In New York.

Krzysztof Choromanski

Columbia University

School of Engineering and Applied Science

Department of Industrial Engineering and Operations Research

Contact Info:

Email: kmc2178@columbia.edu
Office: 321 Mudd Bldg
Phone: -

About me:

I am a PH.D student of the Department of Industrial Engineering and Operations Research at Columbia University. I have finished my master studies with honors at the University of Warsaw with master degree from both computer science and mathematics. My advisors from the University of Warsaw were: Professor Krzysztof Diks and Professor Jacek Miekisz. My present advisor is Professor Maria Chudnovsky. You can find my CV here .

Interests:

I work on structural graph theory focusing on analyzing graphs with forbidden structures. I work on the Erdos-Hajnal Conjecture. I am also involved in many projects hosted by the Department of Computer Science. There I focus on cryptography (differential privacy but not only), machine learning and approximation algorithms for NP-hard problems. My other scientifical interests are: random graphs, spectral graph theory, algorithmics (especially distributed graph algorithms), programming and physics. I also play piano. My favourite composer is Fryderyk Chopin. I dance latin dance.
Selected talks:

  • Upper bounds for Erdos-Hajnal coefficients of tournaments (Talk at the Discrete Math Seminar, Columbia University, 2011)
  • Upper bounds for Erdos-Hajnal coefficients of tournaments (Talk at the 15th International Conference on Random Structures and Algorithms in Atlanta , Emory University, 2011)
  • New classes of tournaments satisfying the Erdos-Hajnal Conjecture (Talk at the Department of Mathematics at Princeton University, 2012)
  • The Erdos-Hajnal Conjecture (Talk at the Department of Mathematics at Rutgers University, 2012)
  • New classes of tournaments satisfying the Erdos-Hajnal Conjecture (Tech Talk at Google, Mountain View, 2012)

    • Some online available papers and not only:

  • Tournaments and colouring (with Eli Berger, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul Seymour and Stephan Thomasse), JCTB
  • Upper bounds for Erdos-Hajnal coefficients of tournaments , Journal of Graph Theory
  • An Appendix to the paper: "Upper bounds for Erdos-Hajnal coefficients of tournaments"
  • The power of the Dinur-Nissim algorithm: Breaking privacy of statistical and graph databases) (with Tal Malkin), PODS'12
  • Scale-free graph with preferential attachment and evolving internal vertex structure (with Michal Matuszak and Jacek Miekisz), Journal of Statistical Physics
  • Forcing large transitive subtournaments (with Eli Berger and Maria Chudnovsky), submitted for publication
  • Tournaments with near-linear transitive subsets(with Maria Chudnovsky and Paul Seymour) , submitted for publication
  • EH-suprema of tournaments with no nontrivial homogeneous sets, submitted for publication
  • Differentially-Private Learning of Low Dimensional Manifolds (with Geetha Jagannathan, Anna Choromanska and Claire Monteleoni), submitted for publication
  • Data k-anonymity via b-matching (with Tony Jebara), submitted for publication
  • On tournaments satisfying strong Erdos-Hajnal Conjecture, in preparation

    • Interesting links:

  • Columbia University website
  • My department
  • My former university website
  • My former department website
  • My great high school website