We stand with Ukraine  

Marcin Peczarski

According to our database1, Marcin Peczarski authored at least 17 papers between 2002 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2026
Note on pancake sorting.
[BibTeX]
[DOI]
Marcin Peczarski
Inf. Process. Lett., 2026

2019
The Worst Balanced Partially Ordered Sets - Ladders with Broken Rungs.
[BibTeX]
[DOI]
Marcin Peczarski
Exp. Math., 2019

2017
Comments on the Golden Partition Conjecture.
[BibTeX]
[DOI]
Marcin Peczarski
Contributions Discret. Math., 2017

2015
Bounding memory for Mastermind might not make it harder.
[BibTeX]
[DOI]
Gerold Jäger
,
Marcin Peczarski
Theor. Comput. Sci., 2015

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

An Experimental Platform for Quantified Crowd.
[BibTeX]
[DOI]
Mateusz Grabowski
,
Michal Marschall
,
Wojciech Sirko
,
Maciej Debski
,
Marcin Ziombski
,
Przemyslaw Horban
,
Szymon Acedanski
,
Marcin Peczarski
,
Dominik Batorski
,
Konrad Iwanicki
Proceedings of the 24th International Conference on Computer Communication and Networks, 2015

2014
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory.
[BibTeX]
[DOI]
Gerold Jäger
,
Marcin Peczarski
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2011
The number of pessimistic guesses in Generalized Black-peg Mastermind.
[BibTeX]
[DOI]
Gerold Jäger
,
Marcin Peczarski
Inf. Process. Lett., 2011

Towards Optimal Sorting of 16 Elements
[BibTeX]
[DOI]
Marcin Peczarski
CoRR, 2011

2009
The number of pessimistic guesses in Generalized Mastermind.
[BibTeX]
[DOI]
Gerold Jäger
,
Marcin Peczarski
Inf. Process. Lett., 2009

2008
The Gold Partition Conjecture for 6-Thin Posets.
[BibTeX]
[DOI]
Marcin Peczarski
Order, 2008

2007
The Ford-Johnson algorithm still unbeaten for less than 47 elements.
[BibTeX]
[DOI]
Marcin Peczarski
Inf. Process. Lett., 2007

2006
The Gold Partition Conjecture.
[BibTeX]
[DOI]
Marcin Peczarski
Order, 2006

An improvement of the tree code construction.
[BibTeX]
[DOI]
Marcin Peczarski
Inf. Process. Lett., 2006

2004
Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols
[BibTeX]
[DOI]
Marcin Peczarski
CoRR, 2004

New Results in Minimum-Comparison Sorting.
[BibTeX]
[DOI]
Marcin Peczarski
Algorithmica, 2004

2002
Sorting 13 Elements Requires 34 Comparisons.
[BibTeX]
[DOI]
Marcin Peczarski
Proceedings of the Algorithms, 2002


  Loading...