How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An algorithm for finding Hamilton cycles in random graphs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A fast perfect-matching algorithm in random graphs
SIAM Journal on Discrete Mathematics
Clique partitions, graph compression and speeding-up algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Probabilistic analysis of network flow algorithms
Mathematics of Operations Research
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Approximate congruence in nearly linear time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Packing Edges in Random Regular Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Large k-separated matchings of random regular graphs
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Advanced algorithms for fast and scalable deep packet inspection
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
Finding a maximum matching in a sparse random graph in O(n) expected time
Journal of the ACM (JACM)
Tolerating correlated failures for generalized Cartesian distributions via bipartite matching
Proceedings of the 8th ACM International Conference on Computing Frontiers
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
| Hi-index | 0.01 |