25. FSTTCS 2005: Hyderabad, India
Ramaswamy Ramanujam, Sandeep Sen (Eds.): FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings. Springer 2005 Lecture Notes in Computer Science ISBN 3-540-30495-9
Invited Papers
- Russell Impagliazzo: Computational Complexity Since 1980. 19-47
- Raimund Seidel: Developments in Data Structure Research During the First 25 Years of FSTTCS. 48-59
- Natarajan Shankar: Inference Systems for Logical Algorithms. 60-78
- Igor Walukiewicz: From Logic to Games. 79-91
- Manindra Agrawal: Proving Lower Bounds Via Pseudo-random Generators. 92-105
- Joel Spencer: Erdös Magic. 106
Contributed Papers
- Mark de Berg: Improved Bounds on the Union Complexity of Fat Objects. 116-127
- Jens Chr. Godskesen, Thomas T. Hildebrandt: Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. 140-151
- Ana Almeida Matos: Non-disclosure for Distributed Mobile Code. 177-188
- P. Madhusudan, P. S. Thiagarajan, Shaofa Yang: The MSO Theory of Connectedly Communicating Processes. 201-212
- Mojmír Kretínský, Vojtech Rehák, Jan Strejcek: Reachability of Hennessy-Milner Properties for Weakly Extended PRS. 213-224
- Ting Zhang, Henny B. Sipma, Zohar Manna: Decision Procedures for Queues with Integer Constraints. 225-237
- Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux: When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? 273-284
- S. Muthukrishnan: Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. 285-296
- Sumit Ganguly, Deepanjan Kesh, Chandan Saha: Practical Algorithms for Tracking Database Join Sizes. 297-309
- Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan: Causal Closure for MSC Languages. 335-347
- Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek: Reachability Analysis of Multithreaded Software with Asynchronous Communication. 348-359
- Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. 360-371
- Tomás Brázdil, Antonín Kucera: Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. 372-383
- Mark Reynolds: Towards a CTL* Tableau. 384-395
- Tim French: Bisimulation Quantified Logics: Undecidability. 396-407
- Prasad Jayanti, Srdjan Petrovic: Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks. 408-419
- Sathya Peri, Neeraj Mittal: Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems. 420-431
- Shankara Narayanan Krishna, Paritosh K. Pandya: Modal Strength Reduction in Quantified Discrete Duration Calculus. 444-456
- Jirí Srba: On Counting the Number of Consistent Genotype Assignments for Pedigrees. 470-482
- Joost Engelfriet, Sebastian Maneth: The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. 495-504
- Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan: Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. 505-516
- Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat: Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. 517-528
- Toshiyasu Arai, Georg Moser: Proofs of Termination of Rewrite Systems for Polytime Functions. 529-540
- Antonín Kucera, Oldrich Strazovský: On the Controller Synthesis for Finite-State Markov Decision Processes. 541-552
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team