Denis Pankratov

Orcid: 0000-0001-6387-6235

According to our database1, Denis Pankratov authored at least 32 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Advice complexity of adaptive priority algorithms.
Theor. Comput. Sci., February, 2024

The En Route Truck-Drone Delivery Problem.
CoRR, 2024

Renting Servers in the Cloud: Parameterized Analysis of FirstFit.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Advice complexity of online non-crossing matching.
Comput. Geom., 2023

Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Temporal Separators with Deadlines.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Uplink NOMA-MIMO Systems with Rayleigh Power Distribution.
Sensors, 2022

Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes.
J. ACM, 2022

Online Coloring and a New Type of Adversary for Online Graph Problems.
Algorithmica, 2022

Maximum Weight Convex Polytope.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021
Renting Servers in the Cloud: The Case of Equal Duration Jobs.
CoRR, 2021

Online Domination: The Value of Getting to Know All your Neighbors.
CoRR, 2021

The Bike Sharing Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Graph Exploration by Energy-Sharing Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2021

Online Domination: The Value of Getting to Know All Your Neighbors.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Group Evacuation on a Line by Agents with Different Communication Abilities.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Advice Complexity of Priority Algorithms.
Theory Comput. Syst., 2020

An Experimental Study of Algorithms for Online Bipartite Matching.
ACM J. Exp. Algorithmics, 2020

2019
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching.
Theory Comput. Syst., 2019

Exploration of High-Dimensional Grids by Finite State Machines.
CoRR, 2019

Exploration of High-Dimensional Grids by Finite Automata.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Linear and Nonlinear Chebyshev Iterative Demodulation Algorithms for MIMO Systems with Large Number of Antennas.
Proceedings of the 24th Conference of Open Innovations Association, 2019

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

Greedy Bipartite Matching in Random Type Poisson Arrival Model.
Proceedings of the Approximation, 2018

2017
Random CNFs are Hard for Cutting Planes.
Electron. Colloquium Comput. Complex., 2017

Stabbing Planes.
Electron. Colloquium Comput. Complex., 2017

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

2012
Information lower bounds via self-reducibility.
Electron. Colloquium Comput. Complex., 2012

From Information to Exact Communication.
Electron. Colloquium Comput. Complex., 2012

2011
Variations on the Sensitivity Conjecture.
Theory Comput., 2011

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...