An efficient algorithm for the vertex-disjoint paths problem in random graphs
- Andrei Z. Broder
- Alan M. Frieze
- et al.
- 1996
- SODA 1996
Publications
Date
Featured collections
Popular topics
26 results for Andrei Broder
Balanced allocations
- Y. Azar
- Andrei Z. Broder
- et al.
- 1994
- STOC 1994
On the parallel complexity of evaluating game trees
- Andrei Z. Broder
- Anna Karlin
- et al.
- 1991
- SODA 1991
Efficient fault tolerant routings in networks
- Andrei Broder
- Michael Fischer
- et al.
- 1984
- STOC 1984
FLIPPING COINS IN MANY POCKETS (BYZANTINE AGREEMENT ON UNIFORMLY RANDOM VALUES).
- Andrei Z. Broder
- D. Dolev
- 1983
- FOCS 1983
Flipping coins in many pockets (byzantine agreement on uniformly random values)
- Andrei Z. Broder
- Danny Dolev
- 1984
- FOCS 1984
Sampling search-engine results
- Aris Anagnostopoulos
- Andrei Z. Broder
- et al.
- 2007
- World Wide Web
Efficient PageRank approximation via graph aggregation
- Andrei Z. Broder
- R. Lempel
- et al.
- 2006
- Information Retrieval
Towards the next generation of enterprise search technology
- Andrei Z. Broder
- A.C. Ciccolo
- 2004
- IBM Systems Journal
Network applications of bloom filters: A survey
- Andrei Broder
- Michael Mitzenmacher
- 2004
- Internet Mathematics