- 2008
- Susanne Albers, Sonja Lauer:
On List Update with Locality of Reference. ICALP (1) 2008: 96-107 - Noga Alon, Rani Hod
:
Optimal Monotone Encodings. ICALP (1) 2008: 258-270 - Alexandr Andoni, Robert Krauthgamer:
The Smoothed Complexity of Edit Distance. ICALP (1) 2008: 357-369 - Chen Avin, Michal Koucký, Zvi Lotker:
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) 2008: 121-132 - Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations. ICALP (1) 2008: 186-197 - Yossi Azar, Iftah Gamzu:
Truthful Unification Framework for Packing Integer Programs with Choices. ICALP (1) 2008: 833-844 - Nikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee:
Scheduling for Speed Bounded Processors. ICALP (1) 2008: 409-420 - Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay:
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) 2008: 609-621 - Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) 2008: 198-209 - Markus Bläser, Moritz Hardt, David Steurer:
Asymptotically Optimal Hitting Sets Against Polynomials. ICALP (1) 2008: 345-356 - Guy E. Blelloch, Virginia Vassilevska, Ryan Williams:
A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120 - Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574 - Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino:
On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59 - Glencora Borradaile, Philip N. Klein:
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. ICALP (1) 2008: 485-501 - Patrick Briest:
Uniform Budgets and the Envy-Free Pricing Problem. ICALP (1) 2008: 808-819 - David Buchfuhrer, Christopher Umans:
The Complexity of Boolean Formula Minimization. ICALP (1) 2008: 24-35 - Andrei A. Bulatov:
The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661 - Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar:
Networks Become Navigable as Nodes Move and Forget. ICALP (1) 2008: 133-144 - Prasad Chebolu, Alan M. Frieze, Páll Melsted:
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) 2008: 161-172 - Chandra Chekuri, Sanjeev Khanna:
Algorithms for 2-Route Cut Problems. ICALP (1) 2008: 472-484 - Yijia Chen, Marc Thurley, Mark Weyer:
Understanding the Complexity of Induced Subgraph Isomorphisms. ICALP (1) 2008: 587-596 - Qi Cheng, Daqing Wan:
Complexity of Decoding Positive-Rate Reed-Solomon Codes. ICALP (1) 2008: 283-293 - Flavio Chierichetti, Andrea Vattani:
The Local Nature of List Colorings for Graphs of High Girth. ICALP (1) 2008: 320-332 - Andrew M. Childs, Troy Lee:
Optimal Quantum Adversary Lower Bounds for Ordered Search. ICALP (1) 2008: 869-880 - George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. ICALP (1) 2008: 820-832 - Ferdinando Cicalese, Eduardo Sany Laber:
Function Evaluation Via Linear Programming in the Priced Information Model. ICALP (1) 2008: 173-185 - Bruno Courcelle:
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. ICALP (1) 2008: 1-13 - Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47 - Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan:
Efficiently Testing Sparse GF(2) Polynomials. ICALP (1) 2008: 502-514
