Lower Bounds for Dynamic Data Structures on Algebraic RAMs Ben-AmramGalil OriginalPaper Pages: 364 - 395
Minimum Congestion Redundant Assignments to Tolerate Random Faults FotakisSpirakis OriginalPaper Pages: 396 - 422
A Functional Approach to External Graph Algorithms AbelloBuchsbaumWestbrook OriginalPaper Pages: 437 - 458
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach CohenKaplan OriginalPaper Pages: 459 - 466
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks JansenPorkolab OriginalPaper Pages: 507 - 520