Marcin Peczarski

Publication Activity (10 Years)

Years Active: 2002-2019
Publications (10 Years): 5

Top Topics

Partially Ordered Sets

Algebraic Structures

Top Venues

Contributions Discret. Math.

Discret. Appl. Math.

Publications

Marcin Peczarski
The Worst Balanced Partially Ordered Sets - Ladders with Broken Rungs. Exp. Math. 28 (2) (2019)
Marcin Peczarski
Comments on the Golden Partition Conjecture. Contributions Discret. Math. 12 (1) (2017)
Gerold Jäger, Marcin Peczarski
The worst case number of questions in Generalized AB game with and without white-peg answers. Discret. Appl. Math. 184 (2015)
Gerold Jäger, Marcin Peczarski
Bounding memory for Mastermind might not make it harder. Theor. Comput. Sci. 596 (2015)
Mateusz Grabowski, Michal Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedanski, Marcin Peczarski, Dominik Batorski, Konrad Iwanicki
An Experimental Platform for Quantified Crowd. ICCCN (2015)
Gerold Jäger, Marcin Peczarski
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. IWOCA (2014)
Gerold Jäger, Marcin Peczarski
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers. CoRR (2013)
Marcin Peczarski
Towards Optimal Sorting of 16 Elements CoRR (2011)
Gerold Jäger, Marcin Peczarski
The number of pessimistic guesses in Generalized Black-peg Mastermind. Inf. Process. Lett. 111 (19) (2011)
Gerold Jäger, Marcin Peczarski
The number of pessimistic guesses in Generalized Mastermind. Inf. Process. Lett. 109 (12) (2009)
Marcin Peczarski
The Gold Partition Conjecture for 6-Thin Posets. Order 25 (2) (2008)
Marcin Peczarski
The Ford-Johnson algorithm still unbeaten for less than 47 elements. Inf. Process. Lett. 101 (3) (2007)
Marcin Peczarski
The Gold Partition Conjecture. Order 23 (1) (2006)
Marcin Peczarski
An improvement of the tree code construction. Inf. Process. Lett. 99 (3) (2006)
Marcin Peczarski
Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols CoRR (2004)
Marcin Peczarski
New Results in Minimum-Comparison Sorting. Algorithmica 40 (2) (2004)
Marcin Peczarski
Sorting 13 Elements Requires 34 Comparisons. ESA (2002)