default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatti J. Aaltonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[c3]Caj Södergård, Matti Aaltonen, Christer Bäckström, Ari Heinonen, Timo Järvinen, Timo Kinnunen, Pauliina Koivunen, Sari Lehtola, Ville Ollikainen, Katja Rentto, Mikko Seppälä, Antti Tammela:
An integrated multiple media news portal. ELPUB 2001- [c2]Caj Södergård, Matti Aaltonen, Christer Bäckström, Ari Heinonen, Timo Järvinen, Timo Kinnunen, Pauliina Koivunen, Sari Lehtola, Ville Ollikainen, Katja Rentto, Mikko Seppälä, Antti Tammela:
An Integrated Multiple Media Portal with Semiautomatic Editing Features. WWW Posters 2001 - 2000
- [j8]Eija Kaasinen
, Matti Aaltonen, Juha Kolari, Suvi Melakoski, Timo Laakko:
Two approaches to bringing Internet services to WAP devices. Comput. Networks 33(1-6): 231-246 (2000)
1990 – 1999
- 1999
- [j7]Caj Södergård, Matti Aaltonen, Sari Hagman, Mikko Hiirsalmi, Timo Järvinen, Eija Kaasinen, Timo Kinnunen, Juha Kolari, Jouko Kunnas, Antti Tammela:
Integrated Multimedia Publishing: Combining TV and Newspaper Content on Personal Channels. Comput. Networks 31(11-16): 1111-1128 (1999) - [c1]Eija Kaasinen, Matti Aaltonen, Timo Laakko:
Defining user requirements for WAP services. HCI (2) 1999: 33-37 - 1990
- [j6]Matti Aaltonen:
A new upper bound on nonbinary block codes. Discret. Math. 83(2-3): 139-160 (1990)
1980 – 1989
- 1986
- [j5]Matti Aaltonen, Juha T. Tanttu, Seppo Pohjolainen:
A distributed parameter system simulator. Simul. 47(4): 145-151 (1986) - 1985
- [j4]Hannu Tarnanen, Matti J. Aaltonen, Jean-Marie Goethals:
On the Nonbinary Johnson Scheme. Eur. J. Comb. 6(3): 279-285 (1985) - 1984
- [j3]Matti J. Aaltonen:
Notes on the asymptotic behavior of the information rate of block codes. IEEE Trans. Inf. Theory 30(1): 84-85 (1984)
1970 – 1979
- 1979
- [j2]Matti J. Aaltonen:
Linear programming bounds for tree codes (Corresp.). IEEE Trans. Inf. Theory 25(1): 85-90 (1979) - 1977
- [j1]Matti J. Aaltonen:
An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.). IEEE Trans. Inf. Theory 23(3): 396-397 (1977)
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-04-24 23:13 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:
