Search the dblp DataBase

Publications of Author

1. Krzysztof Onak, Pawel Parys
   Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:379-388 [Conf]
   
2. David Karger, Krzysztof Onak
   Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:1207-1216 [Conf]
   
3. 
   Circular partitions with applications to visualization and embeddings. [Citation Graph (, )][DBLP]
   
   
4. 
   The Oil Searching Problem. [Citation Graph (, )][DBLP]
   
   
5. 
   Testing for Concise Representations. [Citation Graph (, )][DBLP]
   
   
6. 
   Sketching and Streaming Entropy via Approximation Theory. [Citation Graph (, )][DBLP]
   
   
7. 
   Constant-Time Approximation Algorithms via Local Improvements. [Citation Graph (, )][DBLP]
   
   
8. 
   Local Graph Partitions for Approximation and Testing. [Citation Graph (, )][DBLP]
   
   
9. 
   Testing Properties of Sets of Points in Metric Spaces. [Citation Graph (, )][DBLP]
   
   
10. 
    External Sampling. [Citation Graph (, )][DBLP]
    
    
11. 
    Finding an optimal tree searching strategy in linear time. [Citation Graph (, )][DBLP]
    
    
12. 
    Approximating edit distance in near-linear time. [Citation Graph (, )][DBLP]
    
    
13. 
    Maintaining a large matching and a small vertex cover. [Citation Graph (, )][DBLP]
    
    
14. 
    Sketching and Streaming Entropy via Approximation Theory [Citation Graph (, )][DBLP]
    
    
15. 
    Better Bounds for Frequency Moments in Random-Order Streams [Citation Graph (, )][DBLP]
    
    
16. 
    Testing Distribution Identity Efficiently [Citation Graph (, )][DBLP]
    
    
17. 
    Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity [Citation Graph (, )][DBLP]
    
    
18. 
    Testing for Concise Representations. [Citation Graph (, )][DBLP]