Author of the publication

Complexity of Layered Binary Search Trees with Relaxed Balance.

, and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 269-284. Springer, (2001)

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

Online Interval Scheduling with Predictions., , , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 193-207. Springer, (2023)A Comparison of Performance Measures for Online Algorithms, , and . CoRR, (2008)Online Bin Packing with Advice, , , and . CoRR, (2012)Exponentially Decreasing Number of Operations in Balanced Trees., and . ICTCS, volume 2202 of Lecture Notes in Computer Science, page 293-311. Springer, (2001)Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem., , and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 95-107. Springer, (2006)Fair versus Unrestricted Bin Packing., , , , and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 200-213. Springer, (2000)Search Trees with Relaxed Balance and Near-Optimal Height., , and . WADS, volume 2125 of Lecture Notes in Computer Science, page 414-425. Springer, (2001)A Comparison of Performance Measures via Online Search., , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 303-314. Springer, (2012)Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis., , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 328-339. Springer, (2012)Partially Persistent Search Trees with Transcript Operations.. STACS, volume 1373 of Lecture Notes in Computer Science, page 309-319. Springer, (1998)