Competitive k-server algorithms
- 作者Amos Fiat; Yuval Rabani; Yiftach Ravid
- 卷第48卷
- 期第3期
- 印刷ISSN0022-0000
- 电子ISSN1090-2724
- 文件大小1008.07KB
- 发表时间1994
- DOI10.1016/s0022-0000(05)80060-1
- 页码410-428
同作者推荐
Almost fully-parallel parentheses matchingOmer Berkman; Uzi Vishkin · 1995
Recursive Star-Tree Parallel Data StructureBerkman, Omer; Vishkin, Uzi · SIAM Journal on Computing · 1993
Randomized range-maxima in nearly-constant parallel timeOmer Berkman; Yossi Matias; Uzi Vishkin · Computational Complexity · 1992
A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SETBERKMAN, OMER; SCHIEBER, BARUCH; VISHKIN, UZI · International Journal of Computational Geometry & Applications · 1996
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix MinimaBerkman, Omer; JáJá, Joseph; Krishnamurthy, Sridhar; Thurimella, Ramakrishna; Vishkin, Uzi · SIAM Journal on Computing · 1994