Juha Kortelainen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2023

A microservices-based architecture for data and software management of heavy equipment digital twinsVictor Zhidchenko, Egor Startcev, Juha Kortelainen, Akhtar Zeb, Leo Torvikoski, Saeid Torkabadi, Heikki Handroos. indin 2023: 1-8 [doi]

2022

2020

Enhancing Technical Simulations with Machine LearningHamid Asgari, Juha Kortelainen, Mikko Tahkola. ercim, 2020(122), 2020. [doi]

Surrogate Modeling of Electrical Machine Torque Using Artificial Neural NetworksMikko Tahkola, Janne Keränen, Denis Sedov, Mehrnaz Farzam Far, Juha Kortelainen. access, 8:220027-220045, 2020. [doi]

2018

Automatic Generation of Simulation-based Digital Twins of Industrial Process PlantsGerardo Santillán Martínez, Tommi Karhela, Reino Ruusu, Juha Kortelainen. ercim, 2018(115), 2018. [doi]

Thirty Years of Electro-Hybrid Powertrain SimulationKari Tammi, Tatiana A. Minav, Juha Kortelainen. access, 6:35250-35259, 2018. [doi]

2015

On simple generators of recursively enumerable languagesJuha Kortelainen. jcss, 81(1):249-257, 2015. [doi]

Multi-parameterised compositional verification of safety propertiesAntti Siirtola, Juha Kortelainen. iandc, 244:23-48, 2015. [doi]

2014

New Second Preimage Attack Variants against the MD-StructureTuomas Kortelainen, Juha Kortelainen. cans 2014: 98-110 [doi]

2013

On Diamond Structures and Trojan Message AttacksTuomas Kortelainen, Juha Kortelainen. asiacrypt 2013: 524-539 [doi]

Unavoidable regularities in long words with bounded number of symbol occurrencesJuha Kortelainen, Tuomas Kortelainen, Ari Vesanen. jco, 26(4):670-686, 2013. [doi]

2012

Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision AttacksTuomas Kortelainen, Ari Vesanen, Juha Kortelainen. indocrypt 2012: 172-190 [doi]

2011

On Partitions Separating WordsStepan Holub, Juha Kortelainen. ijac, 21(8):1305-1316, 2011. [doi]

Unavoidable Regularities in Long Words with Bounded Number of Symbol OccurrencesJuha Kortelainen, Tuomas Kortelainen, Ari Vesanen. cocoon 2011: 519-530 [doi]

There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free LanguagesJuha Kortelainen, Tuukka Salmi. dlt 2011: 312-323 [doi]

2010

2009

An Automata-Theoretic Interpretation of Iterated Hash Functions - Application to MulticollisionsKimmo Halunen, Juha Kortelainen, Tuomas Kortelainen. iacr, 2009:456, 2009. [doi]

Algorithmic Verification with Multiple and Nested ParametersAntti Siirtola, Juha Kortelainen. icfem 2009: 561-580 [doi]

Parameterised Process Algebraic Verification by Precongruence ReductionAntti Siirtola, Juha Kortelainen. acsd 2009: 158-167 [doi]

2008

Towards a Ready-to-Use Drivers Vigilance Monitoring SystemRodolfo Ibarra-Orozco, Miguel GonzÃ¡lez-Mendoza, Neil HernÃ¡ndez-Gress, Frederik Diederichs, Juha Kortelainen. cimca 2008: 802-807 [doi]

2007

On systems of word equations with simple loop setsStepan Holub, Juha Kortelainen. TCS, 380(3):363-372, 2007. [doi]

2005

Polynomial Generators of Recursively Enumerable LanguagesJuha Kortelainen. dlt 2005: 320-326 [doi]

2001

Linear size test sets for certain commutative languagesStepan Holub, Juha Kortelainen. ita, 35(5):453-475, 2001. [doi]

1999

On the System of Word Equations ::::x::::::0::::::u:::::::::::i:::::::::1::::::x::::::1::::::u:::::::::::i:::::::::2::::::x::::::2::::::u:::::::::::i:::::::::3::::::x::::::3::=::::y::::::0::::::v:::::::::::i:::::::::1::::::y::::::1::::::v:::::::::::i:::::Ismo Hakala, Juha Kortelainen. TCS, 225(1-2):149-161, 1999. [doi]

1998

Remarks about Commutative Context-Free LanguagesJuha Kortelainen. jcss, 56(1):125-129, 1998.

On the System of Word Equations x::0::u::1:::::i:::x::1::u::2:::::i:::x::2:: ... u::m:::::i:::x::m:: = y::0::v::1:::::i:::y::1::v::2:::::i:::y::2:: ... v::n:::::i:::y::n:: (i=0, 1, 2, ...) in a Free MonoidJuha Kortelainen. jalc, 3(1):43-58, 1998.

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 MonoidIsmo Hakala, Juha Kortelainen. ACTA, 34(3):217-230, 1997.

Polynomial Size Test Sets for Commutative LanguagesIsmo Hakala, Juha Kortelainen. ita, 31(3):291-304, 1997.

1989

The conjecture of Fliess on commutative context-free languagesJuha Kortelainen. JACM, 36(4):870-872, 1989. [doi]

1986

Every Commutative Quasirational Language is RegularJuha Kortelainen. ita, 20(3):319-337, 1986.

1985

Every Commutative Quasirational Language is RegularJuha Kortelainen. icalp 1985: 348-355

1982

A result concerning the trios generated by commutative slip-languagesJuha Kortelainen. DAM, 4(3):233-236, 1982. [doi]

1981

Some Properties of Language Families Generated by Commutative LanguagesJuha Kortelainen. fct 1981: 210-217

Sign in or sign up to see more results.

runs on WebDSL