You have Guest access.
Log In
Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas and Wolfgang Thomas
Front matter
1-2
Assigning Papers to Referees
3-11
Algorithmic Game Theory: A Snapshot
12-23
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
24-36
Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
37-48
Sorting and Selection with Imprecise Comparisons
49-58
Fast FAST
59-70
Bounds on the Size of Small Depth Circuits for Approximating Majority
71-82
Counting Subgraphs via Homomorphisms
83-94
External Sampling
95-106
Functional Monitoring without Monotonicity
107-118
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
119-131
Towards a Study of Low-Complexity Graphs
132-143
Decidability of Conjugacy of Tree-Shifts of Finite Type
144-155
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
156-170
Competitive Analysis of Aggregate Max in Windowed Streaming
171-182
Faster Regular Expression Matching
183-194
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
195-209
Unconditional Lower Bounds against Advice
210-221
Approximating Decision Trees with Multiway Branches
222-234
Annotations in Data Streams
235-253
The Tile Complexity of Linear Assemblies
254-265
A Graph Reduction Step Preserving Element-Connectivity and Applications
266-278
Approximating Matches Made in Heaven
279-291
Strong and Pareto Price of Anarchy in Congestion Games
292-303
A Better Algorithm for Random k-SAT
304-315
Exact and Approximate Bandwidth
316-327
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
328-340
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
341-353
On Cartesian Trees and Range Minimum Queries
354-365
Applications of a Splitting Trick
366-377
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
378-389
Incompressibility through Colors and IDs
390-402
Partition Arguments in Multiparty Communication Complexity
403-414
High Complexity Tilings with Sparse Errors
415-426
Tight Bounds for the Cover Time of Multiple Random Walks
427-438
Online Computation with Advice
439-450
Dynamic Succinct Ordered Trees
451-462
Universal Succinct Representations of Trees?
463-474
Distortion Is Fixed Parameter Tractable
475-486
Towards Optimal Range Medians
487-499
B-Treaps: A Uniquely Represented Alternative to B-Trees
500-512
Testing Fourier Dimensionality and Sparsity
513-524
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
525-536
Wireless Communication Is in APX
537-548
The Ehrenfeucht-Silberger Problem
549-561
Applications of Effective Probability Theory to Martin-Löf Randomness
562-573
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
574-584
Popular Mixed Matchings
585-596
Factoring Groups Efficiently
597-608
On Finding Dense Subgraphs
609-621
Learning Halfspaces with Malicious Noise
622-633
General Scheme for Perfect Quantum Network Coding with Free Classical Communication
634-652
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
653-664
Limits and Applications of Group Algebras for Parameterized Problems
665-676
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
677-688
Improved Bounds for Flow Shop Scheduling
689-700
A 3/2-Approximation Algorithm for General Stable Marriage
701-712
Limiting Negations in Formulas
713-725
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
726-737
Superhighness and Strong Jump Traceability
738-749
Amortized Communication Complexity of Distributions
750-763
The Number of Symbol Comparisons in QuickSort and QuickSelect
764-773
Computing the Girth of a Planar Graph in O(n logn) Time
774-785
Elimination Graphs
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