skip to content
STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings Preview this item
ClosePreview this item
Checking...

STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings

Author: Horst Reichel; Sophie Tison
Publisher: Berlin ; New York : Springer, 2000.
Series: Lecture notes in computer science, 1770.
Edition/Format:   Book : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:

The papers in this volume address fundamental issues from all areas of theoretical computer science including: algorithms; data structures; automata; formal languages; complexity; verification;  Read more...

Rating:

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

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

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

Details

Genre/Form: Conference proceedings
Congresses
Congrès
Material Type: Conference publication, Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Horst Reichel; Sophie Tison
ISBN: 3540671412 9783540671411
OCLC Number: 43526888
Description: xiv, 662 p. : ill. ; 23 cm.
Contents: Codes and Graphs.- A Classification of Symbolic Transition Systems.- Circuits versus Trees in Algebraic Complexity.- On the Many Faces of Block Codes.- A New Algorithm for MAX-2-SAT.- Bias Invariance of Small Upper Spans.- The Complexity of Planarity Testing.- About Cube-Free Morphisms.- Linear Cellular Automata with Multiple State Variables.- Two-Variable Word Equations.- Average-Case Quantum Query Complexity.- Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.- The Boolean Hierarchy of NP-Partitions.- Binary Exponential Backoff Is Stable for High Arrival Rates.- The Data Broadcast Problem with Preemption.- An Approximate L p-Difference Algorithm for Massive Data Streams.- Succinct Representations of Model Based Belief Revision.- Logics Capturing Local Properties.- The Complexity of Poor Man's Logic.- Fast Integer Sorting in Linear Space.- On the Performance of WEAK-HEAPSORT.- On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.- Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.- Small Progress Measures for Solving Parity Games.- Multi-linearity Self-Testing with Relative Error.- Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.- Hard Instances of Hard Problems.- Simulation and Bisimulation over One-Counter Processes.- Decidability of Reachability Problems for Classes of Two Counters Automata.- Hereditary History Preserving Bisimilarity Is Undecidable.- The Hardness of Approximating Spanner Problems.- An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.- ?-Coloring of Graphs.- Optimal Proof Systems and Sparse Sets.- Almost Complete Sets.- Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results.- An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.- Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.- Controlled Conspiracy-2 Search.- The Stability of Saturated Linear Dynamical Systems Is Undecidable.- Tilings: Recursivity and Regularity.- Listing All Potential Maximal Cliques of a Graph.- Distance Labeling Schemes for Well-Separated Graph Classes.- Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.- Characterizing and Deciding MSO-Definability of Macro Tree Transductions.- Languages of Dot-Depth 3/2.- Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.- The CNN Problem and Other k-Server Variants.- The Weighted 2-Server Problem.- On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.- Spectral Bounds on General Hard Core Predicates.- Randomness in Visual Cryptography.- Online Dial-a-Ride Problems: Minimizing the Completion Time.- The Power Range Assignment Problem in Radio Networks on the Plane.
Series Title: Lecture notes in computer science, 1770.
Responsibility: Horst Reichel, Sophie Tison, [eds].
More information:

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


<http://www.worldcat.org/oclc/43526888>
library:oclcnum"43526888"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/43526888>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2000"
schema:exampleOfWork<http://worldcat.org/entity/work/id/774319572>
schema:genre"Conference proceedings."@en
schema:genre"Conference proceedings"@en
schema:inLanguage"en"
schema:name"STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000 : proceedings"@en
schema:numberOfPages"662"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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