Denis Pankratov

PhD student, Theory Group, Department of Computer Science, University of Chicago.

Research Interests:

I am interested in Complexity Theory, and, more specifically, in Communication Complexity. My research goal is to understand how information theoretic tools can be used to better understand the computation process in this model. I am also interested in understanding the structure of complexity classes in the two-party and multiparty number-on-forehead models.

Curriculum Vitae

Publications:

1. Pooya Hatami, Raghav Kulkarni, Denis Pankratov: Variations on the Sensitivity Conjecture. Submitted.
2. Denis Pankratov, Allan Borodin: On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem, Theory and Applications of Satisfiability Testing - SAT 2010, Lecture Notes in Computer Science, 2010, Volume 6175/2010, 223-236, DOI: 10.1007/978-3-642-14186-7_19
3. Alex Varshavsky, Denis Pankratov, John Krumm and Eyal de Lara: Calibree: Calibration-free Localization using Relative Distance Estimations, Pervasive Computing: Lecture Notes in Computer Science, 2008, Volume 5013/2008, 146-161, DOI: 10.1007/978-3-540-79576-6_9

Projects:

TA:

• Spring 2011: BIOS 20151: Introduction to Quantitative Modeling in Biology
• Spring 2011: CSPP 55001: Algorithms
• Winter 2011: CMSC 27200: Theory of Algorithms
• Autumn 2010: CMSC 37110: Discrete Mathematics
• Winter 2010: CSPP 55005: Advanced Algorithms
• Autumn 2009: CSPP 55001: Algorithms

Contact Information: