메뉴 건너뛰기




Volumn 1461 LNCS, Issue , 1998, Pages 271-282

Adaptability and the usefulness of hints

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84896784367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_23     Document Type: Conference Paper
Times cited : (8)

References (21)
  • 7
    • 0003661492 scopus 로고
    • Bit optimal distributed consensus
    • (ed. R. Yaeza-Bates and U. Manber), Plenum Publishing Corporation, NY, NY
    • P. Berman, J. Garay, and K. Perry. Bit Optimal Distributed Consensus. In Computer Science Research (ed. R. Yaeza-Bates and U. Manber), Plenum Publishing Corporation, NY, NY, pp. 313-322, 1992.
    • (1992) Computer Science Research , pp. 313-322
    • Berman, P.1    Garay, J.2    Perry, K.3
  • 11
    • 0021976090 scopus 로고
    • Bounds of information exchange for byzantine agreement
    • D. Dolev and R. Reischuk, Bounds of Information Exchange for Byzantine Agreement. JACM, Vol. 32, No. 1, pp. 191-204, 1985.
    • (1985) JACM , vol.32 , Issue.1 , pp. 191-204
    • Dolev, D.1    Reischuk, R.2
  • 12
    • 0025496224 scopus 로고
    • Early stopping in byzantine agreement
    • D. Dolev, R. Reischuk and H.R. Strong. Early Stopping in Byzantine Agreement. JACM, Vol. 37, No. 4 (1990), pp. 720-741.
    • (1990) JACM , vol.37 , Issue.4 , pp. 720-741
    • Dolev, D.1    Reischuk, R.2    Strong, H.R.3
  • 13
    • 0000461685 scopus 로고
    • On the performance of online algorithms for particular problems
    • U. Faigle, W. Kern and G. Turan, On the performance of online algorithms for particular problems. Acta Cybernetica, 9: 107-119, 1989.
    • (1989) Acta Cybernetica , vol.9 , pp. 107-119
    • Faigle, U.1    Kern, W.2    Turan, G.3
  • 14
    • 0000613943 scopus 로고
    • A lower bound for the time to assure interactive consistency
    • M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Proc. Letters, 14 (1982), pp. 183-186.
    • (1982) Inf. Proc. Letters , vol.14 , pp. 183-186
    • Fischer, M.J.1    Lynch, N.A.2
  • 17
    • 0030353056 scopus 로고    scopus 로고
    • A better algorithm for an ancient scheduling problem
    • D.R. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling problem, Journal of ALgorithms, 20: 400-430, 1996.
    • (1996) Journal of ALgorithms , vol.20 , pp. 400-430
    • Karger, D.R.1    Phillips, S.J.2    Torng, E.3
  • 21
    • 0022093855 scopus 로고
    • Amortized efficiency of list update and paging rules
    • D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32: 652-686, 1985.
    • (1985) Communications of the ACM , vol.32 , pp. 652-686
    • Sleator, D.1    Tarjan, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.