Denis Pankratov
Denis Pankratov
Verified email at concordia.ca - Homepage
Title
Cited by
Cited by
Year
From information to exact communication
M Braverman, A Garg, D Pankratov, O Weinstein
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
862013
Variations on the sensitivity conjecture
P Hatami, R Kulkarni, D Pankratov
arXiv preprint arXiv:1011.0354, 2010
732010
Calibree: Calibration-free localization using relative distance estimations
A Varshavsky, D Pankratov, J Krumm, E De Lara
International Conference on Pervasive Computing, 146-161, 2008
622008
Information lower bounds via self-reducibility
M Braverman, A Garg, D Pankratov, O Weinstein
Theory of Computing Systems 59 (2), 377-396, 2016
312016
Direct sum questions in classical communication complexity
D Pankratov
Master's thesis, University of Chicago, 2012
162012
Stabbing Planes
P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ...
arXiv preprint arXiv:1710.03219, 2017
132017
Random CNFs are hard for cutting planes
N Fleming, D Pankratov, T Pitassi, R Robere
arXiv preprint arXiv:1703.02469, 2017
102017
Random θ (log n)-CNFs are hard for cutting planes
N Fleming, D Pankratov, T Pitassi, R Robere
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
72017
On the relative merits of simple local search methods for the MAX-SAT problem
D Pankratov, A Borodin
International Conference on Theory and Applications of Satisfiability …, 2010
72010
On conceptually simple algorithms for variants of online bipartite matching
A Borodin, D Pankratov, A Salehi-Abari
International Workshop on Approximation and Online Algorithms, 253-268, 2017
62017
Communication complexity and information complexity
D Pankratov
The University of Chicago, 2015
42015
Greedy Bipartite Matching in Random Type Poisson Arrival Model
A Borodin, C Karavasilis, D Pankratov
arXiv preprint arXiv:1805.00578, 2018
32018
Exploration of High-Dimensional Grids by Finite State Machines
S Dobrev, L Narayanan, J Opatrny, D Pankratov
arXiv preprint arXiv:1902.03693, 2019
22019
Exploration of High-Dimensional Grids by Finite Automata
S Dobrev, L Narayanan, J Opatrny, D Pankratov
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
22019
An experimental study of algorithms for online bipartite matching
A Borodin, C Karavasilis, D Pankratov
arXiv preprint arXiv:1808.04863, 2018
22018
Advice Complexity of Priority Algorithms
A Borodin, J Boyar, KS Larsen, D Pankratov
arXiv preprint arXiv:1806.06223, 2018
22018
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
A Borodin, D Pankratov, A Salehi-Abari
arXiv preprint arXiv:1708.01657, 2017
22017
On the Power of Feedback in Interactive Channels
D Pankratov
Technical Report: http://people. cs. uchicago. edu/pankratov/papers/feedback …, 2013
22013
The Bike Sharing Problem
J Czyzowicz, K Georgiou, R Killick, E Kranakis, D Krizanc, L Narayanan, ...
arXiv preprint arXiv:2006.13241, 2020
12020
Graph Exploration by Energy-Sharing Mobile Agents
J Czyzowicz, S Dobrev, R Killick, E Kranakis, D Krizanc, L Narayanan, ...
arXiv preprint arXiv:2102.13062, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20