◍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 2012 · cs.GTShow all

1 paper · 2 filters

cs.GT2012★ 1 cited

The Computational Complexity of Truthfulness in Combinatorial Auctions

Shahar Dobzinski, Jan Vondrak

One of the fundamental questions of Algorithmic Mechanism Design is whether there exists an inherent clash between truthfulness and computational tractability: in particular, wheth…

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