Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Clustering Categorical Data: An Approach Based on Dynamical Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Clustering categorical data: an approach based on dynamical systems
The VLDB Journal — The International Journal on Very Large Data Bases
Convergent algorithms for collaborative filtering
Proceedings of the 4th ACM conference on Electronic commerce
Algorithms for Colouring Random k-colourable Graphs
Combinatorics, Probability and Computing
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Smoothed analysis of binary search trees
Theoretical Computer Science
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical 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
On the tractability of coloring semirandom graphs
Information Processing Letters
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The smoothed complexity of edit distance
ACM Transactions on Algorithms (TALG)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |