default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartti Penttonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c17]Martti Forsell, Ville Leppänen
, Martti Penttonen:
Cost of Bandwidth-Optimized Sparse Mesh Layouts. PaCT 2015: 375-389- 2011
- [c16]Ville Leppänen, Martti Penttonen, Martti Forsell:
A layout for sparse cube-connected-cycles network. CompSysTech 2011: 32-37 - [c15]Martti Forsell, Ville Leppänen, Martti Penttonen:
Cost of Sparse Mesh Layouts Supporting Throughput Computing. DSD 2011: 316-323 - [c14]Martti Penttonen:
ICT at service of endangered languages. Koli Calling 2011: 95-101 - 2010
- [j17]Anssi Kautonen, Ville Leppänen, Martti Penttonen:
Thinning protocols for routing h-relations over shared media. J. Parallel Distributed Comput. 70(8): 783-789 (2010) - [c13]Ville Leppänen, Martti Penttonen, Martti Forsell:
Layouts for Sparse Networks Supporting Throughput Computing. PDPTA 2010: 443-449
2000 – 2009
- 2007
- [c12]Risto Honkanen, Ville Leppänen, Martti Penttonen:
Address-Free All-to-All Routing in Sparse Torus. PaCT 2007: 200-205 - 2004
- [c11]Ville Leppänen, Martti Penttonen:
Recurrence equation as basis for designing hot-potato routing protocols. CompSysTech 2004: 1-6 - 2003
- [c10]Martti Penttonen:
How to Program a Parallel Computer? SPLST 2003: 1 - 2002
- [c9]Eila Kuikka, Paula Leinonen, Martti Penttonen:
Towards automating of document structure transformations. ACM Symposium on Document Engineering 2002: 103-110 - [e1]Martti Penttonen, Erik Meineche Schmidt:
Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Lecture Notes in Computer Science 2368, Springer 2002, ISBN 3-540-43866-1 [contents] - 2001
- [c8]Risto Honkanen, Martti Penttonen, Ville Leppänen:
Hot-Potato Routing Algorithms for Sparse Optical Torus. ICPP Workshops 2001: 302-310 - 2000
- [c7]Eila Kuikka, Paula Leinonen, Martti Penttonen:
Overview of Tree Transducer Based Document Transformation System. DDEP/PODDP 2000: 190-202
1990 – 1999
- 1999
- [j16]Martti Penttonen:
Relative Cost Random Access Machines. Fundam. Informaticae 38(1-2): 17-23 (1999) - 1998
- [c6]Anssi Kautonen, Ville Leppänen, Martti Penttonen:
Constant Thinning Protocol for Routing h-Relations in Complete Networks. Euro-Par 1998: 993-998 - 1997
- [j15]Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997) - 1996
- [c5]Anssi Kautonen, Ville Leppänen, Martti Penttonen:
Simulations of PRAM on Complete Optical Networks. Euro-Par, Vol. II 1996: 307-310 - [c4]Martti Forsell, Martti Penttonen, Ville Leppänen:
Efficient Two-Level Mesh based Simulation of PRAMs. ISPAN 1996: 29-35 - 1995
- [j14]Ville Leppänen, Martti Penttonen:
Work-Optimal Simulation of PRAM Models on Meshes. Nord. J. Comput. 2(1): 51-69 (1995) - 1994
- [c3]Ville Leppänen, Martti Penttonen:
Simulation of PRAM Models on Meshes. PARLE 1994: 146-158 - 1993
- [j13]Eila Kuikka, Martti Penttonen:
Transformation of Structured Documents with the Use of Grammar. Electron. Publ. 6(4): 373-383 (1993) - 1990
- [c2]Luis Fariñas del Cerro, Martti Penttonen:
Logics with Structured Contexts. AIMSA 1990: 43-50
1980 – 1989
- 1988
- [j12]Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen:
Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988) - 1987
- [j11]Luis Fariñas del Cerro, Martti Penttonen:
A Note of the Complexity of the Satisfiability of Modal Horn Clauses. J. Log. Program. 4(1): 1-10 (1987) - 1986
- [j10]Jyrki Katajainen, Martti Penttonen, Jukka Teuhola:
Syntax-directed Compression of Program Files. Softw. Pract. Exp. 16(3): 269-276 (1986) - 1985
- [j9]Martti Penttonen, Jyrki Katajainen:
Notes on the Complexity of Sorting in Abstract Machines. BIT 25(4): 611-622 (1985) - 1984
- [j8]H. C. M. Kleijn, Martti Penttonen, Grzegorz Rozenberg, Kai Salomaa:
Direction Independent Context-Sensitive Grammars. Inf. Control. 63(1/2): 113-117 (1984) - 1980
- [j7]Martti Penttonen:
NP-completeness of combinatorial problems with unary notation for integers. Fundam. Informaticae 3(3): 397- (1980)
1970 – 1979
- 1979
- [j6]Hermann A. Maurer, Martti Penttonen, Arto Salomaa, Derick Wood:
On Non Context-Free Grammar Forms. Math. Syst. Theory 12: 297-324 (1979) - [c1]Matti Linna, Martti Penttonen:
New Proofs for Jump DPDA's. MFCS 1979: 354-362 - 1977
- [j5]Martti Penttonen:
Szilard Languages are log n Tape Recognizable. J. Inf. Process. Cybern. 13(11): 595-602 (1977) - [j4]Grzegorz Rozenberg, Martti Penttonen, Arto Salomaa:
Bibliography of L Systems. Theor. Comput. Sci. 5(3): 339-354 (1977) - 1975
- [j3]Martti Penttonen:
ET0L-Grammars and N-Grammars. Inf. Process. Lett. 4(1): 11-13 (1975) - 1974
- [j2]Martti Penttonen:
On Derivation Languages Corresponding to Context-Free Grammars. Acta Informatica 3: 285-291 (1974) - [j1]Martti Penttonen:
One-Sided and Two-Sided Context in Formal Grammars. Inf. Control. 25(4): 371-392 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
