Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Dipan Dey
Observed name:
Dey, Dipan
Institutions:
Tata Institute of Fundamental Research,
University of Houston
Observed institutions:
Tata Institute of Fundamental Research,
Indian Institute of Technology Gandhinagar,
University of Houston
ORCID:
0009-0001-0675-8790
Observed ORCID:
0009-0001-0675-8790
OpenAlex ID:
A5070239198
Nearly Optimal Fault Tolerant Distance Oracle
2024
·
Dipan Dey
, Manoj Gupta
·
ACM Symposium on Theory of Computing (STOC)
·
18
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem
2022
·
Dey, Dipan
, Gupta, Manoj
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Low-Cost Arborescence Under Edge Faults
2026
·
Dey, Dipan
, Kavitha, Telikepalli
·
arXiv (Cornell University)
·
3
PDF
Optimal Distributed Replacement Paths
2025
·
Yi-Jun Chang
, Yanyu Chen
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
3
PDF
Near Optimal Dual Fault Tolerant Distance Oracle
2024
·
Dey, Dipan
, Gupta, Manoj
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
On Oriented Diameter of Power Graphs
2026
·
Deepu Benson
, Bireswar Das
, et al.
·
Bulletin of the Malaysian Mathematical Sciences Society
·
1
PDF
Fault-Tolerant Approximate Distance Oracles with a Source Set
2025
·
Dey, Dipan
, Kavitha, Telikepalli
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Smoothed Analysis for Distributed MIS
2026
·
Dey, Dipan
, Dufoulon, Fabien
, et al.
·
arXiv (Cornell University)
PDF
The Complexity of Distributed Minimum Weight Cycle Approximation
2026
·
Chang, Yi-Jun
, Chen, Yanyu
, et al.
·
arXiv (Cornell University)
PDF
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
2023
·
Dipan Dey
, Manoj Gupta
·
Research Square
PDF
Show more works
View as search
Works count:
11
Citation count:
34
H-index:
3
I10-index:
1
Year
Topic
Type