◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Will Rosenbaum

23 papers hereh-index 10333 citations34 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author2
  • middle author4
  • last author15

Across the 23 of 23 papers where every author was matched, so the position is known.

fields
  • cs.CC7
  • cs.DC7
  • cs.DS5
  • cs.GT2
  • cs.DM1
  • cs.LG1

identity via Semantic Scholar / OpenAlex

activity
20142026
most citedFinding a Winning Strategy for Wordle is NP-complete

7 citations · 18 across the 15 of their papers we have counts for

collaborators
Showing 2022Show all

3 papers · 1 filter

cs.LG2022

Training-Time Attacks against k-Nearest Neighbors

Ara Vartanian, Will Rosenbaum, Scott Alfeld

Nearest neighbor-based methods are commonly used for classification tasks and as subroutines of other data-analysis methods. An attacker with the capability of inserting their own…

cs.DS2022

Bias Reduction for Sum Estimation

Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan +2

In classical statistics and distribution testing, it is often assumed that elements can be sampled from some distribution P, and that when an element x is sampled, the probabil…

cs.CC2022★ 7 cited

Finding a Winning Strategy for Wordle is NP-complete

Will Rosenbaum

In this paper, we give a formal definition of the popular word-guessing game Wordle. We show that, in general, determining if a given Wordle instance admits a winning strategy is N…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.