default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeerti Choudhary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Davide Bilò
, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024)- [c25]Abhilash Jindal, Kaustubh Beedkar, Vishal Singh, J. Nausheen Mohammed, Tushar Singla, Aman Gupta, Keerti Choudhary:
Reactive Dataflow for Inflight Error Handling in ML Workflows. DEEM@SIGMOD 2024: 51-61 - [i17]Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan:
Fault-Tolerant Bounded Flow Preservers. CoRR abs/2404.16217 (2024) - [i16]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - 2023
- [j9]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. 346(9): 113483 (2023) - [c24]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. ICALP 2023: 24:1-24:20 - [c23]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c22]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [i15]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR abs/2304.14184 (2023) - [i14]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. CoRR abs/2305.03697 (2023) - [i13]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i12]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR abs/2307.11677 (2023) - 2022
- [j8]John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav:
Distributed Graph Realizations. IEEE Trans. Parallel Distributed Syst. 33(6): 1321-1337 (2022) - [c21]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP 2022: 22:1-22:19 - [c20]Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary:
Pairwise Reachability Oracles and Preservers Under Failures. ICALP 2022: 35:1-35:16 - [c19]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [i11]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR abs/2204.10679 (2022) - 2021
- [c18]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. MFCS 2021: 32:1-32:22 - [i10]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. CoRR abs/2107.03020 (2021) - [i9]Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary:
Pairwise Reachability Oracles and Preservers under Failures. CoRR abs/2110.11613 (2021) - [i8]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (2021) - 2020
- [j7]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. 34(4): 2318-2337 (2020) - [j6]Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms 16(4): 44:1-44:22 (2020) - [c17]Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz:
Minimum Neighboring Degree Realization in Graphs and Trees. ESA 2020: 10:1-10:15 - [c16]Greg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar:
New Fault Tolerant Subset Preservers. ICALP 2020: 15:1-15:19 - [c15]Diptarka Chakraborty, Keerti Choudhary:
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures. ICALP 2020: 25:1-25:20 - [c14]John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav:
Distributed Graph Realizations †. IPDPS 2020: 158-167 - [c13]Keerti Choudhary, Omer Gold:
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms. SODA 2020: 495-514 - [c12]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT 2020: 10:1-10:17 - [i7]John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, Suman Sourav:
Distributed Graph Realizations. CoRR abs/2002.05376 (2020) - [i6]Diptarka Chakraborty, Keerti Choudhary:
New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures. CoRR abs/2004.12890 (2020)
2010 – 2019
- 2019
- [j5]Surender Baswana, Keerti Choudhary, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica 81(3): 967-985 (2019) - [j4]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. SIAM J. Comput. 48(4): 1335-1363 (2019) - [c11]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. ISAAC 2019: 47:1-47:15 - [c10]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Profile Realizations and Applications to Social Networks. WALCOM 2019: 3-14 - [i5]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR abs/1912.13286 (2019) - [i4]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. CoRR abs/1912.13287 (2019) - 2018
- [j3]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. 47(1): 80-95 (2018) - [c9]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO 2018: 3-13 - [c8]Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single Source Fault Tolerant Shortest Path. SODA 2018: 1901-1915 - [c7]Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti:
Efficient Oracles and Routing Schemes for Replacement Paths. STACS 2018: 13:1-13:15 - [i3]Keerti Choudhary, Omer Gold:
Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant. CoRR abs/1812.01602 (2018) - 2017
- [c6]Surender Baswana, Keerti Choudhary, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP 2017: 72:1-72:15 - 2016
- [c5]Keerti Choudhary:
An Optimal Dual Fault Tolerant Reachability Oracle. ICALP 2016: 130:1-130:13 - [c4]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. SODA 2016: 730-739 - [c3]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault tolerant subgraph for single source reachability: generic and optimal. STOC 2016: 509-518 - [i2]Surender Baswana, Keerti Choudhary, Liam Roditty:
An efficient strongly connected components algorithm in the fault tolerant model. CoRR abs/1610.04010 (2016) - 2015
- [j2]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
Integer domination of Cartesian product graphs. Discret. Math. 338(7): 1239-1242 (2015) - [c2]Surender Baswana, Keerti Choudhary:
On Dynamic DFS Tree in Directed Graphs. MFCS (2) 2015: 102-114 - [c1]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault Tolerant Reachability for Directed Graphs. DISC 2015: 528-543 - [i1]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. CoRR abs/1502.02481 (2015) - 2013
- [j1]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
A Note on Total and Paired Domination of Cartesian Product Graphs. Electron. J. Comb. 20(3): 25 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:57 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:
