×

zbMATH — the first resource for mathematics

Peczarski, Marcin Piotr

Compute Distance To:
Author ID: peczarski.marcin-piotr Recent zbMATH articles by "Peczarski, Marcin Piotr"
Published as: Peczarski, Marcin; Peczarski, Marcin Piotr
Documents Indexed: 14 Publications since 2002

Co-Authors

9 single-authored
5 Jäger, Gerold

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 58 times in 34 Documents Cited by Year
New results in minimum-comparison sorting. Zbl 1088.68043
Peczarski, Marcin
10
2004
The number of pessimistic guesses in generalized black-peg mastermind. Zbl 1260.68288
Jäger, Gerold; Peczarski, Marcin
8
2011
The number of pessimistic guesses in Generalized Mastermind. Zbl 1197.91064
Jäger, Gerold; Peczarski, Marcin
7
2009
An improvement of the tree code construction. Zbl 1184.68624
Peczarski, Marcin
6
2006
The gold partition conjecture. Zbl 1099.06001
Peczarski, Marcin
5
2006
The Ford-Johnson algorithm still unbeaten for less than 47 elements. Zbl 1185.68881
Peczarski, Marcin
5
2007
The worst case number of questions in generalized AB game with and without white-peg answers. Zbl 1312.91004
Jäger, Gerold; Peczarski, Marcin
5
2015
The gold partition conjecture for 6-thin posets. Zbl 1155.06004
Peczarski, Marcin
4
2008
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory. Zbl 1401.91036
Jäger, Gerold; Peczarski, Marcin
2
2015
Towards optimal sorting of 16 elements. Zbl 1307.68034
Peczarski, Marcin
2
2012
Sorting 13 elements requires 34 comparisons. Zbl 1019.68033
Peczarski, Marcin
2
2002
Bounding memory for Mastermind might not make it harder. Zbl 1328.68095
Jäger, Gerold; Peczarski, Marcin
1
2015
Comments on the golden partition conjecture. Zbl 1378.06001
Peczarski, Marcin Piotr
1
2017
Comments on the golden partition conjecture. Zbl 1378.06001
Peczarski, Marcin Piotr
1
2017
The worst case number of questions in generalized AB game with and without white-peg answers. Zbl 1312.91004
Jäger, Gerold; Peczarski, Marcin
5
2015
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory. Zbl 1401.91036
Jäger, Gerold; Peczarski, Marcin
2
2015
Bounding memory for Mastermind might not make it harder. Zbl 1328.68095
Jäger, Gerold; Peczarski, Marcin
1
2015
Towards optimal sorting of 16 elements. Zbl 1307.68034
Peczarski, Marcin
2
2012
The number of pessimistic guesses in generalized black-peg mastermind. Zbl 1260.68288
Jäger, Gerold; Peczarski, Marcin
8
2011
The number of pessimistic guesses in Generalized Mastermind. Zbl 1197.91064
Jäger, Gerold; Peczarski, Marcin
7
2009
The gold partition conjecture for 6-thin posets. Zbl 1155.06004
Peczarski, Marcin
4
2008
The Ford-Johnson algorithm still unbeaten for less than 47 elements. Zbl 1185.68881
Peczarski, Marcin
5
2007
An improvement of the tree code construction. Zbl 1184.68624
Peczarski, Marcin
6
2006
The gold partition conjecture. Zbl 1099.06001
Peczarski, Marcin
5
2006
New results in minimum-comparison sorting. Zbl 1088.68043
Peczarski, Marcin
10
2004
Sorting 13 elements requires 34 comparisons. Zbl 1019.68033
Peczarski, Marcin
2
2002

Citations by Year