# James R. Driscoll

According to our database

Collaborative distances:

^{1}, James R. Driscoll authored at least 34 papers between 1975 and 1997.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1997

Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs.

SIAM J. Comput., 1997

1995

Scheduling Dyadic Intervals.

Discrete Applied Mathematics, 1995

Multi-lingual Text Filtering Using Semantic Modeling.

Proceedings of The Fourth Text REtrieval Conference, 1995

1994

Using Database Schemes to Detect Relevant Information.

Proceedings of The Third Text REtrieval Conference, 1994

1993

Incorporating Semantics Within a Connectionist Model and a Vector Processing Model.

Proceedings of The Second Text REtrieval Conference, 1993

1992

The QA System.

Proceedings of The First Text REtrieval Conference, 1992

Structuring Text within a Relational System.

Proceedings of the International Conference on Database and Expert Systems Applications, 1992

1991

Modeling the performance of an automated keywording system.

Inf. Process. Manage., 1991

The operation and performance of an artificially intelligent keywording system.

Inf. Process. Manage., 1991

Fully Persistent Lists with Catenation.

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Incorporating a Semantic Analysis into a Document Retrieval Strategy.

Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Chicago, 1991

Enhancing Text Retrieval Semantically.

Proceedings of the Proceedings of the International Conference on Database and Expert Systems Applications, 1991

1990

Factor Refinement.

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

A Unified Analysis of Batched Searching of Sequential and Tree-Structured Files.

ACM Trans. Database Syst., 1989

Making Data Structures Persistent.

J. Comput. Syst. Sci., 1989

Asymptotically Fast Algorithms for Spherical and Related Transforms

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation.

Commun. ACM, 1988

An Application of Artificial Intelligence Techniques to Automated Key-Wording.

Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1988

1987

Computing Short Generator Sequences

Inf. Comput., February, 1987

Achieving minimum height for block split tree structured files.

Inf. Syst., 1987

Modeling B-Tree Insertion Activity.

Inf. Process. Lett., 1987

1986

Batch Insertion for Tree Structured File Organizations - Improving Differential Database Reprensentation.

Inf. Syst., 1986

Making Data Structures Persistent

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Improving the Differential File Technique via Batch Operations for Tree Structured File Organizations.

Proceedings of the Second International Conference on Data Engineering, 1986

1984

A generalized method for maintaining views.

Proceedings of the American Federation of Information Processing Societies: 1984 National Computer Conference, 1984

1983

On the Diameter of Permutation Groups

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1981

Complexity of a proposed database storage structure.

Inf. Syst., 1981

1979

A relational dbms conforming to an architecture which incorporates a physical storage language and a physical navigation language.

Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

Dynamic derived relations within the RAQUEL II DBMS.

Proceedings of the 1979 Annual Conference, Detroit, Michigan, USA, October 29-31, 1979., 1979

A very easy hierarchical DBMS implementation.

Proceedings of the 1979 Annual Conference, Detroit, Michigan, USA, October 29-31, 1979., 1979

1978

A Selective Traversal Algorithm for Binary Search Trees.

Commun. ACM, 1978

Two Languages, And Their Environment, Founded on Basic Data Base Management System Constructs.

Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978

A relational storage scheme suitable for derived views.

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1975

Binary Search Tree Complex - Towards the Implementation of Relations.

Proceedings of the International Conference on Very Large Data Bases, 1975