researcher

Ajay Kumar

Indian Institute of Technology Mandi (IIT Mandi)

38 papers hereh-index 8737.8k citations2k works total

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

author position

first author9
middle author18
last author5

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

fields

affiliations

Indian Institute of Technology Mandi (IIT Mandi)

ORCID 0000-0002-3261-5566

same name

Ajay Kumar — 34 papers, h 16
Ajay Kumar — 12 papers, h 3
Ajay Kumar — 6 papers, h 12
Ajay Kumar — 6 papers, h 4
Ajay Kumar — 5 papers, h 1
Ajay Kumar — 4 papers, h 52

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

20062023

most citedExperimental evidence for bulk superconductivity in pure Bismuth single crystal at ambient pressure

178 citations · 982 across the 37 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2023

Efficient Algorithms and Hardness Results for the Weighted $k$ -Server Problem

Anupam Gupta, Amit Kumar, Debmalya Panigrahi

In this paper, we study the weighted $k$ -server problem on the uniform metric in both the offline and online settings. We start with the offline setting. In contrast to the (unweig…

cs.DS2021

A Hitting Set Relaxation for $k$ -Server and an Extension to Time-Windows

Anupam Gupta, Amit Kumar, Debmalya Panigrahi

We study the $k$ -server problem with time-windows. In this problem, each request $i$ arrives at some point $v_{i}$ of an $n$ -point metric space at time $b_{i}$ and comes with a deadlin…

cs.DS2021

Online Discrepancy with Recourse for Vectors and Graphs

Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy +2

The vector-balancing problem is a fundamental problem in discrepancy theory: given T vectors in $[- 1, 1]^{n}$ , find a signing $σ (a) \in {\pm 1}$ of each vector $a$ to minimize the d…

Efficient Algorithms and Hardness Results for the Weighted k-Server Problem

A Hitting Set Relaxation for k-Server and an Extension to Time-Windows

Online Discrepancy with Recourse for Vectors and Graphs

Efficient Algorithms and Hardness Results for the Weighted $k$ -Server Problem

A Hitting Set Relaxation for $k$ -Server and an Extension to Time-Windows