The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Helmut Seidl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Neumann, Helmut Seidl
    Locating Matches of Tree Patterns in Forests. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1998, pp:134-145 [Conf]
  2. Helmut Seidl
    Deciding Equivalence of Finite Tree Automata. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:424-437 [Journal]
  3. Christoph W. Keßler, Helmut Seidl
    Language Support for Synchronous Parallel Critical Sections. [Citation Graph (0, 0)][DBLP]
    APDC, 1997, pp:92-99 [Conf]
  4. Peter Ziewer, Helmut Seidl
    Transparent teleteaching. [Citation Graph (0, 0)][DBLP]
    ASCILITE, 2002, pp:749-758 [Conf]
  5. Helmut Seidl
    Parameter-Reduction of Higher Level Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:52-71 [Conf]
  6. Helmut Seidl
    Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:269-284 [Conf]
  7. Helmut Seidl
    Finite Tree Automata with Cost Functions. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:279-299 [Conf]
  8. Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
    On the Complexity of Equational Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:337-352 [Conf]
  9. Helmut Seidl, Andreas Neumann
    On Guarding Nested Fixpoints. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:484-498 [Conf]
  10. Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm
    Tree Automata for Code Selection. [Citation Graph (0, 0)][DBLP]
    Code Generation, 1991, pp:30-50 [Conf]
  11. Peter Ziewer, Helmut Seidl
    Annotiertes Lecture Recording. [Citation Graph (0, 0)][DBLP]
    DeLFI, 2004, pp:43-54 [Conf]
  12. Christian Fecht, Helmut Seidl
    Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. [Citation Graph (0, 0)][DBLP]
    ESOP, 1998, pp:90-104 [Conf]
  13. Markus Müller-Olm, Helmut Seidl
    Analysis of Modular Arithmetic. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:46-60 [Conf]
  14. Markus Müller-Olm, Helmut Seidl, Bernhard Steffen
    Interprocedural Herbrand Equalities. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:31-45 [Conf]
  15. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Automatic Complexity Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2002, pp:243-261 [Conf]
  16. Flemming Nielson, Helmut Seidl
    Control-Flow Analysis in Cubic Time. [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:252-268 [Conf]
  17. Helmut Seidl
    Integer Constraints to Stop Deforestation. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:326-340 [Conf]
  18. Helmut Seidl, Bernhard Steffen
    Constraint-Based Inter-Procedural Analysis of Parallel Programs. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:351-365 [Conf]
  19. Alexandru Berlea, Helmut Seidl
    Binary Queries. [Citation Graph (0, 0)][DBLP]
    Extreme Markup Languages®, 2002, pp:- [Conf]
  20. Thomas Perst, Helmut Seidl
    A Type-safe Macro System for XML. [Citation Graph (0, 0)][DBLP]
    Extreme Markup Languages®, 2002, pp:- [Conf]
  21. Helmut Seidl
    A quadratic regularity test for non-deleting macro S grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:422-430 [Conf]
  22. Helmut Seidl
    On the Finite Degree of Ambiguity of Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:395-404 [Conf]
  23. Valérie Gouranton, Pierre Réty, Helmut Seidl
    Synchronized Tree Languages Revisited and New Applications. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:214-229 [Conf]
  24. Christoph W. Keßler, Helmut Seidl
    ForkLight: A Control-Synchronous Parallel Programming Language. [Citation Graph (0, 0)][DBLP]
    HPCN Europe, 1999, pp:525-534 [Conf]
  25. Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
    Infinite-State High-Level MSCs: Model-Checking and Realizability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:657-668 [Conf]
  26. Markus Müller-Olm, Helmut Seidl
    A Note on Karr's Algorithm. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1016-1028 [Conf]
  27. Helmut Seidl
    Least Solutions of Equations over N. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:400-411 [Conf]
  28. Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
    Counting in Trees for Free. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1136-1149 [Conf]
  29. Sebastian Maneth, Thomas Perst, Helmut Seidl
    Exact XML Type Checking in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    ICDT, 2007, pp:254-268 [Conf]
  30. Andreas Goerdt, Helmut Seidl
    Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:148-158 [Conf]
  31. Helmut Seidl
    A Modal Mu-Calculus for Durational Transition Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:128-137 [Conf]
  32. Markus Müller-Olm, Helmut Seidl
    A Generic Framework for Interprocedural Analyses of Numerical Properties. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:432-432 [Conf]
  33. Helmut Seidl, Kumar Neeraj Verma
    Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:79-94 [Conf]
  34. Andreas Weber, Helmut Seidl
    On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:620-629 [Conf]
  35. Torben Hagerup, Arno Schmitt, Helmut Seidl
    FORK: A High-Level Language for PRAMs. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:304-320 [Conf]
  36. Sebastian Maneth, Helmut Seidl
    Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    PLAN-X, 2007, pp:73-79 [Conf]
  37. Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl
    XML type checking with macro tree transducers. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:283-294 [Conf]
  38. Helmut Seidl, Thomas Schwentick, Anca Muscholl
    Numerical document queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:155-166 [Conf]
  39. Markus Müller-Olm, Helmut Seidl
    Precise interprocedural analysis through linear algebra. [Citation Graph (0, 0)][DBLP]
    POPL, 2004, pp:330-341 [Conf]
  40. Helmut Seidl, Morten Heine Sørensen
    Constraints to Stop Higher-Order Deforestation. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:400-413 [Conf]
  41. Sébastien Limet, Pierre Réty, Helmut Seidl
    Weakly Regular Relations and Applications. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:185-200 [Conf]
  42. Christian Fecht, Helmut Seidl
    An Even Faster Solver for General Systems of Equations. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:189-204 [Conf]
  43. Markus Müller-Olm, Helmut Seidl
    Polynomial Constants Are Decidable. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:4-19 [Conf]
  44. Markus Müller-Olm, Helmut Seidl
    A Generic Framework for Interprocedural Analysis of Numerical Properties. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:235-250 [Conf]
  45. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:20-35 [Conf]
  46. Helmut Seidl, Christian Fecht
    Disjuntive Completion Is Not "Optimal". [Citation Graph (0, 0)][DBLP]
    ILPS, 1997, pp:408- [Conf]
  47. Markus Müller-Olm, Michael Petter, Helmut Seidl
    Interprocedurally Analyzing Polynomial Identities. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:50-67 [Conf]
  48. Helmut Seidl
    Deciding Equivalence of Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:480-492 [Conf]
  49. Markus Müller-Olm, Helmut Seidl
    On optimal slicing of parallel programs. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:647-656 [Conf]
  50. Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl
    The Succinct Solver Suite. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:251-265 [Conf]
  51. Helmut Seidl
    When Is a Functional Tree Transduction Deterministic? [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:251-265 [Conf]
  52. Markus Müller-Olm, Oliver Rüthing, Helmut Seidl
    Checking Herbrand Equalities and Beyond. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:79-96 [Conf]
  53. Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm
    Tree Automata for Code Selection. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:8, pp:741-760 [Journal]
  54. Helmut Seidl
    On the Finite Degree of Ambiguity of Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:26, n:6, pp:527-542 [Journal]
  55. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Cryptographic Analysis in Cubic Time. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
  56. Markus Müller-Olm, Helmut Seidl
    Computing polynomial program invariants. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:5, pp:233-244 [Journal]
  57. Thomas Perst, Helmut Seidl
    Macro forest transducers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:3, pp:141-149 [Journal]
  58. Helmut Seidl
    Haskell Overloading is DEXPTIME-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:2, pp:57-60 [Journal]
  59. Helmut Seidl
    Fast and Simple Nested Fixpoints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:303-308 [Journal]
  60. Helmut Seidl, Damian Niwinski
    On distributive fixed-point expressions. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:4/5, pp:427-446 [Journal]
  61. Andreas Weber, Helmut Seidl
    On finitely generated monoids of matrices with entries in N. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:19-38 [Journal]
  62. Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
    Infinite-state high-level MSCs: Model-checking and realizability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:617-647 [Journal]
  63. Helmut Seidl, Christian Fecht
    Interprocedural Analyses: A Comparison. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:43, n:2, pp:123-156 [Journal]
  64. Helmut Seidl
    Equivalence of Finite-Valued Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:4, pp:285-346 [Journal]
  65. Alexandru Berlea, Helmut Seidl
    Binary Queries for Document Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:1, pp:41-71 [Journal]
  66. Christian Fecht, Helmut Seidl
    Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:4, pp:304-329 [Journal]
  67. Flemming Nielson, Helmut Seidl, Hanne Riis Nielson
    A Succinct Solver for ALFP. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:4, pp:335-372 [Journal]
  68. Helmut Seidl
    Least and Greatest Solutions of Equations over N. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:1, pp:41-62 [Journal]
  69. Helmut Seidl, Bernhard Steffen
    Constraint-Based Inter-Procedural Analysis of Parallel Programs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:4, pp:375-0 [Journal]
  70. Christian Fecht, Helmut Seidl
    A Faster Solver for General Systems of Equations. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1999, v:35, n:2, pp:137-161 [Journal]
  71. Helmut Seidl, Morten Heine Sørensen
    Constraints to Stop Deforestation. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:32, n:1-3, pp:73-107 [Journal]
  72. Helmut Seidl
    Parameter Reduction of Higher Level Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:55, n:1, pp:47-85 [Journal]
  73. Helmut Seidl
    Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:1, pp:135-181 [Journal]
  74. Helmut Seidl
    Finite Tree Automata with Cost Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:1, pp:113-142 [Journal]
  75. Andreas Weber, Helmut Seidl
    On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:2, pp:325-349 [Journal]
  76. Thomas Gawlitza, Helmut Seidl
    Computing Game Values for Crash Games. [Citation Graph (0, 0)][DBLP]
    ATVA, 2007, pp:177-191 [Conf]
  77. Helmut Seidl, Kumar Neeraj Verma
    Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:97-119 [Conf]
  78. Thomas Gawlitza, Helmut Seidl
    Precise Relational Invariants Through Strategy Iteration. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:23-40 [Conf]
  79. Thomas Gawlitza, Helmut Seidl
    Precise Fixpoint Computation Through Strategy Iteration. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:300-315 [Conf]
  80. Helmut Seidl, Andrea Flexeder, Michael Petter
    Interprocedurally Analysing Linear Inequality Relations. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:284-299 [Conf]
  81. Markus Müller-Olm, Helmut Seidl
    Analysis of modular arithmetic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:5, pp:- [Journal]

  82. Polynomial Precise Interval Analysis Revisited. [Citation Graph (, )][DBLP]


  83. Games through Nested Fixpoints. [Citation Graph (, )][DBLP]


  84. Minimization of Deterministic Bottom-Up Tree Transducers. [Citation Graph (, )][DBLP]


  85. Upper Adjoints for Fast Inter-procedural Variable Equalities. [Citation Graph (, )][DBLP]


  86. Precise Interval Analysis vs. Parity Games. [Citation Graph (, )][DBLP]


  87. A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. [Citation Graph (, )][DBLP]


  88. Lightweight Verification 2008. [Citation Graph (, )][DBLP]


  89. Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. [Citation Graph (, )][DBLP]


  90. What Is a Pure Functional? [Citation Graph (, )][DBLP]


  91. Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. [Citation Graph (, )][DBLP]


  92. Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. [Citation Graph (, )][DBLP]


  93. Analysing All Polynomial Equations in . [Citation Graph (, )][DBLP]


  94. Region Analysis for Race Detection. [Citation Graph (, )][DBLP]


  95. Verifying a Local Generic Solver in Coq. [Citation Graph (, )][DBLP]


  96. Shape Analysis of Low-Level C with Overlapping Structures. [Citation Graph (, )][DBLP]


  97. Program Analysis through Finite Tree Automata. [Citation Graph (, )][DBLP]


  98. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.047secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002