A Propositional Proof System with Quantification Over Permutations. - Grzegorz Herman; Tim Paterson; Michael Soltys (Fundam. Informaticae, 2007)

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem - Grzegorz Herman; Michael Soltys (CoRR, 2008)

On the Ehrenfeucht-Mycielski sequence. - Grzegorz Herman; Michael Soltys (J. Discrete Algorithms, 2009)

Unambiguous Functions in Logarithmic Space. - Grzegorz Herman; Michael Soltys (Fundam. Informaticae, 2012)

Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices. - Grzegorz Herman (Reports Math. Log., 2014)

Relational parsing: a clean, fast parsing strategy for all context-free languages. - Grzegorz Herman (CoRR, 2019)

Faster general parsing through context-free memoization. - Grzegorz Herman (PLDI, 2020)

Long-Distance Directional Dial-a-Ride Problems. - Grzegorz Gutowski; Grzegorz Herman (VEHITS, 2023)

Aggregating Pairwise Information Over Optimal Routes. - Grzegorz Herman; Grzegorz Gawryal (VEHITS, 2023)

Dynamic Prices in Ride-Sharing Scenarios. - Lech Duraj; Grzegorz Herman (VEHITS, 2024)