| 2008 |
|---|
| 100 | EE | Qin Wang,
Joseph JáJá:
Interactive High-Resolution Isosurface Ray Casting on Multicore Processors.
IEEE Trans. Vis. Comput. Graph. 14(3): 603-614 (2008) |
| 2007 |
|---|
| 99 | EE | Sangchul Song,
Joseph JáJá:
New techniques for ensuring the long term integrity of digital archives.
DG.O 2007: 57-65 |
| 98 | EE | Jusub Kim,
Joseph JáJá:
Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data.
SSDBM 2007: 8 |
| 97 | EE | Jusub Kim,
Joseph JáJá:
Information-Aware 2n-Tree for Efficient Out-of-Core Indexing of Very Large Multidimensional Volumetric Data.
SSDBM 2007: 9 |
| 96 | EE | Qin Wang,
Joseph JáJá,
Amitabh Varshney:
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering.
J. Parallel Distrib. Comput. 67(5): 592-603 (2007) |
| 2006 |
|---|
| 95 | EE | Joseph JáJá:
Robust technologies for automated ingestion and long-term preservation of digital information.
DG.O 2006: 285-286 |
| 94 | EE | Qin Wang,
Joseph JáJá,
Amitabh Varshney:
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering.
IPDPS 2006 |
| 93 | EE | Qingmin Shi,
Joseph JáJá:
Isosurface Extraction and Spatial Filtering using Persistent Octree (POT).
IEEE Trans. Vis. Comput. Graph. 12(5): 1283-1290 (2006) |
| 2005 |
|---|
| 92 | EE | Joseph JáJá,
Mike Smorul,
Fritz McCall,
Yang Wang:
Scalable, Reliable Marshalling and Organization of Distributed Large Scale Data Onto Enterprise Storage Environments.
MSST 2005: 197-201 |
| 91 | EE | Reagan W. Moore,
Joseph JáJá,
Robert Chadduck:
Mitigating Risk of Data Loss in Preservation Environments.
MSST 2005: 39-48 |
| 90 | EE | Qingmin Shi,
Joseph JáJá:
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines.
Inf. Process. Lett. 95(3): 382-388 (2005) |
| 89 | EE | Qingmin Shi,
Joseph JáJá:
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry.
SIAM J. Comput. 34(6): 1474-1492 (2005) |
| 88 | EE | Qingmin Shi,
Joseph JáJá:
A new framework for addressing temporal range queries and some preliminary results.
Theor. Comput. Sci. 332(1-3): 109-121 (2005) |
| 2004 |
|---|
| 87 | EE | Joseph JáJá,
Christian Worm Mortensen,
Qingmin Shi:
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.
ISAAC 2004: 558-568 |
| 86 | EE | Qingmin Shi,
Joseph JáJá:
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects.
ISAAC 2004: 822-834 |
| 85 | EE | Joseph JáJá:
Strategies for Exploring Large Scale Data.
ISPAN 2004: 2 |
| 84 | EE | Joseph JáJá,
Jusub Kim,
Qin Wang:
Temporal Range Exploration of Large Scale Multidimensional Time Series Data.
SSDBM 2004: 95- |
| 83 | EE | Qingmin Shi,
Joseph JáJá:
Fast Algorithms For 3-D Dominance Reporting And Counting.
Int. J. Found. Comput. Sci. 15(4): 673-684 (2004) |
| 2003 |
|---|
| 82 | EE | Qingmin Shi,
Joseph JáJá:
Fast Algorithms for a Class of Temporal Range Queries.
WADS 2003: 91-102 |
| 2002 |
|---|
| 81 | EE | Qingmin Shi,
Joseph JáJá:
Efficient Techniques for Range Search Queries on Earth Science Data.
SSDBM 2002: 142- |
| 2001 |
|---|
| 80 | | Joseph JáJá:
On Computation Models for Clusters of Symmetric Multiprocessors.
IPDPS 2001: 136 |
| 79 | EE | David R. Helman,
Joseph JáJá:
Prefix Computations on Symmetric Multiprocessors.
J. Parallel Distrib. Comput. 61(2): 265-278 (2001) |
| 2000 |
|---|
| 78 | EE | Manuel Rodriguez-Martinez,
Nick Roussopoulos,
John M. McGann,
Stephen Kelley,
Vadim Katz,
Zhexuan Song,
Joseph JáJá:
MOCHA: A Database Middleware System Featuring Automatic Deployment of Application-Specific Functionality.
SIGMOD Conference 2000: 594 |
| 1999 |
|---|
| 77 | EE | David R. Helman,
Joseph JáJá:
Designing Practical Efficient Algorithms for Symmetric Multiprocessors.
ALENEX 1999: 37-56 |
| 76 | EE | David R. Helman,
Joseph JáJá:
Prefix Computations on Symmetric Multiprocessors.
IPPS/SPDP 1999: 7-13 |
| 75 | | David R. Helman,
Joseph JáJá:
Sorting on Clusters of SMPs.
Informatica (Slovenia) 23(1): (1999) |
| 74 | | David A. Bader,
Joseph JáJá:
SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs).
J. Parallel Distrib. Comput. 58(1): 92-108 (1999) |
| 1998 |
|---|
| 73 | EE | David R. Helman,
Joseph JáJá:
Sorting on Clusters of SMPs.
IPPS/SPDP 1998: 561-567 |
| 72 | EE | David R. Helman,
Joseph JáJá,
David A. Bader:
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.
ACM Journal of Experimental Algorithmics 3: 4 (1998) |
| 71 | | David R. Helman,
David A. Bader,
Joseph JáJá:
A Randomized Parallel Sorting Algorithm with an Experimental Study.
J. Parallel Distrib. Comput. 52(1): 1-23 (1998) |
| 1996 |
|---|
| 70 | | Tinku Acharya,
Joseph JáJá:
Enhancing Lempel-Ziv Codes Using an On-Line Variable Length Binary Encoding.
Data Compression Conference 1996: 419 |
| 69 | | Joseph JáJá:
On Combining Technology and Theory in Search of a Parallel Computation Model.
ICPP Workshop 1996: 115-123 |
| 68 | | Hassan Fallah-Adl,
Joseph JáJá,
Shunlin Liang:
Efficient Algorithms for Estimating Atmosperic Parameters for Surface Reflectance Retrieval.
ICPP, Vol. 2 1996: 132-141 |
| 67 | EE | David A. Bader,
Joseph JáJá:
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection.
IPPS 1996: 292-301 |
| 66 | EE | David A. Bader,
Joseph JáJá,
David Harwood,
Larry S. Davis:
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study.
IPPS 1996: 414-423 |
| 65 | | David R. Helman,
David A. Bader,
Joseph JáJá:
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract).
SPAA 1996: 211-222 |
| 64 | EE | David A. Bader,
David R. Helman,
Joseph JáJá:
Practical Parallel Algorithms for Personalized Communication and Integer Sorting.
ACM Journal of Experimental Algorithmics 1: 3 (1996) |
| 63 | EE | Joseph JáJá,
Kwan Woo Ryu:
The Block Distributed Memory Model.
IEEE Trans. Parallel Distrib. Syst. 7(8): 830-840 (1996) |
| 62 | | Tinku Acharya,
Joseph JáJá:
An On-Line Variable-Length Binary Encoding of Text.
Inf. Sci. 94(1-4): 1-22 (1996) |
| 61 | | David A. Bader,
Joseph JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study.
J. Parallel Distrib. Comput. 35(2): 173-190 (1996) |
| 60 | EE | Joseph JáJá,
Kwan Woo Ryu,
Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel.
Theor. Comput. Sci. 154(2): 225-245 (1996) |
| 1995 |
|---|
| 59 | | Ying-Min Huang,
Joseph JáJá:
An Optimal Ear Decomposition Algorithm with Applications on Fixed-Size Linear Arrays.
ICPP (3) 1995: 97-104 |
| 58 | | David A. Bader,
Joseph JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract).
PPOPP 1995: 123-133 |
| 57 | EE | Hassan Fallah-Adl,
Joseph JáJá,
Shunlin Liang,
Yoram J. Kaufman,
John Townshend:
Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data.
SC 1995 |
| 56 | EE | David R. Helman,
Joseph JáJá:
Efficient Image Processing Algorithms on the Scan Line Array Processor.
IEEE Trans. Pattern Anal. Mach. Intell. 17(1): 47-56 (1995) |
| 55 | EE | David A. Bader,
Joseph JáJá,
Rama Chellappa:
Scalable data parallel algorithms for texture synthesis using Gibbs random fields.
IEEE Transactions on Image Processing 4(10): 1456-1460 (1995) |
| 54 | EE | Robert Snelick,
Joseph JáJá,
Raghu Kacker,
Gordon Lyon:
Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs.
Inf. Process. Lett. 54(3): 147-153 (1995) |
| 1994 |
|---|
| 53 | | Joseph JáJá,
Kwan Woo Ryu,
Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel.
IPPS 1994: 349-356 |
| 52 | | Joseph JáJá,
Kwan Woo Ryu:
The Block Distributed Memory Model for Shared Memory Multiprocessors.
IPPS 1994: 752-756 |
| 51 | | Joseph JáJá,
Pearl Y. Wang:
Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction.
J. Parallel Distrib. Comput. 21(1): 1-3 (1994) |
| 50 | | Omer Berkman,
Joseph JáJá,
Sridhar Krishnamurthy,
Ramakrishna Thurimella,
Uzi Vishkin:
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.
SIAM J. Comput. 23(3): 449-465 (1994) |
| 49 | | Robert Snelick,
Joseph JáJá,
Raghu Kacker,
Gordon Lyon:
Synthetic-perturbation Techniques for Screening Shared Memory Programs.
Softw., Pract. Exper. 24(8): 679-701 (1994) |
| 48 | | Joseph JáJá,
Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem.
Theor. Comput. Sci. 129(2): 293-307 (1994) |
| 1993 |
|---|
| 47 | | Robert Snelick,
Joseph JáJá,
Raghu Kacker,
Gordon Lyon:
Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs (Extended Abstract).
ICPP 1993: 2-10 |
| 46 | | David R. Helman,
Joseph JáJá:
Efficient Image Processing Algorithms on the Scan Line Array Processor.
ICPP 1993: 90-93 |
| 45 | | Joseph JáJá:
Designing Efficient Parallel Algorithms: Models and Paradigms with Applications to Image Processing.
IPPS 1993: 385 |
| 44 | EE | Joseph JáJá,
Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem.
SPAA 1993: 230-239 |
| 43 | EE | Joseph JáJá,
Kwan Woo Ryu:
Optimal Algorithms on the Pipelined Hypercube and Related Networks.
IEEE Trans. Parallel Distrib. Syst. 4(5): 582-591 (1993) |
| 1992 |
|---|
| 42 | | Joseph JáJá:
An Introduction to Parallel Algorithms
Addison-Wesley 1992 |
| 41 | | Ronald I. Greenberg,
Joseph JáJá,
Sridhar Krishnamurthy:
On the Difficulty of Manhattan Channel Routing.
Inf. Process. Lett. 44(5): 281-284 (1992) |
| 40 | | Joseph JáJá,
Kwan Woo Ryu:
Load Balancing and Routing on the Hypercube and Related Networks.
J. Parallel Distrib. Comput. 14(4): 431-435 (1992) |
| 1991 |
|---|
| 39 | | S. Alice Wu,
Joseph JáJá:
Optimal Algorithms for Adjacent Side Routing.
Algorithmica 6(4): 565-578 (1991) |
| 38 | | Chaitali Chakrabarti,
Joseph JáJá:
VLSI Architectures for Multidimensional Transforms.
IEEE Trans. Computers 40(9): 1053-1057 (1991) |
| 37 | | Joseph JáJá,
Shing-Chong Chang:
Parallel Algorithms for Channel Routing in the Knock-Knee Model.
SIAM J. Comput. 20(2): 228-245 (1991) |
| 1990 |
|---|
| 36 | | Omer Berkman,
Joseph JáJá,
Sridhar Krishnamurthy,
Ramakrishna Thurimella,
Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)
FOCS 1990: 871-881 |
| 35 | | Joseph JáJá,
Kwan Woo Ryu:
Load Balancing on the Hypercube and Related Networks.
ICPP (1) 1990: 203-210 |
| 34 | | Chaitali Chakrabarti,
Joseph JáJá:
Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition.
IEEE Trans. Computers 39(11): 1359-1368 (1990) |
| 33 | EE | Kwan Woo Ryu,
Joseph JáJá:
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.
IEEE Trans. Parallel Distrib. Syst. 1(1): 83-90 (1990) |
| 1989 |
|---|
| 32 | | Shing-Chong Chang,
Joseph JáJá:
Parallel Algorithms for Wiring Module Pins to Frame Pads.
ICPP (3) 1989: 102-105 |
| 31 | | Kwan Woo Ryu,
Joseph JáJá:
List Ranking on the Hypercube.
ICPP (3) 1989: 20-23 |
| 30 | | Joseph JáJá,
Sau-Mou Wu:
A New Approach to Realizing Partially Symmetric Functions.
IEEE Trans. Computers 38(6): 896-898 (1989) |
| 29 | EE | Joseph JáJá,
S. Alice Wu:
On routing two-terminal nets in the presence of obstacles.
IEEE Trans. on CAD of Integrated Circuits and Systems 8(5): 563-570 (1989) |
| 1988 |
|---|
| 28 | | Deepak D. Sherlekar,
Joseph JáJá:
Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree.
AWOC 1988: 268-277 |
| 1986 |
|---|
| 27 | | Robert Michael Owens,
Joseph JáJá:
Optimal Algorithms for Mesh-Connected Parallel Processors with Serial Memories.
ICPP 1986: 812-818 |
| 26 | | Joseph JáJá,
Jean Takche:
On the Validity of the Direct Sum Conjecture.
SIAM J. Comput. 15(4): 1004-1020 (1986) |
| 1985 |
|---|
| 25 | | Joseph JáJá:
Identification Is Easier Than Decoding
FOCS 1985: 43-50 |
| 24 | | Robert Michael Owens,
Joseph JáJá:
Parallel Sorting with Serial Momories.
IEEE Trans. Computers 34(4): 379-383 (1985) |
| 23 | | Joseph JáJá,
Jean Takche:
Improved Lower Bounds for Some Matrix Multiplication Problems.
Inf. Process. Lett. 21(3): 123-127 (1985) |
| 1984 |
|---|
| 22 | | Joseph JáJá,
Robert Michael Owens:
VLSI Sorting with Reduced Hardware.
IEEE Trans. Computers 33(7): 668-671 (1984) |
| 21 | EE | Joseph JáJá,
Viktor K. Prasanna:
Information Transfer in Distributed Computing with Applications to VLSI.
J. ACM 31(1): 150-162 (1984) |
| 20 | EE | Joseph JáJá:
The VLSI Complexity of Selected Graph Problems.
J. ACM 31(2): 377-391 (1984) |
| 19 | | Joseph JáJá,
Viktor K. Prasanna,
Janos Simon:
Information Transfer under Different Sets of Protocols.
SIAM J. Comput. 13(4): 840-849 (1984) |
| 1983 |
|---|
| 18 | | Joseph JáJá:
On the Computational Complexity of the Permanent (Extended Abstract)
FOCS 1983: 312-319 |
| 17 | EE | Joseph JáJá:
Time-Space Trade-offs for Some Algebraic Problems
J. ACM 30(3): 657-667 (1983) |
| 1982 |
|---|
| 16 | | Joseph JáJá,
Janos Simon:
Space Efficient Algorithms for Some Graph Theoretical Problems.
Acta Inf. 17: 411-423 (1982) |
| 15 | | Joseph JáJá:
The Computational Complexity of a Set of Quadratic Functions.
J. Comput. Syst. Sci. 24(2): 209-223 (1982) |
| 14 | | Joseph JáJá,
Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing.
SIAM J. Comput. 11(2): 314-328 (1982) |
| 13 | | Teofilo F. Gonzalez,
Joseph JáJá:
Evaluation of Arithmetic Expressions with Algebraic Identities.
SIAM J. Comput. 11(4): 633-662 (1982) |
| 12 | | Greg N. Frederickson,
Joseph JáJá:
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
Theor. Comput. Sci. 19: 189-201 (1982) |
| 1981 |
|---|
| 11 | | Joseph JáJá:
Computation of Algebraic Functions with Root Extractions
FOCS 1981: 95-100 |
| 10 | | Greg N. Frederickson,
Joseph JáJá:
Approximation Algorithm for Several Graph Augmentation Problems.
SIAM J. Comput. 10(2): 270-283 (1981) |
| 9 | | Carla D. Savage,
Joseph JáJá:
Fast, Efficient Parallel Algorithms for Some Graph Problems.
SIAM J. Comput. 10(4): 682-691 (1981) |
| 1980 |
|---|
| 8 | | Joseph JáJá,
Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version).
MFCS 1980: 305-319 |
| 7 | | Joseph JáJá:
Time-Space Tradeoffs for some Algebraic Problems
STOC 1980: 339-350 |
| 6 | EE | Joseph JáJá:
Computations of Bilinear Forms over Finite Fields.
J. ACM 27(4): 822-830 (1980) |
| 5 | | Teofilo F. Gonzalez,
Joseph JáJá:
On the Complexity of Computing Bilinear Forms with {0, 1} Constants.
J. Comput. Syst. Sci. 20(1): 77-95 (1980) |
| 4 | | Joseph JáJá:
On the Complexity of Bilinear Forms with Commutativity.
SIAM J. Comput. 9(4): 713-728 (1980) |
| 1979 |
|---|
| 3 | | Joseph JáJá:
On the Complexity of Bilinear Forms with Commutativity
STOC 1979: 197-208 |
| 2 | | Joseph JáJá:
Optimal Evaluation of Pairs of Bilinear Forms.
SIAM J. Comput. 8(3): 443-462 (1979) |
| 1978 |
|---|
| 1 | | Joseph JáJá:
Optimal Evaluation of Pairs of Bilinear Forms
STOC 1978: 173-183 |
