PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Békési, József"

Author of the publication

copydeleteadd this publication to your clipboard
Greedy Algorithms for On-Line Data Compression.

, , , and . J. Algorithms, 25 (2): 274-289 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Békési, József
add a person with the name Békési, József
 

Other publications of authors with the same name

Driver scheduling based on "driver-friendly" vehicle schedules., , , , , and . OR, page 323-328. Springer, (2011)Lower bounds for online makespan minimization on a small number of related machines., , , and . J. Scheduling, 16 (5): 539-547 (2013)Offline black and white bin packing., , , , , , and . Theor. Comput. Sci., (2015)A new lower bound for classic online bin packing., , , , and . CoRR, (2018)Analysis of permutation routing algorithms., , and . European Journal of Operational Research, 125 (2): 249-256 (2000)Online Bin Packing with Cardinality Constraints Resolved., , , , and . ESA, volume 87 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)A New and Improved Algorithm for Online Bin Packing., , , , and . ESA, volume 112 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Greedy Algorithms for On-Line Data Compression., , , and . J. Algorithms, 25 (2): 274-289 (1997)A 5/4 Linear Time Bin Packing Algorithm., , and . J. Comput. Syst. Sci., 60 (1): 145-160 (2000)An exact algorithm for scheduling identical coupled tasks., , , , and . Math. Meth. of OR, 59 (2): 193-203 (2004)