Marcin Peczarski

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The worst balanced partially ordered sets-ladders with broken rungs Experimental Mathematics	2019-06-19	Paper
Algorithm to Prove Formulas for the Expected Number of Questions in Mastermind Games	2018-08-11	Paper
Comments on the golden partition conjecture	2017-12-20	Paper
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory Lecture Notes in Computer Science	2015-09-15	Paper
Bounding memory for Mastermind might not make it harder Theoretical Computer Science	2015-07-24	Paper
The worst case number of questions in generalized AB game with and without white-peg answers Discrete Applied Mathematics	2015-04-28	Paper
Towards optimal sorting of 16 elements (available as arXiv preprint)	2014-07-09	Paper
The number of pessimistic guesses in generalized black-peg mastermind Information Processing Letters	2013-04-04	Paper
The number of pessimistic guesses in Generalized Mastermind Information Processing Letters	2010-08-16	Paper
An improvement of the tree code construction Information Processing Letters	2010-01-29	Paper
The Ford-Johnson algorithm still unbeaten for less than 47 elements Information Processing Letters	2010-01-29	Paper
The gold partition conjecture for 6-thin posets Order	2008-09-09	Paper
The gold partition conjecture Order	2006-09-14	Paper
New results in minimum-comparison sorting Algorithmica	2004-10-01	Paper
scientific article; zbMATH DE number 1947440 (Why is no real title available?)	2003-07-08	Paper

Research outcomes over time

This page was built for person: Marcin Peczarski