FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
1974 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 2000, foundations of software technology and theoretical computer science, 20th conference, New Delhi, India, December 13-15, 2000, proceedings, Sanjiv Kapoor, Sanjiva Prasad (eds.), 2000, Berlin, Springer, 1 vol. (XIII-532 p.), Lecture notes in computer science, 3-540-41413-4 • FST TCS 2000: Foundations of Software Technology and Theoretical Science, Texte imprimé, 9783662203217 |
Table des matières:
- Invited Presentations
- Model Checking: Theory into Practice
- An Algebra for XML Query
- Irregularities of Distribution, Derandomization, and Complexity Theory
- Rewriting Logic as a Metalogical Framework
- Frequency Assignment in Mobile Phone Systems
- Data Provenance: Some Basic Issues
- Contributions
- Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition
- On-Line Edge-Coloring with a Fixed Number of Colors
- On Approximability of the Independent/Connected Edge Dominating Set Problems
- Model Checking CTL Properties of Pushdown Systems
- A Decidable Dense Branching-Time Temporal Logic
- Fair Equivalence Relations
- Arithmetic Circuits and Polynomial Replacement Systems
- Depth-3 Arithmetic Circuits for S inn su2 (X) and Extensions of the Graham-Pollack Theorem
- The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
- Combining Semantics with Non-standard Interpreter Hierarchies
- Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
- Dynamically Ordered Probabilistic Choice Logic Programming
- Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
- Planar Graph Blocking for External Searching
- A Complete Fragment of Higher-Order Duration ?-Calculus
- A Complete Axiomatisation for Timed Automata
- Text Sparsification via Local Maxima
- Approximate Swapped Matching
- A Semantic Theory for Heterogeneous System Design
- Formal Verification of the Ricart-Agrawala Algorithm
- On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
- ? in2 sup -Completeness: A Classical Approach for New Results
- Is the Standard Proof System for SAT P-Optimal?.-A General Framework for Types in Graph Rewriting
- The Ground Congruence for Chi Calculus
- Inheritance in the Join Calculus
- Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints
- Dynamic Spectrum Allocation: The Impotency of Duration Notification
- The Fine Structure of Game Lambda Models
- Strong Normalization of Second Order Symmetric ?-Calculus
- Scheduling to Minimize the Average Completion Time of Dedicated Tasks
- Hunting for Functionally Analogous Genes
- Keeping Track of the Latest Gossip in Shared Memory Systems
- Concurrent Knowledge and Logical Clock Abstractions
- Decidable Hierarchies of Starfree Languages
- Prefix Languages of Church-Rosser Languages.