◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Olkowski

13 papers hereh-index 569 citations25 works total

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

author position
  • middle author4
  • last author9

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

fields
  • cs.DS8
  • cs.DC4
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20212026
most citedOptimal Algorithms for Free Order Multiple-Choice Secretary

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

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.DC2025

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries

Dariusz R. Kowalski, Jan Olkowski

Load balancing is among the basic primitives in distributed computing. In this paper, we consider this problem when executed locally on a network with nodes prone to failures. We s…

cs.DS2025

Beating Competitive Ratio 4 for Graphic Matroid Secretary

Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski +3

One of the classic problems in online decision-making is the *secretary problem* where to goal is to maximize the probability of choosing the largest number from a randomly ordered…

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