| 2008 |
|---|
| 11 | EE | Huy N. Nguyen,
Krzysztof Onak:
Constant-Time Approximation Algorithms via Local Improvements.
FOCS 2008: 327-336 |
| 10 | EE | Nicholas J. A. Harvey,
Jelani Nelson,
Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory.
FOCS 2008: 489-498 |
| 9 | EE | Krzysztof Onak:
Testing Properties of Sets of Points in Metric Spaces.
ICALP (1) 2008: 515-526 |
| 8 | EE | Shay Mozes,
Krzysztof Onak,
Oren Weimann:
Finding an optimal tree searching strategy in linear time.
SODA 2008: 1096-1105 |
| 7 | EE | Krzysztof Onak,
Anastasios Sidiropoulos:
Circular partitions with applications to visualization and embeddings.
Symposium on Computational Geometry 2008: 28-37 |
| 6 | EE | Nicholas J. A. Harvey,
Jelani Nelson,
Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory
CoRR abs/0804.4138: (2008) |
| 5 | EE | Alexandr Andoni,
Andrew McGregor,
Krzysztof Onak,
Rina Panigrahy:
Better Bounds for Frequency Moments in Random-Order Streams
CoRR abs/0808.2222: (2008) |
| 2007 |
|---|
| 4 | EE | Ilias Diakonikolas,
Homin K. Lee,
Kevin Matulef,
Krzysztof Onak,
Ronitt Rubinfeld,
Rocco A. Servedio,
Andrew Wan:
Testing for Concise Representations.
FOCS 2007: 549-558 |
| 3 | EE | David R. Karger,
Krzysztof Onak:
Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems.
SODA 2007: 1207-1216 |
| 2 | EE | Ilias Diakonikolas,
Homin K. Lee,
Kevin Matulef,
Krzysztof Onak,
Ronitt Rubinfeld,
Rocco A. Servedio,
Andrew Wan:
Testing for Concise Representations.
Electronic Colloquium on Computational Complexity (ECCC) 14(077): (2007) |
| 2006 |
|---|
| 1 | EE | Krzysztof Onak,
Pawel Parys:
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders.
FOCS 2006: 379-388 |
