N. Alon, J.H. Spencer, and Paul Erdos. The Probabilistic Method. John Wiley & Sons, 1992. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Greedy Algorithms by Derandomizing . . . - Young (Correct)
Averaging Sequences, Deranged Mappings, and a Problem of.. - Calkin, Canfield, Wilf (Correct)
Limit Probabilities for Random Sparse Bit Strings - John (1997) (1 citation) (Correct)
Random Sparse Bit Strings at the Threshold of Adjacency.. - Spencer, al. (1998) (Correct)
Greedy Algorithms by Derandomizing Unknown Distributions - Young (1994) (1 citation) (Correct)
Hard Graphs for Randomized Subgraph Exclusion Algorithms - Peinado (1994) (Correct)
Limit Probabilities for Random Sparse Bit Strings - John (1997) (1 citation) (Correct)
Hidden Cliques as Cryptographic Keys - Ari Juels Marcus (1996) (1 citation) (Correct)
The Power of Two Choices in Randomized Load Balancing - Mitzenmacher (1996) (44 citations) (Correct)
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman, al. (1996) (12 citations) (Correct)
The Probabilistic Method - Ku Ju Ne (Correct)
Studying Balanced Allocations with Differential Equations - Mitzenmacher (1997) (3 citations) (Correct)
Noise-Tolerant Distribution-Free Learning of General.. - Bshouty, Goldman, al. (1996) (12 citations) (Correct)
The Power of Two Choices in Randomized Load Balancing - Mitzenmacher (1996) (44 citations) (Correct)
Random Unary Predicates: Almost Sure Theories and Countable.. - Spencer, John (1997) (1 citation) Self-citation (Spencer) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC