default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Peczarski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]Marcin Peczarski:
The Worst Balanced Partially Ordered Sets - Ladders with Broken Rungs. Exp. Math. 28(2): 181-184 (2019)- 2017
- [j10]Marcin Peczarski:
Comments on the Golden Partition Conjecture. Contributions Discret. Math. 12(1) (2017) - 2015
- [j9]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: 20-31 (2015) - [j8]Gerold Jäger, Marcin Peczarski:
Bounding memory for Mastermind might not make it harder. Theor. Comput. Sci. 596: 55-66 (2015) - [c3]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: 1-6 - 2014
- [c2]Gerold Jäger, Marcin Peczarski:
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. IWOCA 2014: 188-199 - 2013
- [i3]Gerold Jäger, Marcin Peczarski:
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers. CoRR abs/1306.1713 (2013) - 2011
- [j7]Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Black-peg Mastermind. Inf. Process. Lett. 111(19): 933-940 (2011) - [i2]Marcin Peczarski:
Towards Optimal Sorting of 16 Elements. CoRR abs/1108.0866 (2011)
2000 – 2009
- 2009
- [j6]Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Mastermind. Inf. Process. Lett. 109(12): 635-641 (2009) - 2008
- [j5]Marcin Peczarski:
The Gold Partition Conjecture for 6-Thin Posets. Order 25(2): 91-103 (2008) - 2007
- [j4]Marcin Peczarski:
The Ford-Johnson algorithm still unbeaten for less than 47 elements. Inf. Process. Lett. 101(3): 126-128 (2007) - 2006
- [j3]Marcin Peczarski:
An improvement of the tree code construction. Inf. Process. Lett. 99(3): 92-95 (2006) - [j2]Marcin Peczarski:
The Gold Partition Conjecture. Order 23(1): 89-95 (2006) - 2004
- [j1]Marcin Peczarski:
New Results in Minimum-Comparison Sorting. Algorithmica 40(2): 133-145 (2004) - [i1]Marcin Peczarski:
Strategy in Ulam's Game and Tree Code Give Error-Resistant Protocols. CoRR cs.DC/0410043 (2004) - 2002
- [c1]Marcin Peczarski:
Sorting 13 Elements Requires 34 Comparisons. ESA 2002: 785-794
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
