◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ohad Talmon

2 papers hereh-index 351 citations5 works total

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

author position
  • middle author1
  • last author1

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

fields
  • cs.DS2
same name
  • Ohad Talmon — 1 paper

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

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Competitive Algorithms for Block-Aware Caching

Christian Coester, Roie Levin, Joseph +2

We study the block-aware caching problem, a generalization of classic caching in which fetching (or evicting) pages from the same block incurs the same cost as fetching (or evictin…

cs.DS2017

$O(\mbox{depth})$-Competitive Algorithm for Online Multi-level Aggregation

Niv Buchbinder, Moran Feldman, Joseph Naor +1

We consider a multi-level aggregation problem in a weighted rooted tree, studied recently by Bienkowski et al. (2015). In this problem requests arrive over time at the nodes of the…

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