1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025★ 1 cited
PHast -- Perfect Hashing made fast
Piotr Beling, Peter Sanders
Perfect hash functions give unique "names" to arbitrary keys requiring only a few bits per key. This is an essential building block in applications like static hash tables, databas…
cs.DS2012
Counting common substrings effectively
Stanisław Goldstein, Piotr Beling
This article presents effective (dynamic) algorithm for solving a problem of counting the number of substrings of given string which are also substrings of second string. Presented…