Suchergebnisse

  • 1999

    On guarding nested fixpoints

    Seidl, H. & Neumann, A., 1999, Computer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings. Flum, J. & Rodriguez-Artalejo, M. (Hrsg.). Springer Verlag, S. 484-498 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1683).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    9 Zitate (Scopus)
  • 1998

    Constraints to stop deforestation

    Seidl, H. & Sørensen, M. H., Sept. 1998, in: Science of Computer Programming. 32, 1-3, S. 73-107 35 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    6 Zitate (Scopus)
  • Locating matches of tree patterns in forests

    Neumann, A. & Seidl, H., 1998, Foundations of Software Technology and Theoretical Computer Science - 18th Conference, Proceedings. S. 134-146 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1530 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    64 Zitate (Scopus)
  • Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems

    Fecht, C. & Seidl, H., 1998, Programming Languages and Systems - 7th European Symposium on Programming, ESOP 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings. Hankin, C. (Hrsg.). Springer Verlag, S. 90-104 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1381).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    22 Zitate (Scopus)
  • 1997

    Constraints to stop higher-order deforestation

    Seidl, H. & Sorensen, M. H., 1997, in: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. S. 400-413 14 S.

    Publikation: Beitrag in FachzeitschriftKonferenzartikelBegutachtung

    12 Zitate (Scopus)
  • Language support for synchronous parallel critical sections

    Kessler, C. W. & Seidl, H., 1997, S. 92-99. 8 S.

    Publikation: KonferenzbeitragPapierBegutachtung

    3 Zitate (Scopus)
  • The Fork95 parallel programming language: Design, implementation, application

    Keßler, C. W. & Seidl, H., Feb. 1997, in: International Journal of Parallel Programming. 25, 1, S. 17-50 34 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    20 Zitate (Scopus)
  • 1996

    An even faster solver for general systems of equations

    Fecht, C. & Seidl, H., 1996, Static Analysis - 3rd International Symposium, SAS 1996, Proceedings. Cousot, R. & Schmidt, D. A. (Hrsg.). Springer Verlag, S. 189-204 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1145).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    19 Zitate (Scopus)
  • Fast and simple nested fixpoints

    Seidl, H., 23 Sept. 1996, in: Information Processing Letters. 59, 6, S. 303-308 6 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    47 Zitate (Scopus)
  • Integer constraints to stop deforestation

    Seidl, H., 1996, Programming Languages and Systems - ESOP 1996 - 6th European Symposium on Programming, Proceedings. Nielson, H. R. (Hrsg.). Springer Verlag, S. 326-340 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 1058).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    2 Zitate (Scopus)
  • Modal μ-calculus for durational transition systems

    Seidl, H., 1996, in: Proceedings - Symposium on Logic in Computer Science. S. 128-137 10 S.

    Publikation: Beitrag in FachzeitschriftKonferenzartikelBegutachtung

    5 Zitate (Scopus)
  • 1995

    Integrating synchronous and asynchronous paradigms: The Fork95 parallel programming language

    Kessler, C. W. & Seidl, H., 1995, S. 134-141. 8 S.

    Publikation: KonferenzbeitragPapierBegutachtung

    6 Zitate (Scopus)
  • 1994

    Equivalence of finite-valued tree transducers is decidable

    Seidl, H., Juli 1994, in: Mathematical Systems Theory. 27, 4, S. 285-346 62 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    22 Zitate (Scopus)
  • Finite tree automata with cost functions

    Seidl, H., 11 Apr. 1994, in: Theoretical Computer Science. 126, 1, S. 113-142 30 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    22 Zitate (Scopus)
  • Haskell overloading is DEXPTIME-complete

    Seidl, H., 28 Okt. 1994, in: Information Processing Letters. 52, 2, S. 57-60 4 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    63 Zitate (Scopus)
  • Least solutions of equations over N

    Seidl, H., 1994, Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Abiteboul, S. & Shamir, E. (Hrsg.). Springer Verlag, S. 400-411 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 820 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    5 Zitate (Scopus)
  • Tree automata for code selection

    Ferdinand, C., Seidl, H. & Wilhelm, R., Aug. 1994, in: Acta Informatica. 31, 8, S. 741-760 20 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    31 Zitate (Scopus)
  • 1993

    When is a functional tree transduction deterministic?

    Seidl, H., 1993, TAPSOFT 1993: Theory and Practice of Software Development - 4th International Joint Conference CAAP/FASE, Proceedings. Gaudel, M.-C. & Jouannaud, J.-P. (Hrsg.). Springer Verlag, S. 251-265 15 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 668 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    3 Zitate (Scopus)
  • 1992

    Finite tree automata with cost functions

    Seidl, H., 1992, CAAP 1992 - 17th Colloquium on Trees in Algebra and Programming, Proceedings. Raoult, J.-C. (Hrsg.). Springer Verlag, S. 279-289 11 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 581 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    8 Zitate (Scopus)
  • FORK: A high-level language for PRAMs

    Hagerup, T., Schmitt, A. & Seidl, H., Sept. 1992, in: Future Generation Computer Systems. 8, 4, S. 379-393 15 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    10 Zitate (Scopus)
  • Single-valuedness of tree transducers is decidable in polynomial time

    Seidl, H., 30 Nov. 1992, in: Theoretical Computer Science. 106, 1, S. 135-181 47 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    17 Zitate (Scopus)
  • 1991

    FORK: A high-level language for PRAMs

    Hagerup, T., Schmitt, A. & Seidl, H., 1991, PARLE 1991 Parallel Architectures and Languages Europe - Parallel Architectures and Algorithms, Proceedings. Aarts, E. H. L., Rem, M. & van Leeuwen, J. (Hrsg.). Springer Verlag, S. 304-320 17 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 505 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    1 Zitat (Scopus)
  • On the degree of ambiguity of finite automata

    Weber, A. & Seidl, H., 7 Okt. 1991, in: Theoretical Computer Science. 88, 2, S. 325-349 25 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    94 Zitate (Scopus)
  • 1990

    Characterizing complexity classes by higher type: Primitive recursive definitions, Part II

    Goerdt, A. & Seidl, H., 1990, Aspects and Prospects of Theoretical Computer Science - 6th International Meeting of Young Computer Scientists, Proceedings. Dassow, J. & Kelemen, J. (Hrsg.). Springer Verlag, S. 148-158 11 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 464 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    8 Zitate (Scopus)
  • Deciding equivalence of finite tree automata

    Seidl, H., 1990, in: SIAM Journal on Computing. 19, 3, S. 424-437 14 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    115 Zitate (Scopus)
  • Equivalence of finite-valued bottom-up finite state tree transducers is decidable

    Seidl, H., 1990, CAAP 1990 - 15th Colloquium on Trees in Algebra and Programming, Proceedings. Arnold, A. (Hrsg.). Springer Verlag, S. 269-284 16 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 431 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    6 Zitate (Scopus)
  • 1989

    On the finite degree of ambiguity of finite tree automata

    Seidl, H., Juli 1989, in: Acta Informatica. 26, 6, S. 527-542 16 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    21 Zitate (Scopus)
  • On the finite degree of ambiguity of finite tree automata

    Seidl, H., 1989, Fundamentals of Computation Theory - International Conference, FCT 1989, Proceedings. Demetrovics, J., Csirik, J. & Gecseg, F. (Hrsg.). Springer Verlag, S. 395-404 10 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 380 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    4 Zitate (Scopus)
  • Probabilistic load balancing for parallel graph reduction

    Seidl, H. & Wilhelm, R., 1989, S. 879-884. 6 S.

    Publikation: KonferenzbeitragPapierBegutachtung

    3 Zitate (Scopus)
  • The TRANSPOSE machine--A global implementation of a parallel graph reducer

    Ben-Asher, Y., Seidl, H. & Wilhelm, R., 1989, S. 856-863. 8 S.

    Publikation: KonferenzbeitragPapierBegutachtung

    2 Zitate (Scopus)
  • 1988

    Parameter-reduction of higher level grammars

    Seidl, H., 1988, CAAP 1988 - 13th Colloquium on Trees in Algebra and Programming, Proceedings. Dauchet, M. & Nivat, M. (Hrsg.). Springer Verlag, S. 52-71 20 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 299 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

  • 1987

    Parameter-reduction of higher level grammars

    Seidl, H., Nov. 1987, in: Theoretical Computer Science. 55, 1, S. 47-85 39 S.

    Publikation: Beitrag in FachzeitschriftArtikelBegutachtung

    Open Access
    1 Zitat (Scopus)
  • 1986

    On the degree of ambiguity of finite automata

    Weber, A. & Seidl, H., 1986, Mathematical Foundations of Computer Science 1986 - Proceedings of the 12th Symposium. Gruska, J., Rovan, B. & Wiedermann, J. (Hrsg.). Springer Verlag, S. 620-629 10 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 233 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    17 Zitate (Scopus)
  • 1985

    A quadratic regularity test for non-deleting macro s grammars

    Seidl, H., 1985, Fundamentals of Computation Theory - FCT 1985. Budach, L. (Hrsg.). Springer Verlag, S. 422-430 9 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 199 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung