Journal Article
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
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
Generating and counting Hamilton cycles in random regular graphs
Perfect Matchings in Random r-regular, s-uniform Hypergraphs
POLYNOMIAL-TIME RANDOMIZED APPROXIMATION SCHEMES FOR TUTTE-GROTHENDIECK INVARIANTS - THE DENSE CASE
PROBABILISTIC ANALYSIS OF AN ALGORITHM IN THE THEORY OF MARKETS IN INDIVISIBLE GOODS