LEADER 04414nam 2200565 a 450 001 9910484068703321 005 20200520144314.0 010 $a3-540-32419-4 024 7 $a10.1007/11590156 035 $a(CKB)1000000000213534 035 $a(SSID)ssj0000317815 035 $a(PQKBManifestationID)11211511 035 $a(PQKBTitleCode)TC0000317815 035 $a(PQKBWorkID)10312400 035 $a(PQKB)10943921 035 $a(DE-He213)978-3-540-32419-5 035 $a(MiAaPQ)EBC3067731 035 $a(PPN)12309870X 035 $a(EXLCZ)991000000000213534 100 $a20051114d2005 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFSTTCS 2005 $efoundations of software technology and theoretical computer science : 25th International Conference, Hyderabad, India, December 15-18, 2005 : proceedings /$fR. Ramanujam, Sandeep Sen (eds.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$d2005 215 $a1 online resource (XIV, 566 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3821 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-30495-9 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aLecture notes in computer science ;$v3821. 517 3 $aFoundations of software technology and theoretical computer science 606 $aSoftware engineering$vCongresses 606 $aComputer science$vCongresses 615 0$aSoftware engineering 615 0$aComputer science 676 $a005.3 701 $aRamanujam$b R$01756992 701 $aSen$b Sandeep$01758389 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484068703321 996 $aFSTTCS 2005$94196586 997 $aUNINA