3 citations · 3 across the 2 of their papers we have counts for
3 papers
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this…
On the Sum-of-Squares Algorithm for Bin Packing
Janos Csirik, David S. Johnson, Claire Kenyon +3
In this paper we present a theoretical analysis of the deterministic on-line {\em Sum of Squares} algorithm () for bin packing introduced and studied experimentally in \cite{CJ…
On the genera of X_0(N)
János A. Csirik, Joseph L. Wetherell, Michael E. Zieve
Let g_0(N) be the genus of the modular curve X_0(N). We record several properties of the sequence {g_0(N)}. Even though the average size of g_0(N) is 1.25N/pi^2, a random positive…