default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTero Laihonen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j67]Anni Hakanen
, Ville Junnila, Tero Laihonen, Ismael G. Yero:
On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discret. Appl. Math. 353: 191-207 (2024)- [j66]Vesa Halava, Jarkko Kari, Tero Laihonen:
Preface. Fundam. Informaticae 191(3-4) (2024) - [j65]Pyry Herva, Tero Laihonen, Tuomo Lehtilä:
Optimal Local Identifying and Local Locating-dominating Codes. Fundam. Informaticae 191(3-4): 351-378 (2024) - [j64]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70(2): 1050-1066 (2024) - [i9]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR abs/2406.14125 (2024) - 2023
- [j63]Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas:
On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43(1): 245-275 (2023) - [c11]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT 2023: 1300-1305 - [i8]Pyry Herva, Tero Laihonen, Tuomo Lehtilä:
Optimal local identifying and local locating-dominating codes. CoRR abs/2302.13351 (2023) - [i7]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
New Optimal Results on Codes for Location in Graphs. CoRR abs/2306.07862 (2023) - 2022
- [j62]Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero:
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319: 407-423 (2022) - [j61]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90(1): 67-85 (2022) - [c10]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT 2022: 510-515 - [i6]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR abs/2211.08812 (2022) - 2021
- [j60]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67(6): 3322-3341 (2021) - 2020
- [j59]Ville Junnila, Tero Laihonen:
Tolerant location detection in sensor networks. Adv. Appl. Math. 112 (2020) - [j58]Anni Hakanen, Ville Junnila, Tero Laihonen:
The solid-metric dimension. Theor. Comput. Sci. 806: 156-170 (2020)
2010 – 2019
- 2019
- [j57]Ville Junnila, Tero Laihonen, Gabrielle Paris:
Optimal bounds on codes for location in circulant graphs. Cryptogr. Commun. 11(4): 621-640 (2019) - [j56]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j55]Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas:
On Stronger Types of Locating-dominating Codes. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j54]Ville Junnila, Tero Laihonen, Gabrielle Paris:
Solving Two Conjectures regarding Codes for Location in Circulant Graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j53]Tero Laihonen:
On t-revealing codes in binary Hamming spaces. Inf. Comput. 268 (2019) - [c9]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT 2019: 295-299 - 2018
- [j52]Ville Junnila, Tero Laihonen, Tuomo Lehtila:
On regular and new types of codes for location-domination. Discret. Appl. Math. 247: 225-241 (2018) - [j51]Anni Hakanen, Tero Laihonen:
On {ℓ}-Metric Dimensions in Graphs. Fundam. Informaticae 162(2-3): 143-160 (2018) - [i5]Ville Junnila, Tero Laihonen, Gabrielle Paris:
Optimal bounds on codes for location in circulant graphs. CoRR abs/1802.01325 (2018) - 2017
- [j50]Tero Laihonen:
Information retrieval and the average number of input clues. Adv. Math. Commun. 11(1): 203-223 (2017) - [c8]Tero Laihonen, Tuomo Lehtila:
Improved codes for list decoding in the Levenshtein's channel and information retrieval. ISIT 2017: 2643-2647 - 2016
- [j49]Ville Junnila, Tero Laihonen:
Minimum Number of Input Clues in Robust Information Retrieval. Fundam. Informaticae 145(3): 243-256 (2016) - [j48]Tero Laihonen:
The metric dimension for resolving several objects. Inf. Process. Lett. 116(11): 694-700 (2016) - [j47]Ville Junnila, Tero Laihonen:
Information Retrieval With Varying Number of Input Clues. IEEE Trans. Inf. Theory 62(2): 625-638 (2016) - 2015
- [j46]Ville Junnila, Tero Laihonen:
Information retrieval with unambiguous output. Inf. Comput. 242: 354-368 (2015) - 2014
- [j45]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. Adv. Math. Commun. 8(1): 35-52 (2014) - [j44]Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto:
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16(1): 73-88 (2014) - [j43]Ville Junnila, Tero Laihonen:
Codes for Information Retrieval With Small Uncertainty. IEEE Trans. Inf. Theory 60(2): 976-985 (2014) - 2013
- [j42]Ville Junnila, Tero Laihonen:
Optimal identification of sets of edges using 2-factors. Discret. Math. 313(16): 1636-1647 (2013) - [j41]Ville Junnila, Tero Laihonen, Aline Parreau:
Tolerant identification with Euclidean balls. Networks 61(3): 212-225 (2013) - 2012
- [j40]Ville Junnila, Tero Laihonen:
Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid. Electron. J. Comb. 19(2): 38 (2012) - [j39]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312(10): 1832-1837 (2012) - [j38]Ville Junnila, Tero Laihonen:
Optimal Identifying Codes in Cycles and Paths. Graphs Comb. 28(4): 469-481 (2012) - [c7]Ville Junnila, Tero Laihonen, Aline Parreau:
Codes for locating objects in sensor networks. ISIT 2012: 671-675 - [c6]Ville Junnila, Tero Laihonen:
New lower bounds for identifying codes in infinite grids. ISIT 2012: 676-680 - [i4]Ville Junnila, Tero Laihonen:
Optimal lower bound for 2-identifying code in the hexagonal grid. CoRR abs/1202.0670 (2012) - 2011
- [j37]Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in cycles. Australas. J Comb. 49: 177-194 (2011) - [j36]Ville Junnila, Tero Laihonen:
Identification in Z2 using Euclidean balls. Discret. Appl. Math. 159(5): 335-343 (2011) - [j35]Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in paths. Discret. Math. 311(17): 1863-1873 (2011) - [i3]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. CoRR abs/1108.2769 (2011) - [i2]Ville Junnila, Tero Laihonen, Aline Parreau:
Tolerant identification with Euclidean balls. CoRR abs/1109.1913 (2011) - [i1]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1,<=2)-identifying codes in the king grid. CoRR abs/1111.2477 (2011) - 2010
- [j34]Iiro S. Honkala, Tero Laihonen:
On Vertex-Robust Identifying Codes of Level Three. Ars Comb. 94 (2010) - [j33]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31(3): 813-827 (2010)
2000 – 2009
- 2009
- [j32]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Upper bounds for binary identifying codes. Adv. Appl. Math. 42(3): 277-289 (2009) - [j31]Svante Janson, Tero Laihonen:
On the size of identifying codes in binary hypercubes. J. Comb. Theory A 116(5): 1087-1096 (2009) - [c5]Svante Janson, Tero Laihonen:
An optimal result for codes identifying sets of words. ISIT 2009: 2547-2551 - 2008
- [j30]Tero Laihonen, Julien Moncel:
On graphs admitting t-ID codes. Australas. J Comb. 41: 81-92 (2008) - [j29]Iiro S. Honkala, Tero Laihonen:
On Identifying Codes in the King Grid that are Robust Against Edge Deletions. Electron. J. Comb. 15(1) (2008) - [j28]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
New bounds on binary identifying codes. Discret. Appl. Math. 156(12): 2250-2263 (2008) - [j27]Tero Laihonen:
On cages admitting identifying codes. Eur. J. Comb. 29(3): 737-741 (2008) - [c4]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Improved bounds on binary identifying codes. ISIT 2008: 629-633 - 2007
- [j26]Iiro S. Honkala, Tero Laihonen:
On identifying codes that are robust against edge changes. Inf. Comput. 205(7): 1078-1095 (2007) - [j25]Iiro S. Honkala, Tero Laihonen:
On a new class of identifying codes in graphs. Inf. Process. Lett. 102(2-3): 92-98 (2007) - [j24]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
Improved Upper Bounds on Binary Identifying Codes. IEEE Trans. Inf. Theory 53(11): 4255-4260 (2007) - [c3]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
Improved Identifying Codes in F2n. ISIT 2007: 1021-1025 - 2006
- [j23]Tero Laihonen:
On robust identification in the square and king grids. Discret. Appl. Math. 154(17): 2499-2510 (2006) - [j22]Iiro S. Honkala, Tero Laihonen:
On locating-dominating sets in infinite grids. Eur. J. Comb. 27(2): 218-227 (2006) - [j21]Tero Laihonen:
Optimal t-Edge-Robust r-Identifying Codes in the King Lattice. Graphs Comb. 22(4): 487-496 (2006) - 2005
- [j20]Tero Laihonen:
On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes. SIAM J. Discret. Math. 18(4): 825-834 (2005) - 2004
- [j19]Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On Locating-Dominating Codes in Binary Hamming Spaces. Discret. Math. Theor. Comput. Sci. 6(2): 265-282 (2004) - [j18]Iiro S. Honkala, Tero Laihonen:
On identifying codes in the hexagonal mesh. Inf. Process. Lett. 89(1): 9-14 (2004) - [j17]Iiro S. Honkala, Tero Laihonen:
On identification in the triangular grid. J. Comb. Theory B 91(1): 67-86 (2004) - [j16]Iiro S. Honkala, Tero Laihonen:
On identifying codes in the triangular and square grids. SIAM J. Comput. 33(2): 304-312 (2004) - 2003
- [j15]Iiro S. Honkala, Tero Laihonen:
On the Identification of Sets of Points in the Square Lattice. Discret. Comput. Geom. 29(1): 139-152 (2003) - [j14]Iiro S. Honkala, Tero Laihonen:
Codes for Identification in the King Lattice. Graphs Comb. 19(4): 505-516 (2003) - 2002
- [j13]Tero Laihonen, Sanna M. Ranto:
Families of optimal codes for strong identification. Discret. Appl. Math. 121(1-3): 203-213 (2002) - [j12]Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On strongly identifying codes. Discret. Math. 254(1-3): 191-205 (2002) - [j11]Tero Laihonen:
Optimal Codes for Strong Identification. Eur. J. Comb. 23(3): 307-313 (2002) - [j10]Tero Laihonen:
Sequences of optimal identifying codes. IEEE Trans. Inf. Theory 48(3): 774-776 (2002) - [j9]Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen:
Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inf. Theory 48(5): 1200-1203 (2002) - 2001
- [j8]Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On Codes Identifying Sets of Vertices in Hamming Spaces. Des. Codes Cryptogr. 24(2): 193-204 (2001) - [j7]Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
Codes for Strong Identification. Electron. Notes Discret. Math. 6: 262-270 (2001) - [c2]Tero Laihonen, Sanna M. Ranto:
Codes Identifying Sets of Vertices. AAECC 2001: 82-91
1990 – 1999
- 1999
- [j6]Tero Laihonen, Simon Litsyn:
New Bounds On Covering Radius as a Function of Dual Distance. SIAM J. Discret. Math. 12(2): 243-251 (1999) - [j5]Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn:
On relations between covering radius and dual distance. IEEE Trans. Inf. Theory 45(6): 1808-1816 (1999) - [j4]Iiro S. Honkala, Tero Laihonen:
The probability of undetected error can have several local maxima. IEEE Trans. Inf. Theory 45(7): 2537-2539 (1999) - [c1]Tero Laihonen:
On an algebraic method for bounding the covering radius. Codes and Association Schemes 1999: 213-221 - 1998
- [j3]Tero Laihonen, Simon Litsyn:
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. Des. Codes Cryptogr. 14(1): 71-80 (1998) - 1997
- [j2]Iiro S. Honkala, Tero Laihonen, Simon Litsyn:
On Covering Radius and Discrete Chebyshev Polynomials. Appl. Algebra Eng. Commun. Comput. 8(5): 395-401 (1997) - [j1]Cunsheng Ding, Tero Laihonen, Ari Renvall:
Linear Multisecret-Sharing Schemes and Error-Correcting Codes. J. Univers. Comput. Sci. 3(9): 1023-1036 (1997)
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-10-07 21:11 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:
