Seguir
Debmalya Panigrahi
Debmalya Panigrahi
Professor of Computer Science at Duke University
Dirección de correo verificada de cs.duke.edu - Página principal
Título
Citado por
Citado por
Año
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
2132011
Online algorithms for rent-or-buy with expert advice
S Gollapudi, D Panigrahi
International Conference on Machine Learning, 2319-2327, 2019
1492019
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
942007
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
912022
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
912017
Online matching with stochastic rewards
A Mehta, D Panigrahi
2012 IEEE 53rd annual symposium on foundations of computer science, 728-737, 2012
912012
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
89*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
Customizing ML predictions for online algorithms
K Anand, R Ge, D Panigrahi
International Conference on Machine Learning, 303-313, 2020
682020
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
682011
Online algorithms for weighted paging with predictions
Z Jiang, D Panigrahi, K Sun
ACM Transactions on Algorithms (TALG) 18 (4), 1-27, 2022
652022
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
652008
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
632013
Online service with delay
Y Azar, A Ganesh, R Ge, D Panigrahi
ACM Transactions on Algorithms (TALG) 17 (3), 1-31, 2021
61*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
602020
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
562008
Online graph algorithms with predictions
Y Azar, D Panigrahi, N Touitou
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
522022
Tight bounds for online vector scheduling
S Im, N Kell, J Kulkarni, D Panigrahi
SIAM Journal on Computing 48 (1), 93-121, 2019
51*2019
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
502021
Dynamic set cover: improved algorithms and lower bounds
A Abboud, R Addanki, F Grandoni, D Panigrahi, B Saha
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
482019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20