World's Best Scientists 2026 revealed!
Nathan R. Sturtevant

Nathan R. Sturtevant

D-Index & Metrics

Computer Science

D-Index
35
Citations
6679
World Ranking
11545
National Ranking
451

Nathan R. Sturtevant 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 Nathan R. Sturtevant 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: 215 publications — 52nd percentile

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

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

Nathan R. Sturtevant 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 Nathan R. Sturtevant 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: 35 D-Index — 20th percentile

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

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

Overview

Nathan R. Sturtevant is a researcher affiliated with the University of Alberta in Canada. Their work primarily spans the field of Computer Science, with a significant focus on Artificial Intelligence and related subfields.

The main subfields of study in which Nathan R. Sturtevant has contributed include:

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Sociology and Political Science

The researcher's work covers several core topics within these areas, such as:

  • Robotic Path Planning Algorithms
  • Artificial Intelligence in Games
  • AI-based Problem Solving and Planning
  • Constraint Satisfaction and Optimization
  • Metaheuristic Optimization Algorithms Research
  • Optimization and Search Problems
  • Data Management and Algorithms

Nathan R. Sturtevant has authored numerous papers, with recent publications including:

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks (2021), Proceedings of the International Symposium on Combinatorial Search
  • Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges (2021), Proceedings of the International Symposium on Combinatorial Search
  • Conflict-Based Search For Optimal Multi-Agent Path Finding (2021), Proceedings of the AAAI Conference on Artificial Intelligence
  • Conflict-Based Search for Optimal Multi-Agent Path Finding (2021), Proceedings of the International Symposium on Combinatorial Search
  • A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding (2021), Proceedings of the International Symposium on Combinatorial Search

Frequent collaborators in their research include:

  • Ariel Felner
  • Shahaf Shperberg
  • Matthew Guzdial
  • Guni Sharon
  • Roni Stern

Nathan R. Sturtevant regularly publishes in venues such as:

  • Proceedings of the International Symposium on Combinatorial Search
  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Proceedings of the AAAI Conference on Artificial Intelligence

Best Publications

  • Conflict-based search for optimal multi-agent pathfinding

    Guni Sharon;Roni Stern;Ariel Felner;Nathan R. Sturtevant

  • Benchmarks for Grid-Based Pathfinding

    N. R. Sturtevant

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan R. Sturtevant;Ariel Felner;Sven Koenig

  • An Analysis of UCT in Multi-player Games

    Nathan R. Sturtevant

  • Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

    Roni Stern;Nathan Sturtevant;Ariel Felner;Sven Koenig

  • Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges

    Ariel Felner;Roni Stern;Solomon Eyal Shimony;Eli Boyarski

  • Partial pathfinding using map abstraction and refinement

    Nathan Sturtevant;Michael Buro

  • Enhanced partial expansion A

    Meir Goldenberg;Ariel Felner;Roni Stern;Guni Sharon

  • Understanding the success of perfect information monte carlo sampling in game tree search

    Jeffrey Long;Nathan R. Sturtevant;Michael Buro;Timothy Furtak

  • Memory-based heuristics for explicit state spaces

    Nathan R. Sturtevant;Ariel Felner;Max Barrer;Jonathan Schaeffer

  • Graph abstraction in real-time heuristic search

    Vadim Bulitko;Nathan Sturtevant;Jieshan Lu;Timothy Yau

  • On Pruning Techniques for Multi-Player Games

    Nathan R. Sturtevant;Richard E. Korf

  • Conflict-based search for optimal multi-agent path finding

    Guni Sharon;Roni Stern;Ariel Felner;Nathan Sturtevant

  • Improving state evaluation, inference, and search in trick-based card games

    Michael Buro;Jeffrey R. Long;Timothy Furtak;Nathan Sturtevant

  • Memory-efficient abstractions for pathfinding

    Nathan R. Sturtevant

  • A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding

    Mokhtar M. Khorshid;Robert C. Holte;Nathan R. Sturtevant

  • Partial-expansion A* with selective node generation

    Ariel Felner;Meir Goldenberg;Guni Sharon;Roni Stern

  • Improving collaborative pathfinding using map abstraction

    Nathan Sturtevant;Michael Buro

  • Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding

    Guni Sharon;Roni Stern;Ariel Felner;Nathan R. Sturtevant

  • Feature construction for reinforcement learning in hearts

    Nathan R. Sturtevant;Adam M. White

  • A* search with inconsistent heuristics

    Zhifu Zhang;Nathan R. Sturtevant;Robert Holte;Jonathan Schaeffer

Frequent Co-Authors

Ariel Felner
Ariel Felner Ben-Gurion University of the Negev
Jonathan Schaeffer
Jonathan Schaeffer University of Alberta
Robert C. Holte
Robert C. Holte University of Alberta
Roni Stern
Roni Stern Ben-Gurion University of the Negev
Sven Koenig
Sven Koenig University of Southern California
Malte Helmert
Malte Helmert University of Basel
Michael Bowling
Michael Bowling University of Alberta
Richard E. Korf
Richard E. Korf University of California, Los Angeles
Jeffrey S. Rosenschein
Jeffrey S. Rosenschein Hebrew University of Jerusalem
Julian Togelius
Julian Togelius New York 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

Exploring online degrees in Computer Science opens a diverse range of pathways for students and professionals in the USA. Many learners begin with an associate's degree online, which offers a flexible and affordable entry point to foundational skills and knowledge. These programs are ideal for those wanting to join the workforce quickly or transfer to a bachelor’s program later.

For those seeking career advancement, a key consideration is choosing what masters program should i do. Selecting a degree aligned with high-demand fields—like data science, cybersecurity, or software engineering—helps maximize both earning potential and job security.

Some students want to graduate faster and save time. If speed is a priority, looking into the fastest online master's degree options can be beneficial. Accelerated formats make it possible to earn a reputable credential in just 12–18 months.

Additionally, for those wanting quicker entry into the IT job market, there are easy licenses and certifications to get that pay well and complement a formal degree. These credentials can help students and professionals stand out and access specialized tech roles.

Best Scientists Citing Nathan R. Sturtevant

Trending Scientists

Recently Published Articles