20. FSTTCS 2000: New Delhi, India
Sanjiv Kapoor, Sanjiva Prasad (Eds.): Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings. Springer 2000 Lecture Notes in Computer Science ISBN 3-540-41413-4
Invited Presentations
- E. Allen Emerson: Model Checking: Theory into Practice. 1-10
- Bernard Chazelle: Irregularities of Distribution, Derandomization, and Complexity Theory. 46-54
- Martin Grötschel: Frequency Assignment in Mobile Phone Systems. 81-86
Contributions
- Sachin B. Patkar, H. Narayanan: Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition. 94-105
- Toshihiro Fujito: On Approximability of the Independent/Connected Edge Dominating Set Problems. 117-126
- Igor Walukiewicz: Model Checking CTL Properties of Pushdown Systems. 127-138
- Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner: Arithmetic Circuits and Polynomial Replacement Systems. 164-175
- Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan: Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem. 176-187
- Olivier Ly: The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite. 188-200
- Sergei M. Abramov, Robert Glück: Combining Semantics with Non-standard Interpreter Hierarchies. 201-213
- Jan-Georg Smaus, François Fages, Pierre Deransart: Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping. 214-226
- Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. 240-251
- Dimitar P. Guelev: A Complete Fragment of Higher-Order Duration µ-Calculus. 264-276
- Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi: Text Sparsification via Local Maxima. 290-301
- Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari: Formal Verification of the Ricart-Agrawala Algorithm. 325-335
- Johannes Köbler, Wolfgang Lindner: On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation. 336-347
- Barbara König: A General Framework for Types in Graph Rewriting. 373-384
- Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti: Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. 409-420
- Bala Kalyanasundaram, Kirk Pruhs: Dynamic Spectrum Allocation: The Impotency of Duration Notification. 421-428
- Michel Parigot: Strong Normalization of Second Order Symmetric lambda-Calculus. 442-453
- Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon: Scheduling to Minimize the Average Completion Time of Dedicated Tasks. 454-464
- Bharat Adsul, Aranyak Mehta, Milind A. Sohoni: Keeping Track of the Latest Gossip in Shared Memory Systems. 477-488
- Ajay D. Kshemkalyani: Concurrent Knowledge and Logical Clock Abstractions. 489-502
- Jens R. Woinowski: Prefix Languages of Church-Rosser Languages. 516-530
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team