# Alan Frieze

## Affiliations: | Carnegie Mellon University, Pittsburgh, PA |

##### Area:

Mathematics##### Google:

"Alan Frieze"#### Children

Sign in to add traineeGeoffrey D. Atkinson | grad student | 2003 | Carnegie Mellon |

Kelley Burgin | grad student | 2006 | Carnegie Mellon |

Abraham D. Flaxman | grad student | 2006 | Carnegie Mellon |

Prasad Chebolu | grad student | 2008 | Carnegie Mellon |

Pall Melsted | grad student | 2009 | Carnegie Mellon |

Deepak Bal | grad student | 2013 | Carnegie Mellon |

Charalampos E. Tsourakakis | grad student | 2013 | Carnegie Mellon |

BETA: Related publications

See more...

#### Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |

Frieze A, Haber S. (2015) 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 |

Bal D, Bennett P, Dudek A, et al. (2014) The t-Tone Chromatic Number of Random Graphs Graphs and Combinatorics. 30: 1073-1086 |

Beveridge A, Dudek A, Frieze A, et al. (2014) Maker-breaker games on random geometric graphs Random Structures and Algorithms. 45: 553-607 |

Frieze A, Mubayi D. (2013) Coloring simple hypergraphs Journal of Combinatorial Theory. Series B. 103: 767-794 |

Dudek A, Frieze A, Ruciński A, et al. (2013) Approximate counting of regular hypergraphs Information Processing Letters. 113: 785-788 |

Beveridge A, Dudek A, Frieze A, et al. (2012) Cops and robbers on geometric graphs Combinatorics Probability and Computing. 21: 816-834 |

Frieze A, Melsted P. (2012) Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables Random Structures and Algorithms. 41: 334-364 |

Frieze A, Melsted P, Mitzenmacher M. (2011) An Analysis of Random-Walk Cuckoo Hashing Siam Journal On Computing. 40: 291-308 |

Chebolu P, Frieze A, Melsted P. (2010) Finding a maximum matching in a sparse random graph in O ( n ) expected time Journal of the Acm. 57: 24 |

Bohman T, Frieze A, Mubayi D, et al. (2010) Hypergraphs with independent neighborhoods Combinatorica. 30: 277-293 |