21. FSTTCS 2001:
Bangalore, India
Ramesh Hariharan, Madhavan Mukund, V. Vinay (Eds.):
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings.
Lecture Notes in Computer Science 2245 Springer 2001, ISBN 3-540-43002-4
Invited Papers
Eric Allender:
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity.
1-15
Sanjeev Arora:
Approximation Schemes for Geometric NP-Hard Problems: A Survey.
16-17
Colin Stirling:
An Introduction to Decidability of DPDA Equivalence.
42-56
Uri Zwick:
Semidefinite Programming Based Approximation Algorithms.
57
Contributed Papers
Manindra Agrawal:
Hard Sets and Pseudo-random Generators for Constant Depth Circuits.
58-69
Monaldo Mastrolilli:
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints.
268-279
Ashish Tiwari:
Rewrite Closure for Ground and Cancellative AC Theories.
334-346