World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
6068
World Ranking
10244
National Ranking
4300

Alon Orlitsky publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Alon Orlitsky sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 162 publications — 32nd percentile

32% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Alon Orlitsky D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Alon Orlitsky sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 38 D-Index — 30th percentile

30% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2021 - IEEE Claude E. Shannon Award

Overview

Alon Orlitsky is affiliated with the University of California, San Diego in the United States. Their research focuses primarily on the field of Computer Science with a notable emphasis on Artificial Intelligence. Contributions also span into related subfields including Mechanical Engineering, Molecular Biology, Control and Systems Engineering, and Mathematical Physics.

Orlitsky's work covers a range of topics, with significant publications in Machine Learning and Algorithms, Algorithms and Data Compression, Domain Adaptation and Few-Shot Learning, as well as Mineral Processing and Grinding. Additional topics of research include Diffusion and Search Dynamics, Control Systems and Identification, and Mathematical Dynamics and Fractals.

Recent published papers authored or coauthored by Orlitsky include:

  • A General Method for Robust Learning from Batches, 2020, arXiv (Cornell University)
  • Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions, 2020, arXiv (Cornell University)
  • SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm, 2020, arXiv (Cornell University)
  • Linear-Sample Learning of Low-Rank Distributions, 2020, arXiv (Cornell University)
  • Robust estimation algorithms don't need to know the corruption level, 2022, arXiv (Cornell University)

Frequent coauthors collaborating with Orlitsky include:

  • Ayush Jain
  • Vaishakh Ravindrakumar
  • Hao Yi
  • Yi Hao

Orlitsky has contributed primarily to publications in arXiv (Cornell University), with multiple articles published in this venue. Their sustained research output in this repository reflects engagement with emerging and exploratory studies in their fields of interest.

In recognition of their contributions, Orlitsky was awarded the IEEE Claude E. Shannon Award in 2021.

Best Publications

  • Coding for computing

    A. Orlitsky;J.R. Roche

  • Stopping set distribution of LDPC code ensembles

    A. Orlitsky;Krishnamurthy Viswanathan;J. Zhang

  • Always Good Turing: asymptotically optimal probability estimation

    A. Orlitsky;N.P. Santhanam;J. Zhang

  • Zero-error information theory

    J. Korner;A. Orlitsky

  • Source coding and graph entropies

    N. Alon;A. Orlitsky

  • Universal compression of memoryless sources over unknown alphabets

    A. Orlitsky;N.P. Santhanam;Junan Zhang

  • Worst-case interactive communication. I. Two messages are almost optimal

    A. Orlitsky

  • Optimal prediction of the number of unseen species

    Alon Orlitsky;Ananda Theertha Suresh;Yihong Wu

  • Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length

    N. Madras;A. Orlitsky;L. A. Shepp

  • Stopping sets and the girth of Tanner graphs

    A. Orlitsky;R. Urbanke;K. Viswanathan;J. Zhang

  • On Learning Distributions from their Samples

    Sudeep Kamath;Alon Orlitsky;Dheeraj Pichapati;Ananda Theertha Suresh

  • Repeated communication and Ramsey graphs

    N. Alon;A. Orlitsky

  • On codes that avoid specified differences

    B.E. Moision;A. Orlitsky;P.H. Siegel

  • Interactive communication of balanced distributions and of correlated files

    Alon Orlitsky

  • Worst-case interactive communication. II. Two messages are not optimal

    A. Orlitsky

  • A lower bound on the expected length of one-to-one codes

    N. Alon;A. Orlitsky

  • Competitive distribution estimation: why is Good-Turing good

    Alon Orlitsky;Ananda Theertha Suresh

  • Estimating Renyi Entropy of Discrete Distributions

    Jayadev Acharya;Alon Orlitsky;Ananda Theertha Suresh;Himanshu Tyagi

  • Privacy, additional information and communication

    R. Bar-Yehuda;B. Chor;E. Kushilevitz;A. Orlitsky

  • On modeling profiles instead of values

    Alon Orlitsky;Narayana P. Santhanam;Krishnamurthy Viswanathan;Junan Zhang

  • Near-optimal-sample estimators for spherical Gaussian mixtures

    Jayadev Acharya;Ashkan Jafarpour;Alon Orlitsky;Ananda Theertha Suresh

Frequent Co-Authors

Yihong Wu
Yihong Wu Yale University
Olgica Milenkovic
Olgica Milenkovic University of Illinois at Urbana-Champaign
Christina Fragouli
Christina Fragouli University of California, Los Angeles
Vwani P. Roychowdhury
Vwani P. Roychowdhury University of California, Los Angeles
Thomas Kailath
Thomas Kailath Stanford University
Noga Alon
Noga Alon Tel Aviv University
Paul H. Siegel
Paul H. Siegel University of California, San Diego
Eyal Kushilevitz
Eyal Kushilevitz Technion – Israel Institute of Technology
Moni Naor
Moni Naor Weizmann Institute of Science
Abbas El Gamal
Abbas El Gamal Stanford University

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

Expanding your computer science education can open doors to diverse career pathways, both inside and outside traditional tech roles. Many students explore graduate studies to build expertise while balancing work and personal commitments. Today, online degree options provide flexibility and affordability for continued learning.

For those interested in leadership, the best online emba programs offer advanced business skills, preparing graduates to lead tech projects or startups. Another alternative is the cheapest online doctorate in organizational leadership, suitable for those seeking research or executive roles in large organizations.

If you’re looking for specialized paths, a master in library science can help you leverage technology in information management, digital archives, or data curation. Those seeking more affordable routes should explore the cheapest online masters degree programs for customizable and budget-friendly advancement.

By pursuing related online degrees, you can tailor your expertise and enhance your career mobility in today’s evolving job market.

Best Scientists Citing Alon Orlitsky

Trending Scientists

Recently Published Articles