default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWill Rosenbaum
Person information
- affiliation: Amherst College, Amherst, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Ara Vartanian, Will Rosenbaum, Scott Alfeld:
Training-Time Attacks against K-nearest Neighbors. AAAI 2023: 10053-10060- [c18]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. APPROX/RANDOM 2023: 62:1-62:21 - [c17]Cameron Matsui, Will Rosenbaum
:
Packet Forwarding with Swaps. SIROCCO 2023: 536-557 - 2022
- [j2]Christine T. Cheng, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. ACM Trans. Economics and Comput. 10(3): 13:1-13:45 (2022) - [c16]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. ICALP 2022: 56:1-56:19 - [c15]Will Rosenbaum:
Packet Forwarding with a Locally Bursty Adversary. DISC 2022: 34:1-34:18 - [i18]Will Rosenbaum:
Finding a Winning Strategy for Wordle is NP-complete. CoRR abs/2204.04104 (2022) - [i17]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. CoRR abs/2208.01197 (2022) - [i16]Ara Vartanian, Will Rosenbaum, Scott Alfeld:
Training-Time Attacks against k-Nearest Neighbors. CoRR abs/2208.07272 (2022) - [i15]Will Rosenbaum:
Packet Forwarding with a Locally Bursty Adversary. CoRR abs/2208.09522 (2022) - 2021
- [c14]Christine T. Cheng, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. EC 2021: 319-339 - 2020
- [c13]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. ASYNC 2020: 36-43 - [c12]Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. PODC 2020: 89-98 - [i14]Johannes Bund, Matthias Függer, Christoph Lenzen, Moti Medina, Will Rosenbaum:
PALS: Plesiochronous and Locally Synchronous Systems. CoRR abs/2003.05542 (2020) - [i13]Christine T. Cheng, Will Rosenbaum:
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. CoRR abs/2008.08479 (2020) - [i12]Christine T. Cheng, Will Rosenbaum:
Stable Matchings with Restricted Preferences: Structure and Complexity. CoRR abs/2008.08480 (2020) - [i11]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. CoRR abs/2012.04090 (2020)
2010 – 2019
- 2019
- [j1]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A stable marriage requires communication. Games Econ. Behav. 118: 626-647 (2019) - [c11]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. ICALP 2019: 52:1-52:14 - [c10]Boaz Patt-Shamir, Will Rosenbaum:
Space-Optimal Packet Routing on Trees. INFOCOM 2019: 1036-1044 - [c9]Avery Miller, Boaz Patt-Shamir, Will Rosenbaum:
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. PODC 2019: 117-126 - [c8]Johannes Bund, Christoph Lenzen, Will Rosenbaum:
Fault Tolerant Gradient Clock Synchronization. PODC 2019: 357-365 - [i10]Johannes Bund, Christoph Lenzen, Will Rosenbaum:
Fault Tolerant Gradient Clock Synchronization. CoRR abs/1902.08042 (2019) - [i9]Avery Miller, Boaz Patt-Shamir, Will Rosenbaum:
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing. CoRR abs/1902.08069 (2019) - [i8]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. CoRR abs/1902.08086 (2019) - [i7]Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. CoRR abs/1907.08160 (2019) - 2018
- [c7]Talya Eden, Will Rosenbaum:
Lower Bounds for Approximating Graph Parameters via Communication Complexity. APPROX-RANDOM 2018: 11:1-11:18 - [c6]Talya Eden, Will Rosenbaum:
On Sampling Edges Almost Uniformly. SOSA 2018: 7:1-7:9 - 2017
- [c5]Boaz Patt-Shamir, Will Rosenbaum:
The Space Requirement of Local Forwarding on Acyclic Networks. PODC 2017: 13-22 - [c4]Rafail Ostrovsky, Mor Perry, Will Rosenbaum:
Space-Time Tradeoffs for Distributed Verification. SIROCCO 2017: 53-70 - [i6]Talya Eden, Will Rosenbaum:
On Sampling Edges Almost Uniformly. CoRR abs/1706.09748 (2017) - [i5]Talya Eden, Will Rosenbaum:
Lower Bounds for Approximating Graph Parameters via Communication Complexity. CoRR abs/1709.04262 (2017) - 2016
- [b1]Will Rosenbaum:
Distributed Almost Stable Matchings. University of California, Los Angeles, USA, 2016 - [c3]Mor Baruch, Rafail Ostrovsky, Will Rosenbaum:
Brief Announcement: Space-Time Tradeoffs for Distributed Verification. PODC 2016: 357-359 - [i4]Mor Baruch, Rafail Ostrovsky, Will Rosenbaum:
Space-Time Tradeoffs for Distributed Verification. CoRR abs/1605.06814 (2016) - 2015
- [c2]Rafail Ostrovsky, Will Rosenbaum:
Fast Distributed Almost Stable Matchings. PODC 2015: 101-108 - [c1]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. SODA 2015: 1003-1017 - 2014
- [i3]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. CoRR abs/1405.7709 (2014) - [i2]Rafail Ostrovsky, Will Rosenbaum:
Fast distributed almost stable marriages. CoRR abs/1408.2782 (2014) - [i1]Rafail Ostrovsky, Will Rosenbaum:
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems. CoRR abs/1412.1130 (2014)
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 2024-04-25 05:51 CEST 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:
