World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
6052
World Ranking
7324
National Ranking
121

Overview

Michael Elkin is affiliated with Ben-Gurion University of the Negev in Israel. Their research spans primarily across computer science and biochemistry, genetics, and molecular biology, with a significant focus on computational theory and molecular biology subfields.

The scientist's work includes substantial contributions to complexity and algorithms in graphs, advanced graph theory research, and cryptography and data security. Other topics of research include fibroblast growth factor studies, proteoglycans and glycosaminoglycans research, stochastic gradient optimization techniques, and optimization and search problems.

Frequent co-authors collaborating with Michael Elkin include Ofer Neiman, Esther Hermano, Amichay Meirovitz, Ariel M. Rubinstein, and Ofra Maimon.

Michael Elkin has published repeatedly in various venues. Some of the most frequent include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Journal of the ACM
  • Distributed Computing
  • Biomedicines

Their recent papers demonstrate interdisciplinary research interests combining computational and biomedical sciences. Selected publications include:

  • Intracellular Porphyromonas gingivalis Promotes the Tumorigenic Behavior of Pancreatic Carcinoma Cells, 2020, Cancers
  • Oral bacteria accelerate pancreatic cancer development in mice, 2024, Gut
  • Heparanase: a potential marker of worse prognosis in estrogen receptor-positive breast cancer, 2021, npj Breast Cancer
  • Distributed strong diameter network decomposition, 2022, Theoretical Computer Science
  • Locally-iterative Distributed (Δ + 1)-coloring and Applications, 2021, Journal of the ACM

Best Publications

  • Lower-Stretch Spanning Trees

    Michael Elkin;Yuval Emek;Daniel A. Spielman;Shang-Hua Teng

  • $(1 + psilon,eta)$-Spanner Constructions for General Graphs

    Michael Elkin;David Peleg

  • Distributed (δ+1)-coloring in linear (in δ) time

    Leonid Barenboim;Michael Elkin

  • Distributed Graph Coloring: Fundamentals and Recent Developments

    Leonid Barenboim;Michael Elkin

  • Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

    Leonid Barenboim;Michael Elkin

  • An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem

    Michael Elkin

  • The Locality of Distributed Symmetry Breaking

    Leonid Barenboim;Michael Elkin;Seth Pettie;Johannes Schneider

  • Lower-stretch spanning trees

    Michael Elkin;Yuval Emek;Daniel A. Spielman;Shang-Hua Teng

  • Deterministic Distributed Vertex Coloring in Polylogarithmic Time

    Leonid Barenboim;Michael Elkin

  • Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time

    Leonid Barenboim;Michael Elkin;Fabian Kuhn

  • A faster distributed protocol for constructing a minimum spanning tree

    Michael Elkin

  • Computing almost shortest paths

    Michael Elkin

  • Sparse Sourcewise and Pairwise Distance Preservers

    Don Coppersmith;Michael Elkin

  • Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

    Michael Elkin

  • Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models

    Michael Elkin;Jian Zhang

  • An improved construction of progression-free sets

    Michael Elkin

  • Deterministic distributed vertex coloring in polylogarithmic time

    Leonid Barenboim;Michael Elkin

  • Sparse Distance Preservers and Additive Spanners

    Béla Bollobás;Don Coppersmith;Michael Elkin

  • Computing almost shortest paths

    Michael Elkin

  • Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners

    Michael Elkin

  • (1 + εΒ)-spanner constructions for general graphs

    Michael Elkin;David Peleg

Frequent Co-Authors

Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
David Peleg
David Peleg Weizmann Institute of Science
Seth Pettie
Seth Pettie University of Michigan–Ann Arbor
Danupon Nanongkai
Danupon Nanongkai Max Planck Institute for Informatics
Gopal Pandurangan
Gopal Pandurangan University of Houston
Don Coppersmith
Don Coppersmith IBM (United States)
Daniel A. Spielman
Daniel A. Spielman Yale University
Cyril Gavoille
Cyril Gavoille University of Bordeaux
Shang-Hua Teng
Shang-Hua Teng University of Southern California

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science education in the USA opens up a range of online degree options. Students seeking a quicker entry point might consider associates degree programs, which offer foundational skills and can often be completed in two years or less.

For those interested in advancing their studies to the highest level, it’s worth exploring the cheapest accredited online doctoral programs. These flexible, affordable options make it easier for working professionals to earn a doctorate without leaving their jobs.

When selecting any online program, accreditation is critical. Accredited institutions help ensure that your credentials are recognized by employers and other educational bodies. Consider reviewing online degree programs accredited by reputable agencies to make an informed decision.

Looking for a creative twist? The demand for video game professionals is growing, and a game art degree online can be a smart choice for combining technical and artistic skills, all from the comfort of home.

Best Scientists Citing Michael Elkin

Trending Scientists

Recently Published Articles