1. Constant Depth Circuit Complexity for Generating Quasigroups;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16
2. Descriptive complexity of deterministic polylogarithmic time and space;Journal of Computer and System Sciences;2021-08
3. Linear Matroid Intersection is in Quasi-NC;computational complexity;2020-11-19
4. The Intersection Problem for Finite Semigroups;International Journal of Foundations of Computer Science;2020-09
5. A restricted second-order logic for non-deterministic poly-logarithmic time;Logic Journal of the IGPL;2020-05-12