Conference An Efficient Sparse Regularity Concept 2009 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 207-+ Coja-Oghlan A, Cooper C, Frieze A
Conference Average-Case Analyses of Vickrey Costs 2009 • Lecture Notes in Computer Science • 5687:434-+ Chebolu P, Frieze A, Melsted P, Sorkin GB
Journal Article Hamilton Cycles in 3-Out 2009 • Random structures & algorithms (Print) • 35(4):393-417 Bohman T, Frieze A
Journal Article Line-of-Sight Networks 2009 • Combinatorics Probability and Computing • 18(1-2):145-163 Frieze A, Kleinberg J, Ravi R, Debany W
Journal Article MEMORYLESS RULES FOR ACHLIOPTAS PROCESSES 2009 • SIAM Journal on Discrete Mathematics • 23(2):993-1008 Beveridge A, Bohman T, Frieze A, Pikhurko O
Conference Multiple Random Walks and Interacting Particle Systems 2009 • Lecture Notes in Computer Science • 5556:399-+ Cooper C, Frieze A, Radzik T
Journal Article MULTIPLE RANDOM WALKS IN RANDOM REGULAR GRAPHS 2009 • SIAM Journal on Discrete Mathematics • 23(4):1738-1761 Cooper C, Frieze A, Radzik T
Conference On smoothed <i>k</i>-CNF formulas and the Walksat algorithm 2009 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 451-+ Coja-Oghlan A, Feige U, Frieze A, Krivelevich M, Vilenchik D
Conference Random Walks on Random Graphs 2009 • Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering • 3:95-+ Cooper C, Frieze A
Journal Article Separating populations with wide data: A spectral analysis 2009 • Electronic Journal of Statistics • 3:76-113 Blum A, Coja-Oghlan A, Frieze A, Zhou S
Conference The cover time of random geometric graphs 2009 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 48-+ Cooper C, Frieze A
Journal Article The Cover Time of the Giant Component of a Random Graph (vol 32, pg 401, 2008) 2009 • Random structures & algorithms (Print) • 34(2):300-304 Cooper C, Frieze A
Conference A new approach to the planted clique problem 2008 • Leibniz International Proceedings in Informatics • 2:187-198 Frieze A, Kannan R
Conference Finding a maximum matching in a sparse random graph in O(<i>n</i>) expected time 2008 • Lecture Notes in Computer Science • 5125:161-172 Chebolu P, Frieze A, Melsted P
Journal Article Game chromatic index of graphs with given restrictions on degrees 2008 • Theoretical Computer Science • 407(1-3):242-249 Beveridge A, Bohman T, Frieze A, Pikhurko O
Journal Article Hamilton cycles in random lifts of directed graphs 2008 • SIAM Journal on Discrete Mathematics • 22(2):520-540 Chebolu P, Frieze A
Conference Logconcave Random Graphs 2008 • Annual ACM Symposium on Theory of Computing • 779-+ Frieze A, Vempala S, Vera J
Journal Article On rainbow trees and cycles 2008 • Electronic Journal of Combinatorics • 15(1): Frieze A, Krivelevich M
Journal Article On rainbow trees and cycles 2008 • Electronic Journal of Combinatorics • 15(1 R): Frieze A, Krivelevich M
Journal Article On the chromatic number of simple triangle-free triple systems 2008 • Electronic Journal of Combinatorics • 15(1 R):1-27 Frieze A, Mubayi D
Journal Article On the chromatic number of simple triangle-free triple systems 2008 • Electronic Journal of Combinatorics • 15(1): Frieze A, Mubayi D
Journal Article On two Hamilton cycle problems in random graphs 2008 • Israel Journal of Mathematics • 166(1):221-234 Frieze A, Krivelevich M
Journal Article Random <i>k</i>-SAT:: the limiting probability for satisfiability for moderately growing <i>k</i> 2008 • Electronic Journal of Combinatorics • 15(1): Coja-Oghlan A, Frieze A
Journal Article Random k-SAT: The limiting probability for satisfiability for moderately growing k 2008 • Electronic Journal of Combinatorics • 15(1 R):1-6 Coja-Oghlan A, Frieze A
