We stand with Ukraine  

Jörg Endrullis

Orcid: 0000-0002-2554-8270

According to our database1, Jörg Endrullis authored at least 79 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Termination of Graph Transformation Systems Using Weighted Subgraph Counting.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
Log. Methods Comput. Sci., 2024

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

Generalized Weighted Type Graphs for Termination of Graph Transformation Systems.
[BibTeX]
[DOI]
Jörg Endrullis
,
Roy Overbeek
Proceedings of the Graph Transformation - 17th International Conference, 2024

Correspondence Between Composite Theories and Distributive Laws.
[BibTeX]
[DOI]
Aloïs Rosset
,
Maaike Zwart
,
Helle Hvid Hansen
,
Jörg Endrullis
Proceedings of the Coalgebraic Methods in Computer Science, 2024

2023
Graph rewriting and relabeling with PBPO<sup>+</sup>: A unifying theory for quasitoposes.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
,
Aloïs Rosset
J. Log. Algebraic Methods Program., June, 2023

Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting.
[BibTeX]
[DOI]
Aloïs Rosset
,
Roy Overbeek
,
Jörg Endrullis
CoRR, 2023

Fuzzy Presheaves are Quasitoposes.
[BibTeX]
[DOI]
Aloïs Rosset
,
Roy Overbeek
,
Jörg Endrullis
Proceedings of the Graph Transformation - 16th International Conference, 2023

2022
A PBPO+ Graph Rewriting Tutorial.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
Proceedings of the Proceedings Twelfth International Workshop on Computing with Terms and Graphs, 2022

Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
,
Aloïs Rosset
CoRR, 2022

Algebraic Presentation of Semifree Monads.
[BibTeX]
[DOI]
Aloïs Rosset
,
Helle Hvid Hansen
,
Jörg Endrullis
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Star Games and Hydras.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
,
Roy Overbeek
Log. Methods Comput. Sci., 2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
Proceedings of the Proceedings Twelfth International Workshop on Graph Computational Models, 2021

Graph Rewriting and Relabeling with PBPO<sup>+</sup>.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
,
Aloïs Rosset
Proceedings of the Graph Transformation - 14th International Conference, 2021

2020
Decreasing Diagrams for Confluence and Commutation.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
,
Roy Overbeek
Log. Methods Comput. Sci., 2020

Graph Rewriting and Relabeling with PBPO+ (Extended Version).
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
CoRR, 2020

Transducer degrees: atoms, infima and suprema.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
,
Rena Bakhshi
Acta Informatica, 2020

Patch Graph Rewriting.
[BibTeX]
[DOI]
Roy Overbeek
,
Jörg Endrullis
Proceedings of the Graph Transformation - 13th International Conference, 2020

2019
Braids via term rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
Theor. Comput. Sci., 2019

Syllogistic logic with "Most".
[BibTeX]
[DOI]
Jörg Endrullis
,
Lawrence S. Moss
Math. Struct. Comput. Sci., 2019

Confluence of the Chinese Monoid.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic.
[BibTeX]
[DOI]
Jörg Endrullis
,
Helle Hvid Hansen
,
Dimitri Hendriks
,
Andrew Polonsky
,
Alexandra Silva
Log. Methods Comput. Sci., 2018

Degrees of Infinite Words, Polynomials and Atoms.
[BibTeX]
[DOI]
Jörg Endrullis
,
Juhani Karhumäki
,
Jan Willem Klop
,
Aleksi Saarela
Int. J. Found. Comput. Sci., 2018

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

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
,
Roy Overbeek
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017
Clocked lambda calculus.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
,
Andrew Polonsky
Math. Struct. Comput. Sci., 2017

Undecidability and Finite Automata.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jeffrey O. Shallit
,
Tim Smith
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2015
Proving Looping and Non-Looping Non-Termination by Finite Automata.
[BibTeX]
[DOI]
Jörg Endrullis
,
Hans Zantema
CoRR, 2015

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

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

Proving non-termination by finite automata.
[BibTeX]
[DOI]
Jörg Endrullis
,
Hans Zantema
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
[BibTeX]
[DOI]
Jörg Endrullis
,
Helle Hvid Hansen
,
Dimitri Hendriks
,
Andrew Polonsky
,
Alexandra Silva
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Regularity Preserving but Not Reflecting Encodings.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Degrees of Transducibility.
[BibTeX]
[DOI]
Jörg Endrullis
,
Jan Willem Klop
,
Aleksi Saarela
,
Markus A. Whiteland
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

The Degree of Squares is an Atom.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Hans Zantema
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
On the complexity of stream equality.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Rena Bakhshi
,
Grigore Rosu
J. Funct. Program., 2014

Discriminating Lambda-Terms Using Clocked Boehm Trees
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
,
Andrew Polonsky
Log. Methods Comput. Sci., 2014

Eigenvalues and Transduction of Morphic Sequences: Extended Version.
[BibTeX]
[DOI]
David Sprunger
,
William Tune
,
Jörg Endrullis
,
Lawrence S. Moss
CoRR, 2014

Non-termination using Regular Languages.
[BibTeX]
[DOI]
Jörg Endrullis
,
Hans Zantema
CoRR, 2014

