| 2026 | ISIT | Number of Channels with Different Insertion Errors Required for the Levenshtein's Reconstruction Problem. | Ville Junnila, Tero Laihonen, Tuomo Lehtil, Pavan Padavu Devaraj |
| 2026 | ISIT | Exact Size of Intersections of Hamming Balls in Zq | Ville Junnila, Tero Laihonen, Tuomo Lehtil, Pavan Padavu Devaraj |
| 2025 | ITW | On Levenshtein's Reconstruction Problem for Channels with Unique Insertion Error Patterns. | Ville Junnila, Tero Laihonen, Tuomo Lehtil, Pavan Padavu Devaraj |
| 2025 | ITW | On the Intersections of q-ary Hamming Balls. | Ville Junnila, Tero Laihonen, Tuomo Lehtil, Pavan Padavu Devaraj |
| 2023 | ISIT | Levenshtein's Reconstruction Problem with Different Error Patterns. | Ville Junnila, Tero Laihonen, Tuomo Lehtil |
| 2022 | ISIT | On the List Size in the Levenshtein's Sequence Reconstruction Problem. | Ville Junnila, Tero Laihonen, Tuomo Lehtil |
| 2019 | ISIT | The Levenshtein's Channel and the List Size in Information Retrieval. | Ville Junnila, Tero Laihonen, Tuomo Lehtil |
| 2012 | ISIT | New lower bounds for identifying codes in infinite grids. | Ville Junnila, Tero Laihonen |
| 2012 | ISIT | Codes for locating objects in sensor networks. | Ville Junnila, Tero Laihonen, Aline Parreau |
| 2008 | ISIT | Improved bounds on binary identifying codes. | Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto |