
Conferences in DBLP
 Eric Allender
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:115 [Conf]
 Sanjeev Arora
Approximation Schemes for Geometric NPHard Problems: A Survey. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:1617 [Conf]
 David Harel, Yehuda Koren
On Clustering Using Random Walks. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:1841 [Conf]
 Colin Stirling
An Introduction to Decidability of DPDA Equivalence. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:4256 [Conf]
 Uri Zwick
Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:57 [Conf]
 Manindra Agrawal
Hard Sets and Pseudorandom Generators for Constant Depth Circuits. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:5869 [Conf]
 Manindra Agrawal
The FirstOrder Isomorphism Theorem. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:7082 [Conf]
 Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner
Thresholds and Optimal Binary Comparison Search Trees. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:8395 [Conf]
 Lubos Brim, Ivana Cerná, Pavel Krcál, Radek Pelánek
Distributed LTL Model Checking Based on Negative Cycle Detection. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:96107 [Conf]
 Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn
Computability and Complexity Results for a Spatial Assertion Language for Data Structures. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:108119 [Conf]
 Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
Using Nondeterminism to Design Deterministic Algorithms. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:120131 [Conf]
 Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
Liveness Verification of ReversalBounded Multicounter Machines with a Free Counter. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:132143 [Conf]
 Axel Dold, Vincent Vialard
A Mechanically Verified Compiling Specification for a Lisp Compiler. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:144155 [Conf]
 Dana Fisman, Amir Pnueli
Beyond Regular Model Checking. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:156170 [Conf]
 Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, HansUlrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:171182 [Conf]
 Neelima Gupta, Sumit Chopra, Sandeep Sen
Optimal, OutputSensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:183194 [Conf]
 Venkatesan Guruswami
List Decoding from Erasures: Bounds and Code Constructions. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:195206 [Conf]
 Neeraj Jaggi, K. Gopinath
Verification of a Leader Election Algorithm in Timed Asynchronous Systems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:207218 [Conf]
 Andreas Jakoby, Christian Schindelhauer
Efficient Addition on Field Programmable Gate Arrays. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:219231 [Conf]
 Radha Krishnan, Balaji Raghavachari
The Directed MinimumDegree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:232243 [Conf]
 Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
I/OEfficient Batched Range Counting and Its Applications to Proximity Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:244255 [Conf]
 P. Madhusudan, B. Meenakshi
Beyond Message Sequence Graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:256267 [Conf]
 Monaldo Mastrolilli
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:268279 [Conf]
 Mogens Nielsen, Vladimiro Sassone, Jirí Srba
Properties of Distributed TimedArc Petri Nets. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:280291 [Conf]
 Doron Peled, Amir Pnueli, Lenore D. Zuck
From Falsification to Verification. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:292304 [Conf]
 Erion Plaku, Igor Shparlinski
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:305316 [Conf]
 Amir Pnueli, Yoav Rodeh, Ofer Strichman
Range Allocation for Equivalence Logic. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:317333 [Conf]
 Ashish Tiwari
Rewrite Closure for Ground and Cancellative AC Theories. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:334346 [Conf]
