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
关键词
D O I
10.1007/BF00299635
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
8
引用
收藏
页码:269 / 277
页数:9
相关论文
共 50 条
  • [21] SAT Local Search Algorithms: Worst-Case Study
    Edward A. Hirsch
    Journal of Automated Reasoning, 2000, 24 : 127 - 143
  • [22] Local search algorithms for SAT: Worst-case analysis
    Hirsch, EA
    ALGORITHM THEORY - SWAT'98, 1998, 1432 : 246 - 254
  • [23] SAT local search algorithms: Worst-case study
    Hirsch, EA
    JOURNAL OF AUTOMATED REASONING, 2000, 24 (1-2) : 127 - 143
  • [24] Scope-tree: a program representation for symbolic worst-case execution time analysis
    Colin, A
    Bernat, G
    EUROMICRO RTS 2002: 14TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2002, : 50 - 59
  • [25] Obstacles in worst-case execution time analysis
    Kirner, Raimund
    Puschner, Peter
    ISORC 2008: 11TH IEEE SYMPOSIUM ON OBJECT/COMPONENT/SERVICE-ORIENTED REAL-TIME DISTRIBUTED COMPUTING - PROCEEDINGS, 2008, : 333 - 339
  • [26] Worst-case portfolio optimization in discrete time
    Chen, Lihua
    Korn, Ralf
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2019, 90 (02) : 197 - 227
  • [27] Worst-case portfolio optimization in discrete time
    Lihua Chen
    Ralf Korn
    Mathematical Methods of Operations Research, 2019, 90 : 197 - 227
  • [28] Worst-case performance of Wong's!Steiner tree heuristic
    Candia-Véjar, A
    Bravo-Azlán, H
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) : 730 - 737
  • [29] An efficient search algorithm of worst-case cache flush timings
    Miyamoto, H
    Iiyama, S
    Tomiyama, H
    Takada, H
    Nakashima, H
    11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 45 - 52
  • [30] The worst-case execution time tool challenge 2006
    Tan L.
    International Journal on Software Tools for Technology Transfer, 2009, 11 (02) : 133 - 152