A Lower Worst-Case Complexity for Searching a Dictionary
| dc.citation.bibtexName | techreport | en_US |
| dc.citation.issueNumber | 7808 | en_US |
| dc.citation.journalTitle | Rice University ECE Technical Report | en_US |
| dc.contributor.author | Hirschberg, D.S. | en_US |
| dc.date.accessioned | 2007-10-31T00:47:02Z | |
| dc.date.available | 2007-10-31T00:47:02Z | |
| dc.date.issued | 1978-07-20 | |
| dc.date.modified | 2003-10-23 | en_US |
| dc.date.submitted | 2003-10-23 | en_US |
| dc.description | Tech Report | en_US |
| dc.description.abstract | It is shown that k(p+3)/2 + p-2 letter comparisons suffice to determine whether a word is a member of a lexicographically ordered dictionary containing 2<sup>p</sup>-1 words of length k. This offers a potential savings (compared to worst case complexity of binary search) that asymptotically approaches 50 percent. | en_US |
| dc.description.sponsorship | National Science Foundation | en_US |
| dc.identifier.citation | D. Hirschberg, "A Lower Worst-Case Complexity for Searching a Dictionary," <i>Rice University ECE Technical Report,</i> no. 7808, 1978. | |
| dc.identifier.uri | https://hdl.handle.net/1911/19955 | |
| dc.language.iso | eng | |
| dc.subject | searching | * |
| dc.subject.keyword | searching | en_US |
| dc.title | A Lower Worst-Case Complexity for Searching a Dictionary | en_US |
| dc.type | Report | |
| dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1