default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoti Medina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Christoph Lenzen
, Moti Medina, Mehrdad Saberi, Stefan Schmid:
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. IEEE/ACM Trans. Netw. 32(1): 283-297 (2024)- [c32]Reut Levi, Moti Medina, Omer Tubul:
Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. APPROX/RANDOM 2024: 60:1-60:21 - 2023
- [j14]Johannes Bund, Matthias Függer, Moti Medina:
PALS: Distributed Gradient Clocking on Chip. IEEE Trans. Very Large Scale Integr. Syst. 31(11): 1740-1753 (2023) - [c31]Noy Biton, Reut Levi, Moti Medina:
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. MFCS 2023: 19:1-19:14 - [c30]Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Graph Ranking and the Cost of Sybil Defense. EC 2023: 586-625 - [i27]Noy Biton, Reut Levi, Moti Medina:
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. CoRR abs/2302.00742 (2023) - [i26]Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid:
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults. CoRR abs/2307.05547 (2023) - [i25]Johannes Bund, Matthias Függer, Moti Medina:
PALS: Distributed Gradient Clocking on Chip. CoRR abs/2308.15098 (2023) - 2022
- [c29]Johannes Bund, Christoph Lenzen, Moti Medina:
Small Hazard-Free Transducers. ITCS 2022: 32:1-32:24 - 2021
- [j13]Reut Levi, Moti Medina, Dana Ron:
Property testing of planarity in the CONGEST model. Distributed Comput. 34(1): 15-32 (2021) - [j12]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17(4): 28:1-28:26 (2021) - [c28]Alexander Kushnerov, Moti Medina, Alexandre Yakovlev:
Towards Hazard-Free Multiplexer Based Implementation of Self-Timed Circuits. ASYNC 2021: 17-24 - 2020
- [j11]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. IEEE Trans. Computers 69(2): 198-211 (2020) - [j10]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina:
Synchronizer-Free Digital Link Controller. IEEE Trans. Circuits Syst. 67-I(10): 3562-3573 (2020) - [c27]Reut Levi, Moti Medina:
Distributed Testing of Graph Isomorphism in the CONGEST Model. APPROX-RANDOM 2020: 19:1-19:24 - [c26]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. ASYNC 2020: 36-43 - [i24]Reut Levi, Moti Medina:
Distributed Testing of Graph Isomorphism in the CONGEST model. CoRR abs/2003.00468 (2020) - [i23]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. CoRR abs/2003.05542 (2020) - [i22]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina:
Synchronizer-Free Digital Link Controller. CoRR abs/2010.02017 (2020)
2010 – 2019
- 2019
- [j9]Guy Even, Moti Medina, Boaz Patt-Shamir:
On-Line Path Computation and Function Placement in SDNs. Theory Comput. Syst. 63(2): 306-325 (2019) - [i21]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting via Parallel Prefix Computation. CoRR abs/1911.00267 (2019) - 2018
- [j8]Guy Even, Moti Medina, Dana Ron:
Best of two local models: Centralized local and distributed local algorithms. Inf. Comput. 262: 69-89 (2018) - [c25]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal metastability-containing sorting networks. DATE 2018: 521-526 - [c24]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. PODC 2018: 347-356 - [c23]Guy Even, Moti Medina, Dror Rawitz:
Online Generalized Caching with Varying Weights and Costs. SPAA 2018: 205-212 - [c22]Guy Even, Mohsen Ghaffari, Moti Medina:
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. DISC 2018: 22:1-22:14 - [i20]Johannes Bund, Christoph Lenzen, Moti Medina:
Optimal Metastability-Containing Sorting Networks. CoRR abs/1801.07549 (2018) - [i19]Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro:
Closure Operators and Spam Resistance for PageRank. CoRR abs/1803.05001 (2018) - [i18]Reut Levi, Moti Medina, Dana Ron:
Property Testing of Planarity in the CONGEST model. CoRR abs/1805.10657 (2018) - [i17]Johannes Bund, Christoph Lenzen, Moti Medina:
Small Hazard-free Transducers. CoRR abs/1811.12369 (2018) - 2017
- [j7]Guy Even, Moti Medina:
Online Packet-Routing in Grids with Bounded Buffers. Algorithmica 78(3): 819-868 (2017) - [j6]Reut Levi, Moti Medina:
A (Centralized) Local Guide. Bull. EATCS 122 (2017) - [c21]Johannes Bund, Christoph Lenzen, Moti Medina:
Near-optimal metastability-containing sorting networks. DATE 2017: 226-231 - [c20]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP 2017: 6:1-6:15 - [c19]Christoph Lenzen, Moti Medina:
Robust Routing Made Easy. SSS 2017: 187-202 - [c18]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [i16]Christoph Lenzen, Moti Medina:
Robust Routing Made Easy. CoRR abs/1705.04042 (2017) - [i15]Guy Even, Reut Levi, Moti Medina:
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. CoRR abs/1705.04898 (2017) - 2016
- [j5]Iftah Gamzu, Moti Medina:
Improved Approximation for Orienting Mixed Graphs. Algorithmica 74(1): 49-64 (2016) - [c17]Christoph Lenzen, Moti Medina:
Efficient Metastability-Containing Gray Code 2-Sort. ASYNC 2016: 49-56 - [c16]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. ESA 2016: 40:1-40:16 - [c15]Guy Even, Moti Medina, Boaz Patt-Shamir:
On-Line Path Computation and Function Placement in SDNs. SSS 2016: 131-147 - [c14]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-local Probes Do Not Help with Many Graph Problems. DISC 2016: 201-214 - [i14]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR abs/1602.06159 (2016) - [i13]Guy Even, Moti Medina, Boaz Patt-Shamir:
Competitive Path Computation and Function Placement in SDNs. CoRR abs/1602.06169 (2016) - [i12]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. CoRR abs/1602.06174 (2016) - 2015
- [j4]Guy Even, Moti Medina:
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. Theor. Comput. Sci. 584: 144-154 (2015) - [c13]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. ICDCN 2015: 18:1-18:10 - [c12]Guy Even, Moti Medina, Boaz Patt-Shamir:
Better Deterministic Online Packet Routing on Grids. SPAA 2015: 284-293 - [i11]Guy Even, Moti Medina, Boaz Patt-Shamir:
Better Online Deterministic Packet Routing on Grids. CoRR abs/1501.06140 (2015) - [i10]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-Local Probes Do Not Help with Graph Problems. CoRR abs/1512.05411 (2015) - 2014
- [c11]Guy Even, Moti Medina, Dana Ron:
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. ESA 2014: 394-405 - [i9]Guy Even, Moti Medina, Dana Ron:
Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR abs/1402.3796 (2014) - [i8]Guy Even, Moti Medina:
Online Packet-Routing in Grids with Bounded Buffers. CoRR abs/1407.4498 (2014) - [i7]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. CoRR abs/1407.7882 (2014) - 2013
- [j3]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and deterministic embeddings of virtual networks. Theor. Comput. Sci. 496: 184-194 (2013) - [c10]Guy Even, Moti Medina:
A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations. SIROCCO 2013: 104-115 - [i6]Guy Even, Moti Medina:
A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations. CoRR abs/1304.7687 (2013) - 2012
- [b1]Guy Even, Moti Medina:
Digital Logic Design - A Rigorous Approach. Cambridge University Press 2012, ISBN 978-1-107-02753-4, pp. I-XX, 1-348 - [j2]Guy Even, Moti Medina:
Revisiting randomized parallel load balancing algorithms. Theor. Comput. Sci. 444: 87-99 (2012) - [c9]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and Deterministic Embeddings of Virtual Networks. ICDCN 2012: 106-121 - [c8]Iftah Gamzu, Moti Medina:
Improved Approximation for Orienting Mixed Graphs. SIROCCO 2012: 243-253 - [c7]Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. WAOA 2012: 16-29 - [i5]Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. CoRR abs/1201.5030 (2012) - [i4]Iftah Gamzu, Moti Medina:
Improved Approximation for Orienting Mixed Graphs. CoRR abs/1204.0219 (2012) - 2011
- [j1]Guy Even, Moti Medina:
Parallel randomized load balancing: A lower bound for a more general model. Theor. Comput. Sci. 412(22): 2398-2408 (2011) - [c6]Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy:
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. ALGOSENSORS 2011: 188-201 - [c5]Guy Even, Yakov Matsri, Moti Medina:
Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. ALGOSENSORS 2011: 202-214 - [c4]Guy Even, Moti Medina:
Online packet-routing in grids with bounded buffers. SPAA 2011: 215-224 - [i3]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and Deterministic Embeddings of Virtual Networks. CoRR abs/1101.5221 (2011) - [i2]Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy:
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. CoRR abs/1104.0779 (2011) - [i1]Guy Even, Yakov Matsri, Moti Medina:
Multi-Hop Routing and Scheduling in Wireless Networks in the SINR model. CoRR abs/1104.1330 (2011) - 2010
- [c3]Guy Even, Moti Medina:
An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. ICALP (2) 2010: 139-150 - [c2]Guy Even, Moti Medina:
Parallel Randomized Load Balancing: A Lower Bound for a More General Model. SOFSEM 2010: 358-369
2000 – 2009
- 2009
- [c1]Guy Even, Moti Medina:
Revisiting Randomized Parallel Load Balancing Algorithms. SIROCCO 2009: 209-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
