skip to content
STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings Preview this item
ClosePreview this item
Checking...

STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings

Author: Helmut Alt; Afonso Ferreira
Publisher: Berlin ; New York : Springer, ©2002.
Series: Lecture notes in computer science, 2285.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Summary:
This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and  Read more...
Rating:

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

Subjects
More like this

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: Symposium on Theoretical Aspects of Computer Science (19th : 2002 : Antibes-Juan les Pins, France)
STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings.
(OCoLC)49260424
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Helmut Alt; Afonso Ferreira
ISBN: 9783540458418 3540458417
OCLC Number: 58648889
Language Note: English.
Description: 1 online resource (xiv, 660 pages) : illustrations.
Contents: Invited Papers --
Hyper-Encryption and Everlasting Security --
Models and Techniques for Communication in Dynamic Networks --
What Is a Theory? --
Algorithms --
A Space Lower Bound for Routing in Trees --
Labeling Schemes for Dynamic Tree Networks --
Tight Bounds for the Performance of Longest-in-System on DAGs --
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling --
Balanced Coloring: Equally Easy for All Numbers of Colors? --
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 --
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets --
On Dualization in Products of Forests --
An Asymptotic (ln?/ ln ln?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs --
Scheduling at Twilight the EasyWay --
Complexity of Multi-dimensional Loop Alignment --
A Probabilistic 3 --
SAT Algorithm Further Improved --
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations --
Randomized Acceleration of Fundamental Matrix Computations --
Approximations for ATSP with Parametrized Triangle Inequality --
A New Diagram from Disks in the Plane --
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles --
Current Challenges --
On the Parameterized Intractability of Closest Substring and Related Problems --
On the Complexity of Protein Similarity Search under mRNA Structure Constraints --
Pure Dominance Constraints --
Improved Quantum Communication Complexity Bounds for Disjointness and Equality --
On Quantum Computation with Some Restricted Amplitudes --
A Quantum Goldreich-Levin Theorem with Cryptographic Applications --
On Quantum and Approximate Privacy --
On Quantum Versions of the Yao Principle --
Computational and Structural Complexity --
Describing Parameterized Complexity Classes --
On the Computational Power of Boolean Decision Lists --
How Many Missing Answers Can Be Tolerated by Query Learners? --
Games with a Uniqueness Property --
Bi-Immunity Separates Strong NP-Completeness Notions --
Complexity of Semi-algebraic Proofs --
A Lower Bound Technique for Restricted Branching Programs and Applications --
The Complexity of Constraints on Intervals and Lengths --
Automata and Formal Languages --
Nesting Until and Since in Linear Temporal Logic --
Comparing Verboseness for Finite Automata and Turing Machines --
On the Average Parallelism in Trace Monoids --
A Further Step towards a Theory of Regular MSC Languages --
Existential and Positive Theories of Equations in Graph Products --
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL --
Recognizable Sets of Message Sequence Charts --
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard --
On the Enumerative Sequences of Regular Languages on k Symbols --
Logic in Computer Science --
Ground Tree Rewriting Graphs of Bounded Tree Width --
Timed Control Synthesis for External Specifications --
Axiomatizing GSOS with Termination --
Axiomatising Tree-Interpretable Structures --
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity --
A Parametric Analysis of the State Explosion Problem in Model Checking --
Generalized Model-Checking over Locally Tree-Decomposable Classes --
Learnability and Definability in Trees and Similar Structures.
Series Title: Lecture notes in computer science, 2285.
Responsibility: Helmut Alt, Afonso Ferreira (eds.).

Abstract:

This text contains the proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science 2002, held in Antibes in France. The 50 full papers and three invited papers cover  Read more...

Reviews

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

Tags

Be the first.

Similar Items

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/58648889> # STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
   library:oclcnum "58648889" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/9553714#Place/berlin> ; # Berlin
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://experiment.worldcat.org/entity/work/data/9553714#Topic/computer_science> ; # Computer science
   schema:about <http://dewey.info/class/004/e21/> ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://viaf.org/viaf/117498732> ; # Helmut Alt
   schema:contributor <http://viaf.org/viaf/49376300> ; # Afonso Ferreira
   schema:copyrightYear "2002" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/9553714#Meeting/annual_symposium_on_theoretical_aspects_of_computer_science_19th_2002_antibes_juan_les_pins_france> ; # Annual Symposium on Theoretical Aspects of Computer Science (19th : 2002 : Antibes-Juan les Pins, France)
   schema:datePublished "2002" ;
   schema:description "This book constitutes the refereed proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2002, held in Antibes - Juan les Pins, France, in March 2002. The 50 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 209 submissions. The book offers topical sections on algorithms, current challenges, computational and structural complexity, automata and formal languages, and logic in computer science."@en ;
   schema:description "Invited Papers -- Hyper-Encryption and Everlasting Security -- Models and Techniques for Communication in Dynamic Networks -- What Is a Theory? -- Algorithms -- A Space Lower Bound for Routing in Trees -- Labeling Schemes for Dynamic Tree Networks -- Tight Bounds for the Performance of Longest-in-System on DAGs -- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling -- Balanced Coloring: Equally Easy for All Numbers of Colors? -- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 -- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets -- On Dualization in Products of Forests -- An Asymptotic (ln?/ ln ln?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs -- Scheduling at Twilight the EasyWay -- Complexity of Multi-dimensional Loop Alignment -- A Probabilistic 3 -- SAT Algorithm Further Improved -- The Secret of Selective Game Tree Search, When Using Random-Error Evaluations -- Randomized Acceleration of Fundamental Matrix Computations -- Approximations for ATSP with Parametrized Triangle Inequality -- A New Diagram from Disks in the Plane -- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles -- Current Challenges -- On the Parameterized Intractability of Closest Substring and Related Problems -- On the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Pure Dominance Constraints -- Improved Quantum Communication Complexity Bounds for Disjointness and Equality -- On Quantum Computation with Some Restricted Amplitudes -- A Quantum Goldreich-Levin Theorem with Cryptographic Applications -- On Quantum and Approximate Privacy -- On Quantum Versions of the Yao Principle -- Computational and Structural Complexity -- Describing Parameterized Complexity Classes -- On the Computational Power of Boolean Decision Lists -- How Many Missing Answers Can Be Tolerated by Query Learners? -- Games with a Uniqueness Property -- Bi-Immunity Separates Strong NP-Completeness Notions -- Complexity of Semi-algebraic Proofs -- A Lower Bound Technique for Restricted Branching Programs and Applications -- The Complexity of Constraints on Intervals and Lengths -- Automata and Formal Languages -- Nesting Until and Since in Linear Temporal Logic -- Comparing Verboseness for Finite Automata and Turing Machines -- On the Average Parallelism in Trace Monoids -- A Further Step towards a Theory of Regular MSC Languages -- Existential and Positive Theories of Equations in Graph Products -- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL -- Recognizable Sets of Message Sequence Charts -- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard -- On the Enumerative Sequences of Regular Languages on k Symbols -- Logic in Computer Science -- Ground Tree Rewriting Graphs of Bounded Tree Width -- Timed Control Synthesis for External Specifications -- Axiomatizing GSOS with Termination -- Axiomatising Tree-Interpretable Structures -- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity -- A Parametric Analysis of the State Explosion Problem in Model Checking -- Generalized Model-Checking over Locally Tree-Decomposable Classes -- Learnability and Definability in Trees and Similar Structures."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/9553714> ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Conference publication"@en ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/9553714#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/49260424> ;
   schema:name "STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings"@en ;
   schema:productID "58648889" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/58648889#PublicationEvent/berlin_new_york_springer_2002> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/9553714#Agent/springer> ; # Springer
   schema:url <http://rave.ohiolink.edu/ebooks/ebc/3540458417> ;
   schema:url <http://dx.doi.org/10.1007/3-540-45841-7> ;
   schema:url <http://link.springer.com/10.1007/3-540-45841-7> ;
   schema:url <http://www.springerlink.com/link.asp?id=xxbkyaqye48f> ;
   schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=3072771> ;
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-43283-8> ;
   schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-43283-8> ;
   schema:url <http://gate.lib.buffalo.edu/login?url=https://link.springer.com/book/10.1007/3-540-45841-7> ;
   schema:workExample <http://worldcat.org/isbn/9783540458418> ;
   schema:workExample <http://dx.doi.org/10.1007/3-540-45841-7> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/58648889> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
   schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/9553714#Meeting/annual_symposium_on_theoretical_aspects_of_computer_science_19th_2002_antibes_juan_les_pins_france> # Annual Symposium on Theoretical Aspects of Computer Science (19th : 2002 : Antibes-Juan les Pins, France)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/9553714#Place/antibes_juan_les_pins_france> ; # Antibes-Juan les Pins, France)
   schema:name "Annual Symposium on Theoretical Aspects of Computer Science (19th : 2002 : Antibes-Juan les Pins, France)" ;
    .

<http://experiment.worldcat.org/entity/work/data/9553714#Place/antibes_juan_les_pins_france> # Antibes-Juan les Pins, France)
    a schema:Place ;
   schema:name "Antibes-Juan les Pins, France)" ;
    .

<http://experiment.worldcat.org/entity/work/data/9553714#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/58648889> ; # STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings
   schema:name "Lecture notes in computer science ;" ;
    .

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

<http://viaf.org/viaf/117498732> # Helmut Alt
    a schema:Person ;
   schema:birthDate "1950" ;
   schema:familyName "Alt" ;
   schema:givenName "Helmut" ;
   schema:name "Helmut Alt" ;
    .

<http://viaf.org/viaf/49376300> # Afonso Ferreira
    a schema:Person ;
   schema:familyName "Ferreira" ;
   schema:givenName "Afonso" ;
   schema:name "Afonso Ferreira" ;
    .

<http://worldcat.org/isbn/9783540458418>
    a schema:ProductModel ;
   schema:isbn "3540458417" ;
   schema:isbn "9783540458418" ;
    .

<http://www.worldcat.org/oclc/49260424>
    a schema:CreativeWork ;
   rdfs:label "STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings." ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/58648889> ; # STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings
    .

<http://www.worldcat.org/title/-/oclc/58648889>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/58648889> ; # STACS 2002 : 19th annual Symposium on Theoretical Aspects of Computer Science, Antibes-Juan les Pins, France, March 14-16, 2002 : proceedings
   schema:dateModified "2018-03-10" ;
   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.