메뉴 건너뛰기




Volumn 2827, Issue , 2003, Pages 26-38

Optimality of randomized algorithms for the intersection problem

Author keywords

Intersection of sorted arrays; Randomized algorithm

Indexed keywords

SEARCH ENGINES; STOCHASTIC SYSTEMS;

EID: 35248842674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39816-5_3     Document Type: Article
Times cited : (6)

References (9)
  • 3
    • 0002187292 scopus 로고
    • An almost optimal algorithm for unbounded searching
    • Jon Louis Bentley and Andrew Chi-Chih Yao. An almost optimal algorithm for unbounded searching. Information processing letters, 5(3):82-87, 1976.
    • (1976) Information Processing Letters , vol.5 , Issue.3 , pp. 82-87
    • Bentley, J.L.1    Yao, A.C.-C.2
  • 5
    • 84947262179 scopus 로고    scopus 로고
    • Experiments on adaptive set intersections for text retrieval systems
    • Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Washington DC, January
    • Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Experiments on adaptive set intersections for text retrieval systems. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Lecture Notes in Computer Science, pages 5-6, Washington DC, January 2001.
    • (2001) Lecture Notes in Computer Science , pp. 5-6
    • Demaine, E.D.1    López-Ortiz, A.2    Munro, J.I.3
  • 8
    • 84972513554 scopus 로고
    • On general minimax theorems
    • M. Sion. On general minimax theorems. Pacic Journal of Mathematics, pages 171-176, 1958.
    • (1958) Pacic Journal of Mathematics , pp. 171-176
    • Sion, M.1


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