Some Considerations in Using VSCAN Disk Scheduling With Optimal Page Arrangements. - C.-C. Wang; Bob P. Weems (SIGMETRICS, 1988)

A Top-Down Inference Procedure for Template Dependencies. - Lawrence J. Henschen; Bob P. Weems (Comput. J., 1988)

A Study of Page Arrangements for Extendible Hashing. - Bob P. Weems (Inf. Process. Lett., 1988)

Operations on sets of intervals - an exercise for data structures or algorithms. - Bob P. Weems (SIGCSE, 1989)

An n-grid model for group authorization. - Wen-Gong Shieh; Bob P. Weems; Krishna M. Kavi (ACSAC, 1990)

Redundant information in an authorization mechanism. - Bob P. Weems (Inf. Syst., 1990)

Complete containment sets and their application to the inference problem. - Bob P. Weems; Wen-Gong Shieh; Muhammad Jaseemuddin (ACSAC, 1991)

Extending N-grid group authorization using compact encoding. - Wen-Gong Shieh; Bob P. Weems; Krishna M. Kavi (SAC, 1992)

The Virtual Manufacturing Workbench: Representation and Interface Issues. - John J. Mills; John K. Graham; Ramez Elmasri; Bob P. Weems (Interfaces in Industrial Systems for Production Engineering, 1993)

Allocation Techniques for Distributed Reduction Data Elements. - Bob P. Weems; Lloyd C. Swayze (Inf. Process. Lett., 1994)

Bistable Versions of the Marriages and Roommates Problems. - Bob P. Weems (J. Comput. Syst. Sci., 1999)

Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. - Bob P. Weems; Yongsheng Bai (FCS, 2005)

Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences. - Yongsheng Bai; Bob P. Weems (FCS, 2006)