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: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
    sub title: 27th International Conference, New Delhi, India, December 12-14, 2007. Proceedings
  name:
    name part: Arvind, V.
    role:
      role term: editor.
  name:
    name part: Prasad, Sanjiva.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2007
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 560 p. online resource.
  table of contents: Invited Papers -- The Multicore Revolution -- Streaming Algorithms for Selection and Approximate Sorting -- Adventures in Bidirectional Programming -- Program Analysis Using Weighted Pushdown Systems -- The Complexity of Zero Knowledge -- Contributed Papers -- The Priority k-Median Problem -- “Rent-or-Buy” Scheduling and Cost Coloring Problems -- Order Scheduling Models: Hardness and Algorithms -- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography -- Key Substitution in the Symbolic Analysis of Cryptographic Protocols -- Symbolic Bisimulation for the Applied Pi Calculus -- Non-mitotic Sets -- Reductions to Graph Isomorphism -- Strong Reductions and Isomorphism of Complete Sets -- Probabilistic and Topological Semantics for Timed Automata -- A Theory for Game Theories -- An Incremental Bisimulation Algorithm -- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs -- Communication Lower Bounds Via the Chromatic Number -- The Deduction Theorem for Strong Propositional Proof Systems -- Satisfiability of Algebraic Circuits over Sets of Natural Numbers -- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems -- Synthesis of Safe Message-Passing Systems -- Automata and Logics for Timed Message Sequence Charts -- Propositional Dynamic Logic for Message-Passing Systems -- Better Algorithms and Bounds for Directed Maximum Leaf Problems -- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs -- Covering Graphs with Few Complete Bipartite Subgraphs -- Safely Composing Security Protocols -- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption -- Bounding Messages for Free in Security Protocols -- Triangulations of Line Segment Sets in the Plane -- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections -- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures -- …
  note: edited by V. Arvind, Sanjiva Prasad.
  subject:
    topic: Computer science
  subject:
    topic: Software engineering
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Mathematical Logic and Formal Languages
  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, 4855
  identifier: 9783540770503
  identifier: http://dx.doi.org/10.1007/978-3-540-77050-3
  record info:
    record creation date: 100301
    record change date: 20151204173059.0
    record identifier: 978-3-540-77050-3