Author

B. Bals

h-index 1 View on Semantic Scholar

We have 3 of 10 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Jul 2026

Text Indexing: From Reporting to Counting

We prove an elementary yet powerful combinatorial lemma: in any rooted tree with $L$ leaves, the number of nodes whose depth is smaller than the number of their leaf descendants is at most $L$. For any string $T$ of length $n$, a direct application of this lemma to the suffix trie of $T$ yields that the number of subst...

B. Bals, P. Charalampopoulos, Oded Lachish et al. · Embedded Systems and Applica... · 0 citations

Conference Jul 2026

String Matching in (Block) Graphs: A Full Classification by Walk Length

A near-linear-time algorithm is given and there is no combinatorial algorithm improving over the state-of-the-art $\mathcal{O}(m|E| + N)$ bound for any $b\ge 4$.

Sebastian Angrick, B. Bals, Paweł Gawrychowski et al. · Embedded Systems and Applica... · 0 citations

Jul 2026

Cut Query Reachability for DAGs with Subquadratic Queries

This work restricts its attention to directed acyclic graphs (DAGs) and obtains a deterministic single-source reachability algorithm using $O(n \sqrt{n \log n})$ queries, based on a topological sort algorithm, and can also be adapted to compute single-source shortest paths in DAGs.

B. Bals, Matei Tinca, Yasamin Nazari · arXiv.org · 0 citations