| Bistable versions of the marriages and roommates problems BP Weems Journal of Computer and System Sciences 59 (3), 504-520, 1999 | 11 | 1999 |
| The virtual manufacturing workbench: representation and interface issues JJ Mills, JK Graham, R Elmasri, BP Weems Proceedings of the IFIP TC5/WG5. 10 Working Conference on Interfaces in …, 1993 | 7 | 1993 |
| An n-grid model for group authorization WG Shieh, B Weems, KM Kavi [1990] Proceedings of the Sixth Annual Computer Security Applications …, 1990 | 5 | 1990 |
| Operations on sets of intervals-an exercise for data structures or algorithms BP Weems ACM SIGCSE Bulletin 21 (1), 174-176, 1989 | 5 | 1989 |
| A study of page arrangements for extendible hashing BP Weems Information processing letters 27 (5), 245-248, 1988 | 4 | 1988 |
| Complete containment sets and their application to the inference problem BP Weems, WG Shieh, M Jaseemuddin Proceedings Seventh Annual Computer Security Applications Conference, 187 …, 1991 | 3 | 1991 |
| Some Considerations in Using VSCAN Disk Scheduling With Optimal Page Arrangements. CC Wang, BP Weems SIGMETRICS, 273, 1988 | 3 | 1988 |
| The Longest Common Increasing Subsequence Problem Y Bai, BP Weems Proc. of the 8th Joint Conference on Information Sciences, 64-70, 2005 | 1 | 2005 |
| Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences Y Bai, BP Weems Proc. of the 2005 International Conference on Foundations of Computer …, 2005 | 1 | 2005 |
| ``Bistable Versions of the Marriages and Roommates Problems: Details of Bistable Roommates,'' BP Weems UTA Technical Report, December 1998. Available at http: ÂÂreptar. uta. edu, 1998 | 1 | 1998 |
| An Interactive Prettyprinter for the Hierarchical Graph Model BP Weems Northwestern University, 1982 | 1 | 1982 |
| Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences. Y Bai, BP Weems FCS, 81-87, 2006 | | 2006 |
| Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. BP Weems, Y Bai FCS, 64-72, 2005 | | 2005 |
| HIPP: An Honors Program in Parallel Processing BP Weems, KM Kavi, B Shirazi INTERNATIONAL JOURNAL OF ENGINEERING EDUCATION 11, 329-335, 1995 | | 1995 |
| Allocation techniques for distributed reduction data elements BP Weems, LC Swayze Information processing letters 50 (3), 137-142, 1994 | | 1994 |
| Extending N-grid group authorization using compact encoding WG Shieh, BP Weems, KM Kavi Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing …, 1992 | | 1992 |
| Redundant information in an authorization mechanism BP Weems Information Systems 15 (2), 269-279, 1990 | | 1990 |
| A top-down inference procedure for template dependencies LJ Henschen, BP Weems The Computer Journal 31 (1), 51-55, 1988 | | 1988 |
| Integration Of A Graph Formatter With Symmetry And Bisection Analysis BP Weems | | |
