◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Monik Khare

2 papers hereh-index 26 citations5 works total

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

author position
  • first author2

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

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

most citedCaching with rental cost and zapping

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2013

First-Come-First-Served for Online Slot Allocation and Huffman Coding

Monik Khare, Claire Mathieu, Neal E. Young

Can one choose a good Huffman code on the fly, without knowing the underlying distribution? Online Slot Allocation (OSA) models this and similar problems: There are n slots, each w…

cs.DS2012★ 1 cited

Caching with rental cost and zapping

Monik Khare, Neal E. Young

The \emph{file caching} problem is defined as follows. Given a cache of size k (a positive integer), the goal is to minimize the total retrieval cost for the given sequence of re…

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