Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
2001 (conf/fsttcs/2001)

1. Eric Allender
   When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:1-15 [Conf]
   
2. Sanjeev Arora
   Approximation Schemes for Geometric NP-Hard Problems: A Survey. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:16-17 [Conf]
   
3. David Harel, Yehuda Koren
   On Clustering Using Random Walks. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:18-41 [Conf]
   
4. Colin Stirling
   An Introduction to Decidability of DPDA Equivalence. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:42-56 [Conf]
   
5. Uri Zwick
   Semidefinite Programming Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:57- [Conf]
   
6. Manindra Agrawal
   Hard Sets and Pseudo-random Generators for Constant Depth Circuits. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:58-69 [Conf]
   
7. Manindra Agrawal
   The First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2001, pp:70-82 [Conf]
   
8. 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:83-95 [Conf]
   
9. 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:96-107 [Conf]
   
10. 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:108-119 [Conf]
    
11. Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
    Using Nondeterminism to Design Deterministic Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:120-131 [Conf]
    
12. Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
    Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:132-143 [Conf]
    
13. Axel Dold, Vincent Vialard
    A Mechanically Verified Compiling Specification for a Lisp Compiler. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:144-155 [Conf]
    
14. Dana Fisman, Amir Pnueli
    Beyond Regular Model Checking. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:156-170 [Conf]
    
15. Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
    Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:171-182 [Conf]
    
16. Neelima Gupta, Sumit Chopra, Sandeep Sen
    Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:183-194 [Conf]
    
17. Venkatesan Guruswami
    List Decoding from Erasures: Bounds and Code Constructions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:195-206 [Conf]
    
18. Neeraj Jaggi, K. Gopinath
    Verification of a Leader Election Algorithm in Timed Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:207-218 [Conf]
    
19. Andreas Jakoby, Christian Schindelhauer
    Efficient Addition on Field Programmable Gate Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:219-231 [Conf]
    
20. Radha Krishnan, Balaji Raghavachari
    The Directed Minimum-Degree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:232-243 [Conf]
    
21. Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
    I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:244-255 [Conf]
    
22. P. Madhusudan, B. Meenakshi
    Beyond Message Sequence Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:256-267 [Conf]
    
23. Monaldo Mastrolilli
    Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:268-279 [Conf]
    
24. Mogens Nielsen, Vladimiro Sassone, Jirí Srba
    Properties of Distributed Timed-Arc Petri Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:280-291 [Conf]
    
25. Doron Peled, Amir Pnueli, Lenore D. Zuck
    From Falsification to Verification. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:292-304 [Conf]
    
26. Erion Plaku, Igor Shparlinski
    On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:305-316 [Conf]
    
27. Amir Pnueli, Yoav Rodeh, Ofer Strichman
    Range Allocation for Equivalence Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:317-333 [Conf]
    
28. Ashish Tiwari
    Rewrite Closure for Ground and Cancellative AC Theories. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:334-346 [Conf]