Tight bounds for searching a sorted array of strings

Andersson, Arne; Hagerup, Torben; Hastad, Johan; Petersson, Ola

Local TagsRelease HistoryDetailsSummary

Tight bounds for searching a sorted array of strings

Andersson, A., Hagerup, T., Hastad, J., & Petersson, O. (2000). Tight bounds for searching a sorted array of strings. SIAM Journal on Computing, 30(5), 1552-1578.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-340C-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-340D-9

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Andersson, Arne, Author
Hagerup, Torben¹, Author
Hastad, Johan, Author
Petersson, Ola, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 2000

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518224
Other: Local-ID: C1256428004B93B8-4595D45B4490447000256D20004DEC11-AnderssonHagerupetal2000

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 30 (5) Sequence Number: - Start / End Page: 1552 - 1578 Identifier: ISSN: 0097-5397