Alan L. Tharp

According to our database1, Alan L. Tharp
  • authored at least 49 papers between 1969 and 2010.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 





Simplified Self-Adapting Skip Lists.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2010

DECAL : DErived ChAining for Low-memory Applications.
Proceedings of the 2009 International Conference on Information & Knowledge Engineering, 2009

Shift Hashing for Memory-Constrained Applications.
Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, 2009

Gray code chaining: a high performance hashing algorithm for limited storage applications.
IJHPSA, 2008

Reflections on 10 years of sponsored senior design projects: Students win-clients win!
Journal of Systems and Software, 2007

Gray Code Chaining: A High Performance Hashing Algorithm for Limited Storage Applications.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

Innovating: the importance of right brain skills for computer science graduates.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

What Clients Want - What Students Do: Reflections on Ten Years of Sponsored Senior Design Projects.
Proceedings of the 19th Conference on Software Engineering Education and Training (CSEE&T 2006), 2006

Location Updates In Cellular Networks Using Bloom Filters.
Proceedings of the 30th Annual International Computer Software and Applications Conference, 2006

Tridirectional Computed Chaining: An Efficient Hashing Algorithm for Limited Space Applications.
Proceedings of the 29th Annual International Computer Software and Applications Conference, 2005

Using Tries to Eliminate Pattern Collisions in Perfect Hashing.
IEEE Trans. Knowl. Data Eng., 1994

Adaptive hashing with signatures.
Inf. Syst., 1993

Multi-character Tries for Text Searching.
Inf. Process. Manage., 1993

The CD-ROM Foster a New Sata Structure: the B3-tree.
Proceedings of the ACM 21th Conference on Computer Science, 1993

The *M-ary Tree and *Ternary Hillsort.
Proceedings of the ACM 20th Annual Conference on Computer Science, 1992

Users, A Software Usability Model and Product Evaluation.
Interacting with Computers, 1991

B+ Trees, Bounded Disorder and Adaptive Hashing.
Inf. Syst., 1991

Optimal B-tree packing.
Inf. Syst., 1991

What users say about software usability.
Int. J. Hum. Comput. Interaction, 1991

High Storage Utilisation for Single-Probe Retrieval Linear Hashing.
Comput. J., 1991

Improved Overflow Handling with Linear Hashing.
Proceedings of the Database Systems for Advanced Applications '91, 1991

Accelerating text searching through signature trees.
JASIS, 1990

Perfect hashing using sparse matrix packing.
Inf. Syst., 1990

Alternatives to the B+-Tree.
Proceedings of the Advances in Computing and Information, 1990

Near-perfect Hashing of Large Word Sets.
Softw., Pract. Exper., 1989

Inverted signature trees and text searching on CD-ROMs.
Inf. Process. Manage., 1989

An amalgamated model of software usability.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

A Quasi-Distributed Architecture for Database Management Systems.
Proceedings of the Computer Trends in the 1990s, 1989

Adaptive hashing.
Inf. Syst., 1988

Inverted Signature Trees: An Efficient Text Searching Technique for Use with CD-ROMs.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1988

File organization and processing.
Wiley, ISBN: 978-0-471-60521-8, 1988

Let's motivate].
Proceedings of the 18st SIGCSE Technical Symposium on Computer Science Education, 1987

Linear Hashing with Priority Splitting: A Method for Improving the Retrieval Performance of Linear Hashing.
Proceedings of the Third International Conference on Data Engineering, 1987

A Comparison of Computed Chaining to Predictors.
IEEE Trans. Software Eng., 1986

The effect of windows on man-machine interfaces (or opening doors with windows).
Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

The Influence of Rule-Generated Stress on Computer-Synthesized Speech.
International Journal of Man-Machine Studies, 1984

Application Of The Liberman-Prince Stress Rules To Computer Synthesized Speech.
Proceedings of the 1st Applied Natural Language Processing Conference, 1983

The Practicality of Text Signatures for Accelerating String Searching.
Softw., Pract. Exper., 1982

A Microcomputer System for Processing Natural Languages.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

Computed chaining - A hybrid of direct chaining and open addressing.
Inf. Syst., 1981

An introduction to computed chaining.
Proceedings of the American Federation of Information Processing Societies: 1980 National Computer Conference, 1980

Further refinement of the linear quotient hashing method.
Inf. Syst., 1979

Augmented Transition Networks as a Design Tool for Personalized Data Base Systems.
Proceedings of the ACM-SIGIR, 1978

Using a natural language interface for elementary instruction.
SIGART Newsletter, 1977

Correcting human error in alphanumeric terminal input.
Inf. Process. Manage., 1977

A Comparison of Cobol, Fortran, PL-I and Spitbol.
Comput. Lang., 1977

Using Computers in a Natural Language Mode for Elementary Education.
International Journal of Man-Machine Studies, 1975

Using verbs to automatically determine text descriptors.
Information Storage and Retrieval, 1973

Using Relational Operators to Structure Long-Term Memory.
Proceedings of the 1st International Joint Conference on Artificial Intelligence, 1969