◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Santha

41 papers hereh-index 314.5k citations124 works total

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

author position
  • sole author1
  • middle author19
  • last author21

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

fields
  • quant-ph27
  • cs.CC8
  • cs.DS4
  • cs.GT1
  • math.NT1

identity via Semantic Scholar / OpenAlex

activity
19992025
most citedQuantum walk based search algorithms

24 citations · 72 across the 23 of their papers we have counts for

collaborators
Showing 2011 · cs.GTShow all

1 paper · 2 filters

cs.GT2011

The complexity of approximate Nash equilibrium in congestion games with negative delays

Frederic Magniez, Michel de Rougemont, Miklos Santha +1

We extend the study of the complexity of finding an $\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. W…

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