- Martin Dietzfelbinger
, Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). ICALP (1) 2008: 385-396 - Nedialko B. Dimitrov, C. Greg Plaxton:
Competitive Weighted Matching in Transversal Matroids. ICALP (1) 2008: 397-408 - Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
Spanners in Sparse Graphs. ICALP (1) 2008: 597-608 - Friedrich Eisenbrand, Thomas Rothvoß:
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. ICALP (1) 2008: 246-257 - Lior Eldar, Oded Regev:
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. ICALP (1) 2008: 881-892 - Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710 - Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis:
Recursive Stochastic Games with Positive Rewards. ICALP (1) 2008: 711-723 - Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The Speed of Convergence in Congestion Games under Best-Response Dynamics. ICALP (1) 2008: 796-807 - Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) 2008: 294-305 - Fedor V. Fomin, Yngve Villanger:
Treewidth Computation and Extremal Combinatorics. ICALP (1) 2008: 210-221 - Gudmund Skovbjerg Frandsen, Piotr Sankowski:
Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) 2008: 434-446 - Gianluigi Greco, Francesco Scarcello:
Tree Projections: Hypergraph Games and Minimality. ICALP (1) 2008: 736-747 - Sudipto Guha, Andrew McGregor:
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. ICALP (1) 2008: 760-772 - Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433 - Sean Hallgren, Aram W. Harrow:
Superpolynomial Speedups Based on Almost Any Quantum Circuit. ICALP (1) 2008: 782-795 - Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282 - Klaus Jansen, Ralf Thöle:
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. ICALP (1) 2008: 234-245 - Detlef Kähler, Thomas Wilke:
Complementation, Disambiguation, and Determinization of Büchi Automata Unified. ICALP (1) 2008: 724-735 - Satyen Kale, C. Seshadhri:
An Expansion Tester for Bounded Degree Graphs. ICALP (1) 2008: 527-538 - Ming-Yang Kao, Robert T. Schweller:
Randomized Self-assembly for Approximate Shapes. ICALP (1) 2008: 370-384 - Ken-ichi Kawarabayashi:
Approximating List-Coloring on a Fixed Surface. ICALP (1) 2008: 333-344 - Julia Kempe, Oded Regev, Falk Unger, Ronald de Wolf:
Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. ICALP (1) 2008: 845-856 - Ioannis Koutis:
Faster Algebraic Algorithms for Path and Packing Problems. ICALP (1) 2008: 575-586 - Andrei A. Krokhin, Dániel Marx:
On the Hardness of Losing Weight. ICALP (1) 2008: 662-673 - Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. ICALP (1) 2008: 459-471 - Troy Lee, Rajat Mittal:
Product Theorems Via Semidefinite Programming. ICALP (1) 2008: 674-685 - Mehdi Mhalla, Simon Perdrix:
Finding Optimal Flows Efficiently. ICALP (1) 2008: 857-868 - S. Muthukrishnan:
Internet Ad Auctions: Insights and Directions. ICALP (1) 2008: 14-23 - Krzysztof Onak:
Testing Properties of Sets of Points in Metric Spaces. ICALP (1) 2008: 515-526 - Sriram V. Pemmaraju, Aravind Srinivasan:
The Randomized Coloring Procedure with Symmetry-Breaking. ICALP (1) 2008: 306-319
