◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Elena Grigorescu

38 papers hereh-index 171.1k citations84 works total

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

author position
  • first author12
  • middle author21
  • last author4

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

fields
  • cs.DS21
  • cs.IT8
  • cs.CC4
  • cs.DM2
  • cs.LG2
  • math.PR1
same name
  • Elena Grigorescu — 8 papers, h 2
  • Elena Grigorescu — 2 papers, h 1
  • Elena Grigorescu — 2 papers, h 0
  • Elena Grigorescu — 1 paper
  • Elena Grigorescu — 1 paper, h 2
  • Elena Grigorescu — 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
20092023
most citedSuccinct Representation of Codes with Applications to Testing

23 citations · 74 across the 22 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

4 papers · 2 filters

cs.DS2016

Testing k-Monotonicity

Clément L. Canonne, Elena Grigorescu, Siyao Guo +2

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Ther…

cs.DS2016

Streaming Weighted Matchings: Optimal Meets Greedy

Elena Grigorescu, Morteza Monemizadeh, Samson Zhou

We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph G(V,E) are revealed in a streaming fashion. We analyze a vari…

cs.DS2016★ 1 cited

Local Testing for Membership in Lattices

Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota +1

Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study o…

cs.DS2016★ 3 cited

Estimating Weighted Matchings in o(n) Space

Elena Grigorescu, Morteza Monemizadeh, Samson Zhou

We consider the problem of estimating the weight of a maximum weighted matching of a weighted graph G(V,E) whose edges are revealed in a streaming fashion. We develop a reduction…

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