25 citations · 33 across the 3 of their papers we have counts for
6 papers
Improved Analysis of Online Balanced Clustering
Marcin Bienkowski, Martin Böhm, Martin Koutecký +3
In the online balanced graph repartitioning problem, one has to maintain a clustering of nodes into clusters, each having nodes. During runtime, an online…
Theory meets Practice at the Median: a worst case comparison of relative error quantile algorithms
Graham Cormode, Abhinav Mishra, Joseph Ross +1
Estimating the distribution and quantiles of data is a foundational task in data mining and data science. We study algorithms which provide accurate results for extreme quantile qu…
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis +1
We consider the problem of managing the buffer of a shared-memory switch that transmits packets of unit value. A shared-memory switch consists of an input port, a number of output…
Streaming Algorithms for Geometric Steiner Forest
Artur Czumaj, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
We consider an important generalization of the Steiner tree problem, the \emph{Steiner forest problem}, in the Euclidean plane: the input is a multiset ,…
Relative Error Streaming Quantiles
Graham Cormode, Zohar Karnin, Edo Liberty +2
Estimating ranks, quantiles, and distributions over streaming data is a central task in data analysis and monitoring. Given a stream of items from a data universe equipped with…
Sensitivity of Λ single-particle energies to the ΛN spin-orbit coupling and to nuclear core structure in p-shell and sd-shell hypernuclei
P. Veselý, E. Hiyama, J. Hrtánková +1
We introduce a mean field model based on realistic 2-body baryon interactions and calculate spectra of a set of p-shell and sd-shell Λ hypernuclei - 13ΛC, 17ΛO, 21ΛNe, 29ΛSi and 41…