Martti Penttonen

According to our database1, Martti Penttonen
  • authored at least 33 papers between 1974 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Cost of Bandwidth-Optimized Sparse Mesh Layouts.
Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

2011
ICT at service of endangered languages.
Proceedings of the 11th Koli Calling International Conference on Computing Education Research, 2011

Cost of Sparse Mesh Layouts Supporting Throughput Computing.
Proceedings of the 14th Euromicro Conference on Digital System Design, 2011

A layout for sparse cube-connected-cycles network.
Proceedings of the 12th International Conference on Computer Systems and Technologies, 2011

2010
Thinning protocols for routing h-relations over shared media.
J. Parallel Distrib. Comput., 2010

Layouts for Sparse Networks Supporting Throughput Computing.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

2007
Address-Free All-to-All Routing in Sparse Torus.
Proceedings of the Parallel Computing Technologies, 2007

2003
How to Program a Parallel Computer?
Proceedings of the Eighth Symposium on Programming Languages and Software Tools, 2003

2002
Towards automating of document structure transformations.
Proceedings of the 2002 ACM Symposium on Document Engineering, 2002

2001
Hot-Potato Routing Algorithms for Sparse Optical Torus.
Proceedings of the 30th International Workshops on Parallel Processing (ICPP 2001 Workshops), 2001

2000
Overview of Tree Transducer Based Document Transformation System.
Proceedings of the Digital Documents: Systems and Principles, 2000

1999
Relative Cost Random Access Machines.
Fundam. Inform., 1999

1998
Constant Thinning Protocol for Routing h-Relations in Complete Networks.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
A Reliable Randomized Algorithm for the Closest-Pair Problem.
J. Algorithms, 1997

1996
Efficient Two-Level Mesh based Simulation of PRAMs.
Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

Simulations of PRAM on Complete Optical Networks.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Work-Optimal Simulation of PRAM Models on Meshes.
Nord. J. Comput., 1995

1994
Simulation of PRAM Models on Meshes.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993
Transformation of Structured Documents with the Use of Grammar.
Electronic Publishing, 1993

1990
Logics with Structured Contexts.
Proceedings of the Artificial Intelligence IV: Methodology, Systems, Applications, 1990

1988
Fast Simulation of Turing Machines by Random Access Machines.
SIAM J. Comput., 1988

1987
A Note of the Complexity of the Satisfiability of Modal Horn Clauses.
J. Log. Program., 1987

1986
Syntax-directed Compression of Program Files.
Softw., Pract. Exper., 1986

1985
Notes on the Complexity of Sorting in Abstract Machines.
BIT, 1985

1984
Direction Independent Context-Sensitive Grammars
Information and Control, 1984

1980
NP-completeness of combinatorial problems with unary notation for integers.
Fundam. Inform., 1980

1979
On Non Context-Free Grammar Forms.
Mathematical Systems Theory, 1979

New Proofs for Jump DPDA's.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
Bibliography of L Systems.
Theor. Comput. Sci., 1977

Szilard Languages are log n Tape Recognizable.
Elektronische Informationsverarbeitung und Kybernetik, 1977

1975
ET0L-Grammars and N-Grammars.
Inf. Process. Lett., 1975

1974
One-Sided and Two-Sided Context in Formal Grammars
Information and Control, August, 1974

On Derivation Languages Corresponding to Context-Free Grammars.
Acta Inf., 1974


  Loading...