FST TCS 2001 : foundations of software technology and theoretical computer science : 21st Conference, Bangalore, India, December 13 15, 2001 : proceedings
This volume contains the proceedings of the 21st international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). This year s conference attracted 73 su...
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
2245 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st conference, Bangalore, India, December 13-15, 2001, Ramesh Hariharan, Madhavan Mukund, V. Vinay (eds.), Berlin, Springer, 2001, 1 vol. (XI-346 p.), Lecture notes in computer science, 3-540-43002-4 • FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662205396 |
جدول المحتويات:
- Invited Papers
- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
- Approximation Schemes for Geometric NP-Hard Problems: A Survey
- On Clustering Using Random Walks
- An Introduction to Decidability of DPDA Equivalence
- Semidefinite Programming Based Approximation Algorithms
- Contributed Papers
- Hard Sets and Pseudo-random Generators for Constant Depth Circuits
- The First-Order Isomorphism Theorem
- Thresholds and Optimal Binary Comparison Search Trees
- Distributed LTL Model Checking Based on Negative Cycle Detection
- Computability and Complexity Results for a Spatial Assertion Language for Data Structures
- Using Nondeterminism to Design Efficient Deterministic Algorithms
- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
- A Mechanically Verified Compiling Specification for a Lisp Compiler
- Beyond Regular Model Checking
- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel
- List Decoding from Erasures: Bounds and Code Constructions
- Verification of a Leader Election Algorithm in Timed Asynchronous Systems
- Efficient Addition on Field Programmable Gate Arrays
- The Directed Minimum-Degree Spanning Tree Problem
- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
- Beyond Message Sequence Graphs
- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
- Properties of Distributed Timed-Arc Petri Nets
- From Falsification to Verification
- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
- Range Allocation for Equivalence Logic
- Rewrite Closure for Ground and Cancellative AC Theories.