Benjamin Przybocki

Orcid: 0009-0007-5489-1733

According to our database1, Benjamin Przybocki authored at least 8 papers between 2022 and 2025.

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

2025
Shininess, strong politeness, and unicorns.
CoRR, July, 2025

The termination of Nielsen transformations applied to word equations with length constraints.
CoRR, January, 2025

Being Polite Is Not Enough (and Other Limits of Theory Combination).
Proceedings of the Automated Deduction - CADE 30, 2025

2024
Bender-Knuth involutions on linear extensions of posets.
Discret. Math., 2024

The Nonexistence of Unicorns and Many-Sorted Löwenheim-Skolem Theorems.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
The Maximum Hook Length of $d$-Distinct Simultaneous Core Partitions.
Electron. J. Comb., 2023

2022
Lengths of Irreducible and Delicate Words.
Electron. J. Comb., 2022

Hat Guessing on Books and Windmills.
Electron. J. Comb., 2022


  Loading...