Tony Johansson

Department of Mathematical Sciences
Carnegie Mellon University

email: tony.johansson AT math DOT uu DOT se
(You can contact me in English or Swedish)

As of February 2017 I am working at Uppsala University.
For the moment, this web page will continue to serve as my personal web page.


I am a former Ph.D. student in the Algorithms, Combinatorics and Optimization (ACO) program. My research advisor was Alan Frieze. My research interests are random graphs, randomized algorithms and probabilistic combinatorics.


  • 21-122: Integration and approximation (Summer session one 2016)


  • On the insertion time of random walk cuckoo hashing
    Presented at SODA17 [Co-author: A. Frieze]
  • On random k-out sub-graphs of large graphs
    To appear in Random Structures and Algorithms [Co-author: A. Frieze]
  • Minimum-cost matching in a random graph with random costs
    To appear in SIAM Journal on Discrete Mathematics [Co-author: A. Frieze]
  • On edge disjoint spanning trees in a randomly weighted complete graph
    To appear in Combinatorics, Probability and Computing [Co-author: A. Frieze]


  • Deletion of oldest edges in a preferential attachment graph