Bob P. Weems - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2006

Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input SequencesYongsheng Bai, Bob P. Weems. fcs 2006: 81-87

2005

Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input SequencesBob P. Weems, Yongsheng Bai. fcs 2005: 64-72

1999

Bistable Versions of the Marriages and Roommates ProblemsBob P. Weems. jcss, 59(3):504-520, 1999.

1994

Allocation Techniques for Distributed Reduction Data ElementsBob P. Weems, Lloyd C. Swayze. ipl, 50(3):137-142, 1994.

1993

The Virtual Manufacturing Workbench: Representation and Interface IssuesJohn J. Mills, John K. Graham, Ramez Elmasri, Bob P. Weems. ifip5-10 1993: 231-244

1992

Extending N-grid group authorization using compact encodingWen-Gong Shieh, Bob P. Weems, Krishna M. Kavi. SAC 1992: 190-196 [doi]

1991

Complete containment sets and their application to the inference problemBob P. Weems, Wen-Gong Shieh, Muhammad Jaseemuddin. acsac 1991: 187-200 [doi]

1990

An n-grid model for group authorizationWen-Gong Shieh, Bob P. Weems, Krishna M. Kavi. acsac 1990: 384-392 [doi]

Redundant information in an authorization mechanismBob P. Weems. is, 15(2):269-279, 1990.

1989

Operations on sets of intervals - an exercise for data structures or algorithmsBob P. Weems. sigcse 1989: 174-176 [doi]

1988

A Top-Down Inference Procedure for Template DependenciesLawrence J. Henschen, Bob P. Weems. cj, 31(1):51-55, 1988.

Some Considerations in Using VSCAN Disk Scheduling With Optimal Page ArrangementsC.-C. Wang, Bob P. Weems. sigmetrics 1988: 273

A Study of Page Arrangements for Extendible HashingBob P. Weems. ipl, 27(5):245-248, 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL