ON PATHS IN SEARCH OR DECISION TREES WHICH REQUIRE ALMOST WORST-CASE TIME

被引：0
|
作者：
HUCKENBECK, U
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 344卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：406 / 423
页数：18
相关论文
共 50 条
  • [1] WHICH IS THE WORST-CASE NASH EQUILIBRIUM?
    Luecking, Thomas
    Mavronicolas, Marios
    Monien, Burkhard
    Spirakis, Paul g.
    Vrto, Imrich
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (02) : 1701 - 1732
  • [2] Which is the worst-case Nash equilibrium?
    Lücking, T
    Mavronicolas, M
    Monien, B
    Rode, M
    Spirakis, P
    Vrto, I
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 551 - 561
  • [3] Optimal worst-case operations for implicit cache-oblivious search trees
    Franceschini, G
    Grossi, R
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2003, 2748 : 114 - 126
  • [4] Improving WCET by optimizing worst-case paths
    Zhao, WK
    Kreahling, W
    Whalley, D
    Healy, C
    Mueller, F
    RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2005, : 138 - 147
  • [5] 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
  • [6] Worst-Case Optimal Graph Joins in Almost No Space
    Arroyuelo, Diego
    Hogan, Aidan
    Navarro, Gonzalo
    Reutter, Juan L.
    Rojas-Ledesma, Javiel
    Soto, Adrian
    SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2021, : 102 - 114
  • [7] A BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
    LEVCOPOULOS, C
    OVERMARS, MH
    ACTA INFORMATICA, 1988, 26 (03) : 269 - 277
  • [8] Partially persistent B-trees with constant worst-case update time
    Lagogiannis, George
    Lorentzos, Nikos
    COMPUTERS & ELECTRICAL ENGINEERING, 2012, 38 (02) : 231 - 242
  • [9] Determining best-case and worst-case times of unknown paths in time workflow nets
    Camerzan, Inga
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2010, 18 (01) : 59 - 69
  • [10] 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
12345