default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Pankratov
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov
:
Exploration of High-Dimensional Grids by Finite State Machines. Algorithmica 86(5): 1700-1729 (2024)- [j10]Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice complexity of adaptive priority algorithms. Theor. Comput. Sci. 984: 114318 (2024) - [c22]Mahtab Masoori, Lata Narayanan, Denis Pankratov:
Renting Servers in the Cloud: Parameterized Analysis of FirstFit. ICDCN 2024: 199-208 - [c21]Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov:
On the Online Weighted Non-Crossing Matching Problem. SWAT 2024: 16:1-16:19 - [i26]Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The En Route Truck-Drone Delivery Problem. CoRR abs/2402.00829 (2024) - [i25]Yaqiao Li, Mahtab Masoori, Lata Narayanan, Denis Pankratov:
Renting Servers for Multi-Parameter Jobs in the Cloud. CoRR abs/2404.15444 (2024) - 2023
- [j9]Ali Mohammad Lavasani, Denis Pankratov:
Advice complexity of online non-crossing matching. Comput. Geom. 110: 101943 (2023) - [c20]Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov:
Temporal Separators with Deadlines. ISAAC 2023: 38:1-38:19 - [c19]Yaqiao Li, Denis Pankratov:
Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections. LAGOS 2023: 70-77 - [e1]Denis Pankratov:
Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG 2023, Concordia University, Montreal, Quebec, Canada, July 31 - August 4, 2023. 2023 [contents] - [i24]Yaqiao Li, Denis Pankratov:
Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections. CoRR abs/2306.11241 (2023) - [i23]Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov:
Temporal Separators with Deadlines. CoRR abs/2309.14185 (2023) - 2022
- [j8]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. Algorithmica 84(5): 1232-1251 (2022) - [j7]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69(3): 19:1-19:32 (2022) - [j6]Mikhail Bakulin, Taoufik Ben Rejeb, Vitaly Kreyndelin, Denis Pankratov, Aleksei Smirnov:
Uplink NOMA-MIMO Systems with Rayleigh Power Distribution. Sensors 22(11): 4002 (2022) - [c18]Ali Mohammad Lavasani, Denis Pankratov, Mohammad Ali Abam:
Maximum Weight Convex Polytope. CCCG 2022: 257-263 - [i22]Mohammad Ali Abam, Ali Mohammad Lavasani, Denis Pankratov:
Maximum Weight Convex Polytope. CoRR abs/2207.12915 (2022) - 2021
- [c17]Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Group Evacuation on a Line by Agents with Different Communication Abilities. ISAAC 2021: 57:1-57:24 - [c16]Hovhannes A. Harutyunyan, Denis Pankratov, Jesse Racicot:
Online Domination: The Value of Getting to Know All Your Neighbors. MFCS 2021: 57:1-57:21 - [c15]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. SIROCCO 2021: 185-203 - [c14]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. WALCOM 2021: 65-77 - [i21]Jurek Czyzowicz, Stefan Dobrev, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Graph Exploration by Energy-Sharing Mobile Agents. CoRR abs/2102.13062 (2021) - [i20]Hovhannes Harutyunyan, Denis Pankratov, Jesse Racicot:
Online Domination: The Value of Getting to Know All your Neighbors. CoRR abs/2105.00299 (2021) - [i19]Mahtab Masoori, Lata Narayanan, Denis Pankratov:
Renting Servers in the Cloud: The Case of Equal Duration Jobs. CoRR abs/2108.12486 (2021) - [i18]Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende:
Group Evacuation on a Line by Agents with Different Communication Abilities. CoRR abs/2109.12676 (2021) - [i17]Ali Mohammad Lavasani, Denis Pankratov:
Advice Complexity of Online Non-Crossing Matching. CoRR abs/2112.08295 (2021) - 2020
- [j5]Allan Borodin, Christodoulos Karavasilis, Denis Pankratov:
An Experimental Study of Algorithms for Online Bipartite Matching. ACM J. Exp. Algorithmics 25: 1-37 (2020) - [j4]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. Theory Comput. Syst. 64(4): 593-625 (2020) - [c13]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. WAOA 2020: 47-62 - [i16]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. CoRR abs/2005.10852 (2020) - [i15]Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
The Bike Sharing Problem. CoRR abs/2006.13241 (2020)
2010 – 2019
- 2019
- [j3]Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. Theory Comput. Syst. 63(8): 1781-1818 (2019) - [c12]Denis Pankratov, Anastasia Stepanova:
Linear and Nonlinear Chebyshev Iterative Demodulation Algorithms for MIMO Systems with Large Number of Antennas. FRUCT 2019: 307-312 - [c11]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite Automata. ICALP 2019: 139:1-139:16 - [i14]Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov:
Exploration of High-Dimensional Grids by Finite State Machines. CoRR abs/1902.03693 (2019) - [i13]Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Adaptive Priority Algorithms. CoRR abs/1910.00868 (2019) - 2018
- [c10]Allan Borodin, Christodoulos Karavasilis, Denis Pankratov:
Greedy Bipartite Matching in Random Type Poisson Arrival Model. APPROX-RANDOM 2018: 5:1-5:15 - [c9]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. ITCS 2018: 10:1-10:20 - [c8]Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version. SOSA 2018: 8:1-8:12 - [c7]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. WAOA 2018: 69-86 - [i12]Allan Borodin, Christodoulos Karavasilis, Denis Pankratov:
Greedy Bipartite Matching in Random Type Poisson Arrival Model. CoRR abs/1805.00578 (2018) - [i11]Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov:
Advice Complexity of Priority Algorithms. CoRR abs/1806.06223 (2018) - [i10]Allan Borodin, Christodoulos Karavasilis, Denis Pankratov:
An Experimental Study of Algorithms for Online Bipartite Matching. CoRR abs/1808.04863 (2018) - 2017
- [c6]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random Θ(log n)-CNFs Are Hard for Cutting Planes. FOCS 2017: 109-120 - [c5]Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. WAOA 2017: 253-268 - [i9]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. CoRR abs/1703.02469 (2017) - [i8]Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. CoRR abs/1706.09966 (2017) - [i7]Allan Borodin, Denis Pankratov, Amirali Salehi-Abari:
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version. CoRR abs/1708.01657 (2017) - [i6]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. CoRR abs/1710.03219 (2017) - [i5]Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere:
Stabbing Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i4]Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random CNFs are Hard for Cutting Planes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j2]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information Lower Bounds via Self-Reducibility. Theory Comput. Syst. 59(2): 377-396 (2016) - 2013
- [c4]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information Lower Bounds via Self-reducibility. CSR 2013: 183-194 - [c3]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
From information to exact communication. STOC 2013: 151-160 - 2012
- [i3]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
From Information to Exact Communication. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein:
Information lower bounds via self-reducibility. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. Theory Comput. 4: 1-27 (2011) - 2010
- [c2]Denis Pankratov, Allan Borodin:
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem. SAT 2010: 223-236 - [i1]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. CoRR abs/1011.0354 (2010)
2000 – 2009
- 2008
- [c1]Alex Varshavsky, Denis Pankratov, John Krumm, Eyal de Lara:
Calibree: Calibration-Free Localization Using Relative Distance Estimations. Pervasive 2008: 146-161
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
