Applications of the Erdős-Rado Canonical Ramsey Theorem to Erdős-Type Problems. - William I. Gasarch; Sam Zbarsky (Electron. Notes Discret. Math., 2013)

On Improved Bounds for Bounded Degree Spanning Trees for Points in Arbitrary Dimension. - Samuel Zbarsky (Discret. Comput. Geom., 2014)

Reducing Latency via Redundant Requests: Exact Analysis. - Kristen Gardner 001; Samuel Zbarsky; Sherwin Doroudi; Mor Harchol-Balter; Esa Hyytiä (SIGMETRICS, 2015)

Unimodality of partitions in near-rectangular Ferrers diagrams. - Samuel Zbarsky (Discret. Math., 2015)

Efficient Low-Redundancy Codes for Correcting Multiple Deletions. - Joshua Brakensiek; Venkatesan Guruswami; Samuel Zbarsky (Electron. Colloquium Comput. Complex., 2015)

Distinct Volume Subsets. - David Conlon; Jacob Fox; William I. Gasarch; David G. Harris 001; Douglas Ulrich; Samuel Zbarsky (SIAM J. Discret. Math., 2015)

The Power of d Choices for Redundancy. - Kristen Gardner 001; Samuel Zbarsky; Mor Harchol-Balter; Alan Scheller-Wolf (SIGMETRICS, 2016)

The maximum number of subset divisors of a given size. - Samuel Zbarsky (Discret. Math., 2016)

Queueing with redundant requests: exact analysis. - Kristen Gardner 001; Samuel Zbarsky; Sherwin Doroudi; Mor Harchol-Balter; Esa Hyytiä; Alan Scheller-Wolf (Queueing Syst. Theory Appl., 2016)

Understanding Response Time in the Redundancy-d System. - Kristen Gardner 001; Samuel Zbarsky; Mark Velednitsky; Mor Harchol-Balter; Alan Scheller-Wolf (SIGMETRICS Perform. Evaluation Rev., 2016)

Redundancy-d: The Power of d Choices for Redundancy. - Kristen Gardner 001; Mor Harchol-Balter; Alan Scheller-Wolf; Mark Velednitsky; Samuel Zbarsky (Oper. Res., 2017)

Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons. - Samuel Zbarsky (CoRR, 2019)