Aleksi Saarela

53 papers A* 2A 2B 1C 9Misc 1Journal 30Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Connection Between Unbordered Partial Words and Sparse Rulers. Electron. J. Comb. Aleksi Saarela, Aleksi Vanhatalo
2026	A	`conf`	An Improved Version of Hmelevskii's Theorem on Three-Variable Word Equations. STACS Aleksi Saarela
2025	C	`conf`	Mapped Exponent and Asymptotic Critical Exponent of Words. DLT Eva Foster, Aleksi Saarela, Aleksi Vanhatalo
2025	J	`jnl`	Mapped Exponent and Asymptotic Critical Exponent of Words. CoRR Eva Foster, Aleksi Saarela, Aleksi Vanhatalo
2025	J	`jnl`	Mapping words to powers by morphisms. CoRR Aleksi Saarela
2024	J	`jnl`	A Connection Between Unbordered Partial Words and Sparse Rulers. CoRR Aleksi Saarela, Aleksi Vanhatalo
2024	J	`jnl`	On the Solution Sets of Three-Variable Word Equations. Theory Comput. Syst. Aleksi Saarela
2023	—	`conf`	On the Solution Sets of Entire Systems of Word Equations. WORDS Aleksi Saarela
2022	J	`jnl`	An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. SIAM J. Comput. Dirk Nowotka, Aleksi Saarela
2021	J	`jnl`	Separating the Words of a Language by Counting Factors. Fundam. Informaticae Aleksi Saarela
2021	J	`jnl`	Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2. J. Comb. Theory A Jarkko Peltomäki, Aleksi Saarela
2020	A*	`conf`	Hardness Results for Constant-Free Pattern Languages and Word Equations. ICALP Aleksi Saarela
2020	J	`jnl`	Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$. CoRR Jarkko Peltomäki, Aleksi Saarela
2019	—	`conf`	Independent Systems of Word Equations: From Ehrenfeucht to Eighteen. WORDS Aleksi Saarela
2019	J	`jnl`	On abelian saturated infinite words. Theor. Comput. Sci. Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2019	C	`conf`	Separating Many Words by Counting Occurrences of Factors. DLT Aleksi Saarela
2019	J	`jnl`	Separating many words by counting occurrences of factors. CoRR Aleksi Saarela
2019	J	`jnl`	Word equations with J. Comb. Theory A Aleksi Saarela
2018	A*	`conf`	An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. ICALP Dirk Nowotka, Aleksi Saarela
2018	J	`jnl`	Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2018	J	`jnl`	Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2018	J	`jnl`	One-Variable Word Equations and Three-Variable Constant-Free Word Equations. Int. J. Found. Comput. Sci. Dirk Nowotka, Aleksi Saarela
2018	J	`jnl`	Studying Word Equations by a Method of Weighted Frequencies. Fundam. Informaticae Aleksi Saarela
2017	J	`jnl`	On growth and fluctuation of k-abelian complexity. Eur. J. Comb. Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
2017	—	`conf`	Palindromic Length in Free Monoids and Free Groups. WORDS Aleksi Saarela
2017	J	`jnl`	Variations of the Morse-Hedlund Theorem for Acta Cybern. Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2017	A	`conf`	Word Equations Where a Power Equals a Product of Powers. STACS Aleksi Saarela
2016	C	`conf`	Degrees of Infinite Words, Polynomials and Atoms. DLT Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2016	J	`jnl`	Equivalence Relations Defined by Numbers of Occurrences of Factors. Fundam. Informaticae Aleksi Saarela
2016	C	`conf`	One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. DLT Dirk Nowotka, Aleksi Saarela
2015	—	`conf`	Degrees of Transducibility. WORDS Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland
2015	Misc	`conf`	On Growth and Fluctuation of k-Abelian Complexity. CSR Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
2015	J	`jnl`	Systems of word equations, polynomials and linear algebra: A new approach. Eur. J. Comb. Aleksi Saarela
2014	J	`jnl`	5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. Robert Mercas, Aleksi Saarela
2014	J	`jnl`	Systems of word equations, polynomials and linear algebra: A new approach. CoRR Aleksi Saarela
2014	C	`conf`	Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2013	C	`conf`	3-Abelian Cubes Are Avoidable on Binary Alphabets. Developments in Language Theory Robert Mercas, Aleksi Saarela
2013	J	`jnl`	Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2013	J	`jnl`	On a generalization of Abelian equivalence and complexity of infinite words CoRR Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2013	J	`jnl`	On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory A Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2013	—	`conf`	Strongly k-Abelian Repetitions. WORDS Mari Huova, Aleksi Saarela
2013	—	`conf`	Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants. WORDS Aleksi Saarela
2012	C	`conf`	Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela
2012	J	`jnl`	Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. Mari Huova, Juhani Karhumäki, Aleksi Saarela
2011	—	`conf`	Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari
2011	—	`conf`	Systems of Word Equations and Polynomials: a New Approach WORDS Aleksi Saarela
2011	J	`jnl`	The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae Juhani Karhumäki, Aleksi Saarela
2011	J	`jnl`	Unique decipherability in the additive monoid of sets of numbers. RAIRO Theor. Informatics Appl. Aleksi Saarela
2010	J	`jnl`	Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discret. Math. Theor. Comput. Sci. Juhani Karhumäki, Aleksi Saarela
2009	C	`conf`	On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations. Developments in Language Theory Aleksi Saarela
2009	J	`jnl`	Ultimately Constant Abelian Complexity of Infinite Words. J. Autom. Lang. Comb. Aleksi Saarela
2008	C	`conf`	An Analysis and a Reproof of Hmelevskii's Theorem. Developments in Language Theory Juhani Karhumäki, Aleksi Saarela
2008	B	`conf`	Random Beacon for Privacy and Group Security. WiMob Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg