000 04866nam a22006015i 4500
001 978-3-540-30538-5
003 DE-He213
005 20240730183155.0
007 cr nn 008mamaa
008 100312s2005 gw | s |||| 0|eng d
020 _a9783540305385
_9978-3-540-30538-5
024 7 _a10.1007/b104325
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aFSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
_h[electronic resource] :
_b24th International Conference, Chennai, India, December 16-18, 2004, Proceedings /
_cedited by Kamal Lodaya, Meena Mahajan.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXVI, 532 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3328
505 0 _aInvited Papers -- Genome Halving Problem Revisited -- Verifying Probabilistic Procedural Programs -- Streaming Algorithms for Geometric Problems -- Toward a Grainless Semantics for Shared-Variable Concurrency -- Regular Languages, Unambiguous Concatenation and Computational Complexity -- Contributed Papers -- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets -- On the Urgency Expressiveness -- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages -- A Decidable Fragment of Separation Logic -- Approximate Range Searching Using Binary Space Partitions -- Representable Disjoint NP-Pairs -- Symbolic Reachability Analysis of Higher-Order Context-Free Processes -- Optimal Strategies in Priced Timed Game Automata -- A Calculus for Trust Management -- Short-Cuts on Star, Source and Planar Unfoldings -- Subdividing Alpha Complex -- Real-Counter Automata and Their Decision Problems -- Adjunct Elimination Through Games in Static Ambient Logic -- On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite -- On the Complexity of Hilbert's 17th Problem -- Who is Pointing When to Whom? -- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix -- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems -- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS -- Minimum Weight Pseudo-Triangulations -- Join Algorithms for the Theory of Uninterpreted Functions -- No, Coreset, No Cry -- Hardness Hypotheses, Derandomization, and Circuit Complexity -- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract -- Learning Languages from Positive Data and a Finite Number of Queries -- The Complexity of the Local Hamiltonian Problem.-Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds -- Adaptive Stabilization of Reactive Protocols -- Visibly Pushdown Games -- Refinement and Separation Contexts -- Decidability of MSO Theories of Tree Structures -- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks -- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size -- Testing Geometric Convexity -- Complexity of Linear Connectivity Problems in Directed Hypergraphs -- Actively Learning to Verify Safety for FIFO Automata -- Reasoning About Game Equilibria Using Temporal Logic -- Alternation in Equational Tree Automata Modulo XOR.
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 0 _aMachine theory.
_9130823
650 0 _aAlgorithms.
_93390
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aTheory of Computation.
_9130824
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.
_9130825
650 2 4 _aAlgorithms.
_93390
700 1 _aLodaya, Kamal.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9130826
700 1 _aMahajan, Meena.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9130827
710 2 _aSpringerLink (Online service)
_9130828
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540240587
776 0 8 _iPrinted edition:
_z9783540805953
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3328
_923263
856 4 0 _uhttps://doi.org/10.1007/b104325
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91713
_d91713