default search action
Joel D. Day
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea:
A Closer Look at the Expressive Power of Logics Based on Word Equations. Theory Comput. Syst. 68(3): 322-379 (2024) - [j9]Joel D. Day
, Florin Manea:
On the structure of solution-sets to regular word equations. Theory Comput. Syst. 68(4): 662-739 (2024) - [c22]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. IJCAI 2024: 1907-1915 - [c21]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. SMT@CAV 2024: 75 - [e1]Joel D. Day
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings. Lecture Notes in Computer Science 14791, Springer 2024, ISBN 978-3-031-66158-7 [contents] - [i11]Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh:
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis. CoRR abs/2401.17159 (2024) - 2023
- [j8]Joel D. Day, Vijay Ganesh, Florin Manea:
Formal Languages via Theories over Strings: An Overview of Some Recent Results. Bull. EATCS 140 (2023) - [j7]Joel D. Day
On the Expressive Power of String Constraints. Proc. ACM Program. Lang. 7(POPL): 278-308 (2023) - [j6]Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski
Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943: 50-72 (2023) - 2022
- [j5]Joel D. Day, Daniel Reidenbach
Unambiguous injective morphisms in free groups. Inf. Comput. 289(Part): 104946 (2022) - [c20]Joel D. Day
Word Equations in the Context of String Solving. DLT 2022: 13-32 - [c19]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. ISAAC 2022: 64:1-64:18 - [i10]Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea:
Formal Languages via Theories over Strings. CoRR abs/2205.00475 (2022) - [i9]Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid:
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems. CoRR abs/2206.13896 (2022) - [i8]Joel D. Day, Adrian Kröger, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
A Generic Information Extraction System for String Constraints. CoRR abs/2208.08806 (2022) - 2021
- [c18]Murphy Berzish, Mitja Kulczynski
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length. CAV (2) 2021: 289-312 - [c17]Murphy Berzish, Joel D. Day, Vijay Ganesh
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back. WORDS 2021: 50-64 - [c16]Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. STACS 2021: 25:1-25:19 - [i7]Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka:
String Theories involving Regular Membership Predicates: From Practice to Theory and Back. CoRR abs/2105.07220 (2021) - 2020
- [j4]Joel D. Day, Pamela Fleischmann
Equations enforcing repetitions under permutations. Discret. Appl. Math. 285: 61-78 (2020) - [c15]Joel D. Day, Florin Manea:
On the Structure of Solution Sets to Regular Word Equations. ICALP 2020: 124:1-124:16 - [c14]Joel D. Day, Mitja Kulczynski
Rule-based Word Equation Solving. FormaliSE@ICSE 2020: 87-97 - [i6]Murphy Berzish
A Length-aware Regular Expression SMT Solver. CoRR abs/2010.07253 (2020)
2010 – 2019
- 2019
- [c13]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
k-Spectra of Weakly-c-Balanced Words. DLT 2019: 265-277 - [c12]Katrin Casel, Joel D. Day
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. ICALP 2019: 109:1-109:16 - [c11]Joel D. Day, Florin Manea, Dirk Nowotka:
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. MFCS 2019: 44:1-44:15 - [c10]Joel D. Day, Thorsten Ehlers, Mitja Kulczynski
On Solving Word Equations Using SAT. RP 2019: 93-106 - [i5]Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid:
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. CoRR abs/1902.10983 (2019) - [i4]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
k-Spectra of c-Balanced Words. CoRR abs/1904.09125 (2019) - [i3]Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen:
On Solving Word Equations Using SAT. CoRR abs/1906.11718 (2019) - 2018
- [c9]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid:
On Matching Generalised Repetitive Patterns. DLT 2018: 269-281 - [c8]Joel D. Day, Vijay Ganesh
The Satisfiability of Word Equations: Decidable and Undecidable Theories. RP 2018: 15-29 - [i2]Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka:
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability. CoRR abs/1802.00523 (2018) - 2017
- [j3]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure properties of pattern languages. J. Comput. Syst. Sci. 84: 11-31 (2017) - [c7]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Equations Enforcing Repetitions Under Permutations. WORDS 2017: 72-84 - [c6]Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Local Patterns. FSTTCS 2017: 24:1-24:14 - [c5]Joel D. Day, Florin Manea, Dirk Nowotka:
The Hardness of Solving Simple Word Equations. MFCS 2017: 18:1-18:14 - [i1]Joel D. Day, Florin Manea, Dirk Nowotka:
The Hardness of Solving Simple Word Equations. CoRR abs/1702.07922 (2017) - 2016
- [b1]Joel D. Day:
On restricting the ambiguity in morphic images of words. Loughborough University, UK, 2016 - 2015
- [j2]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity forcing words. Theor. Comput. Sci. 601: 2-14 (2015) - [c4]Joel D. Day, Daniel Reidenbach:
Ambiguity of Morphisms in a Free Group. WORDS 2015: 97-108 - 2014
- [j1]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. Int. J. Found. Comput. Sci. 25(8): 1033-1048 (2014) - [c3]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure Properties of Pattern Languages. Developments in Language Theory 2014: 279-290 - 2013
- [c2]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity Forcing Words. WORDS 2013: 107-118 - [c1]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. Developments in Language Theory 2013: 167-178
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 2024-11-07 20:34 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: