Search the dblp DataBase

Publications of Author

1. Ilias Diakonikolas, Mihalis Yannakakis
   Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2007, pp:74-88 [Conf]
   
2. 
   Improved Approximation of Linear Threshold Functions. [Citation Graph (, )][DBLP]
   
   
3. 
   A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. [Citation Graph (, )][DBLP]
   
   
4. 
   Testing for Concise Representations. [Citation Graph (, )][DBLP]
   
   
5. 
   Bounded Independence Fools Halfspaces. [Citation Graph (, )][DBLP]
   
   
6. 
   Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]
   
   
7. 
   Succinct approximate convex pareto curves. [Citation Graph (, )][DBLP]
   
   
8. 
   How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]
   
   
9. 
   Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. [Citation Graph (, )][DBLP]
   
   
10. 
    Efficiently Testing Sparse GF(2) Polynomials [Citation Graph (, )][DBLP]
    
    
11. 
    Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems [Citation Graph (, )][DBLP]
    
    
12. 
    Bounded Independence Fools Halfspaces [Citation Graph (, )][DBLP]
    
    
13. 
    A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions [Citation Graph (, )][DBLP]
    
    
14. 
    Average sensitivity and noise sensitivity of polynomial threshold functions [Citation Graph (, )][DBLP]
    
    
15. 
    Improved Approximation of Linear Threshold Functions [Citation Graph (, )][DBLP]
    
    
16. 
    Bounded Independence Fools Degree-2 Threshold Functions [Citation Graph (, )][DBLP]
    
    
17. 
    Testing for Concise Representations. [Citation Graph (, )][DBLP]