Sorting 13 Elements Requires 34 Comparisons. - Marcin Peczarski (ESA, 2002)

New Results in Minimum-Comparison Sorting. - Marcin Peczarski (Algorithmica, 2004)

Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols - Marcin Peczarski (CoRR, 2004)

An improvement of the tree code construction. - Marcin Peczarski (Inf. Process. Lett., 2006)

The Gold Partition Conjecture. - Marcin Peczarski (Order, 2006)

The Ford-Johnson algorithm still unbeaten for less than 47 elements. - Marcin Peczarski (Inf. Process. Lett., 2007)

The Gold Partition Conjecture for 6-Thin Posets. - Marcin Peczarski (Order, 2008)

The number of pessimistic guesses in Generalized Mastermind. - Gerold Jäger; Marcin Peczarski (Inf. Process. Lett., 2009)

Towards Optimal Sorting of 16 Elements - Marcin Peczarski (CoRR, 2011)

The number of pessimistic guesses in Generalized Black-peg Mastermind. - Gerold Jäger; Marcin Peczarski (Inf. Process. Lett., 2011)

Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. - Gerold Jäger; Marcin Peczarski (IWOCA, 2014)

An Experimental Platform for Quantified Crowd. - Mateusz Grabowski; Michal Marschall; Wojciech Sirko; Maciej Debski; Marcin Ziombski; Przemyslaw Horban; Szymon Acedanski; Marcin Peczarski; Dominik Batorski; Konrad Iwanicki (ICCCN, 2015)

The worst case number of questions in Generalized AB game with and without white-peg answers. - Gerold Jäger; Marcin Peczarski (Discret. Appl. Math., 2015)

Bounding memory for Mastermind might not make it harder. - Gerold Jäger; Marcin Peczarski (Theor. Comput. Sci., 2015)

Comments on the Golden Partition Conjecture. - Marcin Peczarski (Contributions Discret. Math., 2017)

The Worst Balanced Partially Ordered Sets - Ladders with Broken Rungs. - Marcin Peczarski (Exp. Math., 2019)

Note on pancake sorting. - Marcin Peczarski (Inf. Process. Lett., 2026)