Denis Pankratov 个人学术档案

引用次数

	总计	2019 年至今
引用	478	251
h 指数	9	8
i10 指数	9	6

20092010201120122013201420152016201720182019202020212022202320243 10 11 6 18 40 40 33 33 26 48 42 37 44 35 45

开放获取的出版物数量

查看全部

10 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Allan BorodinProfessor of Computer Science, University of Toronto在 cs.toronto.edu 的电子邮件经过验证
Lata NarayananProfessor of Computer Science, Concordia University在 cs.concordia.ca 的电子邮件经过验证
Noah FlemingMemorial University在 mun.ca 的电子邮件经过验证
Robert RobereMcGill University在 cs.mcgill.ca 的电子邮件经过验证
Jaroslav OpatrnyDept. of Computer Science, Concordia University在 cs.concordia.ca 的电子邮件经过验证
Ankit GargMicrosoft Research在 microsoft.com 的电子邮件经过验证
Alexander VarshavskyGoogle在 research.att.com 的电子邮件经过验证
Raghav KulkarniCentre for Quantum Technologies, Singapore在 cs.uchicago.edu 的电子邮件经过验证
Pooya HatamiThe Ohio State University在 osu.edu 的电子邮件经过验证
Eyal de LaraProfessor of Computer Science, University of Toronto在 cs.toronto.edu 的电子邮件经过验证
John KrummUniversity of Southern California在 usc.edu 的电子邮件经过验证
Evangelos KranakisChancellor's Professor, School of Computer Science, Carleton University在 scs.carleton.ca 的电子邮件经过验证
Jurek CzyzowiczUniversité du Québec en Outaouais在 uqo.ca 的电子邮件经过验证
Christodoulos KaravasilisUniversity of Toronto在 cs.toronto.edu 的电子邮件经过验证
Joan BoyarProfessor Emerita of Computer Science, University of Southern Denmark在 imada.sdu.dk 的电子邮件经过验证
Amirali Salehi-AbariAssociate Professor, UOIT在 uoit.ca 的电子邮件经过验证
Paul BeameProfessor of Computer Science and Engineering, University of Washington在 cs.washington.edu 的电子邮件经过验证
Antonina KolokolovaComputer Science, Memorial University of Newfoundland在 cs.toronto.edu 的电子邮件经过验证
Russell ImpagliazzoUCSD在 ucsd.edu 的电子邮件经过验证
Sunil ShendeProfessor of Computer Science, Rutgers University, Camden在 camden.rutgers.edu 的电子邮件经过验证

关注

Denis Pankratov

Concordia University

在 concordia.ca 的电子邮件经过验证 - 首页

theoretical computer science


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	101	2013
Variations on the sensitivity conjecture P Hatami, R Kulkarni, D Pankratov arXiv preprint arXiv:1011.0354, 2010	92	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	66	2008
Information lower bounds via self-reducibility M Braverman, A Garg, D Pankratov, O Weinstein Theory of Computing Systems 59, 377-396, 2016	34	2016
Stabbing Planes P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ... arXiv preprint arXiv:1710.03219, 2017	31	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	25	2017
Direct sum questions in classical communication complexity D Pankratov Master's thesis, University of Chicago, 2012	20	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	15	2020
Random CNFs are hard for cutting planes N Fleming, D Pankratov, T Pitassi, R Robere arXiv preprint arXiv:1703.02469, 2017	10	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	9	2017
On the Power of Feedback in Interactive Channels D Pankratov Technical Report: http://people. cs. uchicago. edu/pankratov/papers/feedback …, 2013	9	2013
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	9	2010
Exploration of high-dimensional grids by finite state machines S Dobrev, L Narayanan, J Opatrny, D Pankratov Algorithmica, 1-30, 2024	7*	2024
Advice Complexity of Priority Algorithms A Borodin, J Boyar, KS Larsen, D Pankratov arXiv preprint arXiv:1806.06223, 2018	7	2018
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	7	2017
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	6	2021
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	6	2021
Communication complexity and information complexity D Pankratov The University of Chicago, 2015	5	2015
Online Domination: The Value of Getting to Know All your Neighbors H Harutyunyan, D Pankratov, J Racicot arXiv preprint arXiv:2105.00299, 2021	4	2021
Greedy Bipartite Matching in Random Type Poisson Arrival Model A Borodin, C Karavasilis, D Pankratov arXiv preprint arXiv:1805.00578, 2018	4	2018

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用