World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
5925
World Ranking
8514
National Ranking
419

Jürgen Giesl 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 Jürgen Giesl 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: 171 publications — 35th percentile

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

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

Jürgen Giesl 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 Jürgen Giesl 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: 42 D-Index — 43rd percentile

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

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

Overview

Jürgen Giesl is affiliated with RWTH Aachen University in Germany, where their work primarily focuses on the field of Computer Science. Their research spans multiple subfields including Artificial Intelligence, Computational Theory and Mathematics, Software, Information Systems, and Hardware and Architecture.

The main topics covered in their research include Formal Methods in Verification, Logic, Programming, and Type Systems, Software Testing and Debugging Techniques, Natural Language Processing Techniques, Semantic Web and Ontologies, Software Engineering Research, and Software Reliability and Analysis Research.

Jürgen Giesl has contributed to a range of recent publications. Notable papers include:

  • Polynomial Loops: Beyond Termination (2020, EPiC series in computing)
  • Termination of triangular polynomial loops (2023, Formal Methods in System Design)
  • A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (2023, arXiv, Cornell University)
  • Integrating Loop Acceleration into Bounded Model Checking (2024, arXiv, Cornell University)
  • Proving Non-Termination by Acceleration Driven Clause Learning (2023, arXiv, Cornell University)

Their frequent collaborators include Florian Frohn, Jan-Christoph Kassing, Nils Lommen, Marcel Hark, and Jera Hensel. These coauthors contribute to a significant number of joint publications, indicating ongoing research partnerships.

Jürgen Giesl's work is often published in well-regarded venues, with the majority of publications appearing in arXiv (Cornell University). Other publication venues include EPiC series in computing, Formal Methods in System Design, RWTH Publications (RWTH Aachen), and Zenodo (CERN European Organization for Nuclear Research).

Best Publications

  • Termination of term rewriting using dependency pairs

    Thomas Arts;Jürgen Giesl

  • AProVE 1.2: automatic termination proofs in the dependency pair framework

    Jürgen Giesl;Peter Schneider-Kamp;René Thiemann

  • Mechanizing and Improving Dependency Pairs

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke

  • The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp

  • Automated Termination Proofs with AProVE

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp;Stephan Falke

  • SAT solving for termination analysis with polynomial interpretations

    Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp

  • Analyzing Program Termination and Complexity Automatically with AProVE

    Jürgen Giesl;Cornelius Aschermann;Marc Brockschmidt;Fabian Emmes

  • Proving and disproving termination of higher-order functions

    Jürgen Giesl;René Thiemann;Peter Schneider-Kamp

  • Proving Termination of Programs Automatically with AProVE

    Jürgen Giesl;Marc Brockschmidt;Fabian Emmes;Florian Frohn

  • Modular Termination Proofs for Rewriting Using Dependency Pairs

    Jürgen Giesl;Thomas Arts;Enno Ohlebusch

  • Automated termination proofs for haskell by term rewriting

    Jürgen Giesl;Matthias Raffelsieper;Peter Schneider-Kamp;Stephan Swiderski

  • Automated termination analysis for Haskell: from term rewriting to programming languages

    Jürgen Giesl;Stephan Swiderski;Peter Schneider-Kamp;René Thiemann

  • Analyzing Runtime and Size Complexity of Integer Programs

    Marc Brockschmidt;Fabian Emmes;Stephan Falke;Carsten Fuhs

  • Automated Termination Analysis of Java Bytecode by Term Rewriting

    Carsten Otto;Marc Brockschmidt;Christian von Essen;Jürgen Giesl

  • Automatically Proving Termination Where Simplification Orderings Fail

    Thomas Arts;Jürgen Giesl

  • Alternating runtime and size complexity analysis of integer programs

    Marc Brockschmidt;Fabian Emmes;Stephan Falke;Carsten Fuhs

  • Transformation techniques for context-sensitive rewrite systems

    Jürgen Giesl;Aart Middeldorp

  • Generating Polynomial Orderings for Termination Proofs

    Jürgen Giesl

  • Termination of Nested and Mutually Recursive Algorithms

    Jürgen Giesl

  • Verification of Erlang Processes by Dependency Pairs

    Jürgen Giesl;Thomas Arts

  • Automatic Termination Proofs in the Dependency Pair Framework.

    Jürgen Giesl;Peter Schneider-Kamp;René Thiemann

Frequent Co-Authors

Marc Brockschmidt
Marc Brockschmidt Google (United States)
Michael Codish
Michael Codish Ben-Gurion University of the Negev
Aart Middeldorp
Aart Middeldorp University of Innsbruck
Reiner Hähnle
Reiner Hähnle Technical University of Darmstadt
Alexander Serebrenik
Alexander Serebrenik Eindhoven University of Technology
Deepak Kapur
Deepak Kapur University of New Mexico
Tobias Nipkow
Tobias Nipkow Technical University of Munich
Thomas Ball
Thomas Ball Microsoft (United States)
Joost-Pieter Katoen
Joost-Pieter Katoen RWTH Aachen University
Franz Baader
Franz Baader TU Dresden

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

As computer science continues to evolve, numerous online degrees offer flexible options for advancing your education and career. Earning credentials from one of the highly accredited online universities can provide a solid foundation recognized by employers nationwide.

For those interested in creative and technical fields, pursuing a game design masters online can open doors to roles in game development, animation, and interactive media. Alternatively, students keen on digital security can explore a cyber security bachelor degree online, addressing the growing demand for information security professionals.

Expanding further, some interdisciplinary pathways such as construction degrees also incorporate elements of technology, project management, and data analysis—skillsets highly valued in today’s technology-driven world.

These related online programs are not only versatile but also affordable, making them accessible to a broad range of students seeking specialized, in-demand skills in the digital age.

Best Scientists Citing Jürgen Giesl

Trending Scientists

Recently Published Articles