default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Denis Pankratov
@article{DBLP:journals/algorithmica/DobrevNOP24,
author = {Stefan Dobrev and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
title = {Exploration of High-Dimensional Grids by Finite State Machines},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1700--1729},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01207-6},
doi = {10.1007/S00453-024-01207-6},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DobrevNOP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarLP24,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice complexity of adaptive priority algorithms},
journal = {Theor. Comput. Sci.},
volume = {984},
pages = {114318},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114318},
doi = {10.1016/J.TCS.2023.114318},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/MasooriNP24,
author = {Mahtab Masoori and
Lata Narayanan and
Denis Pankratov},
title = {Renting Servers in the Cloud: Parameterized Analysis of FirstFit},
booktitle = {Proceedings of the 25th International Conference on Distributed Computing
and Networking, {ICDCN} 2024, Chennai, India, January 4-7, 2024},
pages = {199--208},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3631461.3631557},
doi = {10.1145/3631461.3631557},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcn/MasooriNP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarKLLLP24,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Ali Mohammad Lavasani and
Yaqiao Li and
Denis Pankratov},
editor = {Hans L. Bodlaender},
title = {On the Online Weighted Non-Crossing Matching Problem},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2024, June 12-14, 2024, Helsinki, Finland},
series = {LIPIcs},
volume = {294},
pages = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2024.16},
doi = {10.4230/LIPICS.SWAT.2024.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarKLLLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-00829,
author = {Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
title = {The En Route Truck-Drone Delivery Problem},
journal = {CoRR},
volume = {abs/2402.00829},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.00829},
doi = {10.48550/ARXIV.2402.00829},
eprinttype = {arXiv},
eprint = {2402.00829},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-00829.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-15444,
author = {Yaqiao Li and
Mahtab Masoori and
Lata Narayanan and
Denis Pankratov},
title = {Renting Servers for Multi-Parameter Jobs in the Cloud},
journal = {CoRR},
volume = {abs/2404.15444},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.15444},
doi = {10.48550/ARXIV.2404.15444},
eprinttype = {arXiv},
eprint = {2404.15444},
timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-15444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/LavasaniP23,
author = {Ali Mohammad Lavasani and
Denis Pankratov},
title = {Advice complexity of online non-crossing matching},
journal = {Comput. Geom.},
volume = {110},
pages = {101943},
year = {2023},
url = {https://doi.org/10.1016/j.comgeo.2022.101943},
doi = {10.1016/J.COMGEO.2022.101943},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/LavasaniP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HarutyunyanKP23,
author = {Hovhannes A. Harutyunyan and
Kamran Koupayi and
Denis Pankratov},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Temporal Separators with Deadlines},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {38:1--38:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.38},
doi = {10.4230/LIPICS.ISAAC.2023.38},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HarutyunyanKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/LiP23,
author = {Yaqiao Li and
Denis Pankratov},
editor = {Cristina G. Fernandes and
Sergio Rajsbaum},
title = {Online vector bin packing and hypergraph coloring illuminated: simpler
proofs and new connections},
booktitle = {Proceedings of the {XII} Latin-American Algorithms, Graphs and Optimization
Symposium, {LAGOS} 2023, Huatulco, Mexico, September 18-22, 2023},
series = {Procedia Computer Science},
volume = {223},
pages = {70--77},
publisher = {Elsevier},
year = {2023},
url = {https://doi.org/10.1016/j.procs.2023.08.215},
doi = {10.1016/J.PROCS.2023.08.215},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lagos/LiP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2023,
editor = {Denis Pankratov},
title = {Proceedings of the 35th Canadian Conference on Computational Geometry,
{CCCG} 2023, Concordia University, Montreal, Quebec, Canada, July
31 - August 4, 2023},
year = {2023},
url = {https://cccg.ca/proceedings/2023/CCCG2023.pdf},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-11241,
author = {Yaqiao Li and
Denis Pankratov},
title = {Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler
Proofs and New Connections},
journal = {CoRR},
volume = {abs/2306.11241},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11241},
doi = {10.48550/ARXIV.2306.11241},
eprinttype = {arXiv},
eprint = {2306.11241},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-14185,
author = {Hovhannes A. Harutyunyan and
Kamran Koupayi and
Denis Pankratov},
title = {Temporal Separators with Deadlines},
journal = {CoRR},
volume = {abs/2309.14185},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.14185},
doi = {10.48550/ARXIV.2309.14185},
eprinttype = {arXiv},
eprint = {2309.14185},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-14185.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiNP22,
author = {Yaqiao Li and
Vishnu V. Narayan and
Denis Pankratov},
title = {Online Coloring and a New Type of Adversary for Online Graph Problems},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1232--1251},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00920-w},
doi = {10.1007/S00453-021-00920-W},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiNP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlemingPPR22,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random {\textbackslash}( {\textbackslash}Theta ({\textbackslash}log
n) {\textbackslash}) -CNFs are Hard for Cutting Planes},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {19:1--19:32},
year = {2022},
url = {https://doi.org/10.1145/3486680},
doi = {10.1145/3486680},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FlemingPPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/BakulinRKPS22,
author = {Mikhail Bakulin and
Taoufik Ben Rejeb and
Vitaly Kreyndelin and
Denis Pankratov and
Aleksei Smirnov},
title = {Uplink {NOMA-MIMO} Systems with Rayleigh Power Distribution},
journal = {Sensors},
volume = {22},
number = {11},
pages = {4002},
year = {2022},
url = {https://doi.org/10.3390/s22114002},
doi = {10.3390/S22114002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sensors/BakulinRKPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/LavasaniPA22,
author = {Ali Mohammad Lavasani and
Denis Pankratov and
Mohammad Ali Abam},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Maximum Weight Convex Polytope},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {257--263},
year = {2022},
timestamp = {Wed, 23 Nov 2022 15:41:57 +0100},
biburl = {https://dblp.org/rec/conf/cccg/LavasaniPA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-12915,
author = {Mohammad Ali Abam and
Ali Mohammad Lavasani and
Denis Pankratov},
title = {Maximum Weight Convex Polytope},
journal = {CoRR},
volume = {abs/2207.12915},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.12915},
doi = {10.48550/ARXIV.2207.12915},
eprinttype = {arXiv},
eprint = {2207.12915},
timestamp = {Mon, 01 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-12915.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CzyzowiczKKKNOP21,
author = {Jurek Czyzowicz and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov and
Sunil M. Shende},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Group Evacuation on a Line by Agents with Different Communication
Abilities},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {57:1--57:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.57},
doi = {10.4230/LIPICS.ISAAC.2021.57},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CzyzowiczKKKNOP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HarutyunyanPR21,
author = {Hovhannes A. Harutyunyan and
Denis Pankratov and
Jesse Racicot},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Online Domination: The Value of Getting to Know All Your Neighbors},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {57:1--57:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.57},
doi = {10.4230/LIPICS.MFCS.2021.57},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HarutyunyanPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/CzyzowiczDKKKNO21,
author = {Jurek Czyzowicz and
Stefan Dobrev and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov and
Sunil M. Shende},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {Graph Exploration by Energy-Sharing Mobile Agents},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {185--203},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_11},
doi = {10.1007/978-3-030-79527-6\_11},
timestamp = {Tue, 22 Jun 2021 16:58:40 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/CzyzowiczDKKKNO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CzyzowiczGKKKNO21,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
editor = {Ryuhei Uehara and
Seok{-}Hee Hong and
Subhas C. Nandy},
title = {The Bike Sharing Problem},
booktitle = {{WALCOM:} Algorithms and Computation - 15th International Conference
and Workshops, {WALCOM} 2021, Yangon, Myanmar, February 28 - March
2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12635},
pages = {65--77},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68211-8\_6},
doi = {10.1007/978-3-030-68211-8\_6},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/walcom/CzyzowiczGKKKNO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-13062,
author = {Jurek Czyzowicz and
Stefan Dobrev and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov and
Sunil M. Shende},
title = {Graph Exploration by Energy-Sharing Mobile Agents},
journal = {CoRR},
volume = {abs/2102.13062},
year = {2021},
url = {https://arxiv.org/abs/2102.13062},
eprinttype = {arXiv},
eprint = {2102.13062},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-13062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00299,
author = {Hovhannes Harutyunyan and
Denis Pankratov and
Jesse Racicot},
title = {Online Domination: The Value of Getting to Know All your Neighbors},
journal = {CoRR},
volume = {abs/2105.00299},
year = {2021},
url = {https://arxiv.org/abs/2105.00299},
eprinttype = {arXiv},
eprint = {2105.00299},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-00299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-12486,
author = {Mahtab Masoori and
Lata Narayanan and
Denis Pankratov},
title = {Renting Servers in the Cloud: The Case of Equal Duration Jobs},
journal = {CoRR},
volume = {abs/2108.12486},
year = {2021},
url = {https://arxiv.org/abs/2108.12486},
eprinttype = {arXiv},
eprint = {2108.12486},
timestamp = {Thu, 02 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-12486.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-12676,
author = {Jurek Czyzowicz and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov and
Sunil M. Shende},
title = {Group Evacuation on a Line by Agents with Different Communication
Abilities},
journal = {CoRR},
volume = {abs/2109.12676},
year = {2021},
url = {https://arxiv.org/abs/2109.12676},
eprinttype = {arXiv},
eprint = {2109.12676},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-12676.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-08295,
author = {Ali Mohammad Lavasani and
Denis Pankratov},
title = {Advice Complexity of Online Non-Crossing Matching},
journal = {CoRR},
volume = {abs/2112.08295},
year = {2021},
url = {https://arxiv.org/abs/2112.08295},
eprinttype = {arXiv},
eprint = {2112.08295},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-08295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BorodinKP20,
author = {Allan Borodin and
Christodoulos Karavasilis and
Denis Pankratov},
title = {An Experimental Study of Algorithms for Online Bipartite Matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--37},
year = {2020},
url = {https://doi.org/10.1145/3379552},
doi = {10.1145/3379552},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BorodinKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BorodinBLP20,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {593--625},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09955-7},
doi = {10.1007/S00224-019-09955-7},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BorodinBLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/LiNP20,
author = {Yaqiao Li and
Vishnu V. Narayan and
Denis Pankratov},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Online Coloring and a New Type of Adversary for Online Graph Problems},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {47--62},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_4},
doi = {10.1007/978-3-030-80879-2\_4},
timestamp = {Tue, 20 Jul 2021 15:29:23 +0200},
biburl = {https://dblp.org/rec/conf/waoa/LiNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-10852,
author = {Yaqiao Li and
Vishnu V. Narayan and
Denis Pankratov},
title = {Online Coloring and a New Type of Adversary for Online Graph Problems},
journal = {CoRR},
volume = {abs/2005.10852},
year = {2020},
url = {https://arxiv.org/abs/2005.10852},
eprinttype = {arXiv},
eprint = {2005.10852},
timestamp = {Thu, 28 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-10852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-13241,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Ryan Killick and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
title = {The Bike Sharing Problem},
journal = {CoRR},
volume = {abs/2006.13241},
year = {2020},
url = {https://arxiv.org/abs/2006.13241},
eprinttype = {arXiv},
eprint = {2006.13241},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-13241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BorodinPS19,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
title = {On Conceptually Simple Algorithms for Variants of Online Bipartite
Matching},
journal = {Theory Comput. Syst.},
volume = {63},
number = {8},
pages = {1781--1818},
year = {2019},
url = {https://doi.org/10.1007/s00224-019-09916-0},
doi = {10.1007/S00224-019-09916-0},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BorodinPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fruct/PankratovS19,
author = {Denis Pankratov and
Anastasia Stepanova},
title = {Linear and Nonlinear Chebyshev Iterative Demodulation Algorithms for
{MIMO} Systems with Large Number of Antennas},
booktitle = {24th Conference of Open Innovations Association, {FRUCT} 2019, Moscow,
Russia, April 8-12, 2019},
pages = {307--312},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.23919/FRUCT.2019.8711940},
doi = {10.23919/FRUCT.2019.8711940},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fruct/PankratovS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DobrevNOP19,
author = {Stefan Dobrev and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Exploration of High-Dimensional Grids by Finite Automata},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {139:1--139:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.139},
doi = {10.4230/LIPICS.ICALP.2019.139},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DobrevNOP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-03693,
author = {Stefan Dobrev and
Lata Narayanan and
Jaroslav Opatrny and
Denis Pankratov},
title = {Exploration of High-Dimensional Grids by Finite State Machines},
journal = {CoRR},
volume = {abs/1902.03693},
year = {2019},
url = {http://arxiv.org/abs/1902.03693},
eprinttype = {arXiv},
eprint = {1902.03693},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-03693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00868,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Adaptive Priority Algorithms},
journal = {CoRR},
volume = {abs/1910.00868},
year = {2019},
url = {http://arxiv.org/abs/1910.00868},
eprinttype = {arXiv},
eprint = {1910.00868},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BorodinKP18,
author = {Allan Borodin and
Christodoulos Karavasilis and
Denis Pankratov},
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Greedy Bipartite Matching in Random Type Poisson Arrival Model},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.5},
doi = {10.4230/LIPICS.APPROX-RANDOM.2018.5},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BorodinKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeameFIKPPR18,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Anna R. Karlin},
title = {Stabbing Planes},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {10:1--10:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.10},
doi = {10.4230/LIPICS.ITCS.2018.10},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeameFIKPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorodinPS18,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
editor = {Raimund Seidel},
title = {A Simple {PTAS} for the Dual Bin Packing Problem and Advice Complexity
of Its Online Version},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {8:1--8:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.8},
doi = {10.4230/OASICS.SOSA.2018.8},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BorodinPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBLP18,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Advice Complexity of Priority Algorithms},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {69--86},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_5},
doi = {10.1007/978-3-030-04693-4\_5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-00578,
author = {Allan Borodin and
Christodoulos Karavasilis and
Denis Pankratov},
title = {Greedy Bipartite Matching in Random Type Poisson Arrival Model},
journal = {CoRR},
volume = {abs/1805.00578},
year = {2018},
url = {http://arxiv.org/abs/1805.00578},
eprinttype = {arXiv},
eprint = {1805.00578},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-00578.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-06223,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {CoRR},
volume = {abs/1806.06223},
year = {2018},
url = {http://arxiv.org/abs/1806.06223},
eprinttype = {arXiv},
eprint = {1806.06223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-06223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-04863,
author = {Allan Borodin and
Christodoulos Karavasilis and
Denis Pankratov},
title = {An Experimental Study of Algorithms for Online Bipartite Matching},
journal = {CoRR},
volume = {abs/1808.04863},
year = {2018},
url = {http://arxiv.org/abs/1808.04863},
eprinttype = {arXiv},
eprint = {1808.04863},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-04863.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Chris Umans},
title = {Random {\(\Theta\)}(log n)-CNFs Are Hard for Cutting Planes},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {109--120},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.19},
doi = {10.1109/FOCS.2017.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinPS17,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {On Conceptually Simple Algorithms for Variants of Online Bipartite
Matching},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {253--268},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_19},
doi = {10.1007/978-3-319-89441-6\_19},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random CNFs are Hard for Cutting Planes},
journal = {CoRR},
volume = {abs/1703.02469},
year = {2017},
url = {http://arxiv.org/abs/1703.02469},
eprinttype = {arXiv},
eprint = {1703.02469},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorodinPS17,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
title = {On Conceptually Simple Algorithms for Variants of Online Bipartite
Matching},
journal = {CoRR},
volume = {abs/1706.09966},
year = {2017},
url = {http://arxiv.org/abs/1706.09966},
eprinttype = {arXiv},
eprint = {1706.09966},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorodinPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01657,
author = {Allan Borodin and
Denis Pankratov and
Amirali Salehi{-}Abari},
title = {A Simple {PTAS} for the Dual Bin Packing Problem and Advice Complexity
of Its Online Version},
journal = {CoRR},
volume = {abs/1708.01657},
year = {2017},
url = {http://arxiv.org/abs/1708.01657},
eprinttype = {arXiv},
eprint = {1708.01657},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-01657.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03219,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {CoRR},
volume = {abs/1710.03219},
year = {2017},
url = {http://arxiv.org/abs/1710.03219},
eprinttype = {arXiv},
eprint = {1710.03219},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03219.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeameFIKPPR17,
author = {Paul Beame and
Noah Fleming and
Russell Impagliazzo and
Antonina Kolokolova and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Stabbing Planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-151}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/151},
eprinttype = {ECCC},
eprint = {TR17-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeameFIKPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random CNFs are Hard for Cutting Planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-045}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/045},
eprinttype = {ECCC},
eprint = {TR17-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BravermanGPW16,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {Information Lower Bounds via Self-Reducibility},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {377--396},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9655-z},
doi = {10.1007/S00224-015-9655-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BravermanGPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BravermanGPW13,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {Information Lower Bounds via Self-reducibility},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {183--194},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_16},
doi = {10.1007/978-3-642-38536-0\_16},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BravermanGPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanGPW13,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {From information to exact communication},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {151--160},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488628},
doi = {10.1145/2488608.2488628},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanGPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {From Information to Exact Communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-171}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/171},
eprinttype = {ECCC},
eprint = {TR12-171},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanGPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12a,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {Information lower bounds via self-reducibility},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-177}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/177},
eprinttype = {ECCC},
eprint = {TR12-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanGPW12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HatamiKP11,
author = {Pooya Hatami and
Raghav Kulkarni and
Denis Pankratov},
title = {Variations on the Sensitivity Conjecture},
journal = {Theory Comput.},
volume = {4},
pages = {1--27},
year = {2011},
url = {https://doi.org/10.4086/toc.gs.2011.004},
doi = {10.4086/TOC.GS.2011.004},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HatamiKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/PankratovB10,
author = {Denis Pankratov and
Allan Borodin},
editor = {Ofer Strichman and
Stefan Szeider},
title = {On the Relative Merits of Simple Local Search Methods for the {MAX-SAT}
Problem},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6175},
pages = {223--236},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14186-7\_19},
doi = {10.1007/978-3-642-14186-7\_19},
timestamp = {Sat, 19 Oct 2019 20:28:15 +0200},
biburl = {https://dblp.org/rec/conf/sat/PankratovB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-0354,
author = {Pooya Hatami and
Raghav Kulkarni and
Denis Pankratov},
title = {Variations on the Sensitivity Conjecture},
journal = {CoRR},
volume = {abs/1011.0354},
year = {2010},
url = {http://arxiv.org/abs/1011.0354},
eprinttype = {arXiv},
eprint = {1011.0354},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-0354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pervasive/VarshavskyPKL08,
author = {Alex Varshavsky and
Denis Pankratov and
John Krumm and
Eyal de Lara},
editor = {Jadwiga Indulska and
Donald J. Patterson and
Tom Rodden and
Max Ott},
title = {Calibree: Calibration-Free Localization Using Relative Distance Estimations},
booktitle = {Pervasive Computing, 6th International Conference, Pervasive 2008,
Sydney, Australia, May 19-22, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5013},
pages = {146--161},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79576-6\_9},
doi = {10.1007/978-3-540-79576-6\_9},
timestamp = {Thu, 14 Oct 2021 10:19:36 +0200},
biburl = {https://dblp.org/rec/conf/pervasive/VarshavskyPKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
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:
