Tomasz Walen
Scholar

Tomasz Walen

Google Scholar ID: MFuTWXYAAAAJ
University of Warsaw
Text AlgorithmsComputational Biology
Citations & Impact
All-time
Citations
919
 
H-index
16
 
i10-index
35
 
Publications
20
 
Co-authors
28
list available
Publications
20 items
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
  • Published multiple papers, such as:
  • - 'Approximate Circular Pattern Matching Under Edit Distance' (2024, STACS)
  • - 'Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words' (2024, SPIRE)
  • - 'Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String' (2023, CPM)
  • - 'Tight Bound for the Number of Distinct Palindromes in a Tree' (2023, Electron. J. Comb.)
  • - 'Subsequence Covers of Words' (2022, SPIRE)
Research Experience
  • Serves as an Assistant Professor at the University of Warsaw, teaching 'Algorithms and Data Structures' (Winter semester 2025/2026 - exercises and lab) and 'Introduction to Programming' (Winter semester 2025/2026 - lab). Additionally, he is involved in the TAG 2025/2026 project.
Background
  • Assistant Professor at the Institute of Informatics, University of Warsaw, and a member of the Algorithms group. His research interests include text algorithms, data structures, and machine learning.
Miscellany
  • Interests include data visualization using Python, such as generating cartographic visualizations with Python and the GeoPandas library.