Automata, languages and programming : 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
2076 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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, 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, proceedings, Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (Eds.), 2001, Berlin, Springer, 1 vol. (XIV-1083 p.), Lecture notes in computer science, 3-540-42287-0 • Automata, Languages and Programming, Texte imprimé, 9783662168356 |
| LEADER | 08461nam a22004817a 4500 | ||
|---|---|---|---|
| 001 | 971174 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155202774 | ||
| 020 | |a 9783540482246 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International colloquium on automata, languages and programming |n (28 |d :2001 |c :Crète, Grèce). | |
| 245 | 1 | 0 | |a Automata, languages and programming : |b 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 : proceedings |c [edited by] Fernando Orejas, Paul G. Spirakis, Jan Leeuwen. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2076 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object Oriented System Models -- Modelling with Partial Orders Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number ofIterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds forReversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. | |
| 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 Langages de programmation | ||
| 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 Analyse combinatoire | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Leeuwen, Jan van, |d 1946- |4 pbd | |
| 700 | 1 | |a Spirakis, Paul G., |d 1955-...., |c informaticien. |4 pbd | |
| 700 | 1 | |a Orejas, Fernando, |d 1952- |4 pbd | |
| 776 | 0 | |0 058100881 |t Automata, languages and programming |o 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 |o proceedings |f Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (Eds.) |d 2001 |c Berlin |n Springer |p 1 vol. (XIV-1083 p.) |s Lecture notes in computer science |z 3-540-42287-0 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662168356 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-48224-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5Q1NMTQT-5 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750655550 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-48224-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75400547X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-48224-5 |z Accès INSA CVL | |
| 997 | |0 971174 |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/ | ||