Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2380 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, 29th International Colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002, Proceedings, Peter Widmayer ...[et al.] (eds.), Berlin, Springer, 2002, 1 vol. (XXI-1069 p.), Lecture notes in computer science, 3-540-43864-5 • Automata, Languages and Programming, Texte imprimé, 9783662171240 |
| LEADER | 08074nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 972388 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155223275 | ||
| 020 | |a 9783540454656 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 005.1 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International colloquium on automata, languages and programming |n (29 |d :2002 |c :Málaga, Espagne). | |
| 245 | 1 | 0 | |a Automata, Languages and Programming : |b 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings |c [edited by] Peter Widmayer, Francisco Triguero, Rafael Morales... [et al.]. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2380 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Molecular Assembly and Computation: From Theory to Experimental Demonstrations -- Towards a Predictive Computational Complexity Theory -- Equivariant Syntax and Semantics -- L(A) = L(B)? Decidability Results from Complete Formal Systems -- Discrete Tomography: Reconstruction under Periodicity Constraints -- Local and Global Methods in Data Mining: Basic Techniques and Open Problems -- Program Debugging and Validation Using Semantic Approximations and Partial Specifications -- Best Papers -- Inapproximability Results for Equations over Finite Groups -- A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs -- On Families of Graphs Having a Decidable First Order Theory with Reachability -- Contributions -- Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet -- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game -- Control Message Aggregation in Group Communication Protocols -- Church-Rosser Languages vs. UCFL -- Intersection of Regular Languages and Star Hierarchy -- On the Construction of Reversible Automata for Reversible Languages -- Priority Queues, Pairing, and Adaptive Sorting -- Exponential Structures for Efficient Cache-Oblivious Algorithms -- Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations -- On the Complexity of Resolution with Bounded Conjunctions -- Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes -- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials -- Exponential Lower Bound for Static Semi-algebraic Proofs -- Paths Problems in Symmetric Logarithmic Space -- Scheduling Search Procedures -- Removable Online Knapsack Problems -- New Bounds for Variable-Sized and Resource Augmented Online Bin Packing -- TheQuest for Small Universal Cellular Automata -- Hyperbolic Recognition by Graph Automata -- Quantum and Stochastic Branching Programs of Bounded Width -- Spanning Trees with Bounded Number of Branch Vertices -- Energy Optimal Routing in Radio Networks Using Geometric Data Structures -- Gossiping with Bounded Size Messages in ad hoc Radio Networks -- The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences -- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications -- Constraint Satisfaction Problems in Non-deterministic Logarithmic Space -- Cache Oblivious Distribution Sweeping -- One-Probe Search -- New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems -- Measuring the Probabilistic Powerdomain -- Games Characterizing Levy-Longo Trees -- Comparing Functional Paradigms for Exact Real-Number Computation -- Random Sampling from Boltzmann Principles -- On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures -- Bialgebraic Modelling of Timed Processes -- Testing Labelled Markov Processes -- Why Computational Complexity Requires Stricter Martingales -- Correspondence Principles for Effective Dimensions -- A Total Approach to Partial Algebraic Specification -- Axiomatising Divergence -- A Spatial Logic for Querying Graphs -- Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network -- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION -- Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths -- Synthesis of Uninitialized Systems -- Infinite-State High-Level MSCs: Model-Checking and Realizability -- Universal Inherence of Cycle-Free Context-Free Ambiguity Functions -- Histogramming Data Streams with Fast Per-Item Processing -- Finding Frequent Items in Data Streams -- Symbolic Strategy Synthesis for Games on Pushdown Graphs -- Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard -- Solving the String Statistics Problem in Time (nlogn) -- A PTAS for Distinguishing (Sub)string Selection -- On the Theory of One-Step Rewriting in Trace Monoids -- Navigating with a Browser -- Improved Results for Stackelberg Scheduling Strategies -- Call Control in Rings -- Preemptive Scheduling in Overloaded Systems -- The Equivalence Problem of Finite Substitutions on ab*c, with Applications -- Deciding DPDA Equivalence Is Primitive Recursive -- Two-Way Alternating Automata and Finite Models -- Approximating Huffman Codes in Parallel -- Seamless Integration of Parallelism and Memory Hierarchy -- The Communication Complexity of Approximate Set Packing and Covering -- Antirandomizing the Wrong Game -- Fast Universalization of Investment Strategies with Provably Good Relative Returns -- Randomized Pursuit-Evasion in Graphs -- The Essence of Principal Typings -- Complete and Tractable Local Linear Time Temporal Logics over Traces -- An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces -- Random Numbers and an Incomplete Immune Recursive Set -- A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers -- Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem -- Finding a Path of Superlogarithmic Length -- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs -- Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs -- Efficient Testing of Hypergraphs -- Optimal Net Surface Problems with Applications -- Wagner s Theorem on Realizers -- Circular Arrangements. | |
| 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 Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Widmayer, Peter, |d 1953- |4 pbd | |
| 700 | 1 | |a Triguero, Francisco. |4 pbd | |
| 700 | 1 | |a Morales, Rafael. |4 pbd | |
| 776 | 0 | |0 068976801 |t Automata, Languages and Programming |o 29th International Colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002 |o Proceedings |f Peter Widmayer ...[et al.] (eds.) |c Berlin |n Springer |d 2002 |p 1 vol. (XXI-1069 p.) |s Lecture notes in computer science |z 3-540-43864-5 | |
| 776 | 0 | |t Automata, Languages and Programming |b Texte imprimé |z 9783662171240 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45465-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-FTHG41R1-9 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750642084 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45465-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753993325 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45465-9 |z Accès INSA CVL | |
| 997 | |0 972388 |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/ | ||