rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
    sub title: 23rd Conference, Mumbai, India, December 15-17, 2003. Proceedings
  name:
    name part: Pandya, Paritosh K.
    role:
      role term: editor.
  name:
    name part: Radhakrishnan, Jaikumar.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2003
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 454 p. online resource.
  table of contents: Contributed Papers -- A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol -- Constructions of Sparse Asymmetric Connectors -- A Separation Logic for Resource Distribution -- An Equational Theory for Transactions -- Axioms for Regular Words -- 1-Bounded TWA Cannot Be Determinized -- Reachability Analysis of Process Rewrite Systems -- Pushdown Games with Unboundedness and Regular Conditions -- Real-Time Model-Checking: Parameters Everywhere -- The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata -- Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents -- Subtyping Constraints in Quasi-lattices -- An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case -- Word Equations over Graph Products -- Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models -- Comparing Sequences with Segment Rearrangements -- On Logically Defined Recognizable Tree Languages -- Randomized Time-Space Tradeoffs for Directed Graph Connectivity -- Distance-Preserving Approximations of Polygonal Paths -- Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra -- On the Covering Steiner Problem -- Minimality Results for the Spatial Logics -- Algorithms for Non-uniform Size Data Placement on Parallel Disks -- Efficient Algorithms for Abelian Group Isomorphism and Related Problems -- Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees -- Model Checking and Satisfiability for Sabotage Modal Logic -- Merging and Sorting By Strip Moves -- The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase -- Distributed Games -- Maintenance of Multidimensional Histograms -- Tagging Makes Secrecy Decidable with Unbounded Nonces as Well -- Quantum and Classical Complexity Classes: Separations, Collapses, and Closure…
  note: edited by Paritosh K. Pandya, Jaikumar Radhakrishnan.
  subject:
    topic: Computer science
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer logic
  subject:
    topic: Application software
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Computer Applications
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Algorithm Analysis and Problem Complexity
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2914
  identifier: 9783540245971
  identifier: http://dx.doi.org/10.1007/b94618
  record info:
    record creation date: 121227
    record change date: 20151204153021.0
    record identifier: 978-3-540-24597-1