Choudhary, Keerti

1. New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures
   2020/04/27 by Chakraborty, Diptarka, Choudhary, Keerti · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. An efficient strongly connected components algorithm in the fault\n tolerant model
   2016/10/13 by Surender Baswana, Baswana, Surender, Keerti Choudhary +3 · 2 citations
   Computer Science · #Distributed systems and fault tolerance #Interconnection Networks and Systems #Complexity and Algorithms in Graphs
3. Distributed Graph Realizations
   2020/02/13 by Augustine, John, Choudhary, Keerti, Cohen, Avi +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
4. Efficiently Realizing Interval Sequences
   2019/12/31 by Bar-Noy, Amotz, Choudhary, Keerti, Peleg, David +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
5. Pairwise Reachability Oracles and Preservers under Failures
   2021/10/22 by Chakraborty, Diptarka, Chatterjee, Kushagra, Choudhary, Keerti · 1 citation
   #05C85 #68P05 #Data Structures and Algorithms (cs.DS) #E.1 #FOS: Computer and information sciences
6. Improved Distance (Sensitivity) Oracles with Subquadratic Space
   2024/08/19 by Bilò, Davide, Chechik, Shiri, Choudhary, Keerti +3 · 2 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
7. Compact Distance Oracles with Large Sensitivity and Low Stretch
   2023/04/27 by Davide Bilò, Keerti Choudhary, Bilò, Davide +9 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
8. Fault-Tolerant ST-Diameter Oracles
   2023/05/05 by Bilò, Davide, Choudhary, Keerti, Cohen, Sarel +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
9. Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs
   2023/07/21 by Davide Bilò, Shiri Chechik, Bilò, Davide +9 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
10. Fault-Tolerant Bounded Flow Preservers
    2024/04/24 by Bansal, Shivam, Choudhary, Keerti, Dhanoa, Harkirat +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences