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
Characterisation of Lawvere-Tierney Topologies on Simplicial Sets, Bicolored Graphs, and Fuzzy Sets.
CoRR, 2024

Generalized Weighted Type Graphs for Termination of Graph Transformation Systems.
Proceedings of the Graph Transformation - 17th International Conference, 2024

Correspondence Between Composite Theories and Distributive Laws.
Proceedings of the Coalgebraic Methods in Computer Science, 2024

2023
Graph rewriting and relabeling with PBPO<sup>+</sup>: A unifying theory for quasitoposes.
J. Log. Algebraic Methods Program., June, 2023

Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting.
CoRR, 2023

Fuzzy Presheaves are Quasitoposes.
Proceedings of the Graph Transformation - 16th International Conference, 2023

Termination of Graph Transformation Systems Using Weighted Subgraph Counting.
Proceedings of the Graph Transformation - 16th International Conference, 2023

2022
A PBPO+ Graph Rewriting Tutorial.
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.
CoRR, 2022

Algebraic Presentation of Semifree Monads.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Star Games and Hydras.
Log. Methods Comput. Sci., 2021

From Linear Term Rewriting to Graph Rewriting with Preservation of Termination.
Proceedings of the Proceedings Twelfth International Workshop on Graph Computational Models, 2021

Graph Rewriting and Relabeling with PBPO<sup>+</sup>.
Proceedings of the Graph Transformation - 14th International Conference, 2021

2020
Decreasing Diagrams for Confluence and Commutation.
Log. Methods Comput. Sci., 2020

Graph Rewriting and Relabeling with PBPO+ (Extended Version).
CoRR, 2020

Transducer degrees: atoms, infima and suprema.
Acta Informatica, 2020

Patch Graph Rewriting.
Proceedings of the Graph Transformation - 13th International Conference, 2020

2019
Braids via term rewriting.
Theor. Comput. Sci., 2019

Syllogistic logic with "Most".
Math. Struct. Comput. Sci., 2019

Confluence of the Chinese Monoid.
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.
Log. Methods Comput. Sci., 2018

Degrees of Infinite Words, Polynomials and Atoms.
Int. J. Found. Comput. Sci., 2018

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version).
CoRR, 2018

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017
Clocked lambda calculus.
Math. Struct. Comput. Sci., 2017

Undecidability and Finite Automata.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2015
Proving Looping and Non-Looping Non-Termination by Finite Automata.
CoRR, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version).
CoRR, 2015

The Degree of Squares is an Atom (Extended Version).
CoRR, 2015

Proving non-termination by finite automata.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Regularity Preserving but Not Reflecting Encodings.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Degrees of Transducibility.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

The Degree of Squares is an Atom.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
On the complexity of stream equality.
J. Funct. Program., 2014

Discriminating Lambda-Terms Using Clocked Boehm Trees
Log. Methods Comput. Sci., 2014

Eigenvalues and Transduction of Morphic Sequences: Extended Version.
CoRR, 2014

Non-termination using Regular Languages.
CoRR, 2014

An Introduction to the Clocked Lambda Calculus.
CoRR, 2014

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples.
Log. Methods Comput. Sci., 2014

Eigenvalues and Transduction of Morphic Sequences.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

On periodically iterated morphisms.
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.
Bull. EATCS, 2013

A Coinductive Treatment of Infinitary Rewriting.
CoRR, 2013

Mix-Automatic Sequences.
Proceedings of the Language and Automata Theory and Applications, 2013

Circular Coinduction in Coq Using Bisimulation-Up-To Techniques.
Proceedings of the Interactive Theorem Proving - 4th International Conference, 2013

Clocks for Functional Programs.
Proceedings of the Beauty of Functional Code, 2013

2012
Highlights in infinitary rewriting and lambda calculus.
Theor. Comput. Sci., 2012

Arithmetic Self-Similarity of Infinite Sequences.
CoRR, 2012

Automatic Sequences and Zip-Specifications.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On the complexity of equivalence of specifications of infinite objects.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Lazy productivity via termination.
Theor. Comput. Sci., 2011

On equal μ-terms.
Theor. Comput. Sci., 2011

Fast leader election in anonymous rings with bounded expected delay.
Inf. Process. Lett., 2011

Degrees of Streams.
Integers, 2011

Levels of undecidability in rewriting.
Inf. Comput., 2011

Infinitary Rewriting Coinductively.
Proceedings of the 18th International Workshop on Types for Proofs and Programs, 2011

Proving Equality of Streams Automatically.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
Productivity of stream definitions.
Theor. Comput. Sci., 2010

Local Termination: theory and practice
Log. Methods Comput. Sci., 2010

Transforming Outermost into Context-Sensitive Rewriting
Log. Methods Comput. Sci., 2010

Asynchronous Bounded Expected Delay Networks
CoRR, 2010

Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability
CoRR, 2010

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees
CoRR, 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Automating the Mean-Field Method for Large Dynamic Gossip Networks.
Proceedings of the QEST 2010, 2010

Brief announcement: asynchronous bounded expected delay networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
CoRR, 2009

Let's Make a Difference!
CoRR, 2009

Degrees of Undecidability in Rewriting
CoRR, 2009

Local Termination.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

From Outermost to Context-Sensitive Rewriting.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Degrees of Undecidability in Term Rewriting.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Complexity of Fractran and Productivity.
Proceedings of the Automated Deduction, 2009

2008
Matrix Interpretations for Proving Termination of Term Rewriting.
J. Autom. Reason., 2008

Proving Infinitary Normalization.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

Reduction Under Substitution.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Data-Oblivious Stream Productivity.
Proceedings of the Logic for Programming, 2008


  Loading...