My Wish Lists Login / Join

Lecture Notes in Computer Science

21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings

By: Volker Diekert (Editor), Michel Habib (Editor)

Write A Review

Paperback | 18 March 2004

At a Glance

Paperback
680 Pages

Dimensions(cm)
24.13 x 15.88 x 2.54

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

The Symposium on Theoretical Aspects of Computer Science (STACS) is alt- nately held in France and in Germany. The conference of March 25-27, 2004 at the Corum, Montpellier was the twenty-?rst in this series. Previous meetings took place in Paris (1984), Saarbruc ¨ ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992),Wurzburg ¨ (1993),Caen(1994),Munc ¨ hen(1995),Grenoble(1996),Lub ¨ eck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), and Berlin (2003). The symposium looks back at a remarkable tradition of over 20 years. The interest in STACS has been increasing continuously during recent years and has turned it into one of the most signi?cant conferences in theoretical computer science. The STACS 2004 call for papers led to more than 200 submissions from all over the world. Thereviewingprocesswasextremelyhard:morethan800reviewsweredone. We would like to thank the program committee and all external referees for the valuable work they put into the reviewing process of this conference. We had a two-day meeting for the program committee in Montpellier during November 21-22, 2003. Just 54 papers (i.e., 27% of the submissions) could be accepted, as we wanted to keep the conference in its standard format with only two parallel sessions. This strict selection guaranteed the very high scienti?c quality of the conference.

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 Mathematics Combinatorics & Graph Theory Computing & I.T.Computer Science Computer Architecture & Logic Design Mathematical Foundation Mathematical Logic Graphical & Digital Media Applications 3D Graphics & Modelling Databases Data Capture & Analysis

Computer Programming & Software Development Algorithms & Data Structures Mathematical Theory of Computation Artificial Intelligence

Approximation schemes for metric clustering problems	p. 1
Positional determinacy of infinite games	p. 4
Individual communication complexity	p. 19
The complexity of satisfiabilty problems over finite lattices	p. 31
Constant width planar computation characterizes ACC[superscript 0]	p. 44
A simple and fast approach for solving problems on planar graphs	p. 56
Sum-multicoloring on paths	p. 68
Matching algorithms are fast in sparse random graphs	p. 81
Algebraic results on quantum automata	p. 93
Quantum identification of boolean oracles	p. 105
Local limit distributions in pattern statistics : beyond the Markovian models	p. 117
A discontinuity in pattern inference	p. 129
Algorithms for SAT based on search in hamming balls	p. 141
Identifying efficiently solvable cases of max CSP	p. 152
The complexity of boolean constraint isomorphism	p. 164
On minimizing the total weighted tardiness on a single machine	p. 176
Online competitive algorithms for maximizing weighted throughput of unit jobs	p. 187
Optimal and online preemptive scheduling on uniformly related machines	p. 199
Parallel prefetching and caching is hard	p. 211
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem	p. 222
Approximation algorithms for minimizing average distortion	p. 234
Digraphs exploration with little memory	p. 246
Approximate patch coloring with applications to wavelength assignment in WDM optical networks	p. 258
An algorithmic view on OVSF code assignment	p. 270
The syntactic graph of a sofic shift	p. 282
Periodicity and unbordered words	p. 294
Desert automata and the finite substitution problem	p. 305
Satisfiability problems complete for deterministic logarithmic space	p. 317
A logspace approximation scheme for the shortest path problem for graphs with bounded independence number	p. 326
The minimal logically-defined NP-complete problem	p. 338
Solving the 2-disjoint paths problem in nearly linear time	p. 350
Simpler computation of single-source shortest paths in linear average time	p. 362
Lattices with many cycles are dense	p. 370
Automata-based analysis of recursive cryptographic protocols	p. 382
On minimum circular arrangement	p. 394
Integral symmetric 2-commodity flows	p. 406
Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks	p. 418
On the expressiveness of deterministic transducers over infinite trees	p. 428
Definability and regularity in automatic structures	p. 440
Active context-free games	p. 452
Worst case performance of an approximation algorithm for asymmetric TSP	p. 465
On visibility representation of plane graphs	p. 477
Topology matters : smoothed competitiveness of metrical task systems	p. 489
A randomized competitive algorithm for evaluating priced and/or trees	p. 501
The plurality problem with three colors	p. 513
A measured collapse of the modal [mu]-calculus alternation hierarchy	p. 522
An information theoretic lower bound for broadcasting in radio networks	p. 534
A new model for selfish routing	p. 547
Broadcast in the rendezvous model	p. 559
Time-space tradeoff in derandomizing probabilistic logspace	p. 571
What can be efficiently reduced to the k-random strings?	p. 584
Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms	p. 596
Deterministic truthful approximation mechanisms for scheduling related machines	p. 608
The expected competitive ratio for weighted completion time scheduling	p. 620
Effective strong dimension in algorithmic information and computational complexity	p. 632
A lower bound on the competitive ratio of truthful auctions	p. 644
Errata to analysis of the harmonic algorithm for three servers	p. 656
Author index	p. 657
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Artificial Intelligence in Modeling and Simulation

Simulation Foundations, Methods and Applications

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

AI Engineering

Building Applications with Foundation Models

Effective Machine Learning Teams

Best Practices for ML Practitioners

The Times Codeword: Book 13

200 Cracking Logic Puzzles

AI, Robotics, and 3D Printing

Constructing the Sustainable City of Tomorrow

Foundation Mathematics

Introduction to Modern Cryptography

Revised Third Edition

Machine Learning Interviews

Kickstart Your Machine Learning Career

Proof Assistants and Their Applications in Mathematics and Computer Science

Computer Science Foundations and Applied Logic

BEADING WITH ALGORITHMS

CELLULAR AUTOMATA IN PEYOTE STITCH

Applied Mathematics with F#

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

Python Essentials

Symbolic and Numeric Problem-Solving in Engineering

Axiomatic Set Theory

An Introduction

Tools for High Performance Computing 2024

Proceedings of the 15th International Workshop on Parallel Tools for High Performance Computing

AI Value Creators

Beyond the Generative AI User Mindset

Hands-On Generative AI with Transformers and Diffusion Models

Practical Weak Supervision

Doing More with Less Data

Information and Communications Technologies

Third International Libyan Conference, ILCICT 2025 Tripoli, Libya, September 9-11, 2025 Proceedings

Federated Learning for Privacy-Preserving AI Systems

Theory, Applications, and Implementation

This product is categorised by