SCOPUS 정보 검색 플랫폼

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1552-1578

Tight bounds for searching a sorted array of strings

(4) Andersson, Arne a Hagerup, Torben b Håstad, Johan c,d Petersson, Ola e,f

a UPPSALA UNIVERSITY (Sweden)

b GOETHE UNIVERSITY (Germany)

c ROYAL INSTITUTE OF TECHNOLOGY (Sweden)

d INSTITUTE FOR ADVANCED STUDY (United States)

e LINNAEUS UNIVERSITY (Sweden)

f LUND UNIVERSITY (Sweden)

Author keywords

Character comparisons; Dictionaries; Lower bounds; Potential functions; String searching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; FUNCTIONS; GLOSSARIES; MATRIX ALGEBRA; THEOREM PROVING;

CHARACTER COMPARISONS; LOGARITHMIC FUNCTIONS; LOWER BOUNDS; POTENTIAL FUNCTIONS; STRING ARRAYS; STRING SEARCHING;

BOUNDARY VALUE PROBLEMS;

EID: 0035188044 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539797329889 Document Type: Article

Times cited : (13)

References (7)

1
- 0028087487
- The complexity of searching a sorted army of strings
- Montreal, Quebec, Canada
- A. ANDERSSON, T. HAGERUP, J. HÅSTAD, AND O. PETERSSON, The complexity of searching a sorted army of strings, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 317-325.
- (1994) Proceedings of the 26th Annual ACM Symposium on Theory of Computing , pp. 317-325
- Andersson, A.¹ Hagerup, T.² Håstad, J.³ Petersson, O.⁴

2
- 42149110034
- A tight lower bound for searching a sorted array
- Las Vegas, NV
- A. ANDERSSON, J. HÅSTAD, AND O. PETERSSON, A tight lower bound for searching a sorted array, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 417-426.
- (1995) Proceedings of the 27th Annual ACM Symposium on Theory of Computing , pp. 417-426
- Andersson, A.¹ Håstad, J.² Petersson, O.³

3
- 0018206639
- A lower worst-case complexity for searching a dictionary
- University of Illinois, Urbana, IL
- D. S. HIRSCHBERG, A lower worst-case complexity for searching a dictionary, in Proceedings of the 16th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana, IL, 1978, pp. 50-53.
- (1978) Proceedings of the 16th Annual Allerton Conference on Communication, Control, and Computing , pp. 50-53
- Hirschberg, D.S.¹

4
- 0006718985
- On the complexity of searching a set of vectors
- D. S. HIRSCHBERG, On the complexity of searching a set of vectors, SIAM J. Comput., 9 (1980), pp. 126-129.
- (1980) SIAM J. Comput. , vol.9 , pp. 126-129
- Hirschberg, D.S.¹

5
- 26444440687
- On a multidimensional search problem
- Atlanta, GA
- S. R. KOSARAJU, On a multidimensional search problem, in Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1979, pp. 67-73.
- (1979) Proceedings of the 11th Annual ACM Symposium on Theory of Computing , pp. 67-73
- Kosaraju, S.R.¹

6
- 0027681165
- Suffix arrays: A new method for on-line string searches
- U. MANBER AND G. MYERS, Suffix arrays: A new method for on-line string searches, SIAM J. Comput., 22 (1993), pp. 935-948.
- (1993) SIAM J. Comput. , vol.22 , pp. 935-948
- Manber, U.¹ Myers, G.²

7
- 0004047313
- Springer-Verlag, Berlin
- K. MEHLHORN, Data Structures and Algorithms, Vol. 1: Sorting and Searching, Springer-Verlag, Berlin, 1984.
- (1984) Data Structures and Algorithms, Vol. 1: Sorting and Searching , vol.1
- Mehlhorn, K.¹

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