STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings - Wolfgang Thomas

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

STACS 2007

24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings

By: Wolfgang Thomas (Editor), Pascal Weil (Editor)

Write A Review

Paperback | 8 February 2007

At a Glance

Paperback
732 Pages

Dimensions(cm)
22.86 x 15.24 x 4.45

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers address the whole range of theoretical computer science as well as current challenges like biological computing, quantum computing, and mobile and net computing.

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 $0.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.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Mathematics Mathematical Foundation Mathematical Logic Graphical & Digital Media Applications 3D Graphics & Modelling Databases Data Capture & Analysis Computer Programming & Software Development

Algorithms & Data Structures

A calculus and algebra for distributed data management	p. 1
The Buchi complementation saga	p. 12
Speed-up techniques for shortest-path computations	p. 23
Compact forbidden-set routing	p. 37
A new bound for pure greedy hot potato routing	p. 49
Wavelength management in WDM rings to maximize the number of connections	p. 61
A first investigation of Sturmian trees	p. 73
On the size of the universal automaton of a regular language	p. 85
Correlations of partial words	p. 97
Testing convexity properties of tree colorings	p. 109
Why almost all k-colorable graphs are easy	p. 121
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds	p. 133
A new rank technique for formula size lower bounds	p. 145
Hard metrics from Cayley graphs of Abelian groups	p. 157
Broadcasting vs. mixing and information dissemination on Cayley graphs	p. 163
Light orthogonal networks with constant geometric dilation	p. 175
Admissibility in infinite games	p. 188
Pure stationary optimal strategies in Markov decision processes	p. 200
Symmetries and the complexity of pure Nash equilibrium	p. 212
Computing representations of matroids of bounded branch-width	p. 224
Characterizing minimal interval completions	p. 236
The complexity of unions of disjoint sets	p. 248
Kolmogorov-Loveland stochasticity and Kolmogorov complexity	p. 260
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets	p. 272
On the complexity of affine image matching	p. 284
On fixed point equations over commutative semirings	p. 296
An exponential lower bound for prefix Grobner bases in free monoid rings	p. 308
A cubic kernel for feedback vertex set	p. 320
The union of minimal hitting sets : parameterized combinatorial bounds and counting	p. 332
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs	p. 344
A search algorithm for the maximal attractor of a cellular automaton	p. 356
Universal tilings	p. 367
On the complexity of unary tiling-recognizable picture languages	p. 381
A characterization of strong learnability in the statistical query model	p. 393
On the consistency of discrete Bayesian learning	p. 405
VPSPACE and a transfer theorem over the reals	p. 417
On symmetric signatures in holographic algorithms	p. 429
Randomly rounding rationals with cardinality constraints and derandomizations	p. 441
Cheating to get better roommates in a random stable matching	p. 453
A deterministic algorithm for summarizing asynchronous streams over a sliding window	p. 465
Arithmetizing classes around NC[superscript 1] and L	p. 477
The polynomially bounded perfect matching problem is in NC[superscript 2]	p. 489
Languages with bounded multiparty communication complexity	p. 500
New approximation algorithms for minimum cycle bases of graphs	p. 512
On completing Latin squares	p. 524
Small space representations for metric min-sum k-clustering and their applications	p. 536
An optimal tableau-based decision algorithm for propositional neighborhood logic	p. 549
Bounded-variable fragments of hybrid logics	p. 561
Rank-1 modal logics are coalgebraic	p. 573
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups	p. 586
Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem	p. 598
Quantum network coding	p. 610
Reachability in unions of commutative rewriting systems is decidable	p. 622
Associative-commutative deducibility constraints	p. 634
On the automatic analysis of recursive security protocols with XOR	p. 646
Improved online algorithms for the sorting buffer problem	p. 658
Cost sharing methods for makespan and completion time scheduling	p. 670
Planar graphs : logical complexity and parallel isomorphism tests	p. 682
Enumerating all solutions for constraint satisfaction problems	p. 694
Table of Contents provided by Blackwell. All Rights Reserved.

STACS 2007

24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

Don't Burn Anyone at the Stake Today

(and other lessons from history about living through an information crisis)

The Laws of Thought

The Quest for a Mathematical Theory of the Mind

Untangling AI

Driving Business Success Through Enterprise Automation and AI Agents

If Anyone Builds It, Everyone Dies

The Case Against Superintelligent AI

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

Windows 11 For Seniors For Dummies, 2nd Edition

For Dummies (Computer/Tech)

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

The Challenge of the Future

What Should We Keep from Yesterday as We Rush into Tomorrow?

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

Microsoft Power BI For Dummies

For Dummies (Computer/Tech)

AI for Business

A Guide to AI Adoption

Architecture, Media, Archives

The Fun Palace of Joan Littlewood and Cedric Price as a Cultural Project

Python Crash Course

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

Mix It!

Understanding and Controlling the Mix Process

Mix It!

Understanding and Controlling the Mix Process

Hope in the Library

How Libraries Can Help Shape Our Future with Artificial Intelligence

Agentic AI For Dummies

For Dummies (Computer/Tech)

AI ChatBots For Dummies

For Dummies (Computer/Tech)

Landscaping 6G

Unlocking the Power of Ultra-Fast Communication

Mathematics for Artificial Intelligence

Textbooks in Mathematics

Mathematics for Artificial Intelligence

Textbooks in Mathematics

Expanding the Digital Frontiers of Business with AI, Gamification, and Metaverse Marketing

Artificial Intelligence AI: Elementary to Advanced Practices

Beyond The Invisible Nexus

Dark Web, Dark AI, and Offensive Security

Beyond The Invisible Nexus

Dark Web, Dark AI, and Offensive Security

This product is categorised by