- Mark Greve, Allan Grønlund Jørgensen, Kasper Dalgaard Larsen, Jakob Truelsen:
Cell Probe Lower Bounds and Approximations for Range Mode. ICALP (1) 2010: 605-616 - Roberto Grossi, Alessio Orlandi, Rajeev Raman:
Optimal Trade-Offs for Succinct String Indexes. ICALP (1) 2010: 678-689 - Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323 - Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274 - Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701 - Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu:
SDP Gaps for 2-to-1 and Other Label-Cover Variants. ICALP (1) 2010: 617-628 - Venkatesan Guruswami, Rishi Saket:
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. ICALP (1) 2010: 360-371 - Tobias Harks, Max Klimm:
On the Existence of Pure Nash Equilibria in Weighted Congestion Games. ICALP (1) 2010: 79-89 - John Iacono, Özgür Özkan:
Mergeable Dictionaries. ICALP (1) 2010: 164-175 - Tsuyoshi Ito:
Polynomial-Space Approximation of No-Signaling Provers. ICALP (1) 2010: 140-151 - Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 - Rosa M. Jiménez, Conrado Martínez:
Interval Sorting. ICALP (1) 2010: 238-249 - Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky:
Interval Graphs: Canonical Representation in Logspace. ICALP (1) 2010: 384-395 - Daniel Král':
Decomposition Width of Matroids. ICALP (1) 2010: 55-66 - Stefan Kratsch, Magnus Wahlström:
Preprocessing of Min Ones Problems: A Dichotomy. ICALP (1) 2010: 653-665 - Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) 2010: 540-551 - Troy Lee, Shengyu Zhang:
Composition Theorems in Communication Complexity. ICALP (1) 2010: 475-489 - Jian Li, Ke Yi, Qin Zhang:
Clustering with Diversity. ICALP (1) 2010: 188-200 - Benoît Libert, Moti Yung:
Efficient Completely Non-malleable Public Key Encryption. ICALP (1) 2010: 127-139 - Bruce E. Litow:
On Sums of Roots of Unity. ICALP (1) 2010: 420-425 - Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) 2010: 594-604 - Burkhard Monien, Dominic Dumrauf, Tobias Tscheuschner:
Local Search: Simple, Successful, But Sometimes Sluggish. ICALP (1) 2010: 1-17 - Mihai Patrascu, Mikkel Thorup:
On the k-Independence Required by Linear Probing and Minwise Independence. ICALP (1) 2010: 715-726 - Ronitt Rubinfeld, Ning Xie:
Testing Non-uniform k-Wise Independent Distributions over Product Spaces. ICALP (1) 2010: 565-581 - Atri Rudra, Steve Uurtamo:
Data Stream Algorithms for Codeword Testing. ICALP (1) 2010: 629-640 - Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383 - Amir Shpilka, Ilya Volkovich:
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. ICALP (1) 2010: 408-419 - Emo Welzl:
When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. ICALP (1) 2010: 18 - David P. Woodruff:
Additive Spanners in Nearly Quadratic Time. ICALP (1) 2010: 463-474