Artikler med mandater om offentlig tilgang - Deeparnab ChakrabartyLes mer
Tilgjengelige et eller annet sted: 18
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube
D Chakrabarty, C Seshadhri
SIAM Journal on Computing 45 (2), 461-472, 2016
Mandater: US Department of Energy
Dynamic algorithms for graph coloring
S Bhattacharya, D Chakrabarty, M Henzinger, D Nanongkai
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mandater: Swedish Research Council, European Commission
Deterministic dynamic matching in O (1) update time
S Bhattacharya, D Chakrabarty, M Henzinger
Algorithmica 82 (4), 1057-1080, 2020
Mandater: European Commission
Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling
D Chakrabarty, S Khanna
Mathematical Programming 188 (1), 395-407, 2021
Mandater: US National Science Foundation
Better Algorithms for Individually Fair -Clustering
M Negahbani, D Chakrabarty
Advances in Neural Information Processing Systems 34, 13340-13351, 2021
Mandater: US National Science Foundation
Approximation algorithms for minimum norm and ordered optimization problems
D Chakrabarty, C Swamy
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Mandater: US National Science Foundation, Natural Sciences and Engineering Research …
Subquadratic submodular function minimization
D Chakrabarty, YT Lee, A Sidford, SC Wong
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Mandater: US National Science Foundation
Facility location with client latencies: LP-based techniques for minimum-latency problems
D Chakrabarty, C Swamy
Mathematics of Operations Research 41 (3), 865-883, 2016
Mandater: Natural Sciences and Engineering Research Council of Canada
Property testing on product distributions: Optimal testers for bounded derivative properties
D Chakrabarty, K Dixit, M Jha, C Seshadhri
ACM Transactions on Algorithms (TALG) 13 (2), 1-30, 2017
Mandater: US National Science Foundation, US Department of Energy
Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions
H Black, D Chakrabarty, C Seshadhri
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Mandater: US National Science Foundation, US Department of Defense
A polynomial lower bound on the number of rounds for parallel submodular function minimization and matroid intersection
D Chakrabarty, Y Chen, S Khanna
SIAM Journal on Computing, 2023, 2023
Mandater: US National Science Foundation
Directed isoperimetric theorems for boolean functions on the hypergrid and an O (n√ d) monotonicity tester
H Black, D Chakrabarty, C Seshadhri
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 233-241, 2023
Mandater: US National Science Foundation, US Department of Defense
Robust k-center with two types of radii
D Chakrabarty, M Negahbani
Mathematical Programming 197 (2), 991-1007, 2023
Mandater: US National Science Foundation
Improved lower bounds for submodular function minimization
D Chakrabarty, A Graur, H Jiang, A Sidford
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
Mandater: US National Science Foundation
Parallel submodular function minimization
D Chakrabarty, A Graur, H Jiang, A Sidford
Advances in Neural Information Processing Systems 36, 68639-68654, 2023
Mandater: US National Science Foundation
Learning spanning forests optimally in weighted undirected graphs with cut queries
H Liao, D Chakrabarty
International Conference on Algorithmic Learning Theory, 785-807, 2024
Mandater: US National Science Foundation
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids
H Black, D Chakrabarty, C Seshadhri
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
Mandater: US National Science Foundation
A query algorithm for learning a spanning forest in weighted undirected graphs
D Chakrabarty, H Liao
International Conference on Algorithmic Learning Theory, 259-274, 2023
Mandater: US National Science Foundation
Informasjon om publisering og finansiering fastsettes automatisk av et datamaskinprogram