World's Best Scientists 2026 revealed!
VIEW LIST
Vincent Y. F. Tan

D-Index & Metrics

Discipline name D-Index World Ranking Current World Ranking National Ranking Current National Ranking Publications Citations
Computer Science 33 12597 12229 169 169 418 5209

Vincent Y. F. Tan publications per year

The chart shows the history of publications by Vincent Y. F. Tan between 2007 and 2025, highlighting the no. of papers published in each year and offering an overview of the publication velocity of this scholar. Vincent Y. F. Tan published across 19 years, from 2007 to 2025, averaging 25.9 papers a year. Output peaked at 57 publications in 2017. 56 of the 493 publications appeared in the last two years.

No. of publications
10 20 30 40 50
Bar chart. Horizontal axis: year, 2007 to 2025. Vertical axis: number of publications, 0 to 57. Peak 57 publications in 2017. 2007: 3 publications 2008: 3 publications 2009: 5 publications 2010: 10 publications 2011: 19 publications 2012: 13 publications 2013: 16 publications 2014: 26 publications 2015: 32 publications 2016: 38 publications 2017: 57 publications 2018: 34 publications 2019: 45 publications 2020: 34 publications 2021: 44 publications 2022: 32 publications 2023: 26 publications 2024: 33 publications 2025: 23 publications
2007 2025

493 publications in total across all disciplines

View publications per year as a table
Vincent Y. F. Tan: publications per year, 2007 to 2025
Year Publications
2007 3
2008 3
2009 5
2010 10
2011 19
2012 13
2013 16
2014 26
2015 32
2016 38
2017 57
2018 34
2019 45
2020 34
2021 44
2022 32
2023 26
2024 33
2025 23
Total 493
Download as CSV

Vincent Y. F. Tan publications per year - data summary

  • Vincent Y. F. Tan, a Computer Science scholar from National University of Singapore, has 493 publications recorded across 19 years, from 2007 to 2025.
  • The oldest publication on record dates to 2007 and the most recent to 2025.
  • The most productive year is 2017, with 57 publications.
  • The least productive years with any output are 2007 and 2008, with 3 publications each.
  • The rate of publication averages 25.9 papers per year over the whole span, or 25.9 per year counting only the 19 years with at least one publication.
  • The last 5 years on the chart (2021-2025) hold 158 publications, 32% of the career total.
  • Split into equal eras - 2007-2013: 69 publications (9.9 per year); 2014-2020: 266 publications (38.0 per year); 2021-2025: 158 publications (31.6 per year).
  • Comparing the opening and closing eras, the overall trend of publication is rising.

Vincent Y. F. Tan 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 Vincent Y. F. Tan sits on this spectrum.

No. of scientists
200 400 600
Bar chart with 97 bars. Horizontal axis: publications, 32–41 to 991+. Vertical axis: number of scientists, 0 to 609. Most scientists, 609, have 142–151 publications. The last bar groups every scientist with 991 publications or more. The highlighted bar, 412–421 publications, is where this scientist sits. 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–41 publications 991+

This scientist: 418 publications — 88th percentile

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

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

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

Vincent Y. F. Tan publication distribution in Computer Science in 2026 - data summary

  • The chart plots the publication count of all 14,188 Computer Science scientists ranked by Research.com in 2026, grouped into 97 ranges running from 32–41 to 991+ publications.
  • Vincent Y. F. Tan, a Computer Science scholar from National University of Singapore, records 418 publications - the 88th percentile of the discipline.
  • 88% of ranked Computer Science scientists score the same or lower than Vincent Y. F. Tan, and about 12% score higher.
  • The median of the discipline falls in the 202–211 publications range, and Vincent Y. F. Tan ranks above the median.
  • The most crowded range is 142–151 publications, holding 609 scientists (4% of the field).
  • 70% of the field sits in the lowest quarter of the value range (up to 272–281 publications), so the distribution is heavily right-skewed and high scores are rare.
  • The final bar has no upper bound: it groups every scientist with 991 publications or more, 100 scientists in all (<1% of the field).

Vincent Y. F. Tan 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 Vincent Y. F. Tan sits on this spectrum.

No. of scientists
200 400 600 800
Bar chart with 52 bars. Horizontal axis: D-Index, 30–31 to 131+. Vertical axis: number of scientists, 0 to 990. Most scientists, 990, have 36–37 D-Index. The last bar groups every scientist with 131 D-Index or more. The highlighted bar, 32–33 D-Index, is where this scientist sits. 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–31 D-Index 131+

