You have Guest access.
Log In
Wolfgang Thomas and Pascal Weil
Front matter
1-11
A Calculus and Algebra for Distributed Data Management
12-22
The Büchi Complementation Saga
23-36
Speed-Up Techniques for Shortest-Path Computations
37-48
Compact Forbidden-Set Routing
49-60
A New Bound for Pure Greedy Hot Potato Routing
61-72
Wavelength Management in WDM Rings to Maximize the Number of Connections
73-84
A First Investigation of Sturmian Trees
85-96
On the Size of the Universal Automaton of a Regular Language
97-108
Correlations of Partial Words
109-120
Testing Convexity Properties of Tree Colorings
121-132
Why Almost All k -Colorable Graphs Are Easy
133-144
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds
145-156
A New Rank Technique for Formula Size Lower Bounds
157-162
Hard Metrics from Cayley Graphs of Abelian Groups
163-174
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
175-187
Light Orthogonal Networks with Constant Geometric Dilation
188-199
Admissibility in Infinite Games
200-211
Pure Stationary Optimal Strategies in Markov Decision Processes
212-223
Symmetries and the Complexity of Pure Nash Equilibrium Extended Abstract
224-235
Computing Representations of Matroids of Bounded Branch-Width
236-247
Characterizing Minimal Interval Completions Towards Better Understanding of Profile and Pathwidth (Extended Abstract)
248-259
The Complexity of Unions of Disjoint Sets
260-271
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
272-283
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
284-295
On the Complexity of Affine Image Matching
296-307
On Fixed Point Equations over Commutative Semirings
308-319
An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings
320-331
A Cubic Kernel for Feedback Vertex Set
332-343
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
344-355
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
356-366
A Search Algorithm for the Maximal Attractor of a Cellular Automaton
367-380
Universal Tilings
381-392
On the Complexity of Unary Tiling-Recognizable Picture Languages
393-404
A Characterization of Strong Learnability in the Statistical Query Model
405-416
On the Consistency of Discrete Bayesian Learning
417-428
VPSPACE and a Transfer Theorem over the Reals
429-440
On Symmetric Signatures in Holographic Algorithms
441-452
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
453-464
Cheating to Get Better Roommates in a Random Stable Matching
465-476
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
477-488
Arithmetizing Classes Around NC 1 and L
489-499
The Polynomially Bounded Perfect Matching Problem Is in NC 2
500-511
Languages with Bounded Multiparty Communication Complexity
512-523
New Approximation Algorithms for Minimum Cycle Bases of Graphs
524-535
On Completing Latin Squares
536-548
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
549-560
An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
561-572
Bounded-Variable Fragments of Hybrid Logics
573-585
Rank-1 Modal Logics Are Coalgebraic
586-597
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
598-609
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
610-621
Quantum Network Coding
622-633
Reachability in Unions of Commutative Rewriting Systems Is Decidable
634-645
Associative-Commutative Deducibility Constraints
646-657
On the Automatic Analysis of Recursive Security Protocols with XOR
658-669
Improved Online Algorithms for the Sorting Buffer Problem
670-681
Cost Sharing Methods for Makespan and Completion Time Scheduling
682-693
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
694-705
Enumerating All Solutions for Constraint Satisfaction Problems
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info