Biing-Feng Wang
Papers
1
Total Citations
113
H-Index
1
About
Biing-Feng Wang is a pioneering computer scientist whose work has fundamentally shaped the field of parallel and reconfigurable computing. His research centers on algorithm design, particularly for processor arrays with reconfigurable bus systems, and the theoretical underpinnings of efficient computation. Wang’s most influential contribution is his 1990 paper, "Constant time sorting on a processor array with a reconfigurable bus system," which demonstrated that sorting—a traditionally time-intensive operation—could be achieved in constant time using a reconfigurable architecture. This landmark result, with over 113 citations, challenged conventional limits of parallel processing and opened new avenues for high-speed data manipulation. Beyond sorting, Wang has made significant strides in graph algorithms, computational geometry, and network optimization, often achieving optimal or near-optimal time complexities. His work is distinguished by its elegance and practical impact, providing foundational techniques for modern parallel systems. A respected educator and mentor, Wang’s legacy lies in his ability to transform abstract theoretical concepts into powerful, realizable computing solutions, inspiring a generation of researchers to rethink the boundaries of algorithmic efficiency.
Research Focus
Key Achievements
Top Papers
- 1Constant time sorting on a processor array with a reconfigurable bus system113 citations · 1990