Marcin Peczarski

dblp:28/637 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
1since 2021 · last 2026
0000-0002-9902-8374ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 5 first-author · 1 since 2021Databases, data management, data science and information retrieval · 5 · 3 first-author · 1 since 2021Computer networks · 1
YearPublicationVenuePosition
2026 Note on pancake sorting
Marcin Peczarski
Inf. Process. Lett.1
2015 An Experimental Platform for Quantified Crowd
abstract
Quantified crowd, a vision in which on-body sensors of nearby people collaborate to detect various phenomena within a crowd and produce feedback, is an emerging research area. One of the issues that impedes progress in this new area is a lack of a broadly applicable experimental platform, such as the platforms that enabled research on wireless sensor networks. In this paper, we aim to address this issue by presenting such an experimental hardware-software platform. Not only does the platform introduce custom badge-form low-power devices that feature a number of sensors relevant to quantified crowd, but it also ensures that these devices can interoperate with commercial off-the-shelf smartphones, wristbands, and other devices for self-quantification. In effect, it constitutes a powerful experimental instrument, as we show in a preliminary real-world evaluation.
Mateusz Grabowski, Michal Marschall, Wojciech Sirko, Maciej Debski, Marcin Ziombski, Przemyslaw Horban, Szymon Acedanski, Marcin Peczarski, Dominik Batorski, Konrad Iwanicki
ICCCN8
2015 The worst case number of questions in Generalized AB game with and without white-peg answers
Gerold Jäger, Marcin Peczarski
Discret. Appl. Math.2
2015 Bounding memory for Mastermind might not make it harder
Gerold Jäger, Marcin Peczarski
Theor. Comput. Sci.2
2014 Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
Gerold Jäger, Marcin Peczarski
IWOCA2
2011 The number of pessimistic guesses in Generalized Black-peg Mastermind
Gerold Jäger, Marcin Peczarski
Inf. Process. Lett.2
2009 The number of pessimistic guesses in Generalized Mastermind
Gerold Jäger, Marcin Peczarski
Inf. Process. Lett.2
2007 The Ford-Johnson algorithm still unbeaten for less than 47 elements
Marcin Peczarski
Inf. Process. Lett.1
2006 An improvement of the tree code construction
Marcin Peczarski
Inf. Process. Lett.1
2004 New Results in Minimum-Comparison Sorting
Marcin Peczarski
Algorithmica1
2002 Sorting 13 Elements Requires 34 Comparisons
Marcin Peczarski
ESA1