1 citations · 1 across the 3 of their papers we have counts for
3 papers
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.GT2013
A Complexity of double dummy bridge
Piotr Beling
This paper presents an analysis of complexity of double dummy bridge. Values of both, a state-space (search-space) complexity and a game tree complexity have been estimated. -----…
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…