| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Helmut Seidl Markus Müller-Olm , Helmut Seidl: Precise interprocedural analysis through linear algebra. POPL 2004 : 330-341 Flemming Nielson , Hanne Riis Nielson , Hongyan Sun , Mikael Buchholtz , René Rydhof Hansen , Henrik Pilegaard , Helmut Seidl: The Succinct Solver Suite. TACAS 2004 : 251-265 Thomas Perst , Helmut Seidl: Macro forest transducers. Inf. Process. Lett. 89 (3): 141-149 (2004) Helmut Seidl, Thomas Schwentick , Anca Muscholl : Numerical document queries. PODS 2003 : 155-166 Peter Ziewer , Helmut Seidl: Transparent teleteaching. ASCILITE 2002 : 749-758 Flemming Nielson , Hanne Riis Nielson , Helmut Seidl: Automatic Complexity Analysis. ESOP 2002 : 243-261 Blaise Genest , Anca Muscholl , Helmut Seidl, Marc Zeitoun : Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002 : 657-668 Flemming Nielson , Hanne Riis Nielson , Helmut Seidl: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS 2002 : 20-35 Markus Müller-Olm , Helmut Seidl: Polynomial Constants Are Decidable. SAS 2002 : 4-19 Flemming Nielson , Helmut Seidl, Hanne Riis Nielson : A Succinct Solver for ALFP. Nord. J. Comput. 9 (4): 335-372 (2002) Markus Müller-Olm , Helmut Seidl: Polynomial Constants are Decidable Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09: (2002) Helmut Seidl, Varmo Vene , Markus Müller-Olm : Interprocedural Invariants Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10: (2002) Helmut Seidl, Aditya Nori : On the Expressiveness of Tree Set Operators Universität Trier, Mathematik/Informatik, Forschungsbericht 02-17: (2002) Flemming Nielson , Helmut Seidl: Control-Flow Analysis in Cubic Time. ESOP 2001 : 252-268 Valérie Gouranton , Pierre Réty , Helmut Seidl: Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001 : 214-229 Sébastien Limet , Pierre Réty , Helmut Seidl: Weakly Regular Relations and Applications. RTA 2001 : 185-200 Markus Müller-Olm , Helmut Seidl: On optimal slicing of parallel programs. STOC 2001 : 647-656 Flemming Nielson , Hanne Riis Nielson , Helmut Seidl: Cryptographic Analysis in Cubic Time. Electr. Notes Theor. Comput. Sci. 62 : (2001) Flemming Nielson , Helmut Seidl: Succinct Solvers Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12: (2001) Helmut Seidl, Bernhard Steffen : Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP 2000 : 351-365 Helmut Seidl, Christian Fecht : Interprocedural Analyses: A Comparison. J. Log. Program. 43 (2): 123-156 (2000) Helmut Seidl, Bernhard Steffen : Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7 (4): 375- (2000) Helmut Seidl, Andreas Neumann : On Guarding Nested Fixpoints. CSL 1999 : 484-498 Christoph W. Keßler , Helmut Seidl: ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe 1999 : 525-534 Helmut Seidl, Damian Niwinski : On distributive fixed-point expressions. ITA 33 (4/5): 427-446 (1999) Christian Fecht , Helmut Seidl: A Faster Solver for General Systems of Equations. Sci. Comput. Program. 35 (2): 137-161 (1999) Christoph W. Keßler , Helmut Seidl, Craig Smith : The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations Universität Trier, Mathematik/Informatik, Forschungsbericht 99-10: (1999) Christian Fecht , Helmut Seidl: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP 1998 : 90-104 Andreas Neumann , Helmut Seidl: Locating Matches of Tree Patterns in Forests. FSTTCS 1998 : 134-145 Christian Fecht , Helmut Seidl: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nord. J. Comput. 5 (4): 304-329 (1998) Helmut Seidl, Morten Heine Sørensen : Constraints to Stop Deforestation. Sci. Comput. Program. 32 (1-3): 73-107 (1998) Andreas Neumann , Helmut Seidl: Locating Matches of Tree Patterns in Forests Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08: (1998) Christoph W. Keßler , Helmut Seidl: ForkLight: A Control-Synchronous Parallel Programming Language Universität Trier, Mathematik/Informatik, Forschungsbericht 98-13: (1998) Helmut Seidl, Christian Fecht : Disjuntive Completion Is Not "Optimal". ILPS 1997 : 408 Helmut Seidl, Morten Heine Sørensen : Constraints to Stop Higher-Order Deforestation. POPL 1997 : 400-413 Helmut Seidl, Christian Fecht : Interprocedural Analysis Based on PDAs Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06: (1997) Helmut Seidl, Christian Fecht : Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems Universität Trier, Mathematik/Informatik, Forschungsbericht 97-13: (1997) Helmut Seidl: Model-Checking for L 2 Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18: (1997) Helmut Seidl: Integer Constraints to Stop Deforestation. ESOP 1996 : 326-340 Helmut Seidl: A Modal Mu-Calculus for Durational Transition Systems. LICS 1996 : 128-137 Christian Fecht , Helmut Seidl: An Even Faster Solver for General Systems of Equations. SAS 1996 : 189-204 Helmut Seidl: Fast and Simple Nested Fixpoints. Inf. Process. Lett. 59 (6): 303-308 (1996) Helmut Seidl: Least and Greatest Solutions of Equations over N. Nord. J. Comput. 3 (1): 41-62 (1996) Helmut Seidl: Fast and Simple Nested Fixpoints Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05: (1996) Christian Fecht , Helmut Seidl: An Even Faster Solver for General Systems of Equations Universität Trier, Mathematik/Informatik, Forschungsbericht 96-11: (1996) Christoph W. Keßler , Helmut Seidl: Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language Universität Trier, Mathematik/Informatik, Forschungsbericht 95-05: (1995) Helmut Seidl: A Modal µ-Calculus for Durational Transition Systems Universität Trier, Mathematik/Informatik, Forschungsbericht 95-08: (1995) Christoph W. Keßler , Helmut Seidl: Language Support for Synchronous Parallel Critical Sections Universität Trier, Mathematik/Informatik, Forschungsbericht 95-23: (1995) Helmut Seidl: Least Solutions of Equations over N. ICALP 1994 : 400-411 Christian Ferdinand , Helmut Seidl, Reinhard Wilhelm : Tree Automata for Code Selection. Acta Inf. 31 (8): 741-760 (1994) Helmut Seidl: Haskell Overloading is DEXPTIME-Complete. Inf. Process. Lett. 52 (2): 57-60 (1994) Helmut Seidl: Equivalence of Finite-Valued Tree Transducers Is Decidable. Mathematical Systems Theory 27 (4): 285-346 (1994) Helmut Seidl: Finite Tree Automata with Cost Functions. Theor. Comput. Sci. 126 (1): 113-142 (1994) Helmut Seidl: When Is a Functional Tree Transduction Deterministic? TAPSOFT 1993 : 251-265 Helmut Seidl: Finite Tree Automata with Cost Functions. CAAP 1992 : 279-299 Helmut Seidl: Ambiguity and valuedness. Tree Automata and Languages 1992 : 355-380 Helmut Seidl: Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. Theor. Comput. Sci. 106 (1): 135-181 (1992) Christian Ferdinand , Helmut Seidl, Reinhard Wilhelm : Tree Automata for Code Selection. Code Generation 1991 : 30-50 Torben Hagerup , Arno Schmitt , Helmut Seidl: FORK: A High-Level Language for PRAMs. PARLE (1) 1991 : 304-320 Andreas Weber , Helmut Seidl: On finitely generated monoids of matrices with entries in N. ITA 25 : 19-38 (1991) Andreas Weber , Helmut Seidl: On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88 (2): 325-349 (1991) Helmut Seidl: Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP 1990 : 269-284 Andreas Goerdt , Helmut Seidl: Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990 : 148-158 Helmut Seidl: Deciding Equivalence of Finite Tree Automata. SIAM J. Comput. 19 (3): 424-437 (1990) Helmut Seidl: On the Finite Degree of Ambiguity of Finite Tree Automata. FCT 1989 : 395-404 Helmut Seidl: Deciding Equivalence of Finite Tree Automata. STACS 1989 : 480-492 Helmut Seidl: On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Inf. 26 (6): 527-542 (1989) Helmut Seidl: Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP 1988 : 52-71 Helmut Seidl: Parameter Reduction of Higher Level Grammars. Theor. Comput. Sci. 55 (1): 47-85 (1987) Andreas Weber , Helmut Seidl: On the Degree of Ambiguity of Finite Automata. MFCS 1986 : 620-629 Helmut Seidl: A quadratic regularity test for non-deleting macro S grammars. FCT 1985 : 422-430 1 [ 70 ] 2 [ 27 ] [ 31 ] [ 35 ] [ 36 ] [ 38 ] [ 42 ] [ 44 ] [ 46 ] [ 51 ] 3 [ 14 ] [ 22 ] 4 [ 65 ] 5 [ 9 ] 6 [ 57 ] 7 [ 13 ] 8 [ 70 ] 9 [ 24 ] [ 26 ] [ 39 ] [ 45 ] [ 48 ] 10 [ 56 ] 11 [ 55 ] [ 60 ] [ 61 ] [ 63 ] [ 71 ] 12 [ 65 ] [ 68 ] 13 [ 40 ] [ 43 ] [ 49 ] 14 [ 53 ] [ 54 ] [ 58 ] [ 62 ] [ 64 ] [ 66 ] [ 70 ] 15 [ 54 ] [ 62 ] [ 64 ] [ 66 ] [ 70 ] 16 [ 47 ] 17 [ 59 ] 18 [ 69 ] 19 [ 70 ] 20 [ 56 ] [ 57 ] 21 [ 13 ] 22 [ 68 ] 23 [ 45 ] 24 [ 37 ] [ 41 ] 25 [ 50 ] [ 52 ] 26 [ 70 ] 27 [ 60 ] 28 [ 2 ] [ 11 ] [ 12 ] 29 [ 14 ] [ 22 ] 30 [ 65 ] 31 [ 67 ]  ©2004 Association for Computing Machinery |
