Data-Oblivious Stream Productivity. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LPAR, 2008)

Reduction Under Substitution. - Jörg Endrullis; Roel C. de Vrijer (RTA, 2008)

Proving Infinitary Normalization. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Roel C. de Vrijer (TYPES, 2008)

Matrix Interpretations for Proving Termination of Term Rewriting. - Jörg Endrullis; Johannes Waldmann; Hans Zantema (J. Autom. Reason., 2008)

Complexity of Fractran and Productivity. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (CADE, 2009)

Degrees of Undecidability in Term Rewriting. - Jörg Endrullis; Herman Geuvers; Hans Zantema (CSL, 2009)

From Outermost to Context-Sensitive Rewriting. - Jörg Endrullis; Dimitri Hendriks (RTA, 2009)

Local Termination. - Jörg Endrullis; Roel C. de Vrijer; Johannes Waldmann (RTA, 2009)

Degrees of Undecidability in Rewriting - Jörg Endrullis; Herman Geuvers; Hans Zantema (CoRR, 2009)

Let's Make a Difference! - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (CoRR, 2009)

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop (CoRR, 2009)

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (LICS, 2010)

Brief announcement: asynchronous bounded expected delay networks. - Rena Bakhshi; Jörg Endrullis; Wan J. Fokkink; Jun Pang 001 (PODC, 2010)

Automating the Mean-Field Method for Large Dynamic Gossip Networks. - Rena Bakhshi; Jörg Endrullis; Stefan Endrullis; Wan J. Fokkink; Boudewijn R. Haverkort (QEST, 2010)

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (RTA, 2010)

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (CoRR, 2010)

Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability - Jörg Endrullis (CoRR, 2010)

Asynchronous Bounded Expected Delay Networks - Rena Bakhshi; Jörg Endrullis; Wan J. Fokkink; Jun Pang 001 (CoRR, 2010)

Transforming Outermost into Context-Sensitive Rewriting - Jörg Endrullis; Dimitri Hendriks (Log. Methods Comput. Sci., 2010)

Local Termination: theory and practice - Jörg Endrullis; Roel C. de Vrijer; Johannes Waldmann (Log. Methods Comput. Sci., 2010)

Productivity of stream definitions. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Ariya Isihara; Jan Willem Klop (Theor. Comput. Sci., 2010)

Proving Equality of Streams Automatically. - Hans Zantema; Jörg Endrullis (RTA, 2011)

Infinitary Rewriting Coinductively. - Jörg Endrullis; Andrew Polonsky (TYPES, 2011)

Levels of undecidability in rewriting. - Jörg Endrullis; Herman Geuvers; Jakob Grue Simonsen; Hans Zantema (Inf. Comput., 2011)

Degrees of Streams. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Integers, 2011)

Fast leader election in anonymous rings with bounded expected delay. - Rena Bakhshi; Jörg Endrullis; Wan J. Fokkink; Jun Pang 001 (Inf. Process. Lett., 2011)

On equal μ-terms. - Jörg Endrullis; Clemens Grabmayer; Jan Willem Klop; Vincent van Oostrom (Theor. Comput. Sci., 2011)

Lazy productivity via termination. - Jörg Endrullis; Dimitri Hendriks (Theor. Comput. Sci., 2011)

On the complexity of equivalence of specifications of infinite objects. - Jörg Endrullis; Dimitri Hendriks; Rena Bakhshi (ICFP, 2012)

Automatic Sequences and Zip-Specifications. - Clemens Grabmayer; Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Lawrence S. Moss (LICS, 2012)

Arithmetic Self-Similarity of Infinite Sequences. - Dimitri Hendriks; Frits Dannenberg; Jörg Endrullis; Mark Dow; Jan Willem Klop (CoRR, 2012)

Highlights in infinitary rewriting and lambda calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Theor. Comput. Sci., 2012)

Clocks for Functional Programs. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (The Beauty of Functional Code, 2013)

Circular Coinduction in Coq Using Bisimulation-Up-To Techniques. - Jörg Endrullis; Dimitri Hendriks; Martin Bodin (ITP, 2013)

Mix-Automatic Sequences. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LATA, 2013)

A Coinductive Treatment of Infinitary Rewriting. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2013)

Streams are Forever. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Bull. EATCS, 2013)

On periodically iterated morphisms. - Jörg Endrullis; Dimitri Hendriks (CSL-LICS, 2014)

Eigenvalues and Transduction of Morphic Sequences. - David Sprunger; William Tune; Jörg Endrullis; Lawrence S. Moss (Developments in Language Theory, 2014)

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (Log. Methods Comput. Sci., 2014)

An Introduction to the Clocked Lambda Calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (CoRR, 2014)

Non-termination using Regular Languages. - Jörg Endrullis; Hans Zantema (CoRR, 2014)

