#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1957

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Noga Alon, Joel H. Spencer
- SODA
- 1992

- Noga Alon, Joel H. Spencer
- SODA '92
- 2000

The use of randomness is now an accepted tool in Theoretical Computer Science but not everyone is aware of the underpinnings of this methodology in Combinatorics - particularly, in what is now called the probabilistic Method as developed primarily by Paul Erdo&huml;s over the past half century. Here I will explore a particular set of problems - all dealing… (More)

- Béla Bollobás, Oliver Riordan, Joel H. Spencer, Gábor E. Tusnády
- Random Struct. Algorithms
- 2001

Recently, Barabási and Albert [2] suggested modeling complex real-world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In [2] and, with Jeong, in [3], Barabási and… (More)

- D Karger, R Motwani, M Sudan, J H Wilkinson, A Blum, J H Spencer
- 1994

18 until the number of vertices left is O(n=d), and color the remaining vertices in an arbitrary manner. 7. The existence of an approximation algorithm based on the spectral method for coloring arbitrary graphs is a question that deserves further investigation (which we do not address here.) Recently, improved approximation algorithms for graph coloring… (More)

- Norbert Sauer, Joel H. Spencer
- J. Comb. Theory, Ser. B
- 1978

- Paul Erdös, Joel H. Spencer
- Discrete Applied Mathematics
- 1991

- Boris Pittel, Joel H. Spencer, Nicholas C. Wormald
- J. Comb. Theory, Ser. B
- 1996

<lb>We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite<lb>graph and analyze the algorithm using the theory of discrete time random processes. As a result<lb>we obtain a simple criterion invovlving the fractions of nodes of di erent degrees on both sides of<lb>the graph which is necessary and su cient for the… (More)

- Nicholas Pippenger, Joel H. Spencer
- J. Comb. Theory, Ser. A
- 1989

- Eli Shamir, Joel H. Spencer
- Combinatorica
- 1987

- Joel H. Spencer
- Discrete Mathematics
- 1977