◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Vondrák

40 papers hereh-index 4710.7k citations393 works total

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

author position
  • sole author2
  • middle author10
  • last author28

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

fields
  • cs.DS20
  • cs.LG6
  • cs.GT5
  • math.CO4
  • astro-ph.EP1
  • cs.DC1

identity via Semantic Scholar / OpenAlex

activity
20022026
most citedHigh probability generalization bounds for uniformly stable algorithms with nearly optimal rate

40 citations · 242 across the 33 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.LG2020★ 3 cited

Submodular Maximization Through Barrier Functions

Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi +1

In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves t…

cs.DS2020

A polynomial lower bound on adaptive complexity of submodular maximization

Wenzheng Li, Paul Liu, Jan Vondrak

In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a…

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