Research Interests
Probabilistic combinatorics, randomized algorithms, random graphs, biological and social networks
Education
- Ph.D.: Mathematics, (2010), Massachusetts Institute of Technology - Cambridge, MA
- BA: Mathematics, (2005), University of Chicago - Chicago, IL
- Mathematics, (2003), Budapest Semesters in Mathematics - Budapest, Hungary
Biosketch
Alum of University of Chicago, Budapest Semesters in Mathematics, and Massachusetts Institute of Technology. Previously at Rutgers University, the Institute for Computational and Experimental Research in Mathematics at Brown University and Bowdoin College. Research interests in probabilistic combinatorics and randomized algorithms. Also interested in cooking, Bollywood and math related to knitting.
Selected Publications
- Augustine, J., Moses Jr., W.K., Redlich, A., Upfal, E. (2022). Balanced Allocation: Patience Is Not a Virtue. SIAM J. Comput, 51(6): 1743-1768
- Redlich, A. (2017). A Power-of-Two-Choices Unbalanced Allocation Process. SIAM Journal on Discrete Mathematics,31(1) 477-488.
- Augustine, J., Moses, W.K., Redlich, A., Upfal, E. (2016). Balanced Allocation: Patience is not a Virtue. Society for Industrial and Applied Mathematics.
- DeMarco, B., Redlich, A. (2016). Graph Decomposition and Parity. Journal of Graph Theory,82(4) 374-386.
- DeMarco, B., Kahn, J., Redlich, A. (2015). Modular statistics for subgraph counts in sparse random graphs. Electronic Journal of Combinatorics,22(1).
- Beheshti, S., Redlich, A. (2013). Remarks on combinatorial aspects of the KP equation. AIP
- Patil, S., Roy, S., Augustine, J., Redlich, A., Lodha, S., Vin, H.M., Deshpande, A., Gharote, M., Mehrotra, A. (2010). Minimizing Testing Overheads in Database Migration Lifecycle (pp. 191).
- Pak, I., Redlich, A. (2008). Long cycles in abc-permutations. Functional Analysis and Other Mathematics,2(1) 87-92.
- Eisenstat, D., Gordon, G., Redlich, A. (2008). Combinatorial Properties of a Rooted Graph Polynomial. SIAM Journal on Discrete Mathematics, 22(2) 776-785.
- Eisenstat, D., Feder, J., Francos, G., Gordon, G., Redlich, A. (2008). Expected rank and randomness in rooted graphs. Discrete Applied Mathematics,156(5) 746-756.
Selected Presentations
- Generating power-law-like distributions easily: Popularity contests - Random Walks and Metrics Minisymposium, SIAM Annual Meeting, July 2017 - Pittsburgh, PA
- The power of two choices when the rich get richer: multiple choice at the multiplex - Computer Science & Engineering Seminar, Indian Institute of Technology Madras, May 2017 - Chennai, Tamil Nadu, India
- raph counting and combinatorial games: A logical connection - Topology et al. Seminar, Wesleyan University, November 2016 - Middletown, CT
- The best random choice - MSCS Seminar, October 2016 - St Paul, MN
- The waiting game: Balanced allocation via random choices - Special Session on Extremal and Probabilistic Combinatorics, AMS Fall Central Sectional Meeting, October 2016 - University of St. Thomas
- Strategic graph decompositions - Special Session on New Developments in Graphs and Hypergraphs, AMS Fall Eastern Sectional Meeting, September 2016 - Bowdoin College
- Designing exit frequency distance measures for biological networks - SIAM Workshop on Network Science, July 2016 - Boston MA
- Subgraphs in random graphs - ICERM, March 2014 - Providence, RI
- Unbalanced allocations and cost minimization - Bell Labs Mathematics Colloquium, January 2013 - Murray Hill, NJ
- Logic and graph decompositions - Midwestern Graph Theory Conference LIII, September 2012 - Ames, IA
- Logic, parity, and graph decompositions - Columbia Discrete Math Seminar, March 2012 - New York, NY
Selected Contracts, Fellowships, Grants and Sponsored Research
- National Science Foundation Mathematical Sciences Postdoctoral Research Fellowship (2010), Fellowship - National Science Foundation
Redlich, A. - Graduate Student Appreciation Fellowship (2009), Fellowship - MIT
Redlich, A. - Akamai Presidential Fellowship (2005), Fellowship - MIT
Redlich, A.