2007 |
40 | EE | Mitchell Loeb,
Alan L. Tharp:
Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications.
ITNG 2007: 1014 |
39 | EE | Alan L. Tharp:
Innovating: the importance of right brain skills for computer science graduates.
ITiCSE 2007: 126-130 |
38 | EE | Robert J. Fornaro,
Margaret R. Heil,
Alan L. Tharp:
Reflections on 10 years of sponsored senior design projects: Students win-clients win!
Journal of Systems and Software 80(8): 1209-1216 (2007) |
2006 |
37 | EE | Kamala Subramaniam,
Alan L. Tharp,
Arne A. Nilsson:
Location Updates In Cellular Networks Using Bloom Filters.
COMPSAC (2) 2006: 3-9 |
36 | EE | 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 |
35 | EE | Mitchell Loeb,
Alan L. Tharp:
Tridirectional Computed Chaining: An Efficient Hashing Algorithm for Limited Space Applications.
COMPSAC (1) 2005: 381-387 |
1994 |
34 | EE | 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 |
33 | EE | 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 |
32 | | Lorraine K. D. Cooper,
Alan L. Tharp:
Multi-character Tries for Text Searching.
Inf. Process. Manage. 29(2): 197-208 (1993) |
31 | | Eric A. Schweitz,
Alan L. Tharp:
Adaptive hashing with signatures.
Inf. Syst. 18(8): 597-608 (1993) |
1992 |
30 | EE | Fred L. Heller,
Alan L. Tharp:
The *M-ary Tree and *Ternary Hillsort.
ACM Conference on Computer Science 1992: 41-48 |
1991 |
29 | EE | Seng Fuat Ou,
Alan L. Tharp:
Improved Overflow Handling with Linear Hashing.
DASFAA 1991: 165-173 |
28 | | Seng Fuat Ou,
Alan L. Tharp:
High Storage Utilisation for Single-Probe Retrieval Linear Hashing.
Comput. J. 34(5): 455-468 (1991) |
27 | | Alan L. Tharp,
William Boswell:
B+ Trees, Bounded Disorder and Adaptive Hashing.
Inf. Syst. 16(1): 65-71 (1991) |
26 | | Timothy M. Klein,
Kenneth J. Parzygnat,
Alan L. Tharp:
Optimal B-tree packing.
Inf. Syst. 16(2): 239-243 (1991) |
25 | | Richard Holcomb,
Alan L. Tharp:
Users, A Software Usability Model and Product Evaluation.
Interacting with Computers 3(2): 155-166 (1991) |
1990 |
24 | | William Boswell,
Alan L. Tharp:
Alternatives to the B+-Tree.
ICCI 1990: 266-274 |
23 | | Marshall D. Brain,
Alan L. Tharp:
Perfect hashing using sparse matrix packing.
Inf. Syst. 15(3): 281-290 (1990) |
22 | | Usha Kotamarti,
Alan L. Tharp:
Accelerating text searching through signature trees.
JASIS 41(2): 79-86 (1990) |
1989 |
21 | EE | Alan L. Tharp,
E. A. Middleton:
A Quasi-Distributed Architecture for Database Management Systems.
ACM Conference on Computer Science 1989: 344-347 |
20 | EE | Lorraine K. D. Cooper,
Alan L. Tharp:
Inverted signature trees and text searching on CD-ROMs.
Inf. Process. Manage. 25(2): 161-169 (1989) |
19 | | Marshall D. Brain,
Alan L. Tharp:
Near-perfect Hashing of Large Word Sets.
Softw., Pract. Exper. 19(10): 967-978 (1989) |
1988 |
18 | | Alan L. Tharp,
Lorraine K. D. Cooper:
Inverted Signature Trees: An Efficient Text Searching Technique for Use with CD-ROMs.
RIAO 1988: 196-213 |
17 | | Yeong-Shiou Hsiao,
Alan L. Tharp:
Adaptive hashing.
Inf. Syst. 13(1): 111-127 (1988) |
1987 |
16 | EE | 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 |
15 | EE | Alan L. Tharp:
Let's motivate].
SIGCSE 1987: 415-422 |
1986 |
14 | | Kuo-Chung Tai,
Alan L. Tharp:
A Comparison of Computed Chaining to Predictors.
IEEE Trans. Software Eng. 12(8): 870-874 (1986) |
1985 |
13 | EE | 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 |
12 | | David L. McPeters,
Alan L. Tharp:
The Influence of Rule-Generated Stress on Computer-Synthesized Speech.
International Journal of Man-Machine Studies 20(2): 215-226 (1984) |
1983 |
11 | EE | David L. McPeters,
Alan L. Tharp:
Application Of The Liberman-Prince Stress Rules To Computer Synthesized Speech.
ANLP 1983: 192-197 |
1982 |
10 | | Alan L. Tharp,
Kuo-Chung Tai:
The Practicality of Text Signatures for Accelerating String Searching.
Softw., Pract. Exper. 12(1): 35-44 (1982) |
1981 |
9 | | Kuo-Chung Tai,
Alan L. Tharp:
Computed chaining - A hybrid of direct chaining and open addressing.
Inf. Syst. 6(2): 111-116 (1981) |
1980 |
8 | EE | Kuo-Chung Tai,
Alan L. Tharp:
An introduction to computed chaining.
AFIPS National Computer Conference 1980: 275-282 |
1979 |
7 | | Alan L. Tharp:
Further refinement of the linear quotient hashing method.
Inf. Syst. 4(3): 55-56 (1979) |
1978 |
6 | EE | Alan L. Tharp:
Augmented Transition Networks as a Design Tool for Personalized Data Base Systems.
SIGIR 1978: 2-13 |
1977 |
5 | | Alan L. Tharp:
A Comparison of Cobol, Fortran, PL-I and Spitbol.
Comput. Lang. 2(14): 171-178 (1977) |
4 | EE | Frank E. Muth Jr.,
Alan L. Tharp:
Correcting human error in alphanumeric terminal input.
Inf. Process. Manage. 13(6): 329-337 (1977) |
1975 |
3 | | Alan L. Tharp,
Woodrow E. Robbins:
Using Computers in a Natural Language Mode for Elementary Education.
International Journal of Man-Machine Studies 7(6): 703-725 (1975) |
1973 |
2 | EE | Alan L. Tharp:
Using verbs to automatically determine text descriptors.
Information Storage and Retrieval 9(4): 243-248 (1973) |
1969 |
1 | | Alan L. Tharp,
Gilbert K. Krulee:
Using Relational Operators to Structure Long-Term Memory.
IJCAI 1969: 579-586 |