Research output per year
Research output per year
Personal profile
About Me
My research interests are:
-
Theory of Reliable Hardware Design, and Fault-Tolerant Systems.
-
Design and Analysis of Algorithms.
-
Online Algorithms (Packet Routing, Virtual Circuit Routing, Virtual Networks, Software-Defined Networks, Paging).
-
Approximation Algorithms (Network Orientation, Wireless Networks, Packet Routing).
-
Distributed and Centralized Local Algorithms (Network Algorithms, Load Balancing, Social Networks, Property Testing).
-
Education/Academic qualification
PhD, Tel Aviv University
Mar 2009 → May 2015
Award Date: 1 May 2015
Master's Degree, Tel Aviv University
Oct 2006 → Feb 2009
Award Date: 1 Feb 2009
Bachelor, Tel Aviv University
Oct 2002 → Jun 2006
Award Date: 30 Jun 2006
Fingerprint
Dive into the research topics where Moti Medina 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
-
Small Hazard-Free Transducers
Bund, J., Lenzen, C. & Medina, M., 2025, (Accepted/In press) In: IEEE Transactions on Computers.Research output: Contribution to journal › Article › peer-review
Open Access -
Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs
Levi, R., Medina, M. & Tubul, O., Sep 2024, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Kumar, A. & Ron-Zewi, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 60. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 317).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults
Lenzen, C., Medina, M., Saberi, M. & Schmid, S., 1 Feb 2024, In: IEEE/ACM Transactions on Networking. 32, 1, p. 283-297 15 p.Research output: Contribution to journal › Article › peer-review
Open Access1 Scopus citations -
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations
Biton, N., Levi, R. & Medina, M., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Graph Ranking and the Cost of Sybil Defense
Farach-Colton, G., Farach-Colton, M., Goldberg, L. A., Komlos, H., Lapinskas, J., Levi, R., Medina, M. & Mosteiro, M. A., 9 Jul 2023, EC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 586-625 40 p. (EC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access