default search action
Alan L. Tharp
Person information
- affiliation: North Carolina State University, Raleigh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [c26]Jonathan J. Pittard, Alan L. Tharp:
Simplified Self-Adapting Skip Lists. IDEAL 2010: 126-136
2000 – 2009
- 2009
- [c25]Sushamna Deodhar, Alan L. Tharp:
Shift Hashing for Memory-Constrained Applications. COMPSAC (1) 2009: 531-536 - [c24]Prakash Ramaswamy, Alan L. Tharp:
DECAL : DErived ChAining for Low-memory Applications. IKE 2009: 238-244 - 2008
- [j28]Mitchell Loeb, Alan L. Tharp:
Gray code chaining: a high performance hashing algorithm for limited storage applications. Int. J. High Perform. Syst. Archit. 1(3): 143-149 (2008) - 2007
- [j27]Robert J. Fornaro, Margaret R. Heil
, Alan L. Tharp:
Reflections on 10 years of sponsored senior design projects: Students win-clients win! J. Syst. Softw. 80(8): 1209-1216 (2007) - [c23]Alan L. Tharp:
Innovating: the importance of right brain skills for computer science graduates. ITiCSE 2007: 126-130 - [c22]Mitchell Loeb, Alan L. Tharp:
Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications. ITNG 2007: 1014 - 2006
- [c21]Kamala Subramaniam, Alan L. Tharp, Arne A. Nilsson:
Location Updates In Cellular Networks Using Bloom Filters. COMPSAC (2) 2006: 3-9 - [c20]Robert J. Fornaro, Margaret R. Heil, Alan L. Tharp:
What Clients Want - What Students Do: Reflections on Ten Years of Sponsored Senior Design Projects. CSEE&T 2006: 226-236 - 2005
- [c19]Mitchell Loeb, Alan L. Tharp:
Tridirectional Computed Chaining: An Efficient Hashing Algorithm for Limited Space Applications. COMPSAC (1) 2005: 381-387
1990 – 1999
- 1994
- [j26]Marshall D. Brain, Alan L. Tharp:
Using Tries to Eliminate Pattern Collisions in Perfect Hashing. IEEE Trans. Knowl. Data Eng. 6(2): 239-247 (1994) - 1993
- [j25]Lorraine K. D. Cooper, Alan L. Tharp:
Multi-character Tries for Text Searching. Inf. Process. Manag. 29(2): 197-208 (1993) - [j24]Eric A. Schweitz, Alan L. Tharp:
Adaptive hashing with signatures. Inf. Syst. 18(8): 597-608 (1993) - [c18]Alan L. Tharp, John L. Furlani:
The CD-ROM Foster a New Sata Structure: the B3-tree. ACM Conference on Computer Science 1993: 466-471 - 1992
- [c17]Fred L. Heller, Alan L. Tharp:
The *M-ary Tree and *Ternary Hillsort. ACM Conference on Computer Science 1992: 41-48 - 1991
- [j23]Seng Fuat Ou, Alan L. Tharp:
High Storage Utilisation for Single-Probe Retrieval Linear Hashing. Comput. J. 34(5): 455-468 (1991) - [j22]Richard Holcomb, Alan L. Tharp:
What users say about software usability. Int. J. Hum. Comput. Interact. 3(1): 49-78 (1991) - [j21]Alan L. Tharp, William Boswell:
B+ Trees, Bounded Disorder and Adaptive Hashing. Inf. Syst. 16(1): 65-71 (1991) - [j20]Timothy M. Klein, Kenneth J. Parzygnat, Alan L. Tharp:
Optimal B-tree packing. Inf. Syst. 16(2): 239-243 (1991) - [j19]Richard Holcomb, Alan L. Tharp:
Users, A Software Usability Model and Product Evaluation. Interact. Comput. 3(2): 155-166 (1991) - [c16]Seng Fuat Ou, Alan L. Tharp:
Improved Overflow Handling with Linear Hashing. DASFAA 1991: 165-173 - 1990
- [j18]Marshall D. Brain, Alan L. Tharp:
Perfect hashing using sparse matrix packing. Inf. Syst. 15(3): 281-290 (1990) - [j17]Usha Kotamarti, Alan L. Tharp:
Accelerating text searching through signature trees. J. Am. Soc. Inf. Sci. 41(2): 79-86 (1990) - [c15]William Boswell, Alan L. Tharp:
Alternatives to the B+-Tree. ICCI 1990: 266-274
1980 – 1989
- 1989
- [j16]Lorraine K. D. Cooper, Alan L. Tharp:
Inverted signature trees and text searching on CD-ROMs. Inf. Process. Manag. 25(2): 161-169 (1989) - [j15]Marshall D. Brain, Alan L. Tharp:
Near-perfect Hashing of Large Word Sets. Softw. Pract. Exp. 19(10): 967-978 (1989) - [c14]Alan L. Tharp, E. A. Middleton:
A Quasi-Distributed Architecture for Database Management Systems. ACM Conference on Computer Science 1989: 344-347 - [c13]Richard Holcomb, Alan L. Tharp:
An amalgamated model of software usability. COMPSAC 1989: 559-566 - 1988
- [b1]Alan L. Tharp:
File organization and processing. Wiley 1988, ISBN 978-0-471-60521-8, pp. I-XV, 1-398 - [j14]Yeong-Shiou Hsiao, Alan L. Tharp:
Adaptive hashing. Inf. Syst. 13(1): 111-127 (1988) - [c12]Alan L. Tharp, Lorraine K. D. Cooper:
Inverted Signature Trees: An Efficient Text Searching Technique for Use with CD-ROMs. RIAO 1988: 198 - 1987
- [c11]William D. Ruchte, Alan L. Tharp:
Linear Hashing with Priority Splitting: A Method for Improving the Retrieval Performance of Linear Hashing. ICDE 1987: 2-9 - [c10]Alan L. Tharp:
Let's motivate]. SIGCSE 1987: 415-422 - 1986
- [j13]Alan L. Tharp:
Review of "The role of context and adaptation in user interfaces, by W. B. Croft." Int. J. Man-Mach. Stud., v. 21, 4 (Oct. 1984), p. 283-292. ACM SIGCHI Bull. 17(3): 103 (1986) - [j12]Kuo-Chung Tai, Alan L. Tharp:
A Comparison of Computed Chaining to Predictors. IEEE Trans. Software Eng. 12(8): 870-874 (1986) - 1985
- [c9]Richard Holcomb, Alan L. Tharp:
The effect of windows on man-machine interfaces (or opening doors with windows). ACM Conference on Computer Science 1985: 280-291 - 1984
- [j11]David L. McPeters, Alan L. Tharp:
The Influence of Rule-Generated Stress on Computer-Synthesized Speech. Int. J. Man Mach. Stud. 20(2): 215-226 (1984) - [j10]Alan L. Tharp:
The impact of fourth generation programming languages. ACM SIGCSE Bull. 16(2): 37-44 (1984) - 1983
- [c8]David L. McPeters, Alan L. Tharp:
Application Of The Liberman-Prince Stress Rules To Computer Synthesized Speech. ANLP 1983: 192-197 - [c7]Jeffrey W. Mincy, Alan L. Tharp, Kuo-Chung Tai:
Visualizing algorithms and processes with the aid of a computer. SIGCSE 1983: 106-111 - 1982
- [j9]Jeffrey W. Smith, Alan L. Tharp:
A Microcomputer System for Processing Natural Languages. IEEE Trans. Pattern Anal. Mach. Intell. 4(2): 221-223 (1982) - [j8]Alan L. Tharp, Kuo-Chung Tai:
The Practicality of Text Signatures for Accelerating String Searching. Softw. Pract. Exp. 12(1): 35-44 (1982) - [c6]Alan L. Tharp:
Selecting the "right" programming language. SIGCSE 1982: 151-155 - 1981
- [j7]Kuo-Chung Tai, Alan L. Tharp:
Computed chaining - A hybrid of direct chaining and open addressing. Inf. Syst. 6(2): 111-116 (1981) - [c5]Alan L. Tharp:
Getting more oomph from programming exercises. SIGCSE 1981: 91-95 - 1980
- [c4]Kuo-Chung Tai, Alan L. Tharp:
An introduction to computed chaining. AFIPS National Computer Conference 1980: 275-282
1970 – 1979
- 1979
- [j6]Alan L. Tharp:
Further refinement of the linear quotient hashing method. Inf. Syst. 4(3): 55-56 (1979) - [c3]Alan L. Tharp:
Interactive computing in a project-oriented file organization course. SIGCSE 1979: 82-86 - 1978
- [c2]Alan L. Tharp:
Augmented Transition Networks as a Design Tool for Personalized Data Base Systems. SIGIR 1978: 2-13 - 1977
- [j5]Alan L. Tharp:
A Comparison of Cobol, Fortran, PL-I and Spitbol. Comput. Lang. 2(4): 171-178 (1977) - [j4]Frank E. Muth Jr., Alan L. Tharp:
Correcting human error in alphanumeric terminal input. Inf. Process. Manag. 13(6): 329-337 (1977) - [j3]Alan L. Tharp:
Using a natural language interface for elementary instruction. SIGART Newsl. 61: 64-65 (1977) - 1975
- [j2]Alan L. Tharp, Woodrow E. Robbins:
Using Computers in a Natural Language Mode for Elementary Education. Int. J. Man Mach. Stud. 7(6): 703-725 (1975) - 1973
- [j1]Alan L. Tharp:
Using verbs to automatically determine text descriptors. Inf. Storage Retr. 9(4): 243-248 (1973)
1960 – 1969
- 1969
- [c1]Alan L. Tharp, Gilbert K. Krulee:
Using Relational Operators to Structure Long-Term Memory. IJCAI 1969: 579-586
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: