J
Joseph JaJa
Researcher at University of Maryland, College Park
Publications - 204
Citations - 5146
Joseph JaJa is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Parallel algorithm & Sorting. The author has an hindex of 31, co-authored 199 publications receiving 4939 citations. Previous affiliations of Joseph JaJa include Pennsylvania State University & National Institute of Standards and Technology.
Papers
More filters
Book
An introduction to parallel algorithms
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Journal ArticleDOI
Approximation Algorithms for Several Graph Augmentation Problems
Greg N. Frederickson,Joseph JaJa +1 more
TL;DR: Graph augmentation problems on a weighted graph are shown to be NP-complete in the restricted case of the graph being initially connected and approximation algorithms with favorable time complexity are presented and shown to have constant worst-case performance ratios.
Journal ArticleDOI
An operational atmospheric correction algorithm for Landsat Thematic Mapper imagery over the land
Shunlin Liang,Hassan Fallah-Adl,Satya Kalluri,Joseph JaJa,Yoram J. Kaufman,John R. Townshend +5 more
TL;DR: In this article, an operational atmospheric correction algorithm for Thematic Mapper (TM) imagery has been developed for both sequential and parallel computer environments considering both aerosol and molecular scattering and absorption.
Book ChapterDOI
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
TL;DR: These algorithms achieve O(log n/loglog n+f) query time for the 3-dimensional dominance reporting problem, and extend to any constant dimension d ≥ 3, achieving O(n( log n/ loglog n)d−3) space and O((log n /log log n) d−2+ f) queryTime for the reporting case.
Journal ArticleDOI
Fast, Efficient Parallel Algorithms for Some Graph Problems
Carla D. Savage,Joseph JaJa +1 more
TL;DR: In the algorithms for finding minimum spanning trees, bridges, and fundamental cycles, the number of processors used is small enough that the parallel algorithm is efficient in comparison with the best sequential algorithms for these problems.