Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Helmut Seidl
Observed names:
H Seidl,
H. Seidl,
HELMUT SEIDL,
Seidl Helmut,
Seidl, Helmut
Institution:
Technical University of Munich
Observed institutions:
Goethe University Frankfurt,
The University of Sydney,
Technical University of Munich,
Ludwig-Maximilians-Universität München,
Universität Trier,
Saarland University
show all 6
ORCID:
0000-0002-2135-1593
Observed ORCID:
0000-0002-2135-1593
OpenAlex ID:
A5080676686
Precise interprocedural analysis through linear algebra
2004
·
Markus Müller-Olm
, Helmut Seidl
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
184
Deciding Equivalence of Finite Tree Automata
1990
·
Helmut Seidl
·
SIAM Journal on Computing
·
155
Exact XML Type Checking in Polynomial Time
2006
·
Sebastian Maneth
, Thomas Perst
, et al.
·
Lecture notes in computer science
·
144
XML type checking with macro tree transducers
2005
·
S. Maneth
, A. Berlea
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
124
Computing polynomial program invariants
2004
·
Markus Müller-Olm
, Helmut Seidl
·
Information Processing Letters
·
113
On the degree of ambiguity of finite automata
1991
·
Andreas Weber
, Helmut Seidl
·
Theoretical Computer Science
·
111
Static race detection for device drivers: the Goblint approach
2016
·
Vesal Vojdani
, Kalmer Apinis
, et al.
·
IEEE/ACM International Conference on Automated Software Engineering (ASE)
·
101
On the Complexity of Equational Horn Clauses
2005
·
Kumar Neeraj Verma
, Helmut Seidl
, et al.
·
Lecture notes in computer science
·
101
Counting in Trees for Free
2004
·
Helmut Seidl
, Thomas Schwentick
, et al.
·
Lecture notes in computer science
·
92
Haskell overloading is DEXPTIME-complete
1994
·
Helmut Seidl
·
Information Processing Letters
·
88
A Note on Karr’s Algorithm
2004
·
Markus Müller-Olm
, Helmut Seidl
·
Lecture notes in computer science
·
86
Locating Matches of Tree Patterns in Forests
1998
·
Andreas Neumann
, Helmut Seidl
·
Lecture notes in computer science
·
86
Precise Fixpoint Computation Through Strategy Iteration
2007
·
Thomas Gawlitza
, Helmut Seidl
·
Lecture notes in computer science
·
83
PDF
Analysis of modular arithmetic
2007
·
Markus Müller-Olm
, Helmut Seidl
·
ACM Transactions on Programming Languages and Systems
·
79
PDF
Numerical document queries
2003
·
Helmut Seidl
, Thomas Schwentick
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
73
Macro forest transducers
2003
·
Thomas Perst
, Helmut Seidl
·
Information Processing Letters
·
67
Infinite-state high-level MSCs: Model-checking and realizability
2005
·
Blaise Genest
, Anca Muscholl
, et al.
·
Journal of Computer and System Sciences
·
64
Fast and simple nested fixpoints
1996
·
Helmut Seidl
·
Information Processing Letters
·
60
Model Checking Information Flow in Reactive Systems
2012
·
Rayna Dimitrova
, Bernd Finkbeiner
, et al.
·
Lecture notes in computer science
·
58
A succinct solver for ALFP
2002
·
Flemming Nielson
, Hanne Riis Nielson
, et al.
·
54
Analysis of Modular Arithmetic
2005
·
Markus Müller-Olm
, Helmut Seidl
·
Lecture notes in computer science
·
52
Precise Relational Invariants Through Strategy Iteration
2007
·
Thomas Gawlitza
, Helmut Seidl
·
Lecture notes in computer science
·
49
Precise interprocedural analysis through linear algebra
2004
·
Markus Müller-Olm
, Helmut Seidl
·
ACM SIGPLAN Notices
·
48
A faster solver for general systems of equations
1999
·
Christian Fecht
, Helmut Seidl
·
Science of Computer Programming
·
48
PDF
Tree automata for code selection
1994
·
Christian Ferdinand
, Helmut Seidl
, et al.
·
Acta Informatica
·
46
Show more works
View as search
Works count:
307
Citation count:
4,482
H-index:
34
I10-index:
110
Year
Topic
Type
