Amanda Redlich

Assistant Professor of Mathematics
(on leave for the 2016-17 academic year)

Amanda sitting of the steps of Searles

Contact Information

Searles Science Building - 102


  • B.A. University of Chicago
  • Ph.D. MIT

Research Interests

  • Probabilistic combinatorics, graph theory, randomized algorithms, network science


  • Amanda Redlich: Unbalanced allocations, submitted to SIAM J. Discrete Math.
  • Robert DeMarco, Amanda Redlich: Graph decomposition and parity, to appear, J. Graph Theory.
  • J. Augustine, W. K. Moses Jr., A. Redlich, E. Upfal: Ballanced allocation: Patience is not a virtue,
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Robert DeMarco, Jeff Kahn, Amanda Redlich: Modular statistics for subgraph counts in sparse
    random graphs, Electronic J. of Combinatorics 22(1): P1.37 (2015).
  • Shabnam Beheshti, Amanda Redlich: Remarks on combinatorial aspects of the KP Equation,
    Proceedings of the Second International Conference on Nonlinear and Modern Mathematical
    Physics, AIP Conf. Proc. 1562, 5 (2013).
  • S. Patil, S. Roy, J. Augustine, A. Redlich, A. Deshpande, M. Gharote, S. Lodha, A. Mehrotra,
    H. Vin: Minimizing Testing Overheads in Database Migration Lifecycle. Proceedings of 16th
    International Conference on Management of Data (COMAD), 2010.
  • Igor Pak, Amanda Redlich: Long cycles in abc-permutations. Functional Analysis and Other
    Mathematics 2(1): 87-92 (2008).
  • David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial properties of a rooted graph
    polynomial. SIAM J. Discrete Math. 22(2): 776-785 (2008)
  • David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich: Expected rank and
    randomness in rooted graphs. Discrete Applied Mathematics 156(5): 746-756 (2008)
  • Complete CV (PDFPDF)

Selected Awards

  • Institute for Computation and Experimental Research in Mathematics research fellowship - Spring 2014
  • National Science Foundation Mathematical Sciences Postdoctoral Research Fellowship - Fall 2010- Spring 2013
  • Akamai Presidential Fellowship (MIT) - Fall 2005-Spring 2006


  • Colby-Bowdoin-Bates Math Colloquium, April 2015 - There is method in madness: Increasing randomness to decrease randomness
  • ICERM, Providence RI, March 2014 - Subgraphs in random graphs
  • Discrete Mathematics Day, Wesleyan University, Middletown CT, Oct. 2013 - Parity, first-order logic, and gluing and cutting graphs
  • IAS WAM Research Seminar, Princeton NJ, May 2013 - Gluing graphs, ungluing graphs, and first-order logic with parity
  • DIMACS/CCICADA Interdisciplinary Seminar, Piscataway NJ, April 2013 - Unbalanced allocations and cost minimization
  • Applied Communication Sciences, Basking Ridge NJ, April 2013 - Logic, parity, and counting subgraphs in random graphs
  • Princeton Discrete Mathematics Seminar, Princeton NJ, March 2013 - Graph constructions, graph decompositions, and random graphs
  • Bell Labs Mathematics Colloquium, Murray Hill NJ, Jan. 2013 - Unbalanced allocations and cost minimization
  • Midwestern Graph Theory Conference LIII, Ames IA, Sept. 2012 - Logic and graph decompositions 2
  • 2012 SIAM Conference on Discrete Mathematics, Halifax NS, June 2012 - The power and weakness of two choices
  • Applied Mathematics Colloquium, Illinois Institute of Technology, Chicago IL, April 2012 - Deter- ministic randomness
  • Penn Combinatorics and Probability Seminar, Philadelphia PA, March 2012 - Deterministic random algorithms
  • Columbia Discrete Math Seminar, New York NY, March 2012 - Logic, parity, and graph decom- positions