
Conferences in DBLP
 Max A. Alekseyev, Pavel A. Pevzner
Genome Halving Problem Revisited. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:115 [Conf]
 Javier Esparza, Kousha Etessami
Verifying Probabilistic Procedural Programs. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:1631 [Conf]
 Piotr Indyk
Streaming Algorithms for Geometric Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:3234 [Conf]
 John C. Reynolds
Toward a Grainless Semantics for SharedVariable Concurrency. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:3548 [Conf]
 Denis Thérien
Regular Languages, Unambiguous Concatenation and Computational Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:4957 [Conf]
 Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Decidability of Zenoness, Syntactic Boundedness and TokenLiveness for DenseTimed Petri Nets. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:5870 [Conf]
 Michaël Adélaïde, Claire Pagetti
On the Urgency Expressiveness. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:7183 [Conf]
 Bharat Adsul, Milind A. Sohoni
Asynchronous AutomataTheoretic Characterization of Aperiodic Trace Languages. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:8496 [Conf]
 Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
A Decidable Fragment of Separation Logic. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:97109 [Conf]
 Mark de Berg, Micha Streppel
Approximate Range Searching Using Binary Space Partitions. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:110121 [Conf]
 Olaf Beyersdorff
Representable Disjoint NPPairs. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:122134 [Conf]
 Ahmed Bouajjani, Antoine Meyer
Symbolic Reachability Analysis of HigherOrder ContextFree Processes. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:135147 [Conf]
 Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen
Optimal Strategies in Priced Timed Game Automata. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:148160 [Conf]
 Marco Carbone, Mogens Nielsen, Vladimiro Sassone
A Calculus for Trust Management. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:161173 [Conf]
 Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
ShortCuts on Star, Source and Planar Unfoldings. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:174185 [Conf]
 HoLun Cheng, Tony Tan
Subdividing Alpha Complex. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:186197 [Conf]
 Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
RealCounter Automata and Their Decision Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:198210 [Conf]
 Anuj Dawar, Philippa Gardner, Giorgio Ghelli
Adjunct Elimination Through Games in Static Ambient Logic. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:211223 [Conf]
 Anuj Dawar, David Janin
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:224236 [Conf]
 Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
On the Complexity of Hilbert's 17th Problem. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:237249 [Conf]
 Dino Distefano, JoostPieter Katoen, Arend Rensink
Who is Pointing When to Whom? [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:250262 [Conf]
 Martin Fürer, Shiva Prasad Kasiviswanathan
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (01) Matrix. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:263274 [Conf]
 Paul Gastin, Benjamin Lerman, Marc Zeitoun
Distributed Games with Causal Memory Are Decidable for SeriesParallel Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:275286 [Conf]
 Gilles Geeraerts, JeanFrançois Raskin, Laurent Van Begin
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:287298 [Conf]
 Joachim Gudmundsson, Christos Levcopoulos
Minimum Weight PseudoTriangulations. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:299310 [Conf]
 Sumit Gulwani, Ashish Tiwari, George C. Necula
Join Algorithms for the Theory of Uninterpreted Functions. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:311323 [Conf]
 Sariel HarPeled
No, Coreset, No Cry. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:324335 [Conf]
 John M. Hitchcock, Aduri Pavan
Hardness Hypotheses, Derandomization, and Circuit Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:336347 [Conf]
 Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:348359 [Conf]
 Sanjay Jain, Efim B. Kinber
Learning Languages from Positive Data and a Finite Number of Queries. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:360371 [Conf]
 Julia Kempe, Alexei Kitaev, Oded Regev
The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:372383 [Conf]
 Hartmut Klauck
Quantum and Classical CommunicationSpace Tradeoffs from Rectangle Bounds. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:384395 [Conf]
 Shay Kutten, Boaz PattShamir
Adaptive Stabilization of Reactive Protocols. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:396407 [Conf]
 Christof Löding, P. Madhusudan, Olivier Serre
Visibly Pushdown Games. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:408420 [Conf]
 Ivana Mijajlovic, Noah TorpSmith, Peter W. O'Hearn
Refinement and Separation Contexts. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:421433 [Conf]
 Angelo Montanari, Gabriele Puppis
Decidability of MSO Theories of Tree Structures. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:434446 [Conf]
 Srinivasan Parthasarathy 0002, Rajiv Gandhi
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:447459 [Conf]
 Ashok Kumar Ponnuswami, H. Venkateswaran
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:460468 [Conf]
 Luis Rademacher, Santosh Vempala
Testing Geometric Convexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:469480 [Conf]
 Mayur Thakur, Rahul Tripathi
Complexity of Linear Connectivity Problems in Directed Hypergraphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:481493 [Conf]
 Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gul Agha
Actively Learning to Verify Safety for FIFO Automata. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:494505 [Conf]
 G. Venkatesh
Reasoning About Game Equilibria Using Temporal Logic. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:506517 [Conf]
 Kumar Neeraj Verma
Alternation in Equational Tree Automata Modulo XOR. [Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:518530 [Conf]
