Ville Junnila

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 27

Top Topics

Information Retrieval

Discrete Tomography

Worst Case Bounds

Top Venues

IEEE Trans. Inf. Theory

Discret. Appl. Math.

Publications

Olivier Hudry, Ville Junnila, Antoine Lobstein
On Iiro Honkala's Contributions to Identifying Codes. Fundam. Informaticae 191 (3-4) (2024)
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 (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70 (2) (2024)
Olivier Hudry, Ville Junnila, Antoine Lobstein
Iiro Honkala's contributions to identifying codes. CoRR (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT (2023)
Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas
On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43 (1) (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
New Optimal Results on Codes for Location in Graphs. CoRR (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90 (1) (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT (2022)
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319 (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67 (6) (2021)
Sara Ramezanian, Tommi Meskanen, Masoud Naderpour, Ville Junnila, Valtteri Niemi
Private membership test protocol with low communication complexity. Digit. Commun. Networks 6 (3) (2020)
Anni Hakanen, Ville Junnila, Tero Laihonen
The solid-metric dimension. Theor. Comput. Sci. 806 (2020)
Ville Junnila, Tero Laihonen
Tolerant location detection in sensor networks. Adv. Appl. Math. 112 (2020)
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)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Optimal bounds on codes for location in circulant graphs. Cryptogr. Commun. 11 (4) (2019)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26 (2) (2019)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Solving Two Conjectures regarding Codes for Location in Circulant Graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT (2019)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Optimal bounds on codes for location in circulant graphs. CoRR (2018)
Ville Junnila, Tero Laihonen, Tuomo Lehtila
On regular and new types of codes for location-domination. Discret. Appl. Math. 247 (2018)
Ville Junnila, Tero Laihonen
Information Retrieval With Varying Number of Input Clues. IEEE Trans. Inf. Theory 62 (2) (2016)
Ville Junnila, Tero Laihonen
Minimum Number of Input Clues in Robust Information Retrieval. Fundam. Informaticae 145 (3) (2016)
Ville Junnila
Optimal locating-total dominating sets in strips of height 3. Discuss. Math. Graph Theory 35 (3) (2015)
Ville Junnila, Tero Laihonen
Information retrieval with unambiguous output. Inf. Comput. 242 (2015)
Ville Junnila, Tero Laihonen
Codes for Information Retrieval With Small Uncertainty. IEEE Trans. Inf. Theory 60 (2) (2014)
Ville Junnila, Tero Laihonen
Optimal identification of sets of edges using 2-factors. Discret. Math. 313 (16) (2013)
Ville Junnila
New lower bound for 2-identifying code in the square grid. Discret. Appl. Math. 161 (13-14) (2013)
Ville Junnila, Tero Laihonen, Aline Parreau
Tolerant identification with Euclidean balls. Networks 61 (3) (2013)
Ville Junnila, Tero Laihonen
Optimal Identifying Codes in Cycles and Paths. Graphs Comb. 28 (4) (2012)
Ville Junnila
New lower bound for 2-identifying code in the square grid CoRR (2012)
Ville Junnila, Tero Laihonen
Optimal lower bound for 2-identifying code in the hexagonal grid CoRR (2012)
Ville Junnila, Tero Laihonen
Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid. Electron. J. Comb. 19 (2) (2012)
Ville Junnila, Tero Laihonen
New lower bounds for identifying codes in infinite grids. ISIT (2012)
Ville Junnila, Tero Laihonen, Aline Parreau
Codes for locating objects in sensor networks. ISIT (2012)
Ville Junnila
Adaptive Identification of Sets of Vertices in Graphs. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Geoffrey Exoo, Ville Junnila, Tero Laihonen
Locating-dominating codes in cycles. Australas. J Comb. 49 (2011)
Ville Junnila, Tero Laihonen
Identification in Z2 using Euclidean balls. Discret. Appl. Math. 159 (5) (2011)
Geoffrey Exoo, Ville Junnila, Tero Laihonen
Locating-dominating codes in paths. Discret. Math. 311 (17) (2011)
Ville Junnila, Tero Laihonen, Aline Parreau
Tolerant identification with Euclidean balls CoRR (2011)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31 (3) (2010)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Upper bounds for binary identifying codes. Adv. Appl. Math. 42 (3) (2009)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Improved bounds on binary identifying codes. ISIT (2008)