Stacs 2006 : 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings - Bruno Durand

Instant online reading.
Don't wait for delivery!
Go digital and save!

Stacs 2006

23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings

By: Bruno Durand (Editor), Wolfgang Thomas (Editor)

Write A Review

Paperback | 14 February 2006

At a Glance

Paperback
740 Pages

Dimensions(cm)
22.86 x 15.24 x 2.54

Paperback

$169.00

or 4 interest-free payments of $42.25 with

or

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science.

Shipping

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

Orders over $79.00 qualify for free shipping.

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.

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Paperback

RRP $184.95

$148.75

20%
OFF

Discrete Mathematics for Computing

Grassroots

Paperback

RRP $150.00

$129.75

13%
OFF

Marxian Economics : A New Japanese Tradition - Hiroshi Onishi

$70.75

The Green Crypto Handbook : Blockchain for Sustainability Professionals - Louise Borreani

$54.99

21%
OFF

Discrete Mathematics and Its Applications

2025 Release ISE

Paperback

RRP $169.95

$161.75

Business Process Analytics : Modeling, Simulation and Design - Manuel Laguna

$83.75

27%
OFF

New Probes into Discrete and Convex Geometry : Bolyai Society Mathematical Studies - Geza Toth

$168.99

The ubiquitous digital tree	p. 1
Flat holonomies on automata networks	p. 23
Interprocedurally analyzing polynomial identities	p. 50
External string sorting : faster and cache-oblivious	p. 68
Amortized rigidness in dynamic Cartesian trees	p. 80
Distribution-sensitive construction of minimum-redundancy prefix codes	p. 92
On critical exponents in fixed points of binary k-Uniform morphisms	p. 104
Equivalence of F-algebras and cubic forms	p. 115
Complete codes in a sofic shift	p. 127
Kolmogorov complexity with error	p. 137
Kolmogorov complexity and the recursion theorem	p. 149
Entanglement in interactive proof systems with binary answers	p. 162
Quantum algorithms for matching and network flows	p. 172
The number of runs in a string : improved analysis of the linear upper bound	p. 184
Estimating entropy and entropy norm on data streams	p. 196
Pay today for a rainy day : improved approximation algorithms for demand-robust min-cut and shortest path problems	p. 206
Exact price of anarchy for polynomial congestion games	p. 218
Oblivious symmetric alternation	p. 230
Combining multiple heuristics	p. 242
Conflict-free colorings of rectangles ranges	p. 254
Grid vertex-unfolding orthogonal polyhedra	p. 264
Theory and application of width bounded geometric separator	p. 277
Invariants of automatic presentations and semi-synchronous transductions	p. 289
On the accepting power of 2-tape Buchi automata	p. 301
Weighted picture automata and weighted logics	p. 313
Markov decision processes with multiple objectives	p. 325
The algorithmic structure of group strategy proof budget-balanced cost-sharing mechanisms	p. 337
Convergence and approximation in potential games	p. 349
Fast FPT-algorithms for cleaning grids	p. 361
Tradeoffs in depth-two superconcentrators	p. 372
On hypergraph and graph isomorphism with bounded color classes	p. 384
Forbidden substrings, Kolmogorov complexity and almost periodic sequences	p. 396
Online learning and resource-bounded dimension : winnow yields new lower bounds for hard sets	p. 408
Regularity problems for visibly pushdown languages	p. 420
Regular expressions and NFAs without [epsilon]-transitions	p. 432
Redundancy in complete sets	p. 444
Sparse selfreducible sets and polynomial size circuit lower bounds	p. 455
Linear advice for randomized logarithmic space	p. 469
Nested pebbles and transitive closure	p. 477
Definability of languages by generalized first-order formulas over (N,+)	p. 489
Generalized modal satisfiability	p. 500
Strategy improvement and randomized subexponential algorithms for stochastic parity games	p. 512
DAG-width and parity games	p. 524
Reliable computations based on locally decodable codes	p. 537
Convergence of autonomous mobile robots with inaccurate sensors and movements	p. 549
A faster algorithm for the Steiner tree problem	p. 561
Generating randomized roundings with cardinality constraints and derandomizations	p. 571
Online sorting buffers on line	p. 584
Optimal node routing	p. 596
Memoryless facility location in one pass	p. 608
Energy-efficient algorithms for flow time minimization	p. 621
Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games	p. 634
Datalog and constraint satisfaction with infinite templates	p. 646
Evaluating monotone circuits on cylinders, planes and tori	p. 660
Constant-depth circuits for arithmetic in finite fields of characteristic two	p. 672
Weighted asynchronous cellular automata	p. 684
On the complexity of the "most general" firing squad synchronization problem	p. 696
Table of Contents provided by Blackwell. All Rights Reserved.

Stacs 2006

23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Discrete Mathematics with Applications, Metric Edition

5th edition

Discrete Mathematics for Computing

Grassroots

Marxian Economics

A New Japanese Tradition

How to Prove It

A Structured Approach

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Topics in Mathematical Modeling by Difference Equations

With Mathematica

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Discrete Mathematics and Its Applications

2025 Release ISE

Business Process Analytics

Modeling, Simulation and Design

Introduction to Modern Cryptography

Revised Third Edition

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Geometry of Frameworks

Compact Textbooks in Mathematics

Axiomatic Set Theory

An Introduction

Quantum Communication and Cryptography

The Algebra of Code, Volume 1

Explore Set Theory, Abstract Algebra, and Category Theory with Functional Programming

New Probes into Discrete and Convex Geometry

Bolyai Society Mathematical Studies

An Introduction to Single-User Information Theory

Springer Undergraduate Texts in Mathematics and Technology

Emergence and Phase Transitions in Uniform Random Graphs

London Mathematical Society Lecture Note Series

From Christoffel Words to Markoff Numbers

Fuzzy Sets and Triangular Norms

Aggregation in Decision-Aided Intelligent Systems

Chapman & Hall/CRC Cryptography and Network Security

Chapman & Hall/Crc Cryptography and Network Security

Automatic Generation Of Algorithms

Advances in Metaheuristics

This product is categorised by