Eigenvalues and Transduction of Morphic Sequences: Extended Version. - David Sprunger; William Tune; Jörg Endrullis; Lawrence S. Moss (CoRR, 2014)

Discriminating Lambda-Terms Using Clocked Boehm Trees - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Log. Methods Comput. Sci., 2014)

On the complexity of stream equality. - Jörg Endrullis; Dimitri Hendriks; Rena Bakhshi; Grigore Rosu (J. Funct. Program., 2014)

The Degree of Squares is an Atom. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Hans Zantema (WORDS, 2015)

Degrees of Transducibility. - Jörg Endrullis; Jan Willem Klop; Aleksi Saarela; Markus A. Whiteland (WORDS, 2015)

Regularity Preserving but Not Reflecting Encodings. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks (LICS, 2015)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (RTA, 2015)

Proving non-termination by finite automata. - Jörg Endrullis; Hans Zantema (RTA, 2015)

The Degree of Squares is an Atom (Extended Version). - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Hans Zantema (CoRR, 2015)

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version). - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (CoRR, 2015)

Proving Looping and Non-Looping Non-Termination by Finite Automata. - Jörg Endrullis; Hans Zantema (CoRR, 2015)

Undecidability and Finite Automata. - Jörg Endrullis; Jeffrey O. Shallit; Tim Smith (DLT, 2017)

Clocked lambda calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Math. Struct. Comput. Sci., 2017)

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (FSCD, 2018)

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). - Jörg Endrullis; Juhani Karhumäki; Jan Willem Klop; Aleksi Saarela (CoRR, 2018)

Degrees of Infinite Words, Polynomials and Atoms. - Jörg Endrullis; Juhani Karhumäki; Jan Willem Klop; Aleksi Saarela (Int. J. Found. Comput. Sci., 2018)

Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. - Jörg Endrullis; Helle Hvid Hansen; Dimitri Hendriks; Andrew Polonsky; Alexandra Silva 001 (Log. Methods Comput. Sci., 2018)

Confluence of the Chinese Monoid. - Jörg Endrullis; Jan Willem Klop (The Art of Modelling Computational Systems, 2019)

Syllogistic logic with "Most". - Jörg Endrullis; Lawrence S. Moss (Math. Struct. Comput. Sci., 2019)

Braids via term rewriting. - Jörg Endrullis; Jan Willem Klop (Theor. Comput. Sci., 2019)

Patch Graph Rewriting. - Roy Overbeek; Jörg Endrullis (ICGT, 2020)

Transducer degrees: atoms, infima and suprema. - Jörg Endrullis; Jan Willem Klop; Rena Bakhshi (Acta Informatica, 2020)

Graph Rewriting and Relabeling with PBPO+ (Extended Version). - Roy Overbeek; Jörg Endrullis (CoRR, 2020)

Decreasing Diagrams for Confluence and Commutation. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (Log. Methods Comput. Sci., 2020)

Graph Rewriting and Relabeling with PBPO+. - Roy Overbeek; Jörg Endrullis; Aloïs Rosset (ICGT, 2021)

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination. - Roy Overbeek; Jörg Endrullis (GCM@STAF, 2021)

Star Games and Hydras. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (Log. Methods Comput. Sci., 2021)

Algebraic Presentation of Semifree Monads. - Aloïs Rosset; Helle Hvid Hansen; Jörg Endrullis (CMCS, 2022)

Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes. - Roy Overbeek; Jörg Endrullis; Aloïs Rosset (CoRR, 2022)

A PBPO+ Graph Rewriting Tutorial. - Roy Overbeek; Jörg Endrullis (TERMGRAPH@FSCD, 2022)

Fuzzy Presheaves are Quasitoposes. - Aloïs Rosset; Roy Overbeek; Jörg Endrullis (ICGT, 2023)

Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting. - Aloïs Rosset; Roy Overbeek; Jörg Endrullis (CoRR, 2023)

Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes. - Roy Overbeek; Jörg Endrullis; Aloïs Rosset (J. Log. Algebraic Methods Program., 2023)

Correspondence Between Composite Theories and Distributive Laws. - Aloïs Rosset; Maaike Zwart; Helle Hvid Hansen; Jörg Endrullis (CMCS, 2024)

Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. - Jörg Endrullis; Roy Overbeek (ICGT, 2024)

Characterisation of Lawvere-Tierney Topologies on Simplicial Sets, Bicolored Graphs, and Fuzzy Sets. - Aloïs Rosset; Helle Hvid Hansen; Jörg Endrullis (CoRR, 2024)

Termination of Graph Transformation Systems Using Weighted Subgraph Counting. - Roy Overbeek; Jörg Endrullis (Log. Methods Comput. Sci., 2024)