This scientist: 33 D-Index — 13th percentile

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

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

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

Vincent Y. F. Tan D-index placement in Computer Science in 2026 - data summary

  • The chart plots the discipline H-index (D-index) of all 14,188 Computer Science scientists ranked by Research.com in 2026, grouped into 52 ranges running from 30–31 to 131+ D-Index.
  • Vincent Y. F. Tan, a Computer Science scholar from National University of Singapore, records 33 D-Index - the 13th percentile of the discipline.
  • 13% of ranked Computer Science scientists score the same or lower than Vincent Y. F. Tan, and about 87% score higher.
  • The median of the discipline falls in the 44–45 D-Index range, and Vincent Y. F. Tan ranks below the median.
  • The most crowded range is 36–37 D-Index, holding 990 scientists (7% of the field).
  • 71% of the field sits in the lowest quarter of the value range (up to 54–55 D-Index), so the distribution is heavily right-skewed and high scores are rare.
  • The final bar has no upper bound: it groups every scientist with 131 D-Index or more, 98 scientists in all (<1% of the field).

Overview

Vincent Y. F. Tan is affiliated with the National University of Singapore in Singapore. Their research primarily spans the field of Computer Science, with a focus on Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Electrical and Electronic Engineering, and Computer Vision and Pattern Recognition.

The scientist's research encompasses several key topics including Advanced Bandit Algorithms Research, Wireless Communication Security Techniques, Machine Learning and Algorithms, Distributed Sensor Networks and Detection Algorithms, Adversarial Robustness in Machine Learning, Age of Information Optimization, and DNA and Biological Computing.

Vincent Y. F. Tan has authored numerous papers, including recent publications such as "Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning" (2022) published in the 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), "Efficient Sharpness-aware Minimization for Improved Training of Neural Networks" (2021) in arXiv (Cornell University), "On Exact and ∞-Rényi Common Informations" (2020) in IEEE Transactions on Information Theory, "Common Information, Noise Stability, and Their Extensions" (2022) in Foundations and Trends® in Communications and Information Theory, and "A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem" (2024) in the European Journal of Operational Research.

Frequent coauthors of Vincent Y. F. Tan include Jiashi Feng, Qiaosheng Zhang, Yonglong Li, P. N. Karthik, and Hanshu Yan.

The scientist has published extensively in venues such as arXiv (Cornell University), IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing, Proceedings of the AAAI Conference on Artificial Intelligence, and the 2022 IEEE International Symposium on Information Theory (ISIT).

  • Artificial Intelligence
  • Management Science and Operations Research
  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Computer Vision and Pattern Recognition

  • Advanced Bandit Algorithms Research
  • Wireless Communication Security Techniques
  • Machine Learning and Algorithms
  • Distributed Sensor Networks and Detection Algorithms
  • Adversarial Robustness in Machine Learning
  • Age of Information Optimization
  • DNA and Biological Computing

  • Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning (2022), 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
  • Efficient Sharpness-aware Minimization for Improved Training of Neural Networks (2021), arXiv (Cornell University)
  • On Exact and ∞-Rényi Common Informations (2020), IEEE Transactions on Information Theory
  • Common Information, Noise Stability, and Their Extensions (2022), Foundations and Trends® in Communications and Information Theory
  • A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem (2024), European Journal of Operational Research

  • Jiashi Feng
  • Qiaosheng Zhang
  • Yonglong Li
  • P. N. Karthik
  • Hanshu Yan

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • IEEE Transactions on Signal Processing
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • 2022 IEEE International Symposium on Information Theory (ISIT)

