default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalle Saari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j13]Samuel Marchal
, Giovanni Armano, Tommi Grondahl, Kalle Saari, Nidhi Singh, N. Asokan:
Off-the-Hook: An Efficient and Usable Client-Side Phishing Prevention Application. IEEE Trans. Computers 66(10): 1717-1733 (2017)- 2016
- [c8]Samuel Marchal, Kalle Saari, Nidhi Singh, N. Asokan:
Know Your Phish: Novel Techniques for Detecting Phishing Sites and Their Targets. ICDCS 2016: 323-333 - 2015
- [i6]Samuel Marchal, Kalle Saari, Nidhi Singh, N. Asokan:
Know Your Phish: Novel Techniques for Detecting Phishing Sites and their Targets. CoRR abs/1510.06501 (2015) - 2014
- [j12]James D. Currie, Kalle Saari:
Square-free Words with Square-free Self-shuffles. Electron. J. Comb. 21(1): 1 (2014) - [j11]James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni:
Extremal words in morphic subshifts. Discret. Math. 322: 53-60 (2014) - [j10]Kalle Saari:
Lyndon words and Fibonacci numbers. J. Comb. Theory A 121: 34-44 (2014) - 2013
- [c7]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS 2013: 95-106 - [c6]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory 2013: 143-154 - [c5]Daniel Goc, Kalle Saari, Jeffrey O. Shallit:
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA 2013: 311-322 - [i5]James D. Currie, Narad Rampersad, Kalle Saari:
Extremal words in the shift orbit closure of a morphic sequence. CoRR abs/1301.4972 (2013) - [i4]James D. Currie, Narad Rampersad, Kalle Saari:
Suffix conjugates for a class of morphic subshifts. CoRR abs/1307.5329 (2013) - 2012
- [j9]Kaisa Matomäki, Kalle Saari:
A new geometric approach to Sturmian words. Theor. Comput. Sci. 432: 77-84 (2012) - [i3]Kaisa Matomäki, Kalle Saari:
A new geometric approach to Sturmian words. CoRR abs/1201.4468 (2012) - [i2]Kalle Saari:
Lyndon factors and the Fibonacci word. CoRR abs/1207.4233 (2012) - 2011
- [j8]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. 22(4): 905-920 (2011) - [j7]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83(1): 79-95 (2011) - [c4]Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari:
Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science 2011: 90-101 - 2010
- [j6]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. 45(2): 212-231 (2010) - [j5]Kalle Saari:
Everywhere alpha-repetitive sequences and Sturmian words. Eur. J. Comb. 31(1): 177-192 (2010) - [j4]Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. 44(1): 159-174 (2010) - [i1]Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni:
Avoiding Abelian powers in binary words with bounded Abelian complexity. CoRR abs/1005.2514 (2010)
2000 – 2009
- 2009
- [j3]Stepan Holub, Kalle Saari:
On highly palindromic words. Discret. Appl. Math. 157(5): 953-959 (2009) - [j2]James D. Currie, Kalle Saari:
Least Periods of Factors of Infinite Words. RAIRO Theor. Informatics Appl. 43(1): 165-178 (2009) - 2007
- [j1]Arto Lepistö, Francesco Pappalardi, Kalle Saari:
Transposition invariant words. Theor. Comput. Sci. 380(3): 377-387 (2007) - [c3]Kalle Saari:
Everywhere alpha -Repetitive Sequences and Sturmian Words. CSR 2007: 362-372 - 2006
- [c2]Kalle Saari:
On the Frequency of Letters in Morphic Sequences. CSR 2006: 334-345 - 2005
- [c1]Kalle Saari:
On the Frequency of Letters in Pure Binary Morphic Sequences. Developments in Language Theory 2005: 397-408
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-06-10 21:26 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:
