default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntti Laaksonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Kai Korpimies
, Antti Laaksonen, Matti Luukkainen:
Unrestricted Use of LLMs in a Software Project Course: Student Perceptions on Learning and Impact on Course Performance. Koli Calling 2024: 23:1-23:7- [c14]Antti Laaksonen, Kjell Lemström:
Advanced Polyphonic Music Pattern Matching Algorithms with Timing Invariances. MCM 2024: 242-254 - 2023
- [c13]Erkki Kaila, Antti Laaksonen, Emilia Oikarinen, Kjell Lemström:
Commitment Threshold - On Student Retention in MOOCs. CompSysTech 2023: 139-145 - [c12]Erkki Kaila, Matti Luukkainen, Antti Laaksonen, Kjell Lemström:
On Changing the Curriculum Programming Language from Java to Python (Discussion Paper). Koli Calling 2023: 27:1-27:7 - 2022
- [c11]Antti Laaksonen, Kjell Lemström, Otso Björklund:
Transposition and Time-Scaling Invariant Algorithm for Detecting Repeated Patterns in Polyphonic Music. MCM 2022: 168-179 - [c10]Antti Laaksonen, Kjell Lemström:
On the Memory Usage of the SIA Algorithm Family for Symbolic Music Pattern Discovery. MCM 2022: 180-191 - 2020
- [b2]Antti Laaksonen:
Guide to Competitive Programming - Learning and Improving Algorithms Through Contests, Second Edition. Undergraduate Topics in Computer Science, Springer 2020, ISBN 978-3-030-39356-4, pp. 1-296
2010 – 2019
- 2019
- [j2]Antti Laaksonen, Patric R. J. Östergård:
New lower bounds on q-ary error-correcting codes. Cryptogr. Commun. 11(5): 881-889 (2019) - [c9]Antti Laaksonen, Kjell Lemström:
Transposition and time-warp invariant algorithm for detecting repeated patterns in polyphonic music. DLfM 2019: 38-42 - [c8]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen:
Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns. ISIT 2019: 2604-2608 - [i2]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen:
Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns. CoRR abs/1905.02761 (2019) - 2017
- [b1]Antti Laaksonen:
Guide to Competitive Programming - Learning and Improving Algorithms Through Contests. Undergraduate Topics in Computer Science, Springer 2017, ISBN 978-3-319-72546-8, pp. 1-268 - [j1]Antti Laaksonen, Patric R. J. Östergård:
Constructing error-correcting binary codes using transitive permutation groups. Discret. Appl. Math. 233: 65-70 (2017) - [c7]Antti Laaksonen, Patric R. J. Östergård:
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes. ICMCTA 2017: 228-237 - 2016
- [i1]Antti Laaksonen, Patric R. J. Östergård:
Constructing error-correcting binary codes using transitive permutation groups. CoRR abs/1604.06022 (2016) - 2015
- [c6]Antti Laaksonen:
Two-dimensional point set pattern matching with horizontal scaling. FDIA 2015 - 2014
- [c5]Antti Laaksonen:
Automatic Melody Transcription based on Chord Transcription. ISMIR 2014: 119-124 - [c4]Nick Parlante, Julie Zelenski, Josh Hug, John Nicholson, John DeNero, Antti Laaksonen, Arto Vihavainen, Frank McCown, Kevin Wayne:
Nifty assignments. SIGCSE 2014: 621-622 - 2013
- [c3]Antti Laaksonen, Kjell Lemström:
On Finding Symbolic Themes Directly From Audio Files Using Dynamic Programming. ISMIR 2013: 47-52 - 2012
- [c2]Antti Laaksonen:
Ambiguity in Automatic Chord Transcription: Recognizing Major and Minor Chords. Adaptive Multimedia Retrieval 2012: 203-213 - 2010
- [c1]Veli Mäkinen, Niko Välimäki, Antti Laaksonen, Riku Katainen:
Unified View of Backward Backtracking in Short Read Mapping. Algorithms and Applications 2010: 182-195
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 2025-01-21 00:17 CET 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:
