Automata, languages and programming : ; proceedings 26th international colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1644 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata, languages and programming, 26th international colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Jiří Wiedermann, Peter van Emde Boas, Mogens Nielsen (Eds.), 1999, Berlin, Springer, 1 vol. (XIV-720 p.), Lecture notes in computer science, 3-540-66224-3 • Automata, Languages and Programming, Texte imprimé, 9783662209684 |
| LEADER | 06903nam a22004697a 4500 | ||
|---|---|---|---|
| 001 | 948523 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155168541 | ||
| 020 | |a 9783540485230 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 005.1 | ||
| 111 | 2 | |a International Colloquium on Automata, Languages and Programming |n (26 |d :1999 |c :Prague). | |
| 245 | 1 | 0 | |a Automata, languages and programming : ; proceedings |b 26th international colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 |c [edited by] Jiří Wiedermann, Peter Emde Boas, Mogens Nielsen. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1644 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for Model Measuring -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra EquivalencesUsing Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- TypedExceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. | |
| 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 Langages formels | ||
| 650 | |a Automates mathématiques, Théorie des | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Wiedermann, Juraj, |d 1948- |4 pbd | |
| 700 | 1 | |a Emde Boas, Peter van. |4 pbd | |
| 700 | 1 | |a Nielsen, Mogens, |d 1949- |4 pbd | |
| 776 | 0 | |0 046436227 |t Automata, languages and programming |o 26th international colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 |f Jiří Wiedermann, Peter van Emde Boas, Mogens Nielsen (Eds.) |d 1999 |c Berlin |n Springer |p 1 vol. (XIV-720 p.) |s Lecture notes in computer science |z 3-540-66224-3 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662209684 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-48523-6 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-R65NDQBC-S |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74805944X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-48523-6 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751510947 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-48523-6 |z Accès INSA CVL | |
| 997 | |0 948523 |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/ | ||