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.
Lecture Notes in Computer Science 3821 Springer 2005, ISBN 3-540-30495-9 BibTeX
Invited Papers
Contributed Papers
- Michael Edwards, Kasturi R. Varadarajan:
No Coreset, No Cry: II.
107-115
Electronic Edition (link) BibTeX
- Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects.
116-127
Electronic Edition (link) BibTeX
- Taolue Chen, Tingting Han, Jian Lu:
On the Bisimulation Congruence in chi-Calculus.
128-139
Electronic Edition (link) BibTeX
- Jens Chr. Godskesen, Thomas T. Hildebrandt:
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names.
140-151
Electronic Edition (link) BibTeX
- Vijay Kumar, Atri Rudra:
Approximation Algorithms for Wavelength Assignment.
152-163
Electronic Edition (link) BibTeX
- Refael Hassin, Danny Segev:
The Set Cover with Pairs Problem.
164-176
Electronic Edition (link) BibTeX
- Ana Almeida Matos:
Non-disclosure for Distributed Mobile Code.
177-188
Electronic Edition (link) BibTeX
- Ugo Dal Lago, Martin Hofmann:
Quantitative Models and Implicit Complexity.
189-200
Electronic Edition (link) BibTeX
- P. Madhusudan, P. S. Thiagarajan, Shaofa Yang:
The MSO Theory of Connectedly Communicating Processes.
201-212
Electronic Edition (link) BibTeX
- Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Reachability of Hennessy-Milner Properties for Weakly Extended PRS.
213-224
Electronic Edition (link) BibTeX
- Ting Zhang, Henny B. Sipma, Zohar Manna:
Decision Procedures for Queues with Integer Constraints.
225-237
Electronic Edition (link) BibTeX
- Eric Allender, Samir Datta, Sambuddha Roy:
The Directed Planar Reachability Problem.
238-249
Electronic Edition (link) BibTeX
- Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös Sequences.
250-260
Electronic Edition (link) BibTeX
- Venkatesh Mysore, Amir Pnueli:
Refining the Undecidability Frontier of Hybrid Automata.
261-272
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- S. Muthukrishnan:
Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses.
285-296
Electronic Edition (link) BibTeX
- Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Practical Algorithms for Tracking Database Join Sizes.
297-309
Electronic Edition (link) BibTeX
- Pavel Krcál, Radek Pelánek:
On Sampled Semantics of Timed Systems.
310-321
Electronic Edition (link) BibTeX
- Deepak D'Souza, M. Raj Mohan:
Eventual Timed Automata.
322-334
Electronic Edition (link) BibTeX
- Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages.
335-347
Electronic Edition (link) BibTeX
- Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek:
Reachability Analysis of Multithreaded Software with Asynchronous Communication.
348-359
Electronic Edition (link) BibTeX
- Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth:
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem.
360-371
Electronic Edition (link) BibTeX
- Tomás Brázdil, Antonín Kucera:
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains.
372-383
Electronic Edition (link) BibTeX
- Mark Reynolds:
Towards a CTL* Tableau.
384-395
Electronic Edition (link) BibTeX
- Tim French:
Bisimulation Quantified Logics: Undecidability.
396-407
Electronic Edition (link) BibTeX
- Prasad Jayanti, Srdjan Petrovic:
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks.
408-419
Electronic Edition (link) BibTeX
- Sathya Peri, Neeraj Mittal:
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems.
420-431
Electronic Edition (link) BibTeX
- Patricia Bouyer, Fabrice Chevalier, Nicolas Markey:
On the Expressiveness of TPTL and MTL.
432-443
Electronic Edition (link) BibTeX
- Shankara Narayanan Krishna, Paritosh K. Pandya:
Modal Strength Reduction in Quantified Discrete Duration Calculus.
444-456
Electronic Edition (link) BibTeX
- Henning Fernau, Michael Kaufmann, Mathias Poths:
Comparing Trees Via Crossing Minimization.
457-469
Electronic Edition (link) BibTeX
- Jirí Srba:
On Counting the Number of Consistent Genotype Assignments for Pedigrees.
470-482
Electronic Edition (link) BibTeX
- Stefan Göller, Markus Lohrey:
Fixpoint Logics on Hierarchical Structures.
483-494
Electronic Edition (link) BibTeX
- Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable.
495-504
Electronic Edition (link) BibTeX
- Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan:
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation.
505-516
Electronic Edition (link) BibTeX
- Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat:
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic.
517-528
Electronic Edition (link) BibTeX
- Toshiyasu Arai, Georg Moser:
Proofs of Termination of Rewrite Systems for Polytime Functions.
529-540
Electronic Edition (link) BibTeX
- Antonín Kucera, Oldrich Strazovský:
On the Controller Synthesis for Finite-State Markov Decision Processes.
541-552
Electronic Edition (link) BibTeX
- Ellie D'Hondt, Prakash Panangaden:
Reasoning About Quantum Knowledge.
553-564
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:12:56 2009
by Michael Ley (ley@uni-trier.de)
