3 papers
cs.PL2026
Polyregular equivalence is undecidable in higher-order types
Mikołaj Bojańczyk, Grzegorz Fabiański, Rafał Stefański
It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the λ-calculus definition of pol…
cs.CR2025
A Formally Verified Lightning Network
Grzegorz Fabiański, Rafał Stefański, Orfeas Stefanos Thyfronitis Litos
In this work we use formal verification to prove that the Lightning Network (LN), the most prominent scaling technique for Bitcoin, always safeguards the funds of honest users. We…
cs.DS2019
Properties of nowhere dense graph classes related to independent set problem
Grzegorz Fabiański
A set is called r-independent, if every two vertices of it are in distance greater then r. In the r-independent set problem with parameter k, we ask whether in a given graph G ther…