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

17th Annual Symposium on Theortical Aspects of Computer Science, Lille, France, February 17-19, 2000, Proceedings

By: Horst Reichel (Editor), Sophie Tison (Editor)

Write A Review

Paperback | 1 March 2000

At a Glance

Paperback
684 Pages

Dimensions(cm)
23.39 x 15.6 x 3.48

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Aims to ship in 7 to 10 business days

STACS,the SymposiumonTheoreticalAspects ofComputerScience,isheld- nually, alternating between France and Germany. STACS is organizedjointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f¨ ur Informatik (GI) in Germany and the Maison de l'Informatique et des Ma- ematiquesDiscr etes(MIMD)inFrance.STACS2000wasthe17thintheseries.It was held in Lille from February 17th to 19th, 2000. Previous STACS symposia took place in Paris (1984), Saarbru ¨cken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992),Wu ¨rzburg(1993),Caen(1994),Mu ¨nchen(1995),Grenoble(1996),Lub ¨ eck (1997), Paris (1998), and Trier (1999). All STACS proceedings have been p- lished in the Lecture Notes in Computer Science of Springer-Verlag. STACS has become one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of foundations of computer science. This time, 146 submissions from 30 countries were received, all in electronic form. Jochen Bern designed the electronic submission procedure, which performed marvelously. Many thanks to Jochen.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Medicine Medicine in General Computer Programming & Software Development Software Engineering Databases Data Capture & Analysis Graphical & Digital Media Applications Algorithms & Data Structures

Codes and Graphs	p. 1
A Classification of Symbolic Transition Systems	p. 13
Circuits versus Trees in Algebraic Complexity	p. 35
On the Many Faces of Block Codes	p. 53
A New Algorithm for MAX-2-SAT	p. 65
Bias Invariance of Small Upper Spans	p. 74
The Complexity of Planarity Testing	p. 87
About Cube-Free Morphisms	p. 99
Linear Cellular Automata with Multiple State Variables	p. 110
Two-Variable Word Equations	p. 122
Average-Case Quantum Query Complexity	p. 133
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs	p. 145
The Boolean Hierarchy of NP-Partitions	p. 157
Binary Exponential Backoff Is Stable for High Arrival Rates	p. 169
The Data Broadcast Problem with Preemption	p. 181
An Approximate L^p-Difference Algorithm for Massive Data Streams	p. 193
Succinct Representations of Model Based Belief Revision	p. 205
Logics Capturing Local Properties	p. 217
The Complexity of Poor Man's Logic	p. 230
Fast Integer Sorting in Linear Space	p. 242
On the Performance of WEAK-HEAPSORT	p. 254
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers	p. 267
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.	p. 279
Small Progress Measures for Solving Parity Games	p. 290
Multi-linearity Self-Testing with Relative Error	p. 302
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies	p. 314
Hard Instances of Hard Problems	p. 324
Simulation and Bisimulation over One-Counter Processes	p. 334
Decidability of Reachability Problems for Classes of Two Counters Automata	p. 346
Hereditary History Preserving Bisimilarity Is Undecidable	p. 358
The Hardness of Approximating Spanner Problems	p. 370
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality	p. 382
¿-Coloring of Graphs	p. 395
Optimal Proof Systems and Sparse Sets	p. 407
Almost Complete Sets	p. 419
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results	p. 431
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications	p. 443
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem	p. 455
Controlled Conspiracy-2 Search	p. 466
The Stability of Saturated Linear Dynamical Systems Is Undecidable	p. 479
Tilings: Recursivity and Regularity	p. 491
Listing All Potential Maximal Cliques of a Graph	p. 503
Distance Labeling Schemes for Well-Separated Graph Classes	p. 516
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs	p. 529
Characterizing and Deciding MSO-Definability of Macro Tree Transductions	p. 542
Languages of Dot-Depth 3/2	p. 555
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures	p. 567
The CNN Problem and Other fc-Server Variants	p. 581
The Weighted 2-Server Problem	p. 593
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem	p. 605
Spectral Bounds on General Hard Core Predicates	p. 614
Randomness in Visual Cryptography	p. 626
Online Dial-a-Ride Problems: Minimizing the Completion Time	p. 639
The Power Range Assignment Problem in Radio Networks on the Plane	p. 651
Author Index	p. 661
Table of Contents provided by Publisher. All Rights Reserved.

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

17th Annual Symposium on Theortical Aspects of Computer Science, Lille, France, February 17-19, 2000, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

The Shortest History of AI

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Python Crash Course

3rd Edition - A Hands-On, Project-Based Introduction to Programming

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Co-Intelligence

Living and Working with AI

Sea of Thieves

The Art of Piracy

Finite Element Simulations with ANSYS Workbench 2024

Theory, Applications, Case Studies

Blockchain and IoT

Foundations, Applications and Case Studies

Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow 3e

Concepts, Tools, and Techniques to Build Intelligent Systems

Learning with Generative Artificial Intelligence

What Empirical Studies Tell Us

Web Information Systems and Technologies

19th International Conference, WEBIST 2023, Rome, Italy, November 15-17, 2023, Revised Selected Papers

Terraform - Up and Running

Writing Infrastructure as Code

Effective Modern C++

42 Specific Ways to Improve Your Use of C++11 And C++14

R for Data Science

Import, Tidy, Transform, Visualize, and Model Data

This is Service Design Doing

Applying Service Design Thinking in the Real World

Feature Engineering for Machine Learning

Principles and Techniques for Data Scientists

Making Things Happen : Theory in Practice

Mastering Project Management

Architecture Patterns with Python

Enabling Test-Driven Development, Domain-Driven Design, and Event-Driven Microservices

Windows 11 For Seniors For Dummies, 2nd Edition

Windows 11 For Dummies, 2nd Edition

Windows 11 For Dummies

Python All-in-One For Dummies

3rd Edition

MRI in Practice

5th Edition

Theory of Fun for Game Design

This product is categorised by