24. FSTTCS 2004: Chennai, India

Invited Papers

• Max A. Alekseyev, Pavel A. Pevzner:
  Genome Halving Problem Revisited. 1-15
  
• Javier Esparza, Kousha Etessami:
  Verifying Probabilistic Procedural Programs. 16-31
  
• Piotr Indyk:
  Streaming Algorithms for Geometric Problems. 32-34
  
• John C. Reynolds:
  Toward a Grainless Semantics for Shared-Variable Concurrency. 35-48
  
• Denis Thérien:
  Regular Languages, Unambiguous Concatenation and Computational Complexity. 49-57
  

Contributed Papers

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

Last update Tue Feb 14 03:56:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page