Kalle Saari - RankMe

27 papers A 1C 3Misc 2Journal 19Unranked 2

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Off-the-Hook: An Efficient and Usable Client-Side Phishing Prevention Application. IEEE Trans. Computers Samuel Marchal, Giovanni Armano, Tommi Grondahl, Kalle Saari, Nidhi Singh, N. Asokan
2016	A	`conf`	Know Your Phish: Novel Techniques for Detecting Phishing Sites and Their Targets. ICDCS Samuel Marchal, Kalle Saari, Nidhi Singh, N. Asokan
2015	J	`jnl`	Know Your Phish: Novel Techniques for Detecting Phishing Sites and their Targets. CoRR Samuel Marchal, Kalle Saari, Nidhi Singh, N. Asokan
2014	J	`jnl`	Extremal words in morphic subshifts. Discret. Math. James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
2014	J	`jnl`	Lyndon words and Fibonacci numbers. J. Comb. Theory A Kalle Saari
2014	J	`jnl`	Square-free Words with Square-free Self-shuffles. Electron. J. Comb. James D. Currie, Kalle Saari
2013	C	`conf`	Extremal Words in the Shift Orbit Closure of a Morphic Sequence. Developments in Language Theory James D. Currie, Narad Rampersad, Kalle Saari
2013	J	`jnl`	Extremal words in the shift orbit closure of a morphic sequence CoRR James D. Currie, Narad Rampersad, Kalle Saari
2013	C	`conf`	Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences. LATA Daniel Goc, Kalle Saari, Jeffrey O. Shallit
2013	—	`conf`	Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract). WORDS James D. Currie, Narad Rampersad, Kalle Saari
2013	J	`jnl`	Suffix conjugates for a class of morphic subshifts. CoRR James D. Currie, Narad Rampersad, Kalle Saari
2012	J	`jnl`	A new geometric approach to Sturmian words CoRR Kaisa Matomäki, Kalle Saari
2012	J	`jnl`	A new geometric approach to Sturmian words. Theor. Comput. Sci. Kaisa Matomäki, Kalle Saari
2012	J	`jnl`	Lyndon factors and the Fibonacci word CoRR Kalle Saari
2011	J	`jnl`	Abelian complexity of minimal subshifts. J. Lond. Math. Soc. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2011	J	`jnl`	Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. Int. J. Found. Comput. Sci. Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2011	—	`conf`	Local Squares, Periodicity and Finite Automata. Rainbow of Computer Science Mari Huova, Juhani Karhumäki, Aleksi Saarela, Kalle Saari
2010	J	`jnl`	Avoiding Abelian powers in binary words with bounded Abelian complexity CoRR Julien Cassaigne, Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2010	J	`jnl`	Balance and Abelian complexity of the Tribonacci word. Adv. Appl. Math. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2010	J	`jnl`	Everywhere alpha-repetitive sequences and Sturmian words. Eur. J. Comb. Kalle Saari
2010	J	`jnl`	Standard factors of Sturmian words. RAIRO Theor. Informatics Appl. Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
2009	J	`jnl`	Least Periods of Factors of Infinite Words. RAIRO Theor. Informatics Appl. James D. Currie, Kalle Saari
2009	J	`jnl`	On highly palindromic words. Discret. Appl. Math. Stepan Holub, Kalle Saari
2007	Misc	`conf`	Everywhere CSR Kalle Saari
2007	J	`jnl`	Transposition invariant words. Theor. Comput. Sci. Arto Lepistö, Francesco Pappalardi, Kalle Saari
2006	Misc	`conf`	On the Frequency of Letters in Morphic Sequences. CSR Kalle Saari
2005	C	`conf`	On the Frequency of Letters in Pure Binary Morphic Sequences. Developments in Language Theory Kalle Saari