activity
20222026
most citedClient Error Clustering Approaches in Content Delivery Networks (CDN)

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

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Faster Sublinear Maximal Independent Set Size

Peter Kiss, Arash Kooroshnezhad

We give a sublinear-time algorithm for estimating the size of a maximal independent set in a graph using adjacency-query access with expected running time , i…

cs.DS2026

Online Preemptive Matching Revisited

Peter Kiss, Mohammad Sharifi

We study the online preemptive matching problem, in which the edges of a graph arrive sequentially and the algorithm must maintain a matching by accepting or rejecting arriving edg…