FST TCS 2000 : foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
1974 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
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 |
| LEADER | 05172nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 971802 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155213164 | ||
| 020 | |a 9783540444503 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Conference on foundations of software technology and theoretical computer science |n (20 |d :2000 |c :New Delhi). | |
| 245 | 1 | 0 | |a FST TCS 2000 : |b foundations of software technology and theoretical computer science : 20th conference, New Delhi, India, December 13-15, 2000 : proceedings |c [edited by] Sanjiv Kapoor, Sanjiva Prasad. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1974 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Génie logiciel | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Kapoor, Sanjiv, |d 1959- |4 pbd | |
| 700 | 1 | |a Prasad, Sanjiva. |4 pbd | |
| 776 | 0 | |0 054351383 |t FST TCS 2000 |o foundations of software technology and theoretical computer science |o 20th conference, New Delhi, India, December 13-15, 2000 |o proceedings |f Sanjiv Kapoor, Sanjiva Prasad (eds.) |d 2000 |c Berlin |n Springer |p 1 vol. (XIII-532 p.) |s Lecture notes in computer science |z 3-540-41413-4 | |
| 776 | 0 | |t FST TCS 2000: Foundations of Software Technology and Theoretical Science |b Texte imprimé |z 9783662203217 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44450-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-T3542BRC-K |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750648570 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44450-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753999226 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44450-5 |z Accès INSA CVL | |
| 997 | |0 971802 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||