|
|
Conferences in DBLP
- Max A. Alekseyev, Pavel A. Pevzner
Genome Halving Problem Revisited. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:1-15 [Conf]
- Javier Esparza, Kousha Etessami
Verifying Probabilistic Procedural Programs. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:16-31 [Conf]
- Piotr Indyk
Streaming Algorithms for Geometric Problems. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:32-34 [Conf]
- John C. Reynolds
Toward a Grainless Semantics for Shared-Variable Concurrency. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:35-48 [Conf]
- Denis Thérien
Regular Languages, Unambiguous Concatenation and Computational Complexity. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:49-57 [Conf]
- Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:58-70 [Conf]
- Michaël Adélaïde, Claire Pagetti
On the Urgency Expressiveness. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:71-83 [Conf]
- Bharat Adsul, Milind A. Sohoni
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:84-96 [Conf]
- Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
A Decidable Fragment of Separation Logic. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:97-109 [Conf]
- Mark de Berg, Micha Streppel
Approximate Range Searching Using Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:110-121 [Conf]
- Olaf Beyersdorff
Representable Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:122-134 [Conf]
- Ahmed Bouajjani, Antoine Meyer
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:135-147 [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:148-160 [Conf]
- Marco Carbone, Mogens Nielsen, Vladimiro Sassone
A Calculus for Trust Management. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:161-173 [Conf]
- Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
Short-Cuts on Star, Source and Planar Unfoldings. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:174-185 [Conf]
- Ho-Lun Cheng, Tony Tan
Subdividing Alpha Complex. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:186-197 [Conf]
- Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
Real-Counter Automata and Their Decision Problems. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:198-210 [Conf]
- Anuj Dawar, Philippa Gardner, Giorgio Ghelli
Adjunct Elimination Through Games in Static Ambient Logic. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:211-223 [Conf]
- Anuj Dawar, David Janin
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:224-236 [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:237-249 [Conf]
- Dino Distefano, Joost-Pieter Katoen, Arend Rensink
Who is Pointing When to Whom? [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:250-262 [Conf]
- Martin Fürer, Shiva Prasad Kasiviswanathan
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:263-274 [Conf]
- Paul Gastin, Benjamin Lerman, Marc Zeitoun
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:275-286 [Conf]
- Gilles Geeraerts, Jean-Franç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:287-298 [Conf]
- Joachim Gudmundsson, Christos Levcopoulos
Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:299-310 [Conf]
- Sumit Gulwani, Ashish Tiwari, George C. Necula
Join Algorithms for the Theory of Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:311-323 [Conf]
- Sariel Har-Peled
No, Coreset, No Cry. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:324-335 [Conf]
- John M. Hitchcock, Aduri Pavan
Hardness Hypotheses, Derandomization, and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:336-347 [Conf]
- Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:348-359 [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:360-371 [Conf]
- Julia Kempe, Alexei Kitaev, Oded Regev
The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:372-383 [Conf]
- Hartmut Klauck
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:384-395 [Conf]
- Shay Kutten, Boaz Patt-Shamir
Adaptive Stabilization of Reactive Protocols. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:396-407 [Conf]
- Christof Löding, P. Madhusudan, Olivier Serre
Visibly Pushdown Games. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:408-420 [Conf]
- Ivana Mijajlovic, Noah Torp-Smith, Peter W. O'Hearn
Refinement and Separation Contexts. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:421-433 [Conf]
- Angelo Montanari, Gabriele Puppis
Decidability of MSO Theories of Tree Structures. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:434-446 [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:447-459 [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:460-468 [Conf]
- Luis Rademacher, Santosh Vempala
Testing Geometric Convexity. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:469-480 [Conf]
- Mayur Thakur, Rahul Tripathi
Complexity of Linear Connectivity Problems in Directed Hypergraphs. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:481-493 [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:494-505 [Conf]
- G. Venkatesh
Reasoning About Game Equilibria Using Temporal Logic. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:506-517 [Conf]
- Kumar Neeraj Verma
Alternation in Equational Tree Automata Modulo XOR. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2004, pp:518-530 [Conf]
|
