2013
66Special Issue on Algorithms and Models for the Web Graph. Alan M. Frieze, Paul Horn, Pawel Pralat. Internet Mathematics (9): 1-2 (2013). Web SearchBibTeXDownload
2012
65Rainbow Connectivity of Sparse Random Graphs. Alan M. Frieze, Charalampos E. Tsourakakis. APPROX-RANDOM 2012, 541-552. Web SearchBibTeXDownload
64On Certain Properties of Random Apollonian Networks. Alan M. Frieze, Charalampos E. Tsourakakis. WAW 2012, 93-112. Web SearchBibTeXDownload
2011
63High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks. Alan M. Frieze, Charalampos E. Tsourakakis. CoRR (abs/1104.5259) (2011). Web SearchBibTeXDownload
62An Analysis of Random-Walk Cuckoo Hashing. Alan M. Frieze, Páll Melsted, Michael Mitzenmacher. SIAM J. Comput. (40): 291-308 (2011). Web SearchBibTeXDownload
2010
61Logconcave Random Graphs. Alan M. Frieze, Santosh Vempala, Juan Vera. Electr. J. Comb. (17) (2010). Web SearchBibTeXDownload
2009
60An Analysis of Random-Walk Cuckoo Hashing. Alan M. Frieze, Páll Melsted, Michael Mitzenmacher. APPROX-RANDOM 2009, 490-503. Web SearchBibTeXDownload
59Line-of-Sight Networks. Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. Combinatorics, Probability & Computing (18): 145-163 (2009). Web SearchBibTeXDownload
2008
58A new approach to the planted clique problem. Alan M. Frieze, Ravi Kannan. FSTTCS 2008, 187-198. Web SearchBibTeXDownload
57Logconcave random graphs. Alan M. Frieze, Santosh Vempala, Juan Vera. STOC 2008, 779-788. Web SearchBibTeXDownload
2007
56The Influence of Search Engines on Preferential Attachment. Alan M. Frieze, Juan Vera, Soumen Chakrabarti. Internet Mathematics (3): 361-381 (2007). Web SearchBibTeXDownload
55Separating Populations with Wide Data: A Spectral Analysis. Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou. ISAAC 2007, 439-451. Web SearchBibTeXDownload
54Line-of-sight networks. Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. SODA 2007, 968-977. Web SearchBibTeXDownload
2005
53The influence of search engines on preferential attachment. Soumen Chakrabarti, Alan M. Frieze, Juan Vera. SODA 2005, 293-300. Cited by 13Web SearchBibTeXDownload
2004
52Fast monte-carlo algorithms for finding low-rank approximations. Alan M. Frieze, Ravi Kannan, Santosh Vempala. J. ACM (51): 1025-1041 (2004). Web SearchBibTeXDownload
51Efficient communication in an ad-hoc network. Abraham Flaxman, Alan M. Frieze, Eli Upfal. J. Algorithms (52): 1-7 (2004). Web SearchBibTeXDownload
50Clustering Large Graphs via the Singular Value Decomposition. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay. Machine Learning (56): 9-33 (2004). Web SearchBibTeXDownload
2002
49A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Sanjeev Arora, Alan M. Frieze, Haim Kaplan. Math. Program. (92): 1-36 (2002). Web SearchBibTeXDownload
48Balls and bins models with feedback. Eleni Drinea, Alan M. Frieze, Michael Mitzenmacher. SODA 2002, 308-315. Web SearchBibTeXDownload
2001
47A general approach to dynamic packet routing with bounded buffers. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. J. ACM (48): 324-349 (2001). Web SearchBibTeXDownload
2000
46Min-Wise Independent Permutations. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher. J. Comput. Syst. Sci. (60): 630-659 (2000). Web SearchBibTeXDownload
1999
45Quick Approximation to Matrices and Applications. Alan M. Frieze, Ravi Kannan. Combinatorica (19): 175-220 (1999). Web SearchBibTeXDownload
44A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Alan M. Frieze, Ravi Kannan. Electr. J. Comb. (6) (1999). Web SearchBibTeXDownload
43Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu. FOCS 1999, 218-229. Web SearchBibTeXDownload
42Optimal Reconstruction of a Sequence from its Probes. Alan M. Frieze, Franco P. Preparata, Eli Upfal. Journal of Computational Biology (6): 361-368 (1999). Web SearchBibTeXDownload
41Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. Random Struct. Algorithms (14): 87-109 (1999). Web SearchBibTeXDownload
40On the power of universal bases in sequencing by hybridization. Franco P. Preparata, Alan M. Frieze, Eli Upfal. RECOMB 1999, 295-301. Web SearchBibTeXDownload
39Clustering in Large Graphs and Matrices. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay. SODA 1999, 291-299. Web SearchBibTeXDownload
1998
38A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. Algorithmica (22): 35-52 (1998). Web SearchBibTeXDownload
37Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha. Algorithmica (22): 483-489 (1998). Web SearchBibTeXDownload
36Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. Alan M. Frieze, Ravi Kannan, Santosh Vempala. FOCS 1998, 370-378. Web SearchBibTeXDownload
35Dynamic Packet Routing on Arrays with Bounded Buffers. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. LATIN 1998, 273-281. Web SearchBibTeXDownload
34On Balls and Bins with Deletions. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal. RANDOM 1998, 145-158. Web SearchBibTeXDownload
33Optimal Construction of Edge-Disjoint Paths in Random Graphs. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal. SIAM J. Comput. (28): 541-573 (1998). Web SearchBibTeXDownload
32Min-Wise Independent Permutations (Extended Abstract). Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher. STOC 1998, 327-336. Web SearchBibTeXDownload
1997
31Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). Andrei Z. Broder, Alan M. Frieze, Eli Upfal. STOC 1997, 531-539. Web SearchBibTeXDownload
1996
30A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. Sanjeev Arora, Alan M. Frieze, Haim Kaplan. FOCS 1996, 21-30. Web SearchBibTeXDownload
29A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. FOCS 1996, 330-338. Web SearchBibTeXDownload
28A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). Andrei Z. Broder, Alan M. Frieze, Eli Upfal. FOCS 1996, 390-399. Web SearchBibTeXDownload
27Learning Linear Transformations. Alan M. Frieze, Mark Jerrum, Ravi Kannan. FOCS 1996, 359-368. Web SearchBibTeXDownload
26The Regularity Lemma and Approximation Schemes for Dense Problems. Alan M. Frieze, Ravi Kannan. FOCS 1996, 12-20. Web SearchBibTeXDownload
25Coloring Bipartite Hypergraphs. Hui Chen, Alan M. Frieze. IPCO 1996, 345-358. Web SearchBibTeXDownload
24Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. Hui Chen, Alan M. Frieze. Random Struct. Algorithms (9): 359-377 (1996). Web SearchBibTeXDownload
23An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal. SODA 1996, 261-268. Web SearchBibTeXDownload
1995
22The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. Andrei Z. Broder, Martin E. Dyer, Alan M. Frieze, Prabhakar Raghavan, Eli Upfal. Inf. Process. Lett. (56): 79-81 (1995). Cited by 13Web SearchBibTeXDownload
21Balanced Allocations for Tree-Like Inputs. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold. Inf. Process. Lett. (55): 329-332 (1995). Cited by 8Web SearchBibTeXDownload
20Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Noga Alon, Alan M. Frieze, Dominic Welsh. Random Struct. Algorithms (6): 459-478 (1995). Web SearchBibTeXDownload
19When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?. Alan M. Frieze, Richard M. Karp, Bruce A. Reed. SIAM J. Comput. (24): 484-493 (1995). Web SearchBibTeXDownload
1994
18Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. Noga Alon, Alan M. Frieze, Dominic Welsh. Electronic Colloquium on Computational Complexity (ECCC) (1) (1994). Web SearchBibTeXDownload
17Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs. Noga Alon, Alan M. Frieze, Dominic Welsh. FOCS 1994, 24-35. Web SearchBibTeXDownload
16On the Problem of Approximating the Number of Bases of a Matroid. Yossi Azar, Andrei Z. Broder, Alan M. Frieze. Inf. Process. Lett. (50): 9-11 (1994). Web SearchBibTeXDownload
15Near-perfect Token Distribution. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. Random Struct. Algorithms (5): 559-572 (1994). Web SearchBibTeXDownload
14Finding Hidden Hamiltonian Cycles. Andrei Z. Broder, Alan M. Frieze, Eli Shamir. Random Struct. Algorithms (5): 395-411 (1994). Web SearchBibTeXDownload
13Existence and Construction of Edge-Disjoint Paths on Expander Graphs. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. SIAM J. Comput. (23): 976-989 (1994). Web SearchBibTeXDownload
12Optimal Construction of Edge-Disjoint Paths in Random Graphs. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal. SODA 1994, 603-612. Web SearchBibTeXDownload
1993
11A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani. Combinatorics, Probability & Computing (2): 271-284 (1993). Web SearchBibTeXDownload
10On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. SODA 1993, 322-330. Web SearchBibTeXDownload
1992
9Near-perfect Token Distribution. Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. ICALP 1992, 308-317. Web SearchBibTeXDownload
8When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?. Alan M. Frieze, Richard M. Karp, Bruce A. Reed. IPCO 1992, 453-461. Web SearchBibTeX
7Separator Based Parallel Divide and Conquer in Computational Geometry. Alan M. Frieze, Gary L. Miller, Shang-Hua Teng. SPAA 1992, 420-429. Web SearchBibTeXDownload
6Existence and Construction of Edge Disjoint Paths on Expander Graphs. Andrei Z. Broder, Alan M. Frieze, Eli Upfal. STOC 1992, 140-149. Web SearchBibTeXDownload
1991
5A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. Martin E. Dyer, Alan M. Frieze, Ravi Kannan. J. ACM (38): 1-17 (1991). Web SearchBibTeXDownload
4Finding Hidden Hamiltonian Cycles (Extended Abstract). Andrei Z. Broder, Alan M. Frieze, Eli Shamir. STOC 1991, 182-189. Web SearchBibTeXDownload
1989
3A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. Martin E. Dyer, Alan M. Frieze, Ravi Kannan. STOC 1989, 375-381. Web SearchBibTeXDownload
1988
2Reconstructing Truncated Integer Variables Satisfying Linear Congruences. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir. SIAM J. Comput. (17): 262-280 (1988). Web SearchBibTeXDownload
1984
1Linear Congruential Generators Do Not Produce Random Sequences. Alan M. Frieze, Ravi Kannan, J. C. Lagarias. FOCS 1984, 480-484. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research