Publications by Eero Lassila
Peer-reviewed publications
- A4 in 1996
-
Eero Lassila.
A macro expansion approach to embedded processor code generation.
In Proc. 22nd Euromicro Conference (September 2-5, 1996), pp. 136-142.
Eds. P. Milligan and K. Kuchcinski.
IEEE Computer Society Press, 1996.
ISBN 0-8186-7487-3.
- A3 in 1989
-
Eero Lassila.
Parsing Finnish sentences by performing functionally defined sequential subtasks.
In Proc. 2nd Scandinavian Conference on Artificial Intelligence (June 13-15, 1989), vol. 2, pp. 960-964.
Eds. H. Jaakkola and S. Linnainmaa.
Finnish Artificial Intelligence Society, 1989.
ISBN 951-721-386-7.
- A2 in 1988
- Harri Jäppinen, Eero Lassila, and Aarno Lehtola.
Locally governed trees and dependency parsing.
In Proc. 12th International Conference on Computational Linguistics (August 22-27, 1988), vol. 1, pp. 275-277.
Ed. D. Vargha.
John von Neumann Society for Computing Sciences, Budapest (Hungary), 1988.
ISBN 963-8431-56-3.
- A1 in 1988
-
Eero Lassila.
Suomen kielen sanamuodot taivuttava ohjelma FORMO.
(FORMO: a program for Finnish word form synthesis (in Finnish).)
In Proc. Finnish Artificial Intelligence Symposium STeP-88 (August 15-18, 1988), vol. 1, pp. 118-126.
Eds. M. Mäkelä, S. Linnainmaa, and E. Ukkonen.
Finnish Artificial Intelligence Society, 1988.
ISBN 951-99977-9-2.
Publications in technical reports
- B5 in 2012
- Eero Lassila.
Tetrasystems:
a framework for string generation devices.
Presentation abstract.
In U. Wolter and Y. Lamo (eds.),
24th
Nordic Workshop on Programming Theory,
Reports in Informatics, no. 403,
Department of Informatics,
University of Bergen. Bergen (Norway), October 2012.
ISSN 0333-3590.
- B4 in 2001
-
Eero Lassila.
A tree expansion formalism for generative string rewriting.
Report HUT-TCS-B20, Laboratory for Theoretical Computer Science,
Helsinki University of Technology.
Espoo (Finland), June 2001.
ISBN 951-22-5554-5.
- B3 in 2000
-
Eero Lassila.
On tree belts and belt-selectors.
In N. Husberg, T. Janhunen, and I. Niemelä (eds.),
Leksa notes in computer science, pp. 47-58,
Report HUT-TCS-A63, Laboratory for Theoretical Computer Science,
Helsinki University of Technology.
Espoo (Finland), October 2000.
ISBN 951-22-5211-2.
- B2 in 1997
-
Eero Lassila.
Towards optimizing code generation by domain-sensitive macro expansion.
Report A42, Digital Systems Laboratory, Helsinki University of Technology.
Espoo (Finland), January 1997.
ISBN 951-22-3439-4.
- B1 in 1996
-
Eero Lassila.
ReFlEx - an experimental tool for special-purpose processor code generation.
Report B15, Digital Systems Laboratory, Helsinki University of Technology.
Espoo (Finland), March 1996.
ISBN 951-22-2993-5.
Other (including non-publications)
- C4 in 1997
- Eero Lassila.
Confluent macro expansion for optimizing code generation.
Presentation abstract in the working notes of 9th Nordic Workshop on Programming Theory.
Tallinn (Estonia), October 1997.
- C3 in 1997
-
Eero Lassila.
A functional macro expansion system for optimizing code generation:
gaining context-sensitivity without losing confluence.
Poster abstract in Proc. 1997 ACM SIGPLAN International Conference on Functional Programming
(June 9-11, 1997),
p. 315. (ACM SIGPLAN Notices, vol. 32, no. 8, 1997.) ACM Press, 1997.
ISBN 0-89791-918-1.
- C2 in 1996
- Eero Lassila. A macro expansion approach to embedded processor code generation.
Presentation abstract in the working notes of Workshop on Interaction between Compilers and
Computer Architecture. San Jose (California, USA), February 1996.
- C1 in 1991
-
Eero Lassila.
Kontrollirakennekääntäjä digitaalisten signaaliprosessorien ohjelmointiin.
(Control structure compiler for digital signal processors (in Finnish).)
Master's thesis, Department of Computer Science and Engineering,
Helsinki University of Technology. Espoo (Finland), December 1991.
Some works by others citing the above publications
- In 2009, citing A4
-
B. J. Corcoran et al.
Apparatus, system, and method for communicating a binary code image.
US Patent 7512616. 2009.
- In 2007, citing A1
-
Kimmo Kettunen.
Reductive and generative approaches to morphological variation
of keywords in monolingual information retrieval.
Doctoral dissertation, University of Tampere, October 2007.
Acta Universitas Tamperensis 1261.
Tampereen Yliopistopaino Oy, 2007.
ISBN 978-951-44-7087-5.
- In 2006, citing A1
-
Kimmo Kettunen and Eija Airio.
Is a morphologically complex language really that
complex in full-text retrieval?
In
Advances in Natural Language Processing
(Proc. 5th International Conference on NLP, FinTAL 2006 (August 23-25, 2006)), pp. 411-422.
Eds. T. Salakoski, F. Ginter, S. Pyysalo, and T. Pahikkala.
LNAI 4139. Springer, 2006.
- In 2002, citing A4
-
Yasusi Kanada.
Dynamically extensible policy server and agent.
In Proc. 3rd International Workshop on Policies for Distributed Systems and Networks (June 5-7, 2002),
pp. 236-239.
IEEE Computer Society, 2002.
ISBN 0-7695-1611-4.
- In 1999, citing A4
-
Eiji Shamoto.
High speed assemble processing system.
US Patent 5999733. 1999.
- In 1993, citing A1 and A3
-
H. Jäppinen, K. Hartonen, L. Kulikov, A. Nykänen, and A. Ylä-Rotiala.
KIELIKONE machine translation workstation.
In
Progress in Machine Translation, pp. 173-185.
Ed. S. Nirenburg.
IOS Press, Amsterdam, 1993.