LEADER 05867nam 22007575 450 001 996466354203316 005 20200701023528.0 010 $a3-540-30538-6 024 7 $a10.1007/b104325 035 $a(CKB)1000000000212662 035 $a(SSID)ssj0000159558 035 $a(PQKBManifestationID)11137624 035 $a(PQKBTitleCode)TC0000159558 035 $a(PQKBWorkID)10158527 035 $a(PQKB)10345715 035 $a(DE-He213)978-3-540-30538-5 035 $a(MiAaPQ)EBC3068284 035 $a(PPN)134123573 035 $a(EXLCZ)991000000000212662 100 $a20100312d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science$b[electronic resource] $e24th International Conference, Chennai, India, December 16-18, 2004, Proceedings /$fedited by Kamal Lodaya, Meena Mahajan 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XVI, 532 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3328 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24058-6 320 $aIncludes bibliographical references and index. 327 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3328 606 $aSoftware engineering 606 $aComputers 606 $aComputer logic 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aAlgorithms 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aComputer logic. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 0$aAlgorithms. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a005.1 702 $aLodaya$b Kamal$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMahajan$b Meena$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466354203316 996 $aFSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science$9772049 997 $aUNISA