000 04832nam a22005775i 4500
001 978-3-540-32419-5
003 DE-He213
005 20240730184307.0
007 cr nn 008mamaa
008 100929s2005 gw | s |||| 0|eng d
020 _a9783540324195
_9978-3-540-32419-5
024 7 _a10.1007/11590156
_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 2005: Foundations of Software Technology and Theoretical Computer Science
_h[electronic resource] :
_b25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings /
_cedited by R. Ramanujam, Sandeep Sen.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 566 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3821
505 0 _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 DynamicPeer-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.
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 0 _aAlgorithms.
_93390
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aTheory of Computation.
_9135145
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aAlgorithms.
_93390
700 1 _aRamanujam, R.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135146
700 1 _aSen, Sandeep.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9135147
710 2 _aSpringerLink (Online service)
_9135148
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540304951
776 0 8 _iPrinted edition:
_z9783540818120
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3821
_9135149
856 4 0 _uhttps://doi.org/10.1007/11590156
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92275
_d92275