Grzegorz Fabianski

Orcid: 0000-0001-9146-4131

According to our database1, Grzegorz Fabianski authored at least 7 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Polyregular equivalence is undecidable in higher-order types.
CoRR, April, 2026

2025
Computationally-Sound Symbolic Cryptography in Lean.
IACR Cryptol. ePrint Arch., 2025

A Formally Verified Lightning Network.
Proceedings of the Financial Cryptography and Data Security, 2025

2021
Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Uniformisations of Regular Relations Over Bi-Infinite Words.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Properties of nowhere dense graph classes related to independent set problem.
CoRR, 2019

Progressive Algorithms for Domination and Independence.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019


  Loading...