default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlli Pottonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j12]Josep Díaz, Olli Pottonen, Maria J. Serna
, Erik Jan van Leeuwen:
Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1): 132-158 (2017)- 2016
- [j11]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
Non-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code. Adv. Math. Commun. 10(2): 393-399 (2016) - 2014
- [i7]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code. CoRR abs/1408.6927 (2014) - 2013
- [j10]Lauri Ahlroth, Olli Pottonen, André Schumacher:
Approximately Uniform Online Checkpointing with Bounded Memory. Algorithmica 67(2): 234-246 (2013) - 2012
- [c2]Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen:
On the Complexity of Metric Dimension. ESA 2012: 419-430 - 2011
- [j9]Patric R. J. Östergård, Olli Pottonen:
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. Des. Codes Cryptogr. 59(1-3): 281-285 (2011) - [j8]Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311(10-11): 827-834 (2011) - [j7]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
On Optimal Binary One-Error-Correcting Codes of Lengths 2m-4 and 2m-3. IEEE Trans. Inf. Theory 57(10): 6771-6779 (2011) - [c1]Lauri Ahlroth, Olli Pottonen, André Schumacher:
Approximately Uniform Online Checkpointing. COCOON 2011: 297-306 - [i6]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$. CoRR abs/1104.4013 (2011) - [i5]Josep Díaz, Olli Pottonen, Erik Jan van Leeuwen:
Planar Metric Dimension is NP-complete. CoRR abs/1107.2256 (2011) - 2010
- [j6]Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17(1) (2010) - [j5]Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps:
The perfect binary one-error-correcting codes of length 15: part II-properties. IEEE Trans. Inf. Theory 56(6): 2571-2582 (2010)
2000 – 2009
- 2009
- [b1]Olli Pottonen:
Perfect binary codes: classification and properties. Helsinki University of Technology, Finland, 2009 - [j4]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inf. Theory 55(6): 2622-2625 (2009) - [j3]Patric R. J. Östergård, Olli Pottonen:
The perfect binary one-error-correcting codes of length 15: part I-classification. IEEE Trans. Inf. Theory 55(10): 4657-4660 (2009) - [i4]Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps:
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties. CoRR abs/0903.2749 (2009) - [i3]Patric R. J. Östergård, Olli Pottonen:
Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes. CoRR abs/0909.2526 (2009) - 2008
- [j2]Patric R. J. Östergård, Olli Pottonen:
There exists no Steiner system S(4, 5, 17). J. Comb. Theory A 115(8): 1570-1573 (2008) - [i2]Patric R. J. Östergård, Olli Pottonen:
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification. CoRR abs/0806.2513 (2008) - [i1]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs. CoRR abs/0810.5633 (2008) - 2006
- [j1]Petteri Kaski, Patric R. J. Östergård, Olli Pottonen:
The Steiner quadruple systems of order 16. J. Comb. Theory A 113(8): 1764-1770 (2006)
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-06-10 20:29 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:
