Denis Pankratov

According to our database1, Denis Pankratov
  • authored at least 19 papers between 2008 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Stabbing Planes.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Random CNFs are Hard for Cutting Planes.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Stabbing Planes.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Stabbing Planes.
CoRR, 2017

A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version.
CoRR, 2017

Random CNFs are Hard for Cutting Planes.
CoRR, 2017

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching.
CoRR, 2017

On Conceptually Simple Algorithms for Variants of Online Bipartite Matching.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Random Θ(log n)-CNFs Are Hard for Cutting Planes.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Information Lower Bounds via Self-Reducibility.
Theory Comput. Syst., 2016

2013
From information to exact communication.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Information Lower Bounds via Self-reducibility.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Information lower bounds via self-reducibility.
Electronic Colloquium on Computational Complexity (ECCC), 2012

From Information to Exact Communication.
Electronic Colloquium on Computational Complexity (ECCC), 2012

2011
Variations on the Sensitivity Conjecture.
Theory of Computing, Graduate Surveys, 2011

2010
Variations on the Sensitivity Conjecture
CoRR, 2010

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2008
Calibree: Calibration-Free Localization Using Relative Distance Estimations.
Proceedings of the Pervasive Computing, 2008


  Loading...