default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel Zbarsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i5]Samuel Zbarsky:
Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons. CoRR abs/1903.04054 (2019)- 2018
- [j9]Joshua Brakensiek, Venkatesan Guruswami
, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. IEEE Trans. Inf. Theory 64(5): 3403-3410 (2018) - 2017
- [j8]Kristen Gardner, Mor Harchol-Balter, Alan Scheller-Wolf, Mark Velednitsky, Samuel Zbarsky:
Redundancy-d: The Power of d Choices for Redundancy. Oper. Res. 65(4): 1078-1094 (2017) - 2016
- [j7]Samuel Zbarsky:
The maximum number of subset divisors of a given size. Discret. Math. 339(6): 1727-1733 (2016) - [j6]Kristen Gardner, Samuel Zbarsky, Sherwin Doroudi, Mor Harchol-Balter, Esa Hyytiä, Alan Scheller-Wolf:
Queueing with redundant requests: exact analysis. Queueing Syst. Theory Appl. 83(3-4): 227-259 (2016) - [j5]Kristen Gardner, Samuel Zbarsky, Mark Velednitsky, Mor Harchol-Balter, Alan Scheller-Wolf:
Understanding Response Time in the Redundancy-d System. SIGMETRICS Perform. Evaluation Rev. 44(2): 33-35 (2016) - [c3]Kristen Gardner, Samuel Zbarsky, Mor Harchol-Balter, Alan Scheller-Wolf:
The Power of d Choices for Redundancy. SIGMETRICS 2016: 409-410 - [c2]Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. SODA 2016: 1884-1892 - 2015
- [j4]Samuel Zbarsky:
Unimodality of partitions in near-rectangular Ferrers diagrams. Discret. Math. 338(9): 1649-1658 (2015) - [j3]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky:
Distinct Volume Subsets. SIAM J. Discret. Math. 29(1): 472-480 (2015) - [c1]Kristen Gardner, Samuel Zbarsky, Sherwin Doroudi, Mor Harchol-Balter, Esa Hyytiä:
Reducing Latency via Redundant Requests: Exact Analysis. SIGMETRICS 2015: 347-360 - [i4]Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. CoRR abs/1507.06175 (2015) - [i3]Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Samuel Zbarsky:
On Improved Bounds for Bounded Degree Spanning Trees for Points in Arbitrary Dimension. Discret. Comput. Geom. 51(2): 427-437 (2014) - [i2]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky:
Distinct volume subsets. CoRR abs/1401.6734 (2014) - 2013
- [j1]William I. Gasarch, Sam Zbarsky:
Applications of the Erdős-Rado Canonical Ramsey Theorem to Erdős-Type Problems. Electron. Notes Discret. Math. 43: 305-310 (2013) - [i1]Samuel Zbarsky:
On Improved Bounds on Bounded Degree Spanning Trees for Points in Arbitrary Dimension. CoRR abs/1305.2661 (2013)
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:22 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:
