Larry Wilson
Affiliations: | Old Dominion University, Norfolk, VA, United States |
Area:
Computer Science, Electronics and Electrical Engineering, System Science EngineeringGoogle:
"Larry Wilson"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Olariu S, Pinotti MC, Wilson L. (2002) Greedy algorithms for tracking mobile users in special mobility graphs Discrete Applied Mathematics. 121: 215-227 |
Bokka V, Nakano K, Olariu S, et al. (2001) Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications Ieee Transactions On Parallel and Distributed Systems. 12: 875-887 |
Bhagavathi D, Gurla H, Olariu S, et al. (1998) Time- and VLSI-optimal sorting on enhanced meshes Ieee Transactions On Parallel and Distributed Systems. 9: 929-937 |
Bokka V, Gurla H, Olariu S, et al. (1997) Time-optimal domain-specific querying on enhanced meshes Ieee Transactions On Parallel and Distributed Systems. 8: 13-24 |
Bokka V, Olariu S, Schwing JL, et al. (1997) A time-optimal solution to a classification problem in ordered functional domains, with applications Pattern Recognition. 30: 1555-1564 |
Bhagavathi D, Olariu S, Schwing JL, et al. (1995) Convexity problems on meshes with multiple broadcasting Journal of Parallel and Distributed Computing. 27: 142-156 |
Bhagavathi D, Olariu S, Shen W, et al. (1994) A Unifying Look At Semigroup Computations On Meshes With Multiple Broadcasting Parallel Processing Letters. 4: 73-82 |
Bhagavathi D, Olariu S, Shen W, et al. (1994) A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications Journal of Parallel and Distributed Computing. 22: 113-120 |
Olariu S, Shen W, Wilson L. (1993) Sub-Logarithmic Algorithms For The Largest Empty Rectangle Problem Parallel Processing Letters. 3: 79-85 |
Olariu S, Schwing JL, Shen W, et al. (1993) A Simple Selection Algorithm For Reconfigurable Meshes Parallel Algorithms and Applications. 1: 29-41 |