Research output per year
Research output per year
Personal profile
Research interests
- Generally, I am interested in Theoretical Computer Science (TCS) and Discrete Mathematics. In particular, I am interested in:
Graph Algorithms
Low-Distortion Embeddings
Distributed and Parallel Graph Algorithms
Streaming Graph Algorithms
Dynamic (Centralized and Distributed) Graph Algorithms
Approximation Algorithms and Hardness of Approximation
Discrete Mathematics, Combinatorial and Computational Geometry
Additive Number Theory
Fingerprint
Dive into the research topics where Michael Elkin is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Improved weighted additive spanners
Elkin, M., Gitlitz, Y. & Neiman, O., 1 Sep 2023, In: Distributed Computing. 36, 3, p. 385-394 10 p.Ben-Gurion University of the Negev
Research output: Contribution to journal › Article › peer-review
-
Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n)
Elkin, M. & Shabat, I., 1 Jan 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. p. 2278-2311 34 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Ben-Gurion University of the Negev
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
(1 + ϵ)-Approximate Shortest Paths in Dynamic Streams
Elkin, M. & Trehan, C., 15 Sep 2022, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022. Chakrabarti, A. & Swamy, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 51:1--51:23 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 245).Ben-Gurion University of the Negev
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Almost Shortest Paths with Near-Additive Error in Weighted Graphs
Elkin, M., Gitlitz, Y. & Neiman, O., 1 Jun 2022, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022. Czumaj, A. & Xin, Q. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 227).Ben-Gurion University of the Negev
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Brief Announcement: (1+)-Approximate Shortest Paths in Dynamic Streams.
Elkin, M. & Trehan, C., 20 Jul 2022, PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. p. 57-59 3 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).Ben-Gurion University of the Negev
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access