Amanda Redlich
Assistant Professor of Mathematics
(on leave for the 201617 academic year)
Contact Information
aredlich@bowdoin.edu
2077253566
Mathematics
Searles Science Building  102
Education
 B.A. University of Chicago
 Ph.D. MIT
Research Interests
 Probabilistic combinatorics, graph theory, randomized algorithms, network science
Publications

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 TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms.

Robert DeMarco, Jeff Kahn, Amanda Redlich: Modular statistics for subgraph counts in sparserandom 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 MathematicalPhysics, 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 16thInternational Conference on Management of Data (COMAD), 2010.

Igor Pak, Amanda Redlich: Long cycles in abcpermutations. Functional Analysis and OtherMathematics 2(1): 8792 (2008).

David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial properties of a rooted graphpolynomial. SIAM J. Discrete Math. 22(2): 776785 (2008)

David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich: Expected rank andrandomness in rooted graphs. Discrete Applied Mathematics 156(5): 746756 (2008)
 Complete CV (PDF)
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 2005Spring 2006
Talks
 ColbyBowdoinBates 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, firstorder logic, and gluing and cutting graphs
 IAS WAM Research Seminar, Princeton NJ, May 2013  Gluing graphs, ungluing graphs, and firstorder 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