On Derivation Languages Corresponding to Context-Free Grammars. - Martti Penttonen (Acta Informatica, 1974)

One-Sided and Two-Sided Context in Formal Grammars - Martti Penttonen (Inf. Control., 1974)

ET0L-Grammars and N-Grammars. - Martti Penttonen (Inf. Process. Lett., 1975)

Szilard Languages are log n Tape Recognizable. - Martti Penttonen (J. Inf. Process. Cybern., 1977)

Bibliography of L Systems. - Grzegorz Rozenberg; Martti Penttonen; Arto Salomaa (Theor. Comput. Sci., 1977)

New Proofs for Jump DPDA's. - Matti Linna; Martti Penttonen (MFCS, 1979)

On Non Context-Free Grammar Forms. - Hermann A. Maurer; Martti Penttonen; Arto Salomaa; Derick Wood (Math. Syst. Theory, 1979)

NP-completeness of combinatorial problems with unary notation for integers. - Martti Penttonen (Fundam. Informaticae, 1980)

Direction Independent Context-Sensitive Grammars - H. C. M. Kleijn; Martti Penttonen; Grzegorz Rozenberg; Kai Salomaa (Inf. Control., 1984)

Notes on the Complexity of Sorting in Abstract Machines. - Martti Penttonen; Jyrki Katajainen (BIT, 1985)

Syntax-directed Compression of Program Files. - Jyrki Katajainen; Martti Penttonen; Jukka Teuhola (Softw. Pract. Exp., 1986)

A Note of the Complexity of the Satisfiability of Modal Horn Clauses. - Luis Fariñas del Cerro; Martti Penttonen (J. Log. Program., 1987)

Fast Simulation of Turing Machines by Random Access Machines. - Jyrki Katajainen; Jan van Leeuwen; Martti Penttonen (SIAM J. Comput., 1988)

Logics with Structured Contexts. - Luis Fariñas del Cerro; Martti Penttonen (AIMSA, 1990)

Transformation of Structured Documents with the Use of Grammar. - Eila Kuikka; Martti Penttonen (Electron. Publ., 1993)

Simulation of PRAM Models on Meshes. - Ville Leppänen; Martti Penttonen (PARLE, 1994)

Work-Optimal Simulation of PRAM Models on Meshes. - Ville Leppänen; Martti Penttonen (Nord. J. Comput., 1995)

Simulations of PRAM on Complete Optical Networks. - Anssi Kautonen; Ville Leppänen; Martti Penttonen (Euro-Par, Vol. II, 1996)

Efficient Two-Level Mesh based Simulation of PRAMs. - Martti Forsell; Martti Penttonen; Ville Leppänen (ISPAN, 1996)

A Reliable Randomized Algorithm for the Closest-Pair Problem. - Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen (J. Algorithms, 1997)

Constant Thinning Protocol for Routing h-Relations in Complete Networks. - Anssi Kautonen; Ville Leppänen; Martti Penttonen (Euro-Par, 1998)

Relative Cost Random Access Machines. - Martti Penttonen (Fundam. Informaticae, 1999)

Overview of Tree Transducer Based Document Transformation System. - Eila Kuikka; Paula Leinonen; Martti Penttonen (DDEP/PODDP, 2000)

Hot-Potato Routing Algorithms for Sparse Optical Torus. - Risto Honkanen; Martti Penttonen; Ville Leppänen (ICPP Workshops, 2001)

Towards automating of document structure transformations. - Eila Kuikka; Paula Leinonen; Martti Penttonen (ACM Symposium on Document Engineering, 2002)

How to Program a Parallel Computer? - Martti Penttonen (SPLST, 2003)

Recurrence equation as basis for designing hot-potato routing protocols. - Ville Leppänen; Martti Penttonen (CompSysTech, 2004)

Address-Free All-to-All Routing in Sparse Torus. - Risto Honkanen; Ville Leppänen; Martti Penttonen (PaCT, 2007)

Layouts for Sparse Networks Supporting Throughput Computing. - Ville Leppänen; Martti Penttonen; Martti Forsell (PDPTA, 2010)

Thinning protocols for routing h-relations over shared media. - Anssi Kautonen; Ville Leppänen; Martti Penttonen (J. Parallel Distributed Comput., 2010)

A layout for sparse cube-connected-cycles network. - Ville Leppänen; Martti Penttonen; Martti Forsell (CompSysTech, 2011)

Cost of Sparse Mesh Layouts Supporting Throughput Computing. - Martti Forsell; Ville Leppänen; Martti Penttonen (DSD, 2011)

ICT at service of endangered languages. - Martti Penttonen (Koli Calling, 2011)

Cost of Bandwidth-Optimized Sparse Mesh Layouts. - Martti Forsell; Ville Leppänen; Martti Penttonen (PaCT, 2015)