000 05049nam a22006015i 4500
001 978-3-540-77050-3
003 DE-He213
005 20240730183204.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540770503
_9978-3-540-77050-3
024 7 _a10.1007/978-3-540-77050-3
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aFSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
_h[electronic resource] :
_b27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings /
_cedited by V. Arvind, Sanjiva Prasad.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIV, 560 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4855
505 0 _aInvited 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 -- ReconstructingConvex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections -- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures -- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space -- Stochastic Müller Games are PSPACE-Complete -- Solving Parity Games in Big Steps -- Efficient and Expressive Tree Filters -- Markov Decision Processes with Multiple Long-Run Average Objectives -- A Formal Investigation of Diff3 -- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem -- Undirected Graphs of Entanglement 2 -- Acceleration in Convex Data-Flow Analysis -- Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths -- Closures and Modules Within Linear Logic Concurrent Constraint Programming.
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aMachine theory.
_9130885
650 0 _aAlgorithms.
_93390
650 1 4 _aTheory of Computation.
_9130886
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aFormal Languages and Automata Theory.
_9130887
650 2 4 _aAlgorithms.
_93390
700 1 _aArvind, V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9130888
700 1 _aPrasad, Sanjiva.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9130889
710 2 _aSpringerLink (Online service)
_9130890
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540770497
776 0 8 _iPrinted edition:
_z9783540846376
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4855
_9130891
856 4 0 _uhttps://doi.org/10.1007/978-3-540-77050-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91722
_d91722