See How Your Research Aligns
Create a free account to analyze your research alignment,
identify potential research gaps, and generate personalized
application documents for this professor.
Create Free Account
Bob P Weems
Interactive Prettyprinting
Hierarchical Graph Model
Embedded Multivalued Dependency
Database Design Theory
Software Engineering (SE)
About
. Masters Thesis:
M.S. (Computer Science), Northwestern University, Evanston, Illinois, August 1982.
Thesis: An Interactive Prettyprinter for the Hierarchical Graph Model (Software Engineering)
Advisor: Stephen S. Yau
2. Doctoral Dissertation:
Ph.D. (Computer Science), Northwestern University, Evanston, Illinois, December 1984.
Dissertation: On the Embedded Multivalued Dependency Membership Problem (Database Design Theory)
Advisor: Lawrence J. Henschen
Research Performance Summary
1982-2006
Active Research Span
First Recorded Paper
An Interactive Prettyprinter for the Hierarchical Graph Model
Year:
1982
Citations:
1
Venue:
Northwestern University
Latest Recorded Paper
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences.
Year:
2006
Citations:
0
Venue:
FCS
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.
Publication Venues and Collaboration
Journal, Conference, and Book Publication Breakdown
Top Coauthors
Weems
Bai
Shieh
Research Impact by Period
Papers
4
Citations
3
Avg. Citations / Paper
0.8
H-Index
1
Papers
3
Citations
13
Avg. Citations / Paper
4.3
H-Index
1
Papers
6
Citations
14
Avg. Citations / Paper
2.3
H-Index
3
Papers
4
Citations
12
Avg. Citations / Paper
3
H-Index
3
Papers
1
Citations
1
Avg. Citations / Paper
1
H-Index
1
Contact and Professional Links
Detected Research Keywords
Longest Common Increasing
Common Increasing Subsequence
Increasing Subsequence Two
Random Input Sequences
Bistable Versions Marriages
Versions Marriages Roommates
Marriages Roommates Problems
Finding Longest Common
Subsequence Two Different
Two Different Scenarios