24. FSTTCS 2004:
Chennai,
India
Kamal Lodaya, Meena Mahajan (Eds.):
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings.
Lecture Notes in Computer Science 3328 Springer 2004, ISBN 3-540-24058-6 BibTeX
Invited Papers
Contributed Papers
- Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.
58-70
Electronic Edition (link) BibTeX
- Michaël Adélaïde, Claire Pagetti:
On the Urgency Expressiveness.
71-83
Electronic Edition (link) BibTeX
- Bharat Adsul, Milind A. Sohoni:
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.
84-96
Electronic Edition (link) BibTeX
- Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn:
A Decidable Fragment of Separation Logic.
97-109
Electronic Edition (link) BibTeX
- Mark de Berg, Micha Streppel:
Approximate Range Searching Using Binary Space Partitions.
110-121
Electronic Edition (link) BibTeX
- Olaf Beyersdorff:
Representable Disjoint NP-Pairs.
122-134
Electronic Edition (link) BibTeX
- Ahmed Bouajjani, Antoine Meyer:
Symbolic Reachability Analysis of Higher-Order Context-Free Processes.
135-147
Electronic Edition (link) BibTeX
- Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen:
Optimal Strategies in Priced Timed Game Automata.
148-160
Electronic Edition (link) BibTeX
- Marco Carbone, Mogens Nielsen, Vladimiro Sassone:
A Calculus for Trust Management.
161-173
Electronic Edition (link) BibTeX
- Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar:
Short-Cuts on Star, Source and Planar Unfoldings.
174-185
Electronic Edition (link) BibTeX
- Ho-Lun Cheng, Tony Tan:
Subdividing Alpha Complex.
186-197
Electronic Edition (link) BibTeX
- Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie:
Real-Counter Automata and Their Decision Problems.
198-210
Electronic Edition (link) BibTeX
- Anuj Dawar, Philippa Gardner, Giorgio Ghelli:
Adjunct Elimination Through Games in Static Ambient Logic.
211-223
Electronic Edition (link) BibTeX
- Anuj Dawar, David Janin:
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite.
224-236
Electronic Edition (link) BibTeX
- Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi:
On the Complexity of Hilbert's 17th Problem.
237-249
Electronic Edition (link) BibTeX
- Dino Distefano, Joost-Pieter Katoen, Arend Rensink:
Who is Pointing When to Whom?
250-262
Electronic Edition (link) BibTeX
- Martin Fürer, Shiva Prasad Kasiviswanathan:
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix.
263-274
Electronic Edition (link) BibTeX
- Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
275-286
Electronic Edition (link) BibTeX
- Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.
287-298
Electronic Edition (link) BibTeX
- Joachim Gudmundsson, Christos Levcopoulos:
Minimum Weight Pseudo-Triangulations.
299-310
Electronic Edition (link) BibTeX
- Sumit Gulwani, Ashish Tiwari, George C. Necula:
Join Algorithms for the Theory of Uninterpreted Functions.
311-323
Electronic Edition (link) BibTeX
- Sariel Har-Peled:
No, Coreset, No Cry.
324-335
Electronic Edition (link) BibTeX
- John M. Hitchcock, Aduri Pavan:
Hardness Hypotheses, Derandomization, and Circuit Complexity.
336-347
Electronic Edition (link) BibTeX
- Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
348-359
Electronic Edition (link) BibTeX
- Sanjay Jain, Efim B. Kinber:
Learning Languages from Positive Data and a Finite Number of Queries.
360-371
Electronic Edition (link) BibTeX
- Julia Kempe, Alexei Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem.
372-383
Electronic Edition (link) BibTeX
- Hartmut Klauck:
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.
384-395
Electronic Edition (link) BibTeX
- Shay Kutten, Boaz Patt-Shamir:
Adaptive Stabilization of Reactive Protocols.
396-407
Electronic Edition (link) BibTeX
- Christof Löding, P. Madhusudan, Olivier Serre:
Visibly Pushdown Games.
408-420
Electronic Edition (link) BibTeX
- Ivana Mijajlovic, Noah Torp-Smith, Peter W. O'Hearn:
Refinement and Separation Contexts.
421-433
Electronic Edition (link) BibTeX
- Angelo Montanari, Gabriele Puppis:
Decidability of MSO Theories of Tree Structures.
434-446
Electronic Edition (link) BibTeX
- Srinivasan Parthasarathy, Rajiv Gandhi:
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.
447-459
Electronic Edition (link) BibTeX
- Ashok Kumar Ponnuswami, H. Venkateswaran:
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.
460-468
Electronic Edition (link) BibTeX
- Luis Rademacher, Santosh Vempala:
Testing Geometric Convexity.
469-480
Electronic Edition (link) BibTeX
- Mayur Thakur, Rahul Tripathi:
Complexity of Linear Connectivity Problems in Directed Hypergraphs.
481-493
Electronic Edition (link) BibTeX
- Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gul Agha:
Actively Learning to Verify Safety for FIFO Automata.
494-505
Electronic Edition (link) BibTeX
- G. Venkatesh:
Reasoning About Game Equilibria Using Temporal Logic.
506-517
Electronic Edition (link) BibTeX
- Kumar Neeraj Verma:
Alternation in Equational Tree Automata Modulo XOR.
518-530
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:12:56 2009
by Michael Ley (ley@uni-trier.de)
