This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and selected from a total of 208 submissions. The papers are organized in topical sections on algebraic and circuit complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity.

Produktinformation

Utgivningsdatum:2001-06-27
Mått:155 x 235 x 59 mm
Vikt:1 632 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:1 086
Upplaga:2001
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540422877

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

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.

Mer från samma författare

Del 11629

Graph Transformation

Esther Guerra, Fernando Orejas

Häftad, 2019

556 kr

Graph Transformation

Fernando Orejas, Esther Guerra

E-bok

2019

718 kr

Formal Methods in Software and Systems Modeling

Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, Gabriele Taentzer

Häftad, 2005

573 kr

Recent Trends in Algebraic Development Techniques

José Luiz Fiadeiro, Peter Mosses, Fernando Orejas

Häftad, 2005

573 kr

Formal Methods in Software and Systems Modeling

Gabriele Taentzer, Grzegorz Rozenberg, Fernando Orejas, Ugo Montanari, Hans-Jorg Kreowski

E-bok

2005

718 kr

Recent Trends in Algebraic Development Techniques

Fernando Orejas, Peter Mosses, Jose Luiz Fiadeiro

E-bok

2005

739 kr

Automata, Languages and Programming

Jan van Leeuwen, Paul G. Spirakis, Fernando Orejas

E-bok

2003

712 kr

TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989

Josep Diaz, Fernando Orejas

Häftad, 1989

556 kr

TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13-17, 1989

Josep Diaz, Fernando Orejas

Häftad, 1989

573 kr

Algebraic System Specification and Development

Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella

Häftad, 1991

556 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

556 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

935 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

573 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

845 kr

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott - Biomimetic and Biohybrid Systems, Häftad

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 026 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

573 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 026 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

935 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Del 16923

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

732 kr

Du kanske också är intresserad av

10% rabatt på allt

Adventskalender Ravensburger pussel 2026

Ravensburger

319 kr

Automata, Languages and Programming

Jan van Leeuwen, Paul G. Spirakis, Fernando Orejas

E-bok

2003

712 kr

Automata, Languages and Programming

Timo Lepistö, Arto Salomaa

Häftad, 1988

1 106 kr

Automata, Languages and Programming

A. Salomaa, M. Steinby

Häftad, 1977

403 kr

Automata, Languages and Programming

Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis

Häftad, 2010

1 139 kr

Automata, Languages, and Programming

Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska, David Peleg

Häftad, 2013

573 kr

Automata, Languages and Programming

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener

Häftad, 2006

1 139 kr

Automata, Languages and Programming

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas

Häftad, 2009

1 106 kr

Automata, Languages and Programming

J. W. de Bakker, J. van Leeuwen

Häftad, 1980

539 kr

Automata, Languages and Programming

Andrzej Lingas, Rolf Karlsson, Svante Carlsson

Häftad, 1993

1 139 kr

Automata, Languages and Programming

28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings

AvFernando Orejas,Paul G. Spirakis

Häftad, Engelska, 2001

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

460 kr

403 kr

556 kr

1 479 kr

539 kr

573 kr

573 kr

573 kr

539 kr

539 kr

Beskrivning

Produktinformation

Utgivningsdatum:2001-06-27
Mått:155 x 235 x 59 mm
Vikt:1 632 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:1 086
Upplaga:2001
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540422877

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

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.

Mer från samma författare

Del 11629

Graph Transformation

Esther Guerra, Fernando Orejas

Häftad, 2019

556 kr

Graph Transformation

Fernando Orejas, Esther Guerra

E-bok

2019

718 kr

Formal Methods in Software and Systems Modeling

Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, Gabriele Taentzer

Häftad, 2005

573 kr

Recent Trends in Algebraic Development Techniques

José Luiz Fiadeiro, Peter Mosses, Fernando Orejas

Häftad, 2005

573 kr

Formal Methods in Software and Systems Modeling

Gabriele Taentzer, Grzegorz Rozenberg, Fernando Orejas, Ugo Montanari, Hans-Jorg Kreowski

E-bok

2005

718 kr

Recent Trends in Algebraic Development Techniques

Fernando Orejas, Peter Mosses, Jose Luiz Fiadeiro

E-bok

2005

739 kr

Automata, Languages and Programming

Jan van Leeuwen, Paul G. Spirakis, Fernando Orejas

E-bok

2003

712 kr

TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989

Josep Diaz, Fernando Orejas

Häftad, 1989

556 kr

TAPSOFT '89: Proceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13-17, 1989

Josep Diaz, Fernando Orejas

Häftad, 1989

573 kr

Algebraic System Specification and Development

Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella

Häftad, 1991

556 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

556 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

935 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

573 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

845 kr

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 026 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

573 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 026 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

935 kr

Nyhet

Del 16923

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

732 kr