We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hie...
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz