Juha Kortelainen

According to our database1, Juha Kortelainen
  • authored at least 32 papers between 1981 and 2015.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 


On csauthors.net:


On simple generators of recursively enumerable languages.
J. Comput. Syst. Sci., 2015

Multi-parameterised compositional verification of safety properties.
Inf. Comput., 2015

Semantic restrictions and rules in applications of multibody dynamics.
Eng. Comput. (Lond.), 2015

New Second Preimage Attack Variants against the MD-Structure.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

Unavoidable regularities in long words with bounded number of symbol occurrences.
J. Comb. Optim., 2013

On Diamond Structures and Trojan Message Attacks.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision Attacks.
Proceedings of the Progress in Cryptology, 2012

On Partitions Separating Words.
IJAC, 2011

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions.
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Unavoidable Regularities in Long Words with Bounded Number of Symbol Occurrences.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Multicollision attacks and generalized iterated hash functions.
J. Mathematical Cryptology, 2010

CFD modelling as an integrated part of multi-level simulation of process plants: semantic modelling approach.
Proceedings of the SummerSim '10, 2010

Variants of Multicollision Attacks on Iterated Hash Functions.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

Combinatorial Multicollision Attacks on Generalized Iterated Hash Functions.
Proceedings of the 8th Australasian Information Security Conference 2010, 2010

An Automata-Theoretic Interpretation of Iterated Hash Functions - Application to Multicollisions.
IACR Cryptology ePrint Archive, 2009

Algorithmic Verification with Multiple and Nested Parameters.
Proceedings of the Formal Methods and Software Engineering, 2009

Parameterised Process Algebraic Verification by Precongruence Reduction.
Proceedings of the Ninth International Conference on Application of Concurrency to System Design, 2009

Towards a Ready-to-Use Drivers' Vigilance Monitoring System.
Proceedings of the 2008 International Conferences on Computational Intelligence for Modelling, 2008

On systems of word equations with simple loop sets.
Theor. Comput. Sci., 2007

Polynomial Generators of Recursively Enumerable Languages.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Linear size test sets for certain commutative languages.
ITA, 2001

On the System of Word Equations x0ui1x1ui2x2ui3x3=y0vi1y1vi2y2vi3y3(i=0, 1, 2, ...) in a Free Monoid.
Theor. Comput. Sci., 1999

Remarks about Commutative Context-Free Languages.
J. Comput. Syst. Sci., 1998

On the System of Word Equations x0u1ix1u2ix2 ... umixm = y0v1iy1v2iy2 ... vniyn (i=0, 1, 2, ...) in a Free Monoid.
Journal of Automata, Languages and Combinatorics, 1998

Polynomial Size Test Sets for Commutative Languages.
ITA, 1997

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., 1997

The conjecture of Fliess on commutative context-free languages.
J. ACM, 1989

Every Commutative Quasirational Language is Regular.
ITA, 1986

Every Commutative Quasirational Language is Regular.
Proceedings of the Automata, 1985

A result concerning the trios generated by commutative slip-languages.
Discrete Applied Mathematics, 1982

Some Properties of Language Families Generated by Commutative Languages.
Proceedings of the Fundamentals of Computation Theory, 1981