◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Abhishek Sinha

Tata Institute of Fundamental Research

32 papers hereh-index 161.7k citations51 works total

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

author position
  • sole author1
  • first author13
  • middle author5
  • last author11

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

fields
  • cs.IT13
  • cs.NI12
  • cs.LG4
  • math.OC2
  • cs.DS1
affiliations
  • Tata Institute of Fundamental Research
Homepage
same name
  • Abhishek Sinha — 13 papers, h 11
  • Abhishek Sinha — 12 papers, h 3
  • Abhishek Sinha — 1 paper, h 2
  • Abhishek Sinha — 1 paper, h 1

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
20112023
most citedScheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks

34 citations · 58 across the 22 of their papers we have counts for

collaborators
Showing 2021Show all

4 papers · 1 filter

cs.IT2021

Optimizing Age-of-Information in Adversarial Environments with Channel State Information

Avijit Mandal, Rajarshi Bhattacharjee, Abhishek Sinha

This paper considers a multi-user downlink scheduling problem with access to the channel state information at the transmitter (CSIT) to minimize the Age-of-Information (AoI) in a n…

cs.IT2021

k-experts -- Online Policies and Fundamental Limits

Samrat Mukhopadhyay, Sourav Sahoo, Abhishek Sinha

We introduce the $\texttt{$k$-experts}$ problem - a generalization of the classic Prediction with Expert's Advice framework. Unlike the classic version, where the learner selects e…

cs.NI2021

Fast and Secure Routing Algorithms for Quantum Key Distribution Networks

Shahbaz Akhtar, Krishnakumar G, Vishnu B +1

We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. Assume that a QKD protocol generates symmetric private k…

cs.IT2021

Online Caching with Optimal Switching Regret

Samrat Mukhopadhyay, Abhishek Sinha

We consider the classical uncoded caching problem from an online learning point-of-view. A cache of limited storage capacity can hold C files at a time from a large catalog. A us…

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