crwhite AT cs DOT cmu DOT edu
I am a third year PhD student in the Computer Science
Department at Carnegie Mellon University, supported by the
National Defense Science and Engineering Graduate (NDSEG) Fellowship
and the Amherst Memorial Fellowship.
I am part of the theory
I am fortunate to be advised by
My interests include the design and analysis of algorithms, theoretical foundations of machine learning,
and beyond worst-case analysis.
I received my undergraduate degree from Amherst College.
Here is my CV.
General and Robust Communication-Efficient Algorithms for Distributed Clustering
Learning the best algorithm for max-cut, clustering, and other partitioning problems
Data Driven Resource Allocation for Distributed Learning
International Conference on Artificial Intelligence and Statistics (AISTATS) 2017
Learning Combinatorial Functions from Pairwise Comparisons
by Ellen Vitercik)
Conference on Learning Theory (COLT) 2016
k-center Clustering under Perturbation Resilience
International Colloquium on Automata, Languages, and Programming (ICALP) 2016
Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
European Symposium on Algorithms (ESA) 2015
Small dynamical heights for quadratic
polynomials and rational functions
Y. Kovacheva, C. White
Experimental Mathematics, Volume 23, Issue 4, 2014
An Improved Parallel Iterative Algorithm for Stable Matching
Extended Abstract, SuperComputing 2013
I was a TA for Algorithms in the Real World in Fall '15,
taught by Guy Blelloch
and Anupam Gupta.