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: A poweroftwochoices unbalanced allocation process, SIAM J. Discrete Math, to appear.

Robert DeMarco, Amanda Redlich: Graph decomposition and parity, J. Graph Theory 82 (4): 374–386 (2016).

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, (2016) 655671.

Robert DeMarco, Jeffry 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 abcpermutations. Functional Analysis and Other Mathematics 2(1): 8792 (2008).

David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial properties of a rooted graph polynomial. SIAM J. Discrete Math. 22(2): 776785 (2008)D. Eisenstat, J. Feder, G. Francos, G. Gordon, A. Redlich: Expected rank and randomness 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
Recent Talks

Topology et al. Seminar, Wesleyan University, Nov. 2016  Graph counting and combinatorial games: A logical connection

Special Session on Extremal and Probabilistic Combinatorics, AMS Fall Central Sectional Meeting, University of St. Thomas, Oct. 2016  The waiting game: Balanced allocation via random choices

MSCS Seminar, Macalester College, Oct. 2016  The best random choice

Special Session on New Developments in Graphs and Hypergraphs, AMS Fall Eastern Sectional Meeting, Bowdoin College, Sept. 2016  Strategic graph decompositions

SIAM Workshop on Network Science, Boston MA, July 2016  Designing exit frequency distance measures for biological networks

Randomized Structures and Algorithms, Carnegie Mellon University, July 2015  Power laws and the power of two choices

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 Days in the Northeast, Middletown CT, October 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