activity
20082026
most citedGreed Works -- Online Algorithms For Unrelated Machine Stochastic Scheduling

23 citations · 129 across the 42 of their papers we have counts for

collaborators

54 papers

cs.DS2026

Optimal Convergence of Iterative Methods for Datalogo

Simon Frisk, Sungjin Im, Paraschos Koutris +4

has been introduced as an extension to Datalog that increases expressiveness, yet retains simple least fixpoint semantics and admits optimization technique…

cs.DB2023

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs

Sungjin Im, Benjamin Moseley, Hung Q. Ngo +1

Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natur…

cs.DB2023

On the Convergence Rate of Linear Datalogo over Stable Semirings

Sungjin Im, Benjamin Moseley, Hung Ngo +1

Datalogo is an extension of Datalog, where instead of a program being a collection of union of conjunctive queries over the standard Boolean semiring, a program may now be a collec…

cs.DS2023

Controlling Tail Risk in Online Ski-Rental

Michael Dinitz, Sungjin Im, Thomas Lavastida +2

The classical ski-rental problem admits a textbook 2-competitive deterministic algorithm, and a simple randomized algorithm that is -competitive in expectation. The…

cs.DS2023

Simultaneously Approximating All -norms in Correlation Clustering

Sami Davies, Benjamin Moseley, Heather Newman

This paper considers correlation clustering on unweighted complete graphs. We give a combinatorial algorithm that returns a single clustering solution that is simultaneously …

cs.DS2023★ 2 cited

Online List Labeling with Predictions

Samuel McCauley, Benjamin Moseley, Aidin Niaparast +1

A growing line of work shows how learned predictions can be used to break through worst-case barriers to improve the running time of an algorithm. However, incorporating prediction…