default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Endrullis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Roy Overbeek, Jörg Endrullis:
Termination of Graph Transformation Systems Using Weighted Subgraph Counting. Log. Methods Comput. Sci. 20(4) (2024)- [c41]Aloïs Rosset
, Maaike Zwart, Helle Hvid Hansen, Jörg Endrullis:
Correspondence Between Composite Theories and Distributive Laws. CMCS 2024: 194-215 - [c40]Jörg Endrullis, Roy Overbeek:
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. ICGT 2024: 39-58 - [i34]Aloïs Rosset, Maaike Zwart, Helle Hvid Hansen, Jörg Endrullis:
Correspondence between Composite Theories and Distributive Laws. CoRR abs/2404.00581 (2024) - [i33]Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis:
Characterisation of Lawvere-Tierney Topologies on Simplicial Sets, Bicolored Graphs, and Fuzzy Sets. CoRR abs/2407.04535 (2024) - 2023
- [j23]Roy Overbeek, Jörg Endrullis, Aloïs Rosset:
Graph rewriting and relabeling with PBPO+: A unifying theory for quasitoposes. J. Log. Algebraic Methods Program. 133: 100873 (2023) - [c39]Roy Overbeek, Jörg Endrullis:
Termination of Graph Transformation Systems Using Weighted Subgraph Counting. ICGT 2023: 81-101 - [c38]Aloïs Rosset, Roy Overbeek, Jörg Endrullis:
Fuzzy Presheaves are Quasitoposes. ICGT 2023: 102-122 - [i32]Aloïs Rosset, Roy Overbeek, Jörg Endrullis:
Fuzzy Presheaves are Quasitoposes and Consequences in Graph Rewriting. CoRR abs/2301.13067 (2023) - [i31]Roy Overbeek, Jörg Endrullis:
Termination of Graph Transformation Systems using Weighted Subgraph Counting. CoRR abs/2303.07812 (2023) - [i30]Jörg Endrullis, Roy Overbeek:
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems. CoRR abs/2307.07601 (2023) - 2022
- [c37]Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis:
Algebraic Presentation of Semifree Monads. CMCS 2022: 110-132 - [c36]Roy Overbeek, Jörg Endrullis:
A PBPO+ Graph Rewriting Tutorial. TERMGRAPH@FSCD 2022: 45-63 - [i29]Roy Overbeek, Jörg Endrullis, Aloïs Rosset:
Graph Rewriting and Relabeling with PBPO+: A Unifying Theory for Quasitoposes. CoRR abs/2203.01032 (2022) - [i28]Aloïs Rosset, Helle Hvid Hansen, Jörg Endrullis:
Algebraic Presentation of Semifree Monads. CoRR abs/2205.05392 (2022) - 2021
- [j22]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Star Games and Hydras. Log. Methods Comput. Sci. 17(2) (2021) - [c35]Roy Overbeek, Jörg Endrullis, Aloïs Rosset:
Graph Rewriting and Relabeling with PBPO+. ICGT 2021: 60-80 - [c34]Roy Overbeek, Jörg Endrullis:
From Linear Term Rewriting to Graph Rewriting with Preservation of Termination. GCM@STAF 2021: 19-34 - 2020
- [j21]Jörg Endrullis, Jan Willem Klop, Rena Bakhshi:
Transducer degrees: atoms, infima and suprema. Acta Informatica 57(3-5): 727-758 (2020) - [j20]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams for Confluence and Commutation. Log. Methods Comput. Sci. 16(1) (2020) - [c33]Roy Overbeek, Jörg Endrullis:
Patch Graph Rewriting. ICGT 2020: 128-145 - [i27]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Star Games and Hydras. CoRR abs/2001.08478 (2020) - [i26]Roy Overbeek, Jörg Endrullis:
Patch Graph Rewriting. CoRR abs/2003.06488 (2020) - [i25]Roy Overbeek, Jörg Endrullis:
Graph Rewriting and Relabeling with PBPO+ (Extended Version). CoRR abs/2010.08230 (2020)
2010 – 2019
- 2019
- [j19]Jörg Endrullis, Lawrence S. Moss:
Syllogistic logic with "Most". Math. Struct. Comput. Sci. 29(6): 763-782 (2019) - [j18]Jörg Endrullis, Jan Willem Klop:
Braids via term rewriting. Theor. Comput. Sci. 777: 260-295 (2019) - [c32]Jörg Endrullis, Jan Willem Klop:
Confluence of the Chinese Monoid. The Art of Modelling Computational Systems 2019: 206-220 - [i24]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams for Confluence and Commutation. CoRR abs/1901.10773 (2019) - 2018
- [j17]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29(5): 825-843 (2018) - [j16]Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. Log. Methods Comput. Sci. 14(1) (2018) - [c31]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. FSCD 2018: 14:1-14:15 - [i23]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR abs/1803.03158 (2018) - 2017
- [j15]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Clocked lambda calculus. Math. Struct. Comput. Sci. 27(5): 782-806 (2017) - [c30]Jörg Endrullis, Jeffrey O. Shallit, Tim Smith:
Undecidability and Finite Automata. DLT 2017: 160-172 - [i22]Jörg Endrullis, Jeffrey O. Shallit, Tim Smith:
Undecidability and Finite Automata. CoRR abs/1702.01394 (2017) - [i21]Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic. CoRR abs/1706.00677 (2017) - 2016
- [c29]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. DLT 2016: 164-176 - 2015
- [c28]Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland:
Degrees of Transducibility. WORDS 2015: 1-13 - [c27]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom. WORDS 2015: 109-121 - [c26]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Regularity Preserving but Not Reflecting Encodings. LICS 2015: 535-546 - [c25]Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. RTA 2015: 143-159 - [c24]Jörg Endrullis, Hans Zantema:
Proving non-termination by finite automata. RTA 2015: 160-176 - [c23]Jörg Endrullis, Lawrence S. Moss:
Syllogistic Logic with "Most". WoLLIC 2015: 124-139 - [i20]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Regularity Preserving but not Reflecting Encodings. CoRR abs/1501.04835 (2015) - [i19]Jörg Endrullis, Hans Zantema:
Proving Looping and Non-Looping Non-Termination by Finite Automata. CoRR abs/1505.00478 (2015) - [i18]Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version). CoRR abs/1505.01128 (2015) - [i17]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Hans Zantema:
The Degree of Squares is an Atom (Extended Version). CoRR abs/1506.00884 (2015) - 2014
- [j14]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom:
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10(2) (2014) - [j13]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Discriminating Lambda-Terms Using Clocked Boehm Trees. Log. Methods Comput. Sci. 10(2) (2014) - [j12]Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi, Grigore Rosu:
On the complexity of stream equality. J. Funct. Program. 24(2-3): 166-217 (2014) - [c22]Jörg Endrullis, Dimitri Hendriks:
On periodically iterated morphisms. CSL-LICS 2014: 39:1-39:10 - [c21]David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss:
Eigenvalues and Transduction of Morphic Sequences. Developments in Language Theory 2014: 239-251 - [i16]Jörg Endrullis, Hans Zantema:
Non-termination using Regular Languages. CoRR abs/1405.5662 (2014) - [i15]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
An Introduction to the Clocked Lambda Calculus. CoRR abs/1405.7500 (2014) - [i14]David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss:
Eigenvalues and Transduction of Morphic Sequences: Extended Version. CoRR abs/1406.1754 (2014) - 2013
- [j11]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Streams are Forever. Bull. EATCS 109: 70-106 (2013) - [c20]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Clocks for Functional Programs. The Beauty of Functional Code 2013: 97-126 - [c19]Jörg Endrullis, Dimitri Hendriks, Martin Bodin:
Circular Coinduction in Coq Using Bisimulation-Up-To Techniques. ITP 2013: 354-369 - [c18]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Mix-Automatic Sequences. LATA 2013: 262-274 - [i13]Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva:
A Coinductive Treatment of Infinitary Rewriting. CoRR abs/1306.6224 (2013) - 2012
- [j10]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464: 48-71 (2012) - [c17]Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi:
On the complexity of equivalence of specifications of infinite objects. ICFP 2012: 153-164 - [c16]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. LICS 2012: 335-344 - [i12]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. CoRR abs/1201.3251 (2012) - [i11]Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop:
Arithmetic Self-Similarity of Infinite Sequences. CoRR abs/1201.3786 (2012) - [i10]Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi:
On the Complexity of Equivalence of Specifications of Infinite Objects. CoRR abs/1207.0158 (2012) - [i9]Jörg Endrullis, Dimitri Hendriks:
On Periodically Iterated Morphisms. CoRR abs/1207.2336 (2012) - 2011
- [j9]Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema:
Levels of undecidability in rewriting. Inf. Comput. 209(2): 227-245 (2011) - [j8]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Degrees of Streams. Integers 11B: A6 (2011) - [j7]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Fast leader election in anonymous rings with bounded expected delay. Inf. Process. Lett. 111(17): 864-870 (2011) - [j6]Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom:
On equal μ-terms. Theor. Comput. Sci. 412(28): 3175-3202 (2011) - [j5]Jörg Endrullis, Dimitri Hendriks:
Lazy productivity via termination. Theor. Comput. Sci. 412(28): 3203-3225 (2011) - [c15]Hans Zantema, Jörg Endrullis:
Proving Equality of Streams Automatically. RTA 2011: 393-408 - [c14]Jörg Endrullis, Andrew Polonsky:
Infinitary Rewriting Coinductively. TYPES 2011: 16-27 - 2010
- [j4]Jörg Endrullis, Dimitri Hendriks:
Transforming Outermost into Context-Sensitive Rewriting. Log. Methods Comput. Sci. 6(2) (2010) - [j3]Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann:
Local Termination: theory and practice. Log. Methods Comput. Sci. 6(3) (2010) - [j2]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of stream definitions. Theor. Comput. Sci. 411(4-5): 765-782 (2010) - [c13]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. LICS 2010: 111-119 - [c12]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Brief announcement: asynchronous bounded expected delay networks. PODC 2010: 392-393 - [c11]Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan J. Fokkink, Boudewijn R. Haverkort:
Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST 2010: 241-250 - [c10]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom:
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA 2010: 85-102 - [i8]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees. CoRR abs/1002.2578 (2010) - [i7]Jörg Endrullis:
Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability. CoRR abs/1003.1057 (2010) - [i6]Rena Bakhshi, Jörg Endrullis, Wan J. Fokkink, Jun Pang:
Asynchronous Bounded Expected Delay Networks. CoRR abs/1003.2084 (2010)
2000 – 2009
- 2009
- [c9]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Complexity of Fractran and Productivity. CADE 2009: 371-387 - [c8]Jörg Endrullis, Herman Geuvers, Hans Zantema:
Degrees of Undecidability in Term Rewriting. CSL 2009: 255-270 - [c7]Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann:
Local Termination. RTA 2009: 270-284 - [c6]Jörg Endrullis, Dimitri Hendriks:
From Outermost to Context-Sensitive Rewriting. RTA 2009: 305-319 - [i5]Jörg Endrullis, Herman Geuvers, Hans Zantema:
Degrees of Undecidability in Rewriting. CoRR abs/0902.4723 (2009) - [i4]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Complexity of Fractran and Productivity. CoRR abs/0903.4366 (2009) - [i3]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Let's Make a Difference! CoRR abs/0911.1004 (2009) - [i2]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop:
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting. CoRR abs/0911.1009 (2009) - 2008
- [j1]Jörg Endrullis, Johannes Waldmann, Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40(2-3): 195-220 (2008) - [c5]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Data-Oblivious Stream Productivity. LPAR 2008: 79-96 - [c4]Jörg Endrullis, Roel C. de Vrijer:
Reduction Under Substitution. RTA 2008: 425-440 - [c3]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer:
Proving Infinitary Normalization. TYPES 2008: 64-82 - [i1]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Data-Oblivious Stream Productivity. CoRR abs/0806.2680 (2008) - 2007
- [c2]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions. FCT 2007: 274-287 - 2006
- [c1]Jörg Endrullis, Johannes Waldmann, Hans Zantema:
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
