Moti Medina

Orcid: 0000-0002-5572-3754

According to our database1, Moti Medina authored at least 44 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults.
IEEE/ACM Trans. Netw., February, 2024

2023
PALS: Distributed Gradient Clocking on Chip.
IEEE Trans. Very Large Scale Integr. Syst., November, 2023

Graph Ranking and the Cost of Sybil Defense.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Small Hazard-Free Transducers.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Sublinear Random Access Generators for Preferential Attachment Graphs.
ACM Trans. Algorithms, 2021

Property testing of planarity in the CONGEST model.
Distributed Comput., 2021

Towards Hazard-Free Multiplexer Based Implementation of Self-Timed Circuits.
Proceedings of the 27th IEEE International Symposium on Asynchronous Circuits and Systems, 2021

2020
Synchronizer-Free Digital Link Controller.
IEEE Trans. Circuits Syst., 2020

Optimal Metastability-Containing Sorting via Parallel Prefix Computation.
IEEE Trans. Computers, 2020

PALS: Plesiochronous and Locally Synchronous Systems.
Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems, 2020

Distributed Testing of Graph Isomorphism in the CONGEST Model.
Proceedings of the Approximation, 2020

2019
On-Line Path Computation and Function Placement in SDNs.
Theory Comput. Syst., 2019

2018
Best of two local models: Centralized local and distributed local algorithms.
Inf. Comput., 2018

Closure Operators and Spam Resistance for PageRank.
CoRR, 2018

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Online Generalized Caching with Varying Weights and Costs.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Optimal metastability-containing sorting networks.
Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

2017
A (Centralized) Local Guide.
Bull. EATCS, 2017

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model.
CoRR, 2017

Online Packet-Routing in Grids with Bounded Buffers.
Algorithmica, 2017

Three Notes on Distributed Property Testing.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Robust Routing Made Easy.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Near-optimal metastability-containing sorting networks.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2017

2016
Competitive Path Computation and Function Placement in SDNs.
CoRR, 2016

Improved Approximation for Orienting Mixed Graphs.
Algorithmica, 2016

Non-local Probes Do Not Help with Many Graph Problems.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

A Constant Approximation Algorithm for Scheduling Packets on Line Networks.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Efficient Metastability-Containing Gray Code 2-Sort.
Proceedings of the 22nd IEEE International Symposium on Asynchronous Circuits and Systems, 2016

2015
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations.
Theor. Comput. Sci., 2015

Non-Local Probes Do Not Help with Graph Problems.
CoRR, 2015

Better Online Deterministic Packet Routing on Grids.
CoRR, 2015

Better Deterministic Online Packet Routing on Grids.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Distributed Maximum Matching in Bounded Degree Graphs.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014
Best of Two Local Models: Local Centralized and Local Distributed Algorithms.
CoRR, 2014

Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Competitive and deterministic embeddings of virtual networks.
Theor. Comput. Sci., 2013

2012
Revisiting randomized parallel load balancing algorithms.
Theor. Comput. Sci., 2012

Online Multi-Commodity Flow with High Demands.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Digital Logic Design - A Rigorous Approach.
Cambridge University Press, ISBN: 978-1-107-02753-4, 2012

2011
Parallel randomized load balancing: A lower bound for a more general model.
Theor. Comput. Sci., 2011

Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model.
Proceedings of the Algorithms for Sensor Systems, 2011

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks.
Proceedings of the Algorithms for Sensor Systems, 2011

2010
An <i>O</i>(log<i>n</i>)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010


  Loading...