default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksi Saarela
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Aleksi Saarela, Aleksi Vanhatalo
:
A Connection Between Unbordered Partial Words and Sparse Rulers. CoRR abs/2408.16335 (2024)- 2023
- [c21]Aleksi Saarela:
On the Solution Sets of Entire Systems of Word Equations. WORDS 2023: 261-273 - 2022
- [j20]Dirk Nowotka, Aleksi Saarela:
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. SIAM J. Comput. 51(1): 1-18 (2022) - 2021
- [j19]Aleksi Saarela:
Separating the Words of a Language by Counting Factors. Fundam. Informaticae 180(4): 375-393 (2021) - [j18]Jarkko Peltomäki, Aleksi Saarela:
Standard words and solutions of the word equation X12⋯Xn2=(X1⋯Xn)2. J. Comb. Theory A 178: 105340 (2021) - 2020
- [c20]Aleksi Saarela:
Hardness Results for Constant-Free Pattern Languages and Word Equations. ICALP 2020: 140:1-140:15 - [i5]Jarkko Peltomäki, Aleksi Saarela:
Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm X_n)^2$. CoRR abs/2004.14657 (2020)
2010 – 2019
- 2019
- [j17]Aleksi Saarela:
Word equations with kth powers of variables. J. Comb. Theory A 165: 15-31 (2019) - [j16]Sergey V. Avgustinovich, Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
On abelian saturated infinite words. Theor. Comput. Sci. 792: 154-160 (2019) - [c19]Aleksi Saarela:
Independent Systems of Word Equations: From Ehrenfeucht to Eighteen. WORDS 2019: 60-67 - [c18]Aleksi Saarela:
Separating Many Words by Counting Occurrences of Factors. DLT 2019: 251-264 - [i4]Aleksi Saarela:
Separating many words by counting occurrences of factors. CoRR abs/1905.07223 (2019) - 2018
- [j15]Aleksi Saarela:
Studying Word Equations by a Method of Weighted Frequencies. Fundam. Informaticae 162(2-3): 223-235 (2018) - [j14]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) - [j13]Dirk Nowotka, Aleksi Saarela:
One-Variable Word Equations and Three-Variable Constant-Free Word Equations. Int. J. Found. Comput. Sci. 29(5): 935-950 (2018) - [c17]Dirk Nowotka, Aleksi Saarela:
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences. ICALP 2018: 136:1-136:13 - [i3]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
- [j12]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Acta Cybern. 23(1): 175-189 (2017) - [j11]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On growth and fluctuation of k-abelian complexity. Eur. J. Comb. 65: 92-105 (2017) - [c16]Aleksi Saarela:
Palindromic Length in Free Monoids and Free Groups. WORDS 2017: 203-213 - [c15]Aleksi Saarela:
Word Equations Where a Power Equals a Product of Powers. STACS 2017: 55:1-55:9 - 2016
- [j10]Aleksi Saarela:
Equivalence Relations Defined by Numbers of Occurrences of Factors. Fundam. Informaticae 145(3): 385-397 (2016) - [c14]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. DLT 2016: 164-176 - [c13]Dirk Nowotka, Aleksi Saarela:
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. DLT 2016: 332-343 - 2015
- [j9]Aleksi Saarela:
Systems of word equations, polynomials and linear algebra: A new approach. Eur. J. Comb. 47: 1-14 (2015) - [c12]Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On Growth and Fluctuation of k-Abelian Complexity. CSR 2015: 109-122 - [c11]Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland:
Degrees of Transducibility. WORDS 2015: 1-13 - 2014
- [j8]Robert Mercas, Aleksi Saarela:
5-Abelian cubes are avoidable on binary alphabets. RAIRO Theor. Informatics Appl. 48(4): 467-478 (2014) - [c10]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. Developments in Language Theory 2014: 203-214 - [i2]Aleksi Saarela:
Systems of word equations, polynomials and linear algebra: A new approach. CoRR abs/1401.7498 (2014) - 2013
- [j7]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
Fine and Wilf's Theorem for k-Abelian Periods. Int. J. Found. Comput. Sci. 24(7): 1135-1152 (2013) - [j6]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. J. Comb. Theory A 120(8): 2189-2206 (2013) - [c9]Mari Huova, Aleksi Saarela:
Strongly k-Abelian Repetitions. WORDS 2013: 161-168 - [c8]Aleksi Saarela:
Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants. WORDS 2013: 229-237 - [c7]Robert Mercas, Aleksi Saarela:
3-Abelian Cubes Are Avoidable on Binary Alphabets. Developments in Language Theory 2013: 374-383 - [i1]Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni:
On a generalization of Abelian equivalence and complexity of infinite words. CoRR abs/1301.5104 (2013) - 2012
- [j5]Mari Huova, Juhani Karhumäki, Aleksi Saarela:
Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci. 454: 172-177 (2012) - [c6]Juhani Karhumäki, Svetlana Puzynina, Aleksi Saarela:
Fine and Wilf's Theorem for k-Abelian Periods. Developments in Language Theory 2012: 296-307 - 2011
- [j4]Juhani Karhumäki, Aleksi Saarela:
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110(1-4): 197-200 (2011) - [j3]Aleksi Saarela:
Unique decipherability in the additive monoid of sets of numbers. RAIRO Theor. Informatics Appl. 45(2): 225-234 (2011) - [c5]Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari:
Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science 2011: 90-101 - [c4]Aleksi Saarela:
Systems of Word Equations and Polynomials: a New Approach. WORDS 2011: 215-225 - 2010
- [j2]Juhani Karhumäki, Aleksi Saarela:
Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discret. Math. Theor. Comput. Sci. 12(4): 9-18 (2010)
2000 – 2009
- 2009
- [j1]Aleksi Saarela:
Ultimately Constant Abelian Complexity of Infinite Words. J. Autom. Lang. Comb. 14(3/4): 255-258 (2009) - [c3]Aleksi Saarela:
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations. Developments in Language Theory 2009: 443-453 - 2008
- [c2]Juhani Karhumäki, Aleksi Saarela:
An Analysis and a Reproof of Hmelevskii's Theorem. Developments in Language Theory 2008: 467-478 - [c1]Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg:
Random Beacon for Privacy and Group Security. WiMob 2008: 514-519
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-10-07 21:19 CEST 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:
