Sciweavers

ICALP
2009
Springer
14 years 11 months ago
Unconditional Lower Bounds against Advice
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
Harry Buhrman, Lance Fortnow, Rahul Santhanam
ICALP
2009
Springer
14 years 11 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
ICALP
2009
Springer
14 years 11 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
ICALP
2009
Springer
14 years 11 months ago
Strong and Pareto Price of Anarchy in Congestion Games
Steve Chien, Alistair Sinclair
ICALP
2009
Springer
14 years 11 months ago
On Finding Dense Subgraphs
Samir Khuller, Barna Saha
ICALP
2009
Springer
14 years 11 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
ICALP
2009
Springer
14 years 11 months ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
ICALP
2009
Springer
14 years 11 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
ICALP
2009
Springer
14 years 11 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
ICALP
2009
Springer
14 years 11 months ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...