| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Joseph JáJá 55 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 54 David R. Helman , Joseph JáJá: Designing Practical Efficient Algorithms for Symmetric Multiprocessors. ALENEX 1999 : 37-56 53 David R. Helman , Joseph JáJá: Sorting on Clusters of SMPs. Informatica (Slovenia) 23 (1): (1999) 52 David A. Bader , Joseph JáJá: SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). Journal of Parallel and Distributed Computing 58 (1): 92-108 (1999) 51 David R. Helman , Joseph JáJá, David A. Bader : A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. ACM Journal of Experimental Algorithms 3 : 4 (1998) 50 David R. Helman , David A. Bader , Joseph JáJá: A Randomized Parallel Sorting Algorithm with an Experimental Study. Journal of Parallel and Distributed Computing 52 (1): 1-23 (1998) 49 Tinku Acharya , Joseph JáJá: Enhancing Lempel-Ziv Codes Using an On-Line Variable Length Binary Encoding. Data Compression Conference 1996 : 419 48 Joseph JáJá: On Combining Technology and Theory in Search of a Parallel Computation Model. ICPP Workshop 1996 : 115-123 47 Hassan Fallah-Adl , Joseph JáJá, Shunlin Liang : Efficient Algorithms for Estimating Atmosperic Parameters for Surface Reflectance Retrieval. ICPP, Vol. 2 1996 : 132-141 46 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 45 David A. Bader , David R. Helman , Joseph JáJá: Practical Parallel Algorithms for Personalized Communication and Integer Sorting. ACM Journal of Experimental Algorithms 1 : 3 (1996) 44 Tinku Acharya , Joseph JáJá: An On-Line Variable-Length Binary Encoding of Text. Information Sciences 94 (1-4): 1-22 (1996) 43 David A. Bader , Joseph JáJá: Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. Journal of Parallel and Distributed Computing 35 (2): 173-190 (1996) 42 Joseph JáJá, Kwan Woo Ryu , Uzi Vishkin : Sorting Strings and Constructing Digital Search Trees in Parallel. TCS 154 (2): 225-245 (1996) 41 David A. Bader , Joseph JáJá: Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract). PPOPP 1995 : 123-133 40 Hassan Fallah-Adl , Joseph JáJá, Shunlin Liang , Yoram J. Kaufman , John Townshend : Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data. SC 1995 39 Robert Snelick , Joseph JáJá, Raghu Kacker , Gordon Lyon : Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs. IPL 54 (3): 147-153 (1995) 38 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) 37 Robert Snelick , Joseph JáJá, Raghu Kacker , Gordon Lyon : Synthetic-perturbation Techniques for Screening Shared Memory Programs. Software - Practice and Experience 24 (8): 679-701 (1994) 36 Joseph JáJá, Kwan Woo Ryu : An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. TCS 129 (2): 293-307 (1994) 35 Joseph JáJá, Kwan Woo Ryu : An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. SPAA 1993 : 230-239 34 Ronald Greenberg , Joseph JáJá, Sridhar Krishnamurthy : On the Difficulty of Manhattan Channel Routing. IPL 44 (5): 281-284 (1992) 33 S. Alice Wu , Joseph JáJá: Optimal Algorithms for Adjacent Side Routing. Algorithmica 6 (4): 565-578 (1991) 32 Chaitali Chakrabarti , Joseph JáJá: VLSI Architectures for Multidimensional Transforms. IEEE Transactions on Computers 40 (9): 1053-1057 (1991) 31 Joseph JáJá, Shing-Chong Chang : Parallel Algorithms for Channel Routing in the Knock-Knee Model. SIAM J. Comput. 20 (2): 228-245 (1991) 30 Omer Berkman , Joseph JáJá, Sridhar Krishnamurthy , Ramakrishna Thurimella , Uzi Vishkin : Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990 : 871-881 29 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 Transactions on Computers 39 (11): 1359-1368 (1990) 28 Joseph JáJá, Sau-Mou Wu : A New Approach to Realizing Partially Symmetric Functions. IEEE Transactions on Computers 38 (6): 896-898 (1989) 27 Deepak D. Sherlekar , Joseph JáJá: Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree. AWOC 1988 : 268-277 26 Joseph JáJá, Jean Takche : On the Validity of the Direct Sum Conjecture. SIAM J. Comput. 15 (4): 1004-1020 (1986) 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 Transactions on Computers 34 (4): 379-383 (1985) 23 Joseph JáJá, Jean Takche : Improved Lower Bounds for Some Matrix Multiplication Problems. Information Processing Letters 21 (3): 123-127 (1985) 22 Joseph JáJá, Robert Michael Owens : VLSI Sorting with Reduced Hardware. IEEE Transactions on Computers 33 (7): 668-671 (1984) 21 Joseph JáJá, V. K. Prasanna Kumar : Information Transfer in Distributed Computing with Applications to VLSI. JACM 31 (1): 150-162 (1984) 20 Joseph JáJá: The VLSI Complexity of Selected Graph Problems. JACM 31 (2): 377-391 (1984) 19 Joseph JáJá, V. K. Prasanna Kumar , Janos Simon : Information Transfer under Different Sets of Protocols. SIAM J. Comput. 13 (4): 840-849 (1984) 18 Joseph JáJá: On the Computational Complexity of the Permanent (Extended Abstract). FOCS 1983 : 312-319 17 Joseph JáJá: Time-Space Trade-offs for Some Algebraic Problems. JACM 30 (3): 657-667 (1983) 16 Joseph JáJá, Janos Simon : Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Informatica 17 : 411-423 (1982) 15 Joseph JáJá: The Computational Complexity of a Set of Quadratic Functions. JCSS 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. TCS 19 : 189-201 (1982) 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) 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 Joseph JáJá: Computations of Bilinear Forms over Finite Fields. JACM 27 (4): 822-830 (1980) 5 Teofilo F. Gonzalez , Joseph JáJá: On the Complexity of Computing Bilinear Forms with {0, 1} Constants. JCSS 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) 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) 1 Joseph JáJá: Optimal Evaluation of Pairs of Bilinear Forms. STOC 1978 : 173-183 DiSC'01 Copyright ©2002 ACM Inc. |
