◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Moran

48 papers hereh-index 272.4k citations117 works total

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

author position
  • sole author1
  • first author4
  • middle author26
  • last author17

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

fields
  • cs.LG37
  • cs.DS3
  • cs.CG2
  • cs.DM2
  • math.CO2
  • math.GM1
same name
  • S. Moran — 39 papers, h 34
  • S. Moran — 31 papers, h 22
  • S. Moran — 24 papers, h 6
  • S. Moran — 8 papers, h 12
  • S. Moran — 6 papers, h 36
  • S. Moran — 3 papers, h 2

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
20122026
most citedLimits of Private Learning with Access to Public Data

15 citations · 83 across the 28 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

cs.DS2018

The entropy of lies: playing twenty questions with a liar

Yuval Dagan, Yuval Filmus, Daniel Kane +1

`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between 1 and n, and Alice's goal is to recover it using a minimal number of Yes/No questi…

cs.LG2018

On the Perceptron's Compression

Shay Moran, Ido Nachum, Itai Panasoff +1

We study and provide exposition to several phenomena that are related to the perceptron's compression. One theme concerns modifications of the perceptron algorithm that yield bette…

cs.LG2018

Private PAC learning implies finite Littlestone dimension

Noga Alon, Roi Livni, Maryanthe Malliaris +1

We show that every approximately differentially private learning algorithm (possibly improper) for a class H with Littlestone dimension~d requires Ω(log∗(d)) exam…

cs.CG2018

Generalized comparison trees for point-location problems

Daniel M Kane, Shachar Lovett, Shay Moran

Let H be an arbitrary family of hyper-planes in d-dimensions. We show that the point-location problem for H can be solved by a linear decision tree that only uses a special t…

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