Alan Frieze - Publications

Carnegie Mellon University, Pittsburgh, PA 

19 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Frieze A, Haber S. An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three Random Structures and Algorithms. 47: 73-98. DOI: 10.1002/Rsa.20542  1
2014 Bal D, Bennett P, Dudek A, Frieze A. The t-Tone Chromatic Number of Random Graphs Graphs and Combinatorics. 30: 1073-1086. DOI: 10.1007/S00373-013-1341-9  1
2014 Beveridge A, Dudek A, Frieze A, Müller T, Stojaković M. Maker-breaker games on random geometric graphs Random Structures and Algorithms. 45: 553-607. DOI: 10.1002/Rsa.20572  1
2013 Frieze A, Mubayi D. Coloring simple hypergraphs Journal of Combinatorial Theory. Series B. 103: 767-794. DOI: 10.1016/J.Jctb.2013.09.003  1
2013 Dudek A, Frieze A, Ruciński A, Šileikis M. Approximate counting of regular hypergraphs Information Processing Letters. 113: 785-788. DOI: 10.1016/J.Ipl.2013.07.018  1
2012 Beveridge A, Dudek A, Frieze A, Müller T. Cops and robbers on geometric graphs Combinatorics Probability and Computing. 21: 816-834. DOI: 10.1017/S0963548312000338  1
2012 Frieze A, Melsted P. Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables Random Structures and Algorithms. 41: 334-364. DOI: 10.1002/Rsa.20427  1
2011 Frieze A, Melsted P, Mitzenmacher M. An Analysis of Random-Walk Cuckoo Hashing Siam Journal On Computing. 40: 291-308. DOI: 10.1137/090770928  0.96
2010 Chebolu P, Frieze A, Melsted P. Finding a maximum matching in a sparse random graph in O ( n ) expected time Journal of the Acm. 57: 24. DOI: 10.1145/1734213.1734218  1
2010 Bohman T, Frieze A, Mubayi D, Pikhurko O. Hypergraphs with independent neighborhoods Combinatorica. 30: 277-293. DOI: 10.1007/S00493-010-2474-6  1
2008 Chebolu P, Frieze A. Hamilton cycles in random lifts of directed graphs Siam Journal On Discrete Mathematics. 22: 520-540. DOI: 10.1137/060670808  1
2007 Frieze A, Kleinberg J, Ravi R, Debany W. Line-of-sight networks Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 968-977. DOI: 10.1017/S0963548308009334  1
2005 Frieze A, Krivelevich M, Sudakov B. The strong chromatic index of random graphs Siam Journal On Discrete Mathematics. 19: 719-727. DOI: 10.1137/S0895480104445757  1
2004 Drineas P, Frieze A, Kannan R, Vempala S, Vinay V. Clustering large graphs via the Singular Value Decomposition Machine Learning. 56: 9-33. DOI: 10.1023/B:Mach.0000033113.59016.96  1
2002 Dyer M, Frieze A, Jerrum M. On counting independent sets in sparse graphs Siam Journal On Computing. 31: 1527-1541. DOI: 10.1137/S0097539701383844  1
1998 Aronson J, Frieze A, Pittel BG. Maximum matchings in sparse random graphs: Karp-Sipser revisited Random Structures and Algorithms. 12: 111-117. DOI: 10.1002/(Sici)1098-2418(199803)12:2<111::Aid-Rsa1>3.0.Co;2-#  1
1996 Frieze A, Jerrum M, Molloy M, Robinson R, Wormald N. Generating and Counting Hamilton Cycles in Random Regular Graphs Journal of Algorithms. 21: 176-198. DOI: 10.1006/Jagm.1996.0042  1
1996 Frieze A, Suen S. Analysis of Two Simple Heuristics on a Random Instance of k-SAT Journal of Algorithms. 20: 312-355. DOI: 10.1006/Jagm.1996.0016  1
1994 Dyer M, Frieze A. Random walks, totally unimodular matrices, and a randomised dual simplex algorithm Mathematical Programming. 64: 1-16. DOI: 10.1007/Bf01582563  1
Show low-probability matches.