05867nam 22007575 450 99646635420331620200701023528.03-540-30538-610.1007/b104325(CKB)1000000000212662(SSID)ssj0000159558(PQKBManifestationID)11137624(PQKBTitleCode)TC0000159558(PQKBWorkID)10158527(PQKB)10345715(DE-He213)978-3-540-30538-5(MiAaPQ)EBC3068284(PPN)134123573(EXLCZ)99100000000021266220100312d2005 u| 0engurnn|008mamaatxtccrFSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science[electronic resource] 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings /edited by Kamal Lodaya, Meena Mahajan1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XVI, 532 p.) Lecture Notes in Computer Science,0302-9743 ;3328Bibliographic Level Mode of Issuance: Monograph3-540-24058-6 Includes bibliographical references and index.Invited 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.Lecture Notes in Computer Science,0302-9743 ;3328Software engineeringComputersComputer logicProgramming languages (Electronic computers)Mathematical logicAlgorithmsSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Software engineering.Computers.Computer logic.Programming languages (Electronic computers).Mathematical logic.Algorithms.Software Engineering/Programming and Operating Systems.Theory of Computation.Logics and Meanings of Programs.Programming Languages, Compilers, Interpreters.Mathematical Logic and Formal Languages.Algorithm Analysis and Problem Complexity.005.1Lodaya Kamaledthttp://id.loc.gov/vocabulary/relators/edtMahajan Meenaedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466354203316FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science772049UNISA