World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
4826
World Ranking
11754
National Ranking
580

Overview

Helmut Seidl is affiliated with the Technical University of Munich in Germany and has a research profile focused on Computer Science, with particular attention to its subfields of Computational Theory and Mathematics, Artificial Intelligence, Software, Hardware and Architecture, and Information Systems.

Their recent publications cover a range of topics and include:

  • Three improvements to the top-down solver, 2021, published in Mathematical Structures in Computer Science
  • Non-numerical weakly relational domains, 2024, published in International Journal on Software Tools for Technology Transfer

Seidl's work is associated with notable publication venues, including:

  • arXiv (Cornell University)
  • International Journal on Software Tools for Technology Transfer
  • Lecture notes in computer science
  • Information Processing Letters
  • Mathematical Structures in Computer Science

Their research topics cover multiple areas, such as:

  • Formal Methods in Verification
  • Logic, programming, and type systems
  • Semigroups and automata theory
  • Software Testing and Debugging Techniques
  • Parallel Computing and Optimization Techniques
  • Security and Verification in Computing
  • Software Engineering Research

Helmut Seidl has collaborated frequently with several co-authors, including Michael Schwarz, Julian Erhard, Sarah Tilscher, Simmo Saan, and Vesal Vojdani.

Additionally, Helmut Seidl contributed to book publications, including a work released by Springer Science+Business Media titled Developments in Language Theory in 2022.

Best Publications

  • Precise interprocedural analysis through linear algebra

    Markus Müller-Olm;Helmut Seidl

  • Deciding equivalence of finite tree automata

    Helmut Seidl

  • On the complexity of equational horn clauses

    Kumar Neeraj Vermal;Helmut Seidl;Thomas Schwentick

  • Exact XML Type Checking in Polynomial Time

    Sebastian Maneth;Thomas Perst;Helmut Seidl

  • On the complexity of equational horn clauses

    Kumar Neeraj Verma;Helmut Seidl;Thomas Schwentick

  • XML type checking with macro tree transducers

    S. Maneth;A. Berlea;T. Perst;H. Seidl

  • Computing polynomial program invariants

    Markus Müller-Olm;Helmut Seidl

  • On the degree of ambiguity of finite automata

    Andreas Weber;Helmut Seidl

  • Counting in Trees for Free

    Helmut Seidl;Thomas Schwentick;Anca Muscholl;Peter Habermehl

  • Haskell overloading is DEXPTIME-complete

    Helmut Seidl

  • Locating Matches of Tree Patterns in Forests

    Andreas Neumann;Helmut Seidl

  • A Note on Karr’s Algorithm

    Markus Müller-Olm;Helmut Seidl

  • Precise fixpoint computation through strategy iteration

    Thomas Gawlitza;Helmut Seidl

  • Macro forest transducers

    Thomas Perst;Helmut Seidl

  • Numerical document queries

    Helmut Seidl;Thomas Schwentick;Anca Muscholl

  • A succinct solver for ALFP

    Flemming Nielson;Hanne Riis Nielson;Helmut Seidl

  • Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems

    Christian Fecht;Helmut Seidl

  • Model checking information flow in reactive systems

    Rayna Dimitrova;Bernd Finkbeiner;Máté Kovács;Markus N. Rabe

  • Analysis of modular arithmetic

    Markus Müller-Olm;Helmut Seidl

  • Tree automata for code selection

    Christian Ferdinand;Helmut Seidl;Reinhard Wilhelm

Frequent Co-Authors

Reinhard Wilhelm
Reinhard Wilhelm Saarland University
Bernd Finkbeiner
Bernd Finkbeiner Saarland University
Flemming Nielson
Flemming Nielson Technical University of Denmark
Hanne Riis Nielson
Hanne Riis Nielson Technical University of Denmark
Thomas Schwentick
Thomas Schwentick TU Dortmund University
Joost Engelfriet
Joost Engelfriet Leiden University
Bernhard Steffen
Bernhard Steffen TU Dortmund University
Martin Hofmann
Martin Hofmann Ludwig-Maximilians-Universität München
Aditya V. Nori
Aditya V. Nori Microsoft (United States)
Martin Leucker
Martin Leucker University of Lübeck

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 diverse career pathways and complementary credentials. Many students opt to enhance their qualifications with flexible, online education options. For those with leadership ambitions, pursuing affordable online executive mba programs can provide vital business management skills that pair well with technical expertise.

Interested in information management or research? A library science degree delves into organizing, preserving, and accessing digital knowledge—highly valued in today’s tech-driven world.

There’s also a growing range of affordable master's degrees online across technology, business, and data analysis disciplines. These programs offer the flexibility to learn at your own pace and tailor your studies to emerging fields.

For those aiming for senior leadership or academic roles, consider a phd organizational leadership. This doctorate prepares graduates for high-level strategy and research positions, which complement advanced tech credentials.

Best Scientists Citing Helmut Seidl

Trending Scientists