- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c12 |      | Tuomas Kortelainen, Ari Vesanen, Juha Kortelainen: Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision Attacks. INDOCRYPT 2012: 172-190 |
| 2011 | ||
| j11 | | |
| c11 | | Juha Kortelainen, Tuomas Kortelainen, Ari Vesanen: Unavoidable Regularities in Long Words with Bounded Number of Symbol Occurrences. COCOON 2011: 519-530 |
| c10 | | Juha Kortelainen, Tuukka Salmi: There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages. Developments in Language Theory 2011: 312-323 |
| c9 | | |
| 2010 | ||
| j10 | | Juha Kortelainen, Kimmo Halunen, Tuomas Kortelainen: Multicollision attacks and generalized iterated hash functions. J. Mathematical Cryptology 4(3): 239-270 (2010) |
| c8 | | Tuomas Kortelainen, Juha Kortelainen, Kimmo Halunen: Variants of Multicollision Attacks on Iterated Hash Functions. Inscrypt 2010: 139-154 |
| c7 | | Marek Gayer, Juha Kortelainen, Tommi Karhela: CFD modelling as an integrated part of multi-level simulation of process plants: semantic modelling approach. SummerSim 2010: 219-227 |
| 2009 | ||
| c6 | | Antti Siirtola, Juha Kortelainen: Parameterised Process Algebraic Verification by Precongruence Reduction. ACSD 2009: 158-167 |
| c5 | | Antti Siirtola, Juha Kortelainen: Algorithmic Verification with Multiple and Nested Parameters. ICFEM 2009: 561-580 |
| i1 | | Kimmo Halunen, Juha Kortelainen, Tuomas Kortelainen: An Automata-Theoretic Interpretation of Iterated Hash Functions - Application to Multicollisions. IACR Cryptology ePrint Archive 2009: 456 (2009) |
| 2008 | ||
| c4 | | Rodolfo Ibarra-Orozco, Miguel González-Mendoza, Neil Hernández-Gress, Frederik Diederichs, Juha Kortelainen: Towards a Ready-to-Use Drivers' Vigilance Monitoring System. CIMCA/IAWTIC/ISE 2008: 802-807 |
| 2007 | ||
| j9 | | Stepan Holub, Juha Kortelainen: On systems of word equations with simple loop sets. Theor. Comput. Sci. 380(3): 363-372 (2007) |
| 2005 | ||
| c3 | | Juha Kortelainen: Polynomial Generators of Recursively Enumerable Languages. Developments in Language Theory 2005: 320-326 |
| 2001 | ||
| j8 | | Stepan Holub, Juha Kortelainen: Linear size test sets for certain commutative languages. ITA 35(5): 453-475 (2001) |
| 1999 | ||
| j7 | | Ismo Hakala, Juha Kortelainen: On the System of Word Equations x0ui1x1ui2x2ui3x3=y0vi1y1vi2y2vi3y3(i=0, 1, 2, ...) in a Free Monoid. Theor. Comput. Sci. 225(1-2): 149-161 (1999) |
| 1998 | ||
| j6 |  | Juha Kortelainen: On the System of Word Equations x0u1ix1u2ix2 ... umixm = y0v1iy1v2iy2 ... vniyn (i=0, 1, 2, ...) in a Free Monoid. Journal of Automata, Languages and Combinatorics 3(1): 43-58 (1998) |
| j5 | | Juha Kortelainen: Remarks about Commutative Context-Free Languages. J. Comput. Syst. Sci. 56(1): 125-129 (1998) |
| 1997 | ||
| j4 | | Ismo Hakala, Juha Kortelainen: On the System of word equations x^i_1 x^i_2 ... x^i_m = y^i_1 y^i_2 ...y^i_n (i=1, 2, ...) in a Free Monoid. Acta Inf. 34(3): 217-230 (1997) |
| j3 | | Ismo Hakala, Juha Kortelainen: Polynomial Size Test Sets for Commutative Languages. ITA 31(3): 291-304 (1997) |
| 1989 | ||
| j2 | | Juha Kortelainen: The conjecture of Fliess on commutative context-free languages. J. ACM 36(4): 870-872 (1989) |
| 1986 | ||
| j1 | | |
| 1985 | ||
| c2 | | |
| 1981 | ||
| c1 | | Juha Kortelainen: Some Properties of Language Families Generated by Commutative Languages. FCT 1981: 210-217 |
Colors in the list of coauthors
Last update Sat May 25 23:40:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page