Samuel R Buss

Title: Samuel R Buss: Innovator in Bipartite Matching Technology

Introduction

Samuel R Buss is a notable inventor based in San Diego, CA (US). He has made significant contributions to the field of computer science, particularly in the area of bipartite matching. His innovative approach has paved the way for advancements in various applications.

Latest Patents

Samuel R Buss holds a patent for a technique related to bipartite matching. This method involves matching objects from one subset with those from a different subset, allowing for multiple choices. The process utilizes a bipartite graph where objects are represented as nodes, and the edges connecting these nodes indicate the costs associated with matching them. The original graph is decomposed into several quasi-convex subtours or subgraphs, and the minimum cost match for each subtour is determined. The union of these matches forms the desired overall match.

Career Highlights

Throughout his career, Samuel R Buss has worked with esteemed institutions such as the University of California and NEC Research Institute, Inc. His work has had a lasting impact on the field of computer science and has influenced many researchers and practitioners.

Collaborations

One of his notable collaborators is Peter N Yianilos. Their partnership has contributed to the development of innovative solutions in their respective fields.

Conclusion

Samuel R Buss is a distinguished inventor whose work in bipartite matching has significantly advanced computer science. His contributions continue to inspire future innovations in the field.