Journal Article
A polynomial-time algorithm for learning noisy linear threshold functions
Approximately counting Hamilton paths and cycles in dense graphs
Average-case analysis of the merging algorithm of Hwang and Lin
Greedy algorithms for the shortest common superstring that are asymptotically optimal
Maximum matchings in sparse random graphs: Karp-Sipser revisited
Min-wise independent permutations
Optimal construction of edge-disjoint paths in random graphs
Static and dynamic path selection on expander graphs (preliminary version): a random walk approach
Static and dynamic path selection on expander graphs: A random walk approach
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
Analysis of two simple heuristics on a random instance of k-SAT