Joel D. Day

50 papers A* 3A 2B 3C 6Journal 24Unranked 11
YearRankTypeTitle / Venue / Authors
2025 A conf
FC-Datalog as a Framework for Efficient String Querying.
ICDT
Owen M. Bell, Joel D. Day, Dominik D. Freydenberger
2025 J jnl
FC-Datalog as a Framework for Efficient String Querying.
CoRR
Owen M. Bell, Joel D. Day, Dominik D. Freydenberger
2025 J jnl
Novel tree-search method for synthesizing SMT strategies.
Acta Informatica
Zhengyang John Lu, Joel D. Day, Piyush Jha, Paul Sarnighausen-Cahn, Stefan Siemer, Florin Manea, Vijay Ganesh
2025 J jnl
The edit distance to k-subsequence universality.
J. Comput. Syst. Sci.
Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer
2025 — conf
Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems.
RP
Joel D. Day, Matthew Konefal
2024 J jnl
A Closer Look at the Expressive Power of Logics Based on Word Equations.
Theory Comput. Syst.
Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea
2024 C ed.
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings
DLT
Joel D. Day, Florin Manea
2024 A* conf
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.
IJCAI
Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh
2024 — conf
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.
SMT@CAV
Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh
2024 J jnl
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.
CoRR
Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh
2024 J jnl
On the structure of solution-sets to regular word equations.
Theory Comput. Syst.
Joel D. Day, Florin Manea
2023 J jnl
Formal Languages via Theories over Strings: An Overview of Some Recent Results.
Bull. EATCS
Joel D. Day, Vijay Ganesh, Florin Manea
2023 J jnl
On the Expressive Power of String Constraints.
Proc. ACM Program. Lang.
Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea
2023 J jnl
Towards more efficient methods for solving regular-expression heavy string constraints.
Theor. Comput. Sci.
Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
2022 J jnl
A Generic Information Extraction System for String Constraints.
CoRR
Joel D. Day, Adrian Kröger, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2022 J jnl
Formal Languages via Theories over Strings.
CoRR
Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea
2022 J jnl
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems.
CoRR
Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid
2022 B conf
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems.
ISAAC
Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid
2022 J jnl
Unambiguous injective morphisms in free groups.
Inf. Comput.
Joel D. Day, Daniel Reidenbach
2022 C conf
Word Equations in the Context of String Solving.
DLT
Joel D. Day
2021 — conf
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length.
CAV (2)
Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh
2021 — conf
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back.
WORDS
Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
2021 J jnl
String Theories involving Regular Membership Predicates: From Practice to Theory and Back.
CoRR
Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
2021 A conf
The Edit Distance to k-Subsequence Universality.
STACS
Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer
2020 J jnl
A Length-aware Regular Expression SMT Solver.
CoRR
Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh
2020 J jnl
Equations enforcing repetitions under permutations.
Discret. Appl. Math.
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
2020 A* conf
On the Structure of Solution Sets to Regular Word Equations.
ICALP
Joel D. Day, Florin Manea
2020 — conf
Rule-based Word Equation Solving.
FormaliSE@ICSE
Joel D. Day, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2019 A* conf
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.
ICALP
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
2019 J jnl
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.
CoRR
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid
2019 — conf
On Solving Word Equations Using SAT.
RP
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2019 J jnl
On Solving Word Equations Using SAT.
CoRR
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
2019 B conf
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations.
MFCS
Joel D. Day, Florin Manea, Dirk Nowotka
2019 C conf
k-Spectra of Weakly-c-Balanced Words.
DLT
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
2019 J jnl
k-Spectra of c-Balanced Words.
CoRR
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
2018 C conf
On Matching Generalised Repetitive Patterns.
DLT
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid
2018 J jnl
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.
CoRR
Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka
2018 — conf
The Satisfiability of Word Equations: Decidable and Undecidable Theories.
RP
Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka
2017 J jnl
Closure properties of pattern languages.
J. Comput. Syst. Sci.
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2017 — conf
Equations Enforcing Repetitions Under Permutations.
WORDS
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
2017 — conf
Local Patterns.
FSTTCS
Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka
2017 B conf
The Hardness of Solving Simple Word Equations.
MFCS
Joel D. Day, Florin Manea, Dirk Nowotka
2017 J jnl
The Hardness of Solving Simple Word Equations.
CoRR
Joel D. Day, Florin Manea, Dirk Nowotka
2016 — —
On restricting the ambiguity in morphic images of words.
Joel D. Day
2015 — conf
Ambiguity of Morphisms in a Free Group.
WORDS
Joel D. Day, Daniel Reidenbach
2015 J jnl
Periodicity forcing words.
Theor. Comput. Sci.
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
2014 C conf
Closure Properties of Pattern Languages.
Developments in Language Theory
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2014 J jnl
On the Dual Post Correspondence Problem.
Int. J. Found. Comput. Sci.
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
2013 C conf
On the Dual Post Correspondence Problem.
Developments in Language Theory
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
2013 — conf
Periodicity Forcing Words.
WORDS
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider