An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. - Guy Even; Moti Medina (ICALP (2), 2010)

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. - Guy Even; Yaniv Fais; Moti Medina; Shimon Shahar; Alexander Zadorojniy (ALGOSENSORS, 2011)

Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. - Guy Even; Yakov Matsri; Moti Medina (ALGOSENSORS, 2011)

Parallel randomized load balancing: A lower bound for a more general model. - Guy Even; Moti Medina (Theor. Comput. Sci., 2011)

Digital Logic Design - A Rigorous Approach. - Guy Even; Moti Medina (Cambridge University Press, 2012)

Online Multi-Commodity Flow with High Demands. - Guy Even; Moti Medina (WAOA, 2012)

Revisiting randomized parallel load balancing algorithms. - Guy Even; Moti Medina (Theor. Comput. Sci., 2012)

Competitive and deterministic embeddings of virtual networks. - Guy Even; Moti Medina; Gregor Schaffrath; Stefan Schmid 001 (Theor. Comput. Sci., 2013)

Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. - Guy Even; Moti Medina; Dana Ron (ESA, 2014)

Best of Two Local Models: Local Centralized and Local Distributed Algorithms. - Guy Even; Moti Medina; Dana Ron (CoRR, 2014)

Distributed Maximum Matching in Bounded Degree Graphs. - Guy Even; Moti Medina; Dana Ron (ICDCN, 2015)

Better Deterministic Online Packet Routing on Grids. - Guy Even; Moti Medina; Boaz Patt-Shamir (SPAA, 2015)

Better Online Deterministic Packet Routing on Grids. - Guy Even; Moti Medina; Boaz Patt-Shamir (CoRR, 2015)

Non-Local Probes Do Not Help with Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (CoRR, 2015)

A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. - Guy Even; Moti Medina (Theor. Comput. Sci., 2015)

Efficient Metastability-Containing Gray Code 2-Sort. - Christoph Lenzen 001; Moti Medina (ASYNC, 2016)

A Constant Approximation Algorithm for Scheduling Packets on Line Networks. - Guy Even; Moti Medina; Adi Rosén (ESA, 2016)

Non-local Probes Do Not Help with Many Graph Problems. - Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela (DISC, 2016)

Improved Approximation for Orienting Mixed Graphs. - Iftah Gamzu; Moti Medina (Algorithmica, 2016)

Competitive Path Computation and Function Placement in SDNs. - Guy Even; Moti Medina; Boaz Patt-Shamir (CoRR, 2016)

Near-optimal metastability-containing sorting networks. - Johannes Bund; Christoph Lenzen 001; Moti Medina (DATE, 2017)

Robust Routing Made Easy. - Christoph Lenzen 001; Moti Medina (SSS, 2017)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Online Packet-Routing in Grids with Bounded Buffers. - Guy Even; Moti Medina (Algorithmica, 2017)

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. - Guy Even; Reut Levi; Moti Medina (CoRR, 2017)

A (Centralized) Local Guide. - Reut Levi; Moti Medina (Bull. EATCS, 2017)

Optimal metastability-containing sorting networks. - Johannes Bund; Christoph Lenzen 001; Moti Medina (DATE, 2018)

Online Generalized Caching with Varying Weights and Costs. - Guy Even; Moti Medina; Dror Rawitz (SPAA, 2018)

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. - Guy Even; Mohsen Ghaffari 001; Moti Medina (DISC, 2018)

Closure Operators and Spam Resistance for PageRank. - Lucas Farach-Colton; Martin Farach-Colton; Reut Levi; Moti Medina; Miguel A. Mosteiro (CoRR, 2018)

Best of two local models: Centralized local and distributed local algorithms. - Guy Even; Moti Medina; Dana Ron (Inf. Comput., 2018)

On-Line Path Computation and Function Placement in SDNs. - Guy Even; Moti Medina; Boaz Patt-Shamir (Theory Comput. Syst., 2019)

Distributed Testing of Graph Isomorphism in the CONGEST Model. - Reut Levi; Moti Medina (APPROX-RANDOM, 2020)

PALS: Plesiochronous and Locally Synchronous Systems. - Johannes Bund; Matthias Függer; Christoph Lenzen 001; Moti Medina; Will Rosenbaum (ASYNC, 2020)

Optimal Metastability-Containing Sorting via Parallel Prefix Computation. - Johannes Bund; Christoph Lenzen 001; Moti Medina (IEEE Trans. Computers, 2020)

Synchronizer-Free Digital Link Controller. - Johannes Bund; Matthias Függer; Christoph Lenzen 001; Moti Medina (IEEE Trans. Circuits Syst., 2020)

Towards Hazard-Free Multiplexer Based Implementation of Self-Timed Circuits. - Alexander Kushnerov; Moti Medina; Alexandre Yakovlev (ASYNC, 2021)

Property testing of planarity in the CONGEST model. - Reut Levi; Moti Medina; Dana Ron (Distributed Comput., 2021)

Sublinear Random Access Generators for Preferential Attachment Graphs. - Guy Even; Reut Levi; Moti Medina; Adi Rosén (ACM Trans. Algorithms, 2021)

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. - Noy Biton; Reut Levi; Moti Medina (MFCS, 2023)

Graph Ranking and the Cost of Sybil Defense. - Gwendolyn Farach-Colton; Martin Farach-Colton; Leslie Ann Goldberg; Hanna Komlós; John Lapinskas; Reut Levi; Moti Medina; Miguel A. Mosteiro (EC, 2023)

PALS: Distributed Gradient Clocking on Chip. - Johannes Bund; Matthias Függer; Moti Medina (IEEE Trans. Very Large Scale Integr. Syst., 2023)

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. - Reut Levi; Moti Medina; Omer Tubul (APPROX/RANDOM, 2024)

Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. - Christoph Lenzen 001; Moti Medina; Mehrdad Saberi; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2024)

Small Hazard-Free Transducers. - Johannes Bund; Christoph Lenzen 001; Moti Medina (IEEE Trans. Computers, 2025)