An Introduction to the Clocked Lambda Calculus.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
,
Andrew Polonsky
CoRR, 2014

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

Eigenvalues and Transduction of Morphic Sequences.
[BibTeX]
[DOI]
David Sprunger
,
William Tune
,
Jörg Endrullis
,
Lawrence S. Moss
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On periodically iterated morphisms.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Streams are Forever.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Bull. EATCS, 2013

A Coinductive Treatment of Infinitary Rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Helle Hvid Hansen
,
Dimitri Hendriks
,
Andrew Polonsky
,
Alexandra Silva
CoRR, 2013

Mix-Automatic Sequences.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
Proceedings of the Language and Automata Theory and Applications, 2013

Circular Coinduction in Coq Using Bisimulation-Up-To Techniques.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Martin Bodin
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Clocks for Functional Programs.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
,
Andrew Polonsky
Proceedings of the Beauty of Functional Code, 2013

2012
Highlights in infinitary rewriting and lambda calculus.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Theor. Comput. Sci., 2012

Arithmetic Self-Similarity of Infinite Sequences.
[BibTeX]
[DOI]
Dimitri Hendriks
,
Frits Dannenberg
,
Jörg Endrullis
,
Mark Dow
,
Jan Willem Klop
CoRR, 2012

Automatic Sequences and Zip-Specifications.
[BibTeX]
[DOI]
Clemens Grabmayer
,
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
,
Lawrence S. Moss
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On the complexity of equivalence of specifications of infinite objects.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Rena Bakhshi
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Lazy productivity via termination.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
Theor. Comput. Sci., 2011

On equal μ-terms.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Jan Willem Klop
,
Vincent van Oostrom
Theor. Comput. Sci., 2011

Fast leader election in anonymous rings with bounded expected delay.
[BibTeX]
[DOI]
Rena Bakhshi
,
Jörg Endrullis
,
Wan J. Fokkink
,
Jun Pang
Inf. Process. Lett., 2011

Degrees of Streams.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Integers, 2011

Levels of undecidability in rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Herman Geuvers
,
Jakob Grue Simonsen
,
Hans Zantema
Inf. Comput., 2011

Infinitary Rewriting Coinductively.
[BibTeX]
[DOI]
Jörg Endrullis
,
Andrew Polonsky
Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

Proving Equality of Streams Automatically.
[BibTeX]
[DOI]
Hans Zantema
,
Jörg Endrullis
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
Productivity of stream definitions.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Ariya Isihara
,
Jan Willem Klop
Theor. Comput. Sci., 2010

Local Termination: theory and practice
[BibTeX]
[DOI]
Jörg Endrullis
,
Roel C. de Vrijer
,
Johannes Waldmann
Log. Methods Comput. Sci., 2010

Transforming Outermost into Context-Sensitive Rewriting
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
Log. Methods Comput. Sci., 2010

Asynchronous Bounded Expected Delay Networks
[BibTeX]
[DOI]
Rena Bakhshi
,
Jörg Endrullis
,
Wan J. Fokkink
,
Jun Pang
CoRR, 2010

Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability
[BibTeX]
[DOI]
Jörg Endrullis
CoRR, 2010

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
CoRR, 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Jan Willem Klop
,
Vincent van Oostrom
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Automating the Mean-Field Method for Large Dynamic Gossip Networks.
[BibTeX]
[DOI]
Rena Bakhshi
,
Jörg Endrullis
,
Stefan Endrullis
,
Wan J. Fokkink
,
Boudewijn R. Haverkort
Proceedings of the QEST 2010, 2010

Brief announcement: asynchronous bounded expected delay networks.
[BibTeX]
[DOI]
Rena Bakhshi
,
Jörg Endrullis
,
Wan J. Fokkink
,
Jun Pang
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Jan Willem Klop
CoRR, 2009

Let's Make a Difference!
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
CoRR, 2009

Degrees of Undecidability in Rewriting
[BibTeX]
[DOI]
Jörg Endrullis
,
Herman Geuvers
,
Hans Zantema
CoRR, 2009

Local Termination.
[BibTeX]
[DOI]
Jörg Endrullis
,
Roel C. de Vrijer
,
Johannes Waldmann
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

From Outermost to Context-Sensitive Rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Dimitri Hendriks
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Degrees of Undecidability in Term Rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Herman Geuvers
,
Hans Zantema
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Complexity of Fractran and Productivity.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
Proceedings of the Automated Deduction, 2009

2008
Matrix Interpretations for Proving Termination of Term Rewriting.
[BibTeX]
[DOI]
Jörg Endrullis
,
Johannes Waldmann
,
Hans Zantema
J. Autom. Reason., 2008

Proving Infinitary Normalization.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Jan Willem Klop
,
Roel C. de Vrijer
Proceedings of the Types for Proofs and Programs, International Conference, 2008

Reduction Under Substitution.
[BibTeX]
[DOI]
Jörg Endrullis
,
Roel C. de Vrijer
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Data-Oblivious Stream Productivity.
[BibTeX]
[DOI]
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
Proceedings of the Logic for Programming, 2008


  Loading...