( en | de | ru )

 

Disambiguation of "Medina, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Sublinear Random Access Generators for Preferential Attachment Graphs.

, , , and . ICALP, volume 80 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

René Motika

Lew Motiloff

Ramiro Medina

Eva Medina

Mahesh Motiramani

 

Other publications of authors with the same name

Digital Logic Design - A Rigorous Approach., and . Cambridge University Press, (2012)Distributed Maximum Matching in Bounded Degree Graphs., , and . ICDCN, page 18:1-18:10. ACM, (2015)Small Hazard-Free Transducers., , and . ITCS, volume 215 of LIPIcs, page 32:1-32:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Small Hazard-free Transducers., , and . CoRR, (2018)Parallel Randomized Load Balancing: A Lower Bound for a More General Model., and . SOFSEM, volume 5901 of Lecture Notes in Computer Science, page 358-369. Springer, (2010)Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs., , and . ESA, volume 8737 of Lecture Notes in Computer Science, page 394-405. Springer, (2014)A (Centralized) Local Guide., and . Bull. EATCS, (2017)Online Generalized Caching with Varying Weights and Costs., , and . SPAA, page 205-212. ACM, (2018)Graph Ranking and the Cost of Sybil Defense., , , , , , , and . EC, page 586-625. ACM, (2023)Distributed Testing of Graph Isomorphism in the CONGEST Model., and . APPROX-RANDOM, volume 176 of LIPIcs, page 19:1-19:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)