Derivation of on-line algorithms, with an application to finding palindromes

被引：0
|
作者：
Jeuring, Johan [1 ]
机构：
[1] Utrecht Univ, Utrecht, Netherlands
来源：
Algorithmica (New York) | 1994年 / 11卷 / 02期
关键词：
Bird meertens calculus - Palindromes - Segment problems - Theory of lists - Transformational programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：146 / 184
相关论文
共 50 条
  • [41] ON-LINE LEARNING CONTROL ALGORITHMS.
    Saridis, George N.
    1600,
  • [42] Delayed information and action in on-line algorithms
    Albers, S
    Charikar, M
    Mitzenmacher, M
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 71 - 80
  • [43] An executable taxonomy of on-line modeling algorithms
    Bunton, S
    DCC '97 : DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1997, : 42 - 51
  • [44] On-line algorithms for complex number arithmetic
    McIlhenny, R
    Ercegovac, MD
    CONFERENCE RECORD OF THE THIRTY-SECOND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 1998, : 172 - 176
  • [45] Memory versus randomization in on-line algorithms
    Raghavan, P., 1600, IBM, Armonk (38):
  • [46] On-line scheduling algorithms for QoS control
    Tang, MC
    Shih, WK
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 2095 - 2101
  • [47] Scheduling for on-line taxi problem on a real line and competitive algorithms
    Xin, CL
    Ma, WM
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3078 - 3083
  • [48] Off-line and on-line algorithms for closed string factorization
    Alzamel, Mai
    Iliopoulos, Costas S.
    Smyth, W. F.
    Sung, Wing-Kin
    THEORETICAL COMPUTER SCIENCE, 2019, 792 : 12 - 19
  • [49] Finding maximal 2-dimensional palindromes
    Geizhals, Sara H.
    Sokol, Dina
    INFORMATION AND COMPUTATION, 2019, 266 : 161 - 172
  • [50] On-line application and processing of questionnaires
    Serrano Angulo, Jose
    REVISTA ESPANOLA DE PEDAGOGIA, 2012, 70 (251): : 61 - 75
12345