◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tomasz Waleń

3 papers hereh-index 222.1k citations93 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.DS3
same name
  • Tomasz Waleń — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092013
most citedOrder-Preserving Suffix Trees and Their Algorithmic Applications

7 citations · 7 across the 3 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

cs.DS2009

On the maximal number of highly periodic runs in a string

Maxime Crochemore, Costas Iliopoulos, Marcin Kubica +3

A run is a maximal occurrence of a repetition v with a period p such that 2p≤∣v∣. The maximal number of runs in a string of length n was studied by several authors and…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.