Best Publications

  • Beyond atopy: Multiple patterns of sensitization in relation to asthma in a birth cohort study

    Angela Simpson;Vincent Y. F. Tan;John Winn;Markus Svensén

  • Automatic Relevance Determination in Nonnegative Matrix Factorization with the $(eta)$-Divergence

    V. Y. F. Tan;C. Fevotte

  • Learning Latent Tree Graphical Models

    Myung Jin Choi;Vincent Y. F. Tan;Animashree Anandkumar;Alan S. Willsky

  • Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities

    Vincent Y. F. Tan

  • The Third-Order Term in the Normal Approximation for the AWGN Channel

    Vincent Yan Fu Tan;Marco Tomamichel

  • On the Dispersions of Three Network Information Theory Problems

    Vincent Y. F. Tan;Oliver Kosut

  • High-dimensional structure estimation in Ising models: Local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • High-dimensional Gaussian graphical model selection: walk summability and local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • DragDiffusion: Harnessing Diffusion Models for Interactive Point-Based Image Editing

    Unknown

  • A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels

    Marco Tomamichel;Vincent Y. F. Tan

  • A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures

    Vincent Y F Tan;Animashree Anandkumar;Lang Tong;Alan S Willsky

  • Time-Division is Optimal for Covert Communication Over Some Broadcast Channels

    Vincent Y. F. Tan;Si-Hyeon Lee

  • Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

    Shun Watanabe;Shigeaki Kuzuoka;Vincent Y. F. Tan

  • Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning

    Unknown

  • Wireless Compressive Sensing for Energy Harvesting Sensor Nodes

    Gang Yang;Vincent Y. F. Tan;Chin Keong Ho;See Ho Ting

  • Automatic Relevance Determination in Nonnegative Matrix Factorization

    Vincent Y. F. Tan;Cédric Févotte

  • Hypothesis testing under maximal leakage privacy constraints

    Jiachun Liao;Lalitha Sankar;Flavio P. Calmon;Vincent Y. F. Tan

  • Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels

    Marco Tomamichel;Marco Tomamichel;Vincent Y. F. Tan

  • Moderate deviation analysis for classical communication over quantum channels

    Christopher T. Chubb;Vincent Y. F. Tan;Marco Tomamichel

  • Minimizing the Accumulated Trajectory Error to Improve Dataset Distillation

    Unknown

  • Codes in the Space of Multisets—Coding for Permutation Channels With Impairments

    Mladen Kovacevic;Vincent Y. F. Tan

  • Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm

    V.Y.F. Tan;V.K. Goyal

  • Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures

    Vincent Y F Tan;Animashree Anandkumar;Alan S Willsky

  • Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems

    Mladen Kovacevic;Vincent Y. F. Tan

  • Hypothesis Testing Under Mutual Information Privacy Constraints in the High Privacy Regime

    Jiachun Liao;Lalitha Sankar;Vincent Y. F. Tan;Flavio du Pin Calmon

  • High-dimensional structure estimation in Ising models: Local separation criterion

    Animashree Anandkumar;Vincent Y. F. Tan;Furong Huang;Alan S. Willsky

  • On Robustness of Neural Ordinary Differential Equations

    Hanshu Yan;Jiawei Du;Vincent Y. F. Tan;Jiashi Feng

  • Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information

    Shun Watanabe;Shigeaki Kuzuoka;Vincent Y. F. Tan

Frequent Co-Authors

Mehul Motani
Mehul Motani National University of Singapore
Alan S. Willsky
Alan S. Willsky MIT
Anima Anandkumar
Anima Anandkumar Nvidia (United Kingdom)
Marco Tomamichel
Marco Tomamichel National University of Singapore
Stark C. Draper
Stark C. Draper University of Toronto
Masahito Hayashi
Masahito Hayashi Chinese University of Hong Kong, Shenzhen
Lav R. Varshney
Lav R. Varshney University of Illinois at Urbana-Champaign
Cédric Févotte
Cédric Févotte Toulouse Institute of Computer Science Research
Ashish Khisti
Ashish Khisti University of Toronto
Jiashi Feng
Jiashi Feng ByteDance

External Links

Personal website of Vincent Y. F. Tan

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 in the USA opens up a variety of high-demand fields and flexible learning options. Many students are interested in finding an affordable data science degree that delivers real value without burdening them with excessive debt. These programs often offer online and part-time formats to fit busy schedules.

If you’re considering a technical focus, an online bachelor’s in electrical engineering can be a great pathway. These degrees offer strong job outlooks and robust salary potential, particularly in fields like hardware, communications, and renewable energy.

For those seeking faster entry into tech, look at 3-month certificate programs that pay well. These short credentials can boost your resume and give you the skills needed for well-compensated roles in areas like IT support, cybersecurity, and data analytics.

If you already have a bachelor’s, it’s worth considering the quickest cheapest masters degree to accelerate your career advancement. Fast-track master’s programs allow you to specialize and increase your earning potential in less time.

Best Scientists Citing Vincent Y. F. Tan

Adnan Custovic

Adnan Custovic

Imperial College London

Publications: 55

Zabrina L. Brumme

Zabrina L. Brumme

Simon Fraser University

Publications: 44

Masahito Hayashi

Masahito Hayashi

Chinese University of Hong Kong, Shenzhen

Publications: 43

Bruce D. Walker

Bruce D. Walker

Harvard University

Publications: 43

Marco Tomamichel

Marco Tomamichel

National University of Singapore

Publications: 39

Philip J. R. Goulder

Philip J. R. Goulder

University of Oxford

Publications: 36

Jonathan M. Carlson

Jonathan M. Carlson

Microsoft (United States)

Publications: 35

Angela Simpson

Angela Simpson

University of Manchester

Publications: 32

Mark M. Wilde

Mark M. Wilde

Cornell University

Publications: 29

Gad Getz

Gad Getz

Broad Institute

Publications: 26

Anima Anandkumar

Anima Anandkumar

Nvidia (United Kingdom)

Publications: 25

Mary Carrington

Mary Carrington

Ragon Institute of MGH, MIT and Harvard

Publications: 23

Giuseppe Durisi

Giuseppe Durisi

Chalmers University of Technology

Publications: 23

Jocelyne Just

Jocelyne Just

Hôpital Armand-Trousseau

Publications: 23

Thumbi Ndung'u

Thumbi Ndung'u

University of KwaZulu-Natal

Publications: 22

H. Vincent Poor

H. Vincent Poor

Princeton University

Publications: 22

Trending Scientists

Wenhui Su

Wenhui Su

Harbin Institute of Technology

Carl J. Bernacchi

Carl J. Bernacchi

University of Illinois at Urbana-Champaign

Eileen White

Eileen White

Rutgers, The State University of New Jersey

Markus Pollnau

Markus Pollnau

University of Surrey

Suzanne M. Miller

Suzanne M. Miller

Fox Chase Cancer Center

Ken C. Winters

Ken C. Winters

Oregon Research Institute

Rik Ossenkoppele

Rik Ossenkoppele

Lund University

Christian Sorg

Christian Sorg

Technical University of Munich

Abraham J. Susswein

Abraham J. Susswein

Bar-Ilan University

Gian-Kasper Plattner

Gian-Kasper Plattner

Swiss Federal Institute for Forest, Snow and Landscape Research

William B. Kiosses

William B. Kiosses

La Jolla Institute For Allergy & Immunology

Lixin Xiao

Lixin Xiao

Peking University

Srinivasan Keshav

Srinivasan Keshav

University of Cambridge

Marcus Mietzner

Marcus Mietzner

Australian National University

Peter Bárány

Peter Bárány

Karolinska Institute

Michelle Waycott

Michelle Waycott

University of Adelaide

Related Computer Science Rankings & Guides

2027 How to Become a Digital Forensic Investigator: Salary & Career Paths

2027 How to Become a Digital Forensic Investigator: Salary & Career Paths
2027 Most Affordable Online CompTIA Network+ Training Bootcamps

2027 Most Affordable Online CompTIA Network+ Training Bootcamps
2027 Do Employers Pay for Software Engineering Degrees: Tuition Reimbursement and Sponsorship Options

2027 Do Employers Pay for Software Engineering Degrees: Tuition Reimbursement and Sponsorship Options
2027 Best Master’s Degree Programs in Data Analytics

2027 Best Master’s Degree Programs in Data Analytics
2027 Online Game Design Degree Programs Costs: Tuition & Fees

2027 Online Game Design Degree Programs Costs: Tuition & Fees
2027 Which Schools Offer Flexible Start-Anytime Enrollment for an Information Technology Program?

2027 Which Schools Offer Flexible Start-Anytime Enrollment for an Information Technology Program?
2027 Self-Paced Online Information Security Degree Master's Programs

2027 Self-Paced Online Information Security Degree Master's Programs
2027 Easiest Tech Degree Programs

2027 Easiest Tech Degree Programs
2027 Most Affordable Online Data Analytics Degree Programs

2027 Most Affordable Online Data Analytics Degree Programs
2027 What Can You Do With a Master's Degree in Artificial Intelligence?

2027 What Can You Do With a Master's Degree in Artificial Intelligence?
2026 Best Data Science Degree Programs Ranking in the USA

2026 Best Data Science Degree Programs Ranking in the USA
2027 Universities Offering Online Blockchain, Cryptocurrency and FinTech Education

2027 Universities Offering Online Blockchain, Cryptocurrency and FinTech Education
Most Affordable Cybersecurity Associate Degree Programs - Budget-Friendly Cybersecurity Schools in Virginia for 2026

Most Affordable Cybersecurity Associate Degree Programs - Budget-Friendly Cybersecurity Schools in Virginia for 2026
2027 Most Affordable Online Software Engineering Degrees

2027 Most Affordable Online Software Engineering Degrees
2027 Cheapest Online Artificial Intelligence Master's Degrees That Pay Well: Tuition, Duration, and Earnings

2027 Cheapest Online Artificial Intelligence Master's Degrees That Pay Well: Tuition, Duration, and Earnings
2027 Is Demand for Analytics Degree Graduates Growing or Declining?

2027 Is Demand for Analytics Degree Graduates Growing or Declining?
2027 Best Data Science Degrees for Working Adults

2027 Best Data Science Degrees for Working Adults
2027 Easiest Online Data Analytics Master's Degree Programs That Pay Well: High-Salary Degrees with Simple Admissions

2027 Easiest Online Data Analytics Master's Degree Programs That Pay Well: High-Salary Degrees with Simple Admissions
2027 Most Popular Concentrations in Artificial Intelligence Degrees

2027 Most Popular Concentrations in Artificial Intelligence Degrees
2027 Best Online Master’s Degree Programs in Data Analytics

2027 Best Online Master’s Degree Programs in Data Analytics
2027 How Long Does It Take to Earn an Online Software Engineering Degree?

2027 How Long Does It Take to Earn an Online Software Engineering Degree?

Recently Published Articles

2027 Can You Get Into a Sustainability Program with a Low GPA? Admission Chances & Workarounds

2027 Can You Get Into a Sustainability Program with a Low GPA? Admission Chances & Workarounds
2027 Best Accredited Online Social Work Bachelor's Degree Programs

2027 Best Accredited Online Social Work Bachelor's Degree Programs
2027 Best Online Master’s Degree in Intelligence Programs

2027 Best Online Master’s Degree in Intelligence Programs
2027 Top 15 Hardest College Majors by GPA & Other Factors

2027 Top 15 Hardest College Majors by GPA & Other Factors
2027 Forensic Science Careers: Guide to Career Paths, Options & Salary

2027 Forensic Science Careers: Guide to Career Paths, Options & Salary
2027 No-Exam Online Social Work Master's Degrees: Schools, Costs & Outcomes

2027 No-Exam Online Social Work Master's Degrees: Schools, Costs & Outcomes
2027 Shortest Online Family Nurse Practitioner Degree Master's Programs That Pay Well: Cost, Time to Completion, and Salary Outlook

2027 Shortest Online Family Nurse Practitioner Degree Master's Programs That Pay Well: Cost, Time to Completion, and Salary Outlook
2027 Highest-Paying Jobs with a Liberal Arts Master's Degree

2027 Highest-Paying Jobs with a Liberal Arts Master's Degree
2027 How to Become a BCBA in Tampa, FL: Education Requirements & Certification

2027 How to Become a BCBA in Tampa, FL: Education Requirements & Certification
2027 How to Become a Crime Laboratory Analyst

2027 How to Become a Crime Laboratory Analyst
2027 Online Human Services Master's Degree Program Costs: Tuition & Fees

2027 Online Human Services Master's Degree Program Costs: Tuition & Fees
2027 Associate to Bachelor's in Hospitality Management & Tourism: Transfer Pathways Explained

2027 Associate to Bachelor's in Hospitality Management & Tourism: Transfer Pathways Explained
2027 What Can I Do With an Associate's in Computer Science?

2027 What Can I Do With an Associate's in Computer Science?
2027 Online Environmental Science Master's Programs With No Application Fee

2027 Online Environmental Science Master's Programs With No Application Fee
2027 Most Affordable AACSB Online MBA Degree Programs

2027 Most Affordable AACSB Online MBA Degree Programs
2027 How Many Credits Can You Transfer into a Family Nurse Practitioner Degree Master's Program?

2027 How Many Credits Can You Transfer into a Family Nurse Practitioner Degree Master's Program?
2027 Respiratory Care Therapy Degree Jobs That Do Not Require Licensure

2027 Respiratory Care Therapy Degree Jobs That Do Not Require Licensure
2027 Most Affordable Online MBA – No GMAT Required

2027 Most Affordable Online MBA – No GMAT Required
2027 Work Experience Requirements for Human Services Degree Programs

2027 Work Experience Requirements for Human Services Degree Programs
2027 How Fast Can You Get a Health Informatics Degree Online?

2027 How Fast Can You Get a Health Informatics Degree Online?
2027 Best ADN Nursing Programs in Oregon: Online & Campus

2027 Best ADN Nursing Programs in Oregon: Online & Campus