◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Rocco A. Servedio

22 papers hereh-index 5115 citations28 works total

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

author position
  • middle author8
  • last author13

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

fields
  • cs.CC11
  • cs.DS11
same name
  • Rocco A. Servedio — 2 papers
  • Rocco A. Servedio — 2 papers, h 4
  • Rocco A. Servedio — 2 papers, h 3
  • Rocco A. Servedio — 1 paper, h 2
  • Rocco A. Servedio — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedEfficient deterministic approximate counting for low-degree polynomial threshold functions

1 citations · 1 across the 16 of their papers we have counts for

collaborators
Showing 2026Show all

4 papers · 1 filter

cs.DS2026

Learning Depth-3 Circuits with Polynomial Savings

Xi Chen, Animesh Fatehpuria, Shyamal Patel +1

We study the challenging problem of learning depth-three circuits in the mistake-bound model of (realizable) online learning, which is a more difficult model than distribution-free…

cs.DS2026

Distribution-Free Halfspace Testing with Samples

Xi Chen, Renato Ferreira Pinto, Nathaniel Harms +2

We prove a tight Θ(n/ε) lower bound on the number of samples required for testing halfspaces over Rn, in the distribution-free sample-based model where the underlying…

cs.DS2026

Sublinear-query relative-error testing of halfspaces

Xi Chen, Anindya De, Yizhi Huang +3

The relative-error property testing model was introduced in [CDHLNSY24] to facilitate the study of property testing for "sparse" Boolean-valued functions, i.e. ones for which only…

cs.CC2026

DNF formulas are efficiently testable with relative error

Xi Chen, William Pires, Toniann Pitassi +1

We give a poly(s,1/ε)-query algorithm for testing whether an unknown and arbitrary function f:{0,1}n→{0,1} is an s-term DNF, in the challenging relative-error frame…

◍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.