Coloring random and semi-random k-colorable graphs
Journal of Algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Smoothed analysis of the perceptron algorithm for linear programming
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
How many random edges make a dense graph Hamiltonian?
Random Structures & Algorithms
Journal of Complexity
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
How slow is the k-means method?
Proceedings of the twenty-second annual symposium on Computational geometry
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
SIAM Journal on Matrix Analysis and Applications
On smoothed analysis in dense graphs and formulas
Random Structures & Algorithms
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
The condition number of a randomly perturbed matrix
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Refuting Smoothed 3CNF Formulas
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The Smoothed Complexity of Edit Distance
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Improved smoothed analysis of the k-means method
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the approximation and smoothed complexity of Leontief market equilibria
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Smoothed analysis of condition numbers and complexity implications for linear programming
Mathematical Programming: Series A and B
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Path trading: fast algorithms, smoothed analysis, and hardness results
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Lower bounds for the smoothed number of pareto optimal solutions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Smoothed analysis of partitioning algorithms for Euclidean functionals
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Smoothed Analysis of Moore-Penrose Inversion
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Scientific Computing
Improved smoothed analysis of multiobjective optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Reducing a target interval to a few exact queries
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A framework for evaluating the smoothness of data-mining results
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry
Approximating independent set in perturbed graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
This Gödel Prize-winning work traces the steps toward modeling real data.