FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings /
This book constitutes the refereed proceedings of the 20th international Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000, held in New Delhi, India in December 2000. The 36 revised full papers presented were carefully reviewed and selected from a total...
| Corporate Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Conference Proceeding eBook |
| Language: | English |
| Published: |
Berlin :
Springer,
2000.
|
| Series: | Lecture notes in computer science ;
1974. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Table of Contents:
- Model checking: theory into practice / E. Allen Emerson
- Algebra for XML query / Mary Fernandez, Jerome Simeon, and Philip Wadler
- Irrugularities of distribution, derandomization, and complexity theory / Bernard Chazelle
- Rewriting logic as a metalogical framework / David Basin, Manuel Clavel, and José Meseguer
- Frequency assignment in mobile phone systems / Martin Grötschel
- Data provenance: some basic issues / Peter Buneman, Sanjeev Khanna, and Wang-Chiew Tan
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition / Sachin B. Patkar and H. Narayanan
- On-line edge-coloring with a fixed number of colors / Lene Monrad Favrholdt and Morten Nyhave Nielsen
- On approximability of the independent/connected edge dominating set problems / Toshihiro Fujito
- Model checking CTL properties of pushdown systems / Igor Walukiewicz
- Decidable dense branching-time temporal logic / Salvatore La Torre and Margherita Napoli
- Fair equivalence relations / Orna Kupferman, Nir Piterman, and Moshe Y. Vardi
- Arithmetic circuits and polynomial replacement systems / Pierre McKenzie, Heribert Vollmer, and Klaus W. Wagner
- Depth-3 arithmetic circuits for s2n(X) and extensions of the graham-pollack theorem / Jaikumar Radhakrishnan, Pranab Sen, and Sundar Vishwanathan
- Bounded weak monadic quantifier alternation hierarchy of equational graphs is infinite / Olivier Ly
- Combining semantics with non-standard interpreter hierarchies / Sergei Abramov and Robert Glück
- Using modes to ensure subject reduction fot typed logic programs with subtyping / Jan-Georg Smaus, François Fages, and Pierre Deransart
- Dynamically ordered probabilistic choice logic programming / Marina De Vos and Dirk Vermeir
- Coordinatized kernels and catalytic reductions: an improved FPT algorithm for max leaf spanning tree and other problems / Michael R. Fellows [and others]
- Planar graph blocking for external searching / Surender Baswana and Sandeep Sen
- Complete fragment of higher-order duration u-calculus / Dimitar P. Guelev
- Complete axiomatisation for timed automata / Huimin Lin and Wang Yi
- Text sparsification via local maxima / Pilu Crescenzi [and others]
- Approximate swapped matching / Amihood Amir, Moshe Lewenstein, and Ely Porat
- Semantic theory for heterogeneous system design / Rance Cleaveland and Gerald Lǔttgen
- Formal verification of the ricart-agrawala algorithm / Ekaterina Sedletsky, Amir Pnueli, and Mordechai Ben-Ari
- On distribution-specific learning with membership queries versus pseudorandom generation / Johannes Köbler and Wolfgang Lindner
- 0p2-completeness: a classical approach for new results / Holger Spakowski and Jörg Vogel
- Is the standard proof system for SAT P-optimal? / Johannes Köbler and Jochen Messner
- General framework for types in graph rewriting / Barbara König
- Ground congruence for chi calculus / Yuxi Fu and Zhenrong Yang
- Inheritance in the joint calculus / Cédric Fournet [and others]
- Approximation algorithms for bandwidth and storage allocation problems under real time constraints / Stefano Leonardi, Alberto Marchetti-Spaccamela, and Andrea Vitaletti
- Dynamic spectrum allocation: the impotency of duration notificaion / Bala Kalyanasundaram and Kirk Pruhs
- Fine structure of game lambda models / Pietro Di Gianantonio and Gianluca Franco
- Stron normalization of second order symmetric [pi]-calculus / Michel Parigot
- Scheduling to minimize the average completion time of dedicated tasks / Foto Afrati [and others]
- Hunting for functionally analogous genes / Michael T. Hallett and Jens Lagergren
- Keeping track of the latest gossip in shared memory systems / Bharat Adsul, Aranyak Mehta, and Milind Sohoni
- Concurrent knowledge and logical clock abstractions / Ajay D. Kshemkalyani
- Decidable hierarchies of starfree languages / Christian Glaber and Heinz Schmitz
- Prefix languages of church-rosser languages / Jens R. Woinowski.