A BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME

被引：27
|
作者：
LEVCOPOULOS, C [1 ]
OVERMARS, MH [1 ]
机构：
[1] STATE UNIV UTRECHT,DEPT COMP SCI,3508 TD UTRECHT,NETHERLANDS
来源：
ACTA INFORMATICA | 1988年 / 26卷 / 03期
关键词：
D O I：
10.1007/BF00299635
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
8
引用
收藏
页码：269 / 277
页数：9
相关论文
共 50 条
  • [1] Deterministic Dynamic Matching in Worst-Case Update Time
    Peter Kiss
    Algorithmica, 2023, 85 : 3741 - 3765
  • [2] Deterministic Dynamic Matching in Worst-Case Update Time
    Kiss, Peter
    ALGORITHMICA, 2023, 85 (12) : 3741 - 3765
  • [3] An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
    Bose, Prosenjit
    Douieb, Karim
    Dujmovic, Vida
    Fagerberg, Rolf
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 38 - +
  • [4] Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler
    Dwekat, Zyad A.
    Rouskas, George N.
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [5] Generating gray codes in O(1) worst-case time per word
    Walsh, T
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 73 - 88
  • [6] Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
    Nanongkai, Danupon
    Saranurak, Thatchaphol
    Wulff-Nilsen, Christian
    2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 950 - 961
  • [7] Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity
    Duan, Ran
    Zhang, Le
    ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 337 - 348
  • [8] Partially persistent B-trees with constant worst-case update time
    Lagogiannis, George
    Lorentzos, Nikos
    COMPUTERS & ELECTRICAL ENGINEERING, 2012, 38 (02) : 231 - 242
  • [9] Worst-Case Efficient Range Search Indexing
    Arge, Lars
    PODS'09: PROCEEDINGS OF THE TWENTY-EIGHTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2009, : 175 - 176
  • [10] Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
    van den Brand, Jan
    Nanongkai, Danupon
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 436 - 455
12345