#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2006

2019

- This year (9)
- Last 5 years (14)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Huy N. Nguyen, Krzysztof Onak
- 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applicable to a certainâ€¦ (More)

- Krzysztof Onak, Ronitt Rubinfeld
- STOC
- 2010

We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give theâ€¦ (More)

- Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak
- 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves on prior resultsâ€¦ (More)

We give algorithms for geometric graph problems in the modern parallel models such as MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensionalâ€¦ (More)

- Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak
- 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs with an excluded minor,â€¦ (More)

- Krzysztof Onak, Pawel Parys
- 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach to this sort ofâ€¦ (More)

- Ilias Diakonikolas, Homin K. Lee, +4 authors Andrew Wan
- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 2007

We describe a general method for testing whether a function on n input variables has a concise representation. The approach combines ideas from the junta test of Fischer et al. 16 with ideas fromâ€¦ (More)

Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partitionâ€¦ (More)

- Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak
- IEEE 52nd Annual Symposium on Foundations ofâ€¦
- 2011

A technique introduced by Indyk and Woodruff (STOC 2005) has inspired several recent advances in data-stream algorithms. We show that a number of these results follow easily from the application of aâ€¦ (More)

- Andrew McGregor, Krzysztof Onak, Rina Panigrahy
- ESA
- 2009

Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. The cost ofâ€¦ (More)