What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Operating system
Helmut Seidl mainly investigates Algorithm, Discrete mathematics, Theoretical computer science, Decidability and Tree automaton.
Helmut Seidl has included themes like Type inference, Affine transformation, System of linear equations, Multiplication and Integer in his Algorithm study.
His research in Discrete mathematics intersects with topics in Fixed point, Combinatorics, Symmetric polynomial, Bracket polynomial and Automata theory.
His Theoretical computer science research integrates issues from Programming language, Fragment, Macro, XML and Transformation.
His work deals with themes such as Satisfiability and Model checking, which intersect with Decidability.
His Tree automaton research is multidisciplinary, incorporating elements of Time complexity and Regular language.
His most cited work include:
- Precise interprocedural analysis through linear algebra (160 citations)
- Exact XML Type Checking in Polynomial Time (140 citations)
- Deciding equivalence of finite tree automata (128 citations)
What are the main themes of his work throughout his whole career to date?
Helmut Seidl mainly focuses on Discrete mathematics, Theoretical computer science, Algorithm, Decidability and Time complexity.
His Discrete mathematics research includes elements of Bounded function, Horn clause, Tree automaton and Combinatorics.
His Theoretical computer science study combines topics from a wide range of disciplines, such as Tree, Programming language and Program analysis.
His Algorithm research is multidisciplinary, relying on both Control flow analysis, Fixed point, Static analysis and Affine transformation.
The study incorporates disciplines such as Satisfiability, Model checking, Tree and Invariant in addition to Decidability.
Helmut Seidl focuses mostly in the field of Time complexity, narrowing it down to topics relating to Macro and, in certain cases, Type inference.
He most often published in these fields:
- Discrete mathematics (30.29%)
- Theoretical computer science (22.12%)
- Algorithm (20.19%)
What were the highlights of his more recent work (between 2013-2021)?
- Decidability (20.19%)
- Time complexity (18.75%)
- Discrete mathematics (30.29%)
In recent papers he was focusing on the following fields of study:
Decidability, Time complexity, Discrete mathematics, Algorithm and Fixed point are his primary areas of study.
Decidability is a subfield of Theoretical computer science that Helmut Seidl investigates.
Time complexity is a subfield of Combinatorics that he tackles.
His Discrete mathematics research includes themes of Combinatorics on words and Algebra.
The Transition system research Helmut Seidl does as part of his general Algorithm study is frequently linked to other disciplines of science, such as Parametric process, therefore creating a link between diverse domains of science.
In his study, Operator and Monotonic function is inextricably linked to System of linear equations, which falls within the broad field of Fixed point.
Between 2013 and 2021, his most popular works were:
- Static race detection for device drivers: the Goblint approach (19 citations)
- Efficiently intertwining widening and narrowing (17 citations)
- Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable (12 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Algebra
Helmut Seidl spends much of his time researching Decidability, Algorithm, Fixed point, System of linear equations and Static analysis.
His Decidability study is focused on Discrete mathematics in general.
His research integrates issues of Global variable, Local variable and Spawn in his study of Algorithm.
Helmut Seidl combines subjects such as Operator and Monotonic function with his study of System of linear equations.
He interconnects Debugging, Abstract interpretation, Solver, Server and Data structure in the investigation of issues within Static analysis.
His Time complexity study combines topics in areas such as Polynomial, Matrix polynomial, Predicate transformer semantics and State.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
