◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Ostrovsky

39 papers hereh-index 7534k citations448 works total

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

author position
  • sole author1
  • first author7
  • middle author15
  • last author16

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

fields
  • cs.DS20
  • cs.CR4
  • cs.DC4
  • cs.GT3
  • quant-ph3
  • cs.CC2

identity via Semantic Scholar / OpenAlex

activity
20062026
most citedFuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

1.7k citations · 1.9k across the 33 of their papers we have counts for

collaborators
Showing cs.GTShow all

3 papers · 1 filter

cs.GT2025

Game of Trust: How Trustworthy Does Your Blockchain Think You Are?

Petros Drineas, Rohit Nema, Rafail Ostrovsky +1

We investigate how a blockchain can distill the collective belief of its nodes regarding the trustworthiness of a (sub)set of nodes into a {\em reputation system} that reflects the…

cs.GT2014

Fast distributed almost stable marriages

Rafail Ostrovsky, Will Rosenbaum

In their seminal work on the Stable Marriage Problem, Gale and Shapley describe an algorithm which finds a stable matching in O(n2) communication rounds. Their algorithm has a n…

cs.GT2014

A Stable Marriage Requires Communication

Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky +1

The Gale-Shapley algorithm for the Stable Marriage Problem is known to take Θ(n2) steps to find a stable marriage in the worst case, but only Θ(nlogn) steps in the average…

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