Denis Pankratov
Denis Pankratov
Geverifieerd e-mailadres voor concordia.ca - Homepage
Geciteerd door
Geciteerd door
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
Variations on the sensitivity conjecture
P Hatami, R Kulkarni, D Pankratov
arXiv preprint arXiv:1011.0354, 2010
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
Information lower bounds via self-reducibility
M Braverman, A Garg, D Pankratov, O Weinstein
Theory of Computing Systems 59, 377-396, 2016
Stabbing Planes
P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ...
arXiv preprint arXiv:1710.03219, 2017
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
Direct sum questions in classical communication complexity
D Pankratov
Master's thesis, University of Chicago, 2012
An Experimental Study of Algorithms for Online Bipartite Matching
A Borodin, C Karavasilis, D Pankratov
Journal of Experimental Algorithmics (JEA) 25, 1-37, 2020
Random CNFs are hard for cutting planes
N Fleming, D Pankratov, T Pitassi, R Robere
arXiv preprint arXiv:1703.02469, 2017
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
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
Exploration of high-dimensional grids by finite state machines
S Dobrev, L Narayanan, J Opatrny, D Pankratov
Algorithmica, 1-30, 2024
On the Power of Feedback in Interactive Channels
D Pankratov
Technical Report: http://people. cs. uchicago. edu/pankratov/papers/feedback …, 2013
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
Graph Exploration by Energy-Sharing Mobile Agents
J Czyzowicz, S Dobrev, R Killick, E Kranakis, D Krizanc, L Narayanan, ...
International Colloquium on Structural Information and Communication …, 2021
Advice Complexity of Priority Algorithms
A Borodin, J Boyar, KS Larsen, D Pankratov
arXiv preprint arXiv:1806.06223, 2018
Communication complexity and information complexity
D Pankratov
The University of Chicago, 2015
Online Domination: The Value of Getting to Know All your Neighbors
H Harutyunyan, D Pankratov, J Racicot
arXiv preprint arXiv:2105.00299, 2021
Greedy Bipartite Matching in Random Type Poisson Arrival Model
A Borodin, C Karavasilis, D Pankratov
arXiv preprint arXiv:1805.00578, 2018
Group Evacuation on a Line by Agents with Different Communication Abilities
J Czyzowicz, R Killick, E Kranakis, D Krizanc, L Narayanan, J Opatrny, ...
arXiv preprint arXiv:2109.12676, 2021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20