Piotr Beling
SoftwareX, volume 26, pages 101681, March 2024, doi: https://doi.org/10.1016/j.softx.2024.101681
The paper presents BSuccinct, a collection of software focused on compact and succinct data structures that are both space and time efficient.
pdf urlPiotr Beling
ACM Journal of Experimental Algorithmics, May 2023, doi: 10.1145/3596453
In the paper we study a fingerprint-based minimal perfect hash function (FMPH for short). We propose an effective method (called FMPHGO) that reduces the size of FMPH, as well as a number of implementation improvements.
urlPiotr Beling, Marek Rogalski
Artificial Intelligence, volume 283, pages 103262, March 2020, doi: 10.1016/j.artint.2020.103262
In this paper we study computing Sprague-Grundy values for short impartial games under the normal play convention. We put forward new game-agnostic methods for effective pruning search trees of impartial games.
urlRadosław Zajdel, Justyna Zajdel, Anna Zwolińska, Janusz Śmigielski, Piotr Beling, Tomasz Cegliński, Dariusz Nowak
Archives of Medical Science, Clinical research, vol. 8, no. 5, pp. 892-898, doi: 10.5114/aoms.2012.28891
We compared a subject’s reaction time while performing a test either with a mobile phone ringing or without.
pdfPiotr Beling
Master’s thesis, Łódź University of Technology, Łódź, 2006, in polish
Master’s thesis on programming of logical games. It describes an artificial intelligence engine used in a checkers program.
pdfPiotr Beling, Peter Sanders
2026 Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), pages 1-14, January 2026, doi: 10.1137/1.9781611978957.1
The paper introduces PHast, (minimal) perfect hash function that combines the fastest available queries, very fast construction (especially PHast+ variant), and good space consumption (below 2 bits per key).
pdf url