37 citations · 142 across the 37 of their papers we have counts for
43 papers
Unit Interval Selection in Random Order Streams
Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson +2
We consider the \textsf{Unit Interval Selection} problem in the one-pass random order streaming model. Here, an algorithm is presented a sequence of unit-length intervals on th…
Decentralized Distributed Graph Coloring: Cluster Graphs
Maxime Flin, Magnus M. Halldorsson, Alexandre Nolin
Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the unde…
Coloring Fast with Broadcasts
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson +2
We present an -round distributed algorithm for the -coloring problem, where each node broadcasts only one -bit message per round to its neighbors…
A Distributed Palette Sparsification Theorem
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson +2
The celebrated palette sparsification result of [Assadi, Chen, and Khanna SODA'19] shows that to compute a coloring of the graph, where denotes the maximum degree, it suf…
Query-Competitive Sorting with Uncertainty
Magnús M. Halldórsson, Murilo S. de Lima
We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of data items has an unknown value, which is known to lie in…
Query Minimization under Stochastic Uncertainty
Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima +1
We study problems with stochastic uncertainty information on intervals for which the precise value can be queried by paying a cost. The goal is to devise an adaptive decision tree…