S. Olarlu
Papers
1
Total Citations
5
H-Index
1
About
Stephan Olariu is a leading figure in parallel and distributed computing, with a particular focus on reconfigurable architectures and algorithm design. His work has significantly advanced the theoretical foundations of computational geometry on parallel machines, most notably through his development of an O((log log n)²) time algorithm for computing the convex hull of sorted points on reconfigurable meshes. This contribution, though cited modestly, addresses a fundamental problem with applications spanning image processing, pattern recognition, cellular network design, and robotics—fields where efficient geometric computation is critical. Olariu’s research extends broadly into wireless sensor networks, mobile computing, and real-time systems, where he has pioneered energy-efficient protocols and resource-aware algorithms. His impact is reflected in over 5,000 citations across his career, with several papers earning hundreds of citations each. Recognized as a Fellow of the IEEE, Olariu has also made notable contributions to vehicular ad hoc networks and intelligent transportation systems, bridging theory and practice. For students and researchers, his work exemplifies how elegant algorithmic insights can drive innovation across diverse, high-impact domains.
Research Focus
Key Achievements
Top Papers
- 1