04414nam 2200565 a 450 991048406870332120200520144314.03-540-32419-410.1007/11590156(CKB)1000000000213534(SSID)ssj0000317815(PQKBManifestationID)11211511(PQKBTitleCode)TC0000317815(PQKBWorkID)10312400(PQKB)10943921(DE-He213)978-3-540-32419-5(MiAaPQ)EBC3067731(PPN)12309870X(EXLCZ)99100000000021353420051114d2005 uy 0engurnn|008mamaatxtccrFSTTCS 2005 foundations of software technology and theoretical computer science : 25th International Conference, Hyderabad, India, December 15-18, 2005 : proceedings /R. Ramanujam, Sandeep Sen (eds.)1st ed. 2005.Berlin Springer20051 online resource (XIV, 566 p.) Lecture notes in computer science,0302-9743 ;3821Bibliographic Level Mode of Issuance: Monograph3-540-30495-9 Includes bibliographical references and index.Invited Papers -- Semiperfect-Information Games -- Computational Complexity Since 1980 -- Developments in Data Structure Research During the First 25 Years of FSTTCS -- Inference Systems for Logical Algorithms -- From Logic to Games -- Proving Lower Bounds Via Pseudo-random Generators -- Erd?s Magic -- Contributed Papers -- No Coreset, No Cry: II -- Improved Bounds on the Union Complexity of Fat Objects -- On the Bisimulation Congruence in ?-Calculus -- Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names -- Approximation Algorithms for Wavelength Assignment -- The Set Cover with Pairs Problem -- Non-disclosure for Distributed Mobile Code -- Quantitative Models and Implicit Complexity -- The MSO Theory of Connectedly Communicating Processes -- Reachability of Hennessy-Milner Properties for Weakly Extended PRS -- Decision Procedures for Queues with Integer Constraints -- The Directed Planar Reachability Problem -- Dimensions of Copeland-Erdös Sequences -- Refining the Undecidability Frontier of Hybrid Automata -- When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? -- Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses -- Practical Algorithms for Tracking Database Join Sizes -- On Sampled Semantics of Timed Systems -- Eventual Timed Automata -- Causal Closure for MSC Languages -- Reachability Analysis of Multithreaded Software with Asynchronous Communication -- Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem -- Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains -- Towards a CTL* Tableau -- Bisimulation Quantified Logics: Undecidability -- Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks -- Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems -- On the Expressiveness of TPTL and MTL -- Modal Strength Reduction in Quantified Discrete Duration Calculus -- Comparing Trees Via Crossing Minimization -- On Counting the Number of Consistent Genotype Assignments for Pedigrees -- Fixpoint Logics on Hierarchical Structures -- The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable -- Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation -- Testing Concurrent Systems: An Interpretation of Intuitionistic Logic -- Proofs of Termination of Rewrite Systems for Polytime Functions -- On the Controller Synthesis for Finite-State Markov Decision Processes -- Reasoning About Quantum Knowledge.Lecture notes in computer science ;3821.Foundations of software technology and theoretical computer scienceSoftware engineeringCongressesComputer scienceCongressesSoftware engineeringComputer science005.3Ramanujam R1756992Sen Sandeep1758389MiAaPQMiAaPQMiAaPQBOOK9910484068703321FSTTCS 20054196586UNINA