Author of the publication

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.

 

Other publications of authors with the same name

A Bounded-Space Tree Traversal Algorithm., and . Inf. Process. Lett., 47 (4): 215-219 (1993)Randomized online interval scheduling.. Oper. Res. Lett., 22 (4-5): 171-177 (1998)Semi-online scheduling with decreasing job sizes., , and . Oper. Res. Lett., 27 (5): 215-221 (2000)Can a computer proof be elegant?. SIGACT News, 32 (1): 111-114 (2001)On the Online Bin Packing Problem.. ICALP, volume 2076 of Lecture Notes in Computer Science, page 237-248. Springer, (2001)Buying a Constant Competitive Ratio for Paging., , , , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 98-108. Springer, (2001)Randomized Algorithms for that Ancient Scheduling Problem.. WADS, volume 1272 of Lecture Notes in Computer Science, page 210-223. Springer, (1997)Barely Random Algorithms for Multiprocessor Scheduling.. J. Scheduling, 6 (3): 309-334 (2003)Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies., , , , , , , , and . CLUSTER, page 296-304. IEEE Computer Society, (2002)New Bounds for Variable-Sized Online Bin Packing., , and . SIAM J. Comput., 32 (2): 455-469 (2003)