skip to content
Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings. Preview this item
ClosePreview this item
Checking...

Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings.

Author: Peter WidmayerStephan EidenbenzFrancisco TrigueroRafael MoralesRicardo ConejoAll authors
Publisher: Berlin ; Heidelberg : Springer-Verlag Berlin Heidelberg, 2002.
Series: Lecture notes in computer science, 2380
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002. The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Peter Widmayer; Stephan Eidenbenz; Francisco Triguero; Rafael Morales; Ricardo Conejo; Matthew Hennessy
ISBN: 9783540454656 3540454659 3540438645 9783540438649
OCLC Number: 768064040
Language Note: English.
Description: 1 online resource.
Contents: 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 --
The Quest 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.
Series Title: Lecture notes in computer science, 2380

Abstract:

This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002. The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/768064040> # Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings.
    a schema:Book, schema:MediaObject, schema:CreativeWork ;
   library:oclcnum "768064040" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/862942063#Place/heidelberg> ; # Heidelberg
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/862942063#Place/berlin> ; # Berlin
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   schema:about <http://id.worldcat.org/fast/872119> ; # Computer graphics
   schema:about <http://id.worldcat.org/fast/1004846> ; # Machine theory
   schema:about <http://dewey.info/class/004.0151/e23/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/862942063#Topic/computer_science_mathematics> ; # Computer science--Mathematics
   schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
   schema:about <http://experiment.worldcat.org/entity/work/data/862942063#Topic/machine_theory> ; # Machine theory
   schema:about <http://id.worldcat.org/fast/1078704> ; # Programming languages (Electronic computers)
   schema:about <http://id.worldcat.org/fast/872460> ; # Computer science--Mathematics
   schema:about <http://id.worldcat.org/fast/1124185> ; # Software engineering
   schema:about <http://id.worldcat.org/fast/973149> ; # Information theory
   schema:bookFormat schema:EBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/862942063#Person/triguero_francisco> ; # Francisco Triguero
   schema:contributor <http://viaf.org/viaf/2522025> ; # Rafael Morales
   schema:contributor <http://viaf.org/viaf/62622130> ; # Ricardo Conejo
   schema:contributor <http://viaf.org/viaf/26705881> ; # Stephan Eidenbenz
   schema:contributor <http://viaf.org/viaf/32326006> ; # Matthew Hennessy
   schema:creator <http://viaf.org/viaf/279751074> ; # Peter Widmayer
   schema:datePublished "2002" ;
   schema:description "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 -- The Quest 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."@en ;
   schema:description "This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002. The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/862942063> ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
   schema:isSimilarTo <http://worldcat.org/entity/work/data/862942063#CreativeWork/> ;
   schema:name "Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings."@en ;
   schema:productID "768064040" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/768064040#PublicationEvent/berlin_heidelberg_springer_verlag_berlin_heidelberg_2002> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/862942063#Agent/springer_verlag_berlin_heidelberg> ; # Springer-Verlag Berlin Heidelberg
   schema:url <http://link.springer.com/10.1007/3-540-45465-9> ;
   schema:url <http://dx.doi.org/10.1007/3-540-45465-9> ;
   schema:workExample <http://dx.doi.org/10.1007/3-540-45465-9> ;
   schema:workExample <http://worldcat.org/isbn/9783540438649> ;
   schema:workExample <http://worldcat.org/isbn/9783540454656> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/768064040> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/862942063#Agent/springer_verlag_berlin_heidelberg> # Springer-Verlag Berlin Heidelberg
    a bgn:Agent ;
   schema:name "Springer-Verlag Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/862942063#Person/triguero_francisco> # Francisco Triguero
    a schema:Person ;
   schema:familyName "Triguero" ;
   schema:givenName "Francisco" ;
   schema:name "Francisco Triguero" ;
    .

<http://id.worldcat.org/fast/1004846> # Machine theory
    a schema:Intangible ;
   schema:name "Machine theory"@en ;
    .

<http://id.worldcat.org/fast/1078704> # Programming languages (Electronic computers)
    a schema:Intangible ;
   schema:name "Programming languages (Electronic computers)"@en ;
    .

<http://id.worldcat.org/fast/1124185> # Software engineering
    a schema:Intangible ;
   schema:name "Software engineering"@en ;
    .

<http://id.worldcat.org/fast/872119> # Computer graphics
    a schema:Intangible ;
   schema:name "Computer graphics"@en ;
    .

<http://id.worldcat.org/fast/872460> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
   schema:name "Data structures (Computer science)"@en ;
    .

<http://id.worldcat.org/fast/973149> # Information theory
    a schema:Intangible ;
   schema:name "Information theory"@en ;
    .

<http://viaf.org/viaf/2522025> # Rafael Morales
    a schema:Person ;
   schema:familyName "Morales" ;
   schema:givenName "Rafael" ;
   schema:name "Rafael Morales" ;
    .

<http://viaf.org/viaf/26705881> # Stephan Eidenbenz
    a schema:Person ;
   schema:familyName "Eidenbenz" ;
   schema:givenName "Stephan" ;
   schema:name "Stephan Eidenbenz" ;
    .

<http://viaf.org/viaf/279751074> # Peter Widmayer
    a schema:Person ;
   schema:familyName "Widmayer" ;
   schema:givenName "Peter" ;
   schema:name "Peter Widmayer" ;
    .

<http://viaf.org/viaf/32326006> # Matthew Hennessy
    a schema:Person ;
   schema:familyName "Hennessy" ;
   schema:givenName "Matthew" ;
   schema:name "Matthew Hennessy" ;
    .

<http://viaf.org/viaf/62622130> # Ricardo Conejo
    a schema:Person ;
   schema:familyName "Conejo" ;
   schema:givenName "Ricardo" ;
   schema:name "Ricardo Conejo" ;
    .

<http://worldcat.org/entity/work/data/862942063#CreativeWork/>
    a schema:CreativeWork ;
   schema:description "Printed edition:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/768064040> ; # Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings.
    .

<http://worldcat.org/isbn/9783540438649>
    a schema:ProductModel ;
   schema:isbn "3540438645" ;
   schema:isbn "9783540438649" ;
    .

<http://worldcat.org/isbn/9783540454656>
    a schema:ProductModel ;
   schema:isbn "3540454659" ;
   schema:isbn "9783540454656" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/768064040> ; # Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings.
   schema:issn "0302-9743" ;
   schema:name "Lecture notes in computer science ;" ;
   schema:name "Lecture Notes in Computer Science ;" ;
    .

<http://www.worldcat.org/title/-/oclc/768064040>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/768064040> ; # Automata, Languages and Programming : 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8 13, 2002 Proceedings.
   schema:dateModified "2017-12-24" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.