Juha Kortelainen

Orcid: 0000-0003-3040-2441

According to our database1, Juha Kortelainen authored at least 36 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A microservices-based architecture for data and software management of heavy equipment digital twins.
Proceedings of the 21st IEEE International Conference on Industrial Informatics, 2023

2022
On the alleviation of imminent technical and business challenges of long-lasting functional digital twins.
Comput. Ind., 2022

Physics-Based Digital Twins Merging With Machines: Cases of Mobile Log Crane and Rotating Machine.
IEEE Access, 2022

2020
Enhancing Technical Simulations with Machine Learning.
ERCIM News, 2020

Surrogate Modeling of Electrical Machine Torque Using Artificial Neural Networks.
IEEE Access, 2020

2018
Automatic Generation of Simulation-based Digital Twins of Industrial Process Plants.
ERCIM News, 2018

Thirty Years of Electro-Hybrid Powertrain Simulation.
IEEE Access, 2018

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

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

2013
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

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

2011
On Partitions Separating Words.
Int. J. Algebra Comput., 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

2010
Multicollision attacks and generalized iterated hash functions.
J. Math. Cryptol., 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

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

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

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

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

2001
Linear size test sets for certain commutative languages.
RAIRO Theor. Informatics Appl., 2001

1999
On the System of Word Equations <i>x</i><sub>0</sub><i>u</i><sup><i>i</i></sup><sub>1</sub><i>x</i><sub>1</sub><i>u</i><sup><i>i</i></sup><sub>2</sub><i>x</i><sub>2</sub><i>u</i><sup><i>i</i></sup><sub>3</sub><i>x</i><sub>3</sub>=<i>y</i><sub>0</sub><i>v</i><sup><i>i</i></sup><sub>1</sub><i>y</i><sub>1</sub><i>v</i><sup><i>i</i></sup><sub>2</sub><i>y</i><sub>2</sub><i>v</i><sup><i>i</i></sup><sub>3</sub><i>y</i><sub>3</sub>(<i>i</i>=0, 1, 2, ...) in a Free Monoid.
Theor. Comput. Sci., 1999

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

On the System of Word Equations x<sub>0</sub>u<sub>1</sub><sup>i</sup>x<sub>1</sub>u<sub>2</sub><sup>i</sup>x<sub>2</sub> ... u<sub>m</sub><sup>i</sup>x<sub>m</sub> = y<sub>0</sub>v<sub>1</sub><sup>i</sup>y<sub>1</sub>v<sub>2</sub><sup>i</sup>y<sub>2</sub> ... v<sub>n</sub><sup>i</sup>y<sub>n</sub> (i=0, 1, 2, ...) in a Free Monoid.
J. Autom. Lang. Comb., 1998

1997
Polynomial Size Test Sets for Commutative Languages.
RAIRO Theor. Informatics Appl., 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 Informatica, 1997

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

1986
Every Commutative Quasirational Language is Regular.
RAIRO Theor. Informatics Appl., 1986

1982
A result concerning the trios generated by commutative slip-languages.
Discret. Appl. Math., 1982

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


  Loading...