Golnaz Badkobeh

activity

20112024

most citedBinary Jumbled String Matching for Highly Run-Length Compressible Texts

29 citations · 49 across the 12 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Internal Shortest Absent Word Queries in Constant Time and Linear Space

Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov +1

Given a string $T$ of length $n$ over an alphabet $Σ \subset {1, 2, \dots, n^{O (1)}}$ of size $σ$ , we are to preprocess $T$ so that given a range $[i, j]$ , we can return a representa…

math.CO2021

Avoiding Square-Free Words on Free Groups

Golnaz Badkobeh, Tero Harju, Pascal Ochem +1

We consider sets of factors that can be avoided in square-free words on two-generator free groups. The elements of the group are presented in terms of 0,1,2,3 such that 0 and 2 (re…