Debmalya Panigrahi

Citat de

	Toate	Din 2019
Referințe bibliografice	2768	1885
h-index	33	25
i10-index	61	47

440

220

110

330

2008200920102011201220132014201520162017201820192020202120222023202412 21 35 59 63 74 88 109 118 128 159 152 254 288 394 432 349

Acces public

Afișați-le pe toate

48 de articole

1 articol

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Sreenivas GollapudiGoogleAdresă de e-mail confirmată pe google.com
Rajeev RastogiAmazonAdresă de e-mail confirmată pe amazon.com
Rong GeDuke UniversityAdresă de e-mail confirmată pe cs.duke.edu
Joseph Seffi NaorTechnionAdresă de e-mail confirmată pe cs.technion.ac.il
Ilan Reuven CohenBar Ilan UniversityAdresă de e-mail confirmată pe biu.ac.il
Partha DuttaLinkedInAdresă de e-mail confirmată pe linkedin.com
Sudeepa RoyDuke University, Computer ScienceAdresă de e-mail confirmată pe cs.duke.edu
Ravishankar KrishnaswamyMicrosoft ResearchAdresă de e-mail confirmată pe cs.cmu.edu
Zhiyi HuangThe University of Hong KongAdresă de e-mail confirmată pe cs.hku.hk
Sharad JaiswalFacebookAdresă de e-mail confirmată pe fb.com
James MickensHarvard UniversityAdresă de e-mail confirmată pe g.harvard.edu
Mohit SinghProfessor, Georgia Institute of TechnologyAdresă de e-mail confirmată pe gatech.edu
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkAdresă de e-mail confirmată pe cs.umd.edu
Sungjin ImUniversity of California, MercedAdresă de e-mail confirmată pe ucmerced.edu
Vahid LiaghatDepartment of Management Science & Engineering, Stanford UniversityAdresă de e-mail confirmată pe stanford.edu
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaAdresă de e-mail confirmată pe cs.ubc.ca
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaAdresă de e-mail confirmată pe cis.upenn.edu
Susan DavidsonUniversity of PennsylvaniaAdresă de e-mail confirmată pe cis.upenn.edu
Kostas KolliasGoogle ResearchAdresă de e-mail confirmată pe google.com
David KargerProfessor of Computer Science, MITAdresă de e-mail confirmată pe mit.edu

Urmăriți

Debmalya Panigrahi

Professor of Computer Science at Duke University

Adresă de e-mail confirmată pe cs.duke.edu - Pagina de pornire

Theoretical Computer Science - Algorithms


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
A general framework for graph sparsification WS Fung, R Hariharan, NJA Harvey, D Panigrahi Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	210	2011
Online algorithms for rent-or-buy with expert advice S Gollapudi, D Panigrahi International Conference on Machine Learning, 2319-2327, 2019	146	2019
An O (mn) Gomory-Hu tree construction algorithm for unweighted graphs R Hariharan, T Kavitha, D Panigrahi, A Bhalgat Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007	93	2007
Online and dynamic algorithms for set cover A Gupta, R Krishnaswamy, A Kumar, D Panigrahi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	90	2017
Online matching with stochastic rewards A Mehta, D Panigrahi 2012 IEEE 53rd annual symposium on foundations of computer science, 728-737, 2012	89	2012
Pacing equilibrium in first price auction markets V Conitzer, C Kroer, D Panigrahi, O Schrijvers, NE Stier-Moses, ... Management Science 68 (12), 8515-8535, 2022	88	2022
Online algorithms for covering and packing problems with convex objectives Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ... 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016	87*	2016
Provenance views for module privacy SB Davidson, S Khanna, T Milo, D Panigrahi, S Roy Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011	86*	2011
Online node-weighted steiner tree and related problems J Naor, D Panigrahi, M Singh 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 210-219, 2011	67	2011
Customizing ML predictions for online algorithms K Anand, R Ge, D Panigrahi International Conference on Machine Learning, 303-313, 2020	66	2020
A new channel assignment mechanism for rural wireless mesh networks P Dutta, S Jaiswal, D Panigrahi, R Rastogi IEEE INFOCOM 2008-The 27th Conference on Computer Communications, 2261-2269, 2008	65	2008
Online algorithms for weighted paging with predictions Z Jiang, D Panigrahi, K Sun ACM Transactions on Algorithms (TALG) 18 (4), 1-27, 2022	64	2022
Online mixed packing and covering Y Azar, U Bhaskar, L Fleischer, D Panigrahi Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013	62	2013
Online service with delay Y Azar, A Ganesh, R Ge, D Panigrahi ACM Transactions on Algorithms (TALG) 17 (3), 1-31, 2021	60*	2021
Deterministic min-cut in poly-logarithmic max-flows J Li, D Panigrahi 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 85-92, 2020	58	2020
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs A Bhalgat, R Hariharan, T Kavitha, D Panigrahi Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	54	2008
Tight bounds for online vector scheduling S Im, N Kell, J Kulkarni, D Panigrahi SIAM Journal on Computing 48 (1), 93-121, 2019	50*	2019
Survivable network design problems in wireless networks D Panigrahi Proceedings of the twenty-second annual ACM-SIAM symposium on discrete …, 2011	48	2011
Online graph algorithms with predictions Y Azar, D Panigrahi, N Touitou Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022	47	2022
Vertex connectivity in poly-logarithmic max-flows J Li, D Nanongkai, D Panigrahi, T Saranurak, S Yingchareonthawornchai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021	47	2021

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori