◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mohit Singh

41 papers hereh-index 302.8k citations114 works total

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

author position
  • sole author1
  • first author5
  • middle author23
  • last author12

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

fields
  • cs.DS27
  • math.CO4
  • math.OC3
  • cs.GT2
  • cs.CC1
  • cs.DM1
same name
  • Mohit Singh — 11 papers, h 3
  • Mohit Singh — 5 papers, h 3
  • Mohit Singh — 4 papers, h 2
  • Mohit Singh — 3 papers, h 2
  • Mohit Singh — 1 paper
  • Mohit Singh — 1 paper, h 15

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
20092026
most citedA geometric alternative to Nesterov's accelerated gradient descent

85 citations · 237 across the 30 of their papers we have counts for

collaborators
Showing 2022 · cs.DSShow all

4 papers · 2 filters

cs.DS2022

Efficient Determinant Maximization for All Matroids

Adam Brown, Aditi Laddha, Madhusudhan Pittu +1

Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and networ…

cs.DS2022

Which Lp​ norm is the fairest? Approximations for fair facility location across all "p"

Swati Gupta, Jai Moondra, Mohit Singh

Fair facility location problems try to balance access costs to open facilities borne by different groups of people by minimizing the Lp​ norm of these group distances. However, t…

cs.DS2022

Determinant Maximization via Matroid Intersection Algorithms

Adam Brown, Aditi Laddha, Madhusudhan Pittu +2

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khach…

cs.DS2022★ 1 cited

Constant-Factor Approximation Algorithms for Socially Fair k-Clustering

Mehrdad Ghadiri, Mohit Singh, Santosh S. Vempala

We study approximation algorithms for the socially fair (ℓp​,k)-clustering problem with m groups, whose special cases include the socially fair k-median (p=1) and socia…

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