default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph F. JáJá
Person information
- affiliation: University of Maryland, Institute for Advanced Computer Studies, College Park, MD, USA
- affiliation (PhD): Harvard University, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]Jonathan Heagerty
, Sida Li, Eric Lee, Shuvra S. Bhattacharyya, Sujal Bista, Barbara Brawn, Brandon Y. Feng, Susmija Jabbireddy, Joseph F. JáJá, Hernisa Kacorri, David Li, Derek Yarnell, Matthias Zwicker, Amitabh Varshney:
HoloCamera: Advanced Volumetric Capture for Cinematic-Quality VR Applications. IEEE Trans. Vis. Comput. Graph. 30(5): 2767-2775 (2024)- 2023
- [i12]Vaishnavi Patil, Matthew Evanusa, Joseph F. JáJá:
ProtoVAE: Prototypical Networks for Unsupervised Disentanglement. CoRR abs/2305.09092 (2023) - 2022
- [c67]Jun Wang, Mingfei Gao, Yuqian Hu, Ramprasaath R. Selvaraju, Chetan Ramaiah, Ran Xu, Joseph F. JáJá, Larry Davis:
TAG: Boosting Text-VQA via Text-aware Visual Question-answer Generation. BMVC 2022: 33 - [c66]Vaishnavi Patil, Matthew Evanusa, Joseph F. JáJá:
DOT-VAE: Disentangling One Factor at a Time. ICANN (1) 2022: 109-120 - [c65]Amit Kumar Kundu, Joseph F. JáJá:
FedNet2Net: Saving Communication and Computations in Federated Learning with Model Growing. ICANN (4) 2022: 236-247 - [c64]Yu Jin, Joseph F. JáJá:
Improving Graph Neural Network with Learnable Permutation Pooling. ICDM (Workshops) 2022: 682-689 - [i11]Amit Kumar Kundu, Joseph F. JáJá:
FedNet2Net: Saving Communication and Computations in Federated Learning with Model Growing. CoRR abs/2207.09568 (2022) - [i10]Jun Wang, Mingfei Gao, Yuqian Hu, Ramprasaath R. Selvaraju, Chetan Ramaiah, Ran Xu, Joseph F. JáJá, Larry S. Davis:
TAG: Boosting Text-VQA via Text-aware Visual Question-answer Generation. CoRR abs/2208.01813 (2022) - [i9]Vaishnavi Patil, Matthew Evanusa, Joseph F. JáJá:
DOT-VAE: Disentangling One Factor at a Time. CoRR abs/2210.10920 (2022) - 2021
- [j84]Joyneel Misra, Sriniwas Govinda Surampudi, Manasij Venkatesh, Chirag Limbachia, Joseph F. JáJá, Luiz Pessoa:
Learning brain dynamics for decoding and predicting individual differences. PLoS Comput. Biol. 17(9) (2021) - [j83]Xiaoxu Meng, Ruofei Du, Joseph F. JáJá, Amitabh Varshney:
3D-Kernel Foveated Rendering for Light Fields. IEEE Trans. Vis. Comput. Graph. 27(8): 3350-3360 (2021) - [c63]Chihuang Liu, Joseph F. JáJá:
Class-Similarity Based Label Smoothing for Confidence Calibration. ICANN (4) 2021: 190-201 - 2020
- [j82]Manasij Venkatesh, Joseph F. JáJá, Luiz Pessoa:
Comparing functional connectivity matrices: A geometry-aware approach applied to participant identification. NeuroImage 207 (2020) - [c62]Yu Jin, Andreas Loukas, Joseph F. JáJá:
Graph Coarsening with Preserved Spectral Properties. AISTATS 2020: 4452-4462 - [i8]Chihuang Liu, Joseph F. JáJá:
Class-Similarity Based Label Smoothing for Generalized Confidence Calibration. CoRR abs/2006.14028 (2020)
2010 – 2019
- 2019
- [j81]Wenshuai Hou, Chandler Sours, Li Jiang, Steve Roys, Jiachen Zhuo, Joseph F. JáJá, Rao P. Gullapalli:
Dynamic Functional Network Analysis in Mild Traumatic Brain Injury. Brain Connect. 9(6): 475-487 (2019) - [j80]Manasij Venkatesh, Joseph F. JáJá, Luiz Pessoa:
Brain dynamics and temporal trajectories during task and naturalistic processing. NeuroImage 186: 410-423 (2019) - [c61]Chihuang Liu, Joseph F. JáJá:
Feature Prioritization and Regularization Improve Standard Accuracy and Adversarial Robustness. IJCAI 2019: 2994-3000 - 2018
- [j79]Chihuang Liu, Joseph F. JáJá, Luiz Pessoa:
LEICA: Laplacian eigenmaps for group ICA decomposition of fMRI data. NeuroImage 169: 363-373 (2018) - [i7]Yu Jin, Joseph F. JáJá, Rong Chen, Edward H. Herskovits:
A Data-Driven Approach to Extract Connectivity Structures from Diffusion Tensor Imaging Data. CoRR abs/1802.04353 (2018) - [i6]Yu Jin, Joseph F. JáJá:
Network Summarization with Preserved Spectral Properties. CoRR abs/1802.04447 (2018) - [i5]Yu Jin, Joseph F. JáJá:
A High Performance Implementation of Spectral Clustering on CPU-GPU Platforms. CoRR abs/1802.04450 (2018) - [i4]Yu Jin, Joseph F. JáJá:
Learning Graph-Level Representations with Gated Recurrent Neural Networks. CoRR abs/1805.07683 (2018) - [i3]Chihuang Liu, Joseph F. JáJá:
Feature prioritization and regularization improve standard accuracy and adversarial robustness. CoRR abs/1810.02424 (2018) - 2017
- [j78]Nuttiiya Seekhao, Joseph F. JáJá, Luc Mongeau, Nicole Y. K. Li-Jessen:
In Situ Visualization for 3D Agent-Based Vocal Fold Inflammation and Repair Simulation. Supercomput. Front. Innov. 4(3): 68-79 (2017) - 2016
- [j77]Qi Wang, Rong Chen, Joseph F. JáJá, Yu Jin, L. Elliot Hong, Edward H. Herskovits:
Connectivity-Based Brain Parcellation - A Connectivity-Based Atlas for Schizophrenia Research. Neuroinformatics 14(1): 83-97 (2016) - [j76]Jing Wu, Joseph F. JáJá:
Achieving Native GPU Performance for Out-of-Card Large Dense Matrix Multiplication. Parallel Process. Lett. 26(2): 1650007:1-1650007:17 (2016) - [c60]Nuttiiya Seekhao, Caroline Shung, Joseph F. JáJá, Luc Mongeau, Nicole Y. K. Li-Jessen:
Real-Time Agent-Based Modeling Simulation with in-Situ Visualization of Complex Biological Systems: A Case Study on Vocal Fold Inflammation and Healing. IPDPS Workshops 2016: 463-472 - [c59]Yu Jin, Joseph F. JáJá:
A High Performance Implementation of Spectral Clustering on CPU-GPU Platforms. IPDPS Workshops 2016: 825-834 - [i2]Yu Jin, Joseph F. JáJá, Rong Chen, Edward H. Herskovits:
Scalable Algorithms for Generating and Analyzing Structural Brain Networks with a Varying Number of Nodes. CoRR abs/1609.03893 (2016) - 2015
- [c58]Yu Jin, Joseph F. JáJá, Rong Chen, Edward H. Herskovits:
A data-driven approach to extract connectivity structures from diffusion tensor imaging data. IEEE BigData 2015: 944-951 - 2014
- [j75]Jing Wu, Joseph F. JáJá:
Optimized FFT computations on heterogeneous platforms with application to the Poisson equation. J. Parallel Distributed Comput. 74(8): 2745-2756 (2014) - [j74]Jing Wu, Joseph F. JáJá, Elias Balaras:
An Optimized FFT-Based Direct Poisson Solver on CUDA GPUs. IEEE Trans. Parallel Distributed Syst. 25(3): 550-559 (2014) - [c57]Qi Wang, Joseph F. JáJá:
From Maxout to Channel-Out: Encoding Information on Sparse Pathways. ICANN 2014: 273-280 - 2013
- [c56]Jing Wu, Joseph F. JáJá:
High Performance FFT Based Poisson Solver on a CPU-GPU Heterogeneous Platform. IPDPS 2013: 115-125 - [i1]Qi Wang, Joseph F. JáJá:
From Maxout to Channel-Out: Encoding Information on Sparse Pathways. CoRR abs/1312.1909 (2013) - 2012
- [j73]Zheng Wei, Joseph F. JáJá:
A fast algorithm for constructing inverted files on heterogeneous platforms. J. Parallel Distributed Comput. 72(5): 728-738 (2012) - [j72]Zheng Wei, Joseph F. JáJá:
Optimization of Linked List Prefix Computations on Multithreaded GPUs using CUDA. Parallel Process. Lett. 22(4) (2012) - [j71]Zheng Wei, Joseph F. JáJá:
An Optimized High-Throughput Strategy for Constructing Inverted Files. IEEE Trans. Parallel Distributed Syst. 23(11): 2033-2044 (2012) - [j70]Cheuk Yiu Ip, Amitabh Varshney, Joseph F. JáJá:
Hierarchical Exploration of Volumes Using Multilevel Segmentation of the Intensity-Gradient Histograms. IEEE Trans. Vis. Comput. Graph. 18(12): 2355-2363 (2012) - 2011
- [j69]Gregory V. Chockler, Eliezer Dekel, Joseph F. JáJá, Jimmy Lin:
Special Issue on Cloud Computing. J. Parallel Distributed Comput. 71(6): 731 (2011) - [c55]Zheng Wei, Joseph F. JáJá:
A Fast Algorithm for Constructing Inverted Files on Heterogeneous Platforms. IPDPS 2011: 1124-1134 - [c54]Sushil K. Prasad, Almadena Yu. Chtchelkanova, Sajal K. Das, Frank Dehne, Mohamed G. Gouda, Anshul Gupta, Joseph F. JáJá, Krishna Kant, Anita La Salle, Richard LeBlanc, Manish Lumsdaine, David A. Padua, Manish Parashar, Viktor K. Prasanna, Yves Robert, Arnold L. Rosenberg, Sartaj Sahni, Behrooz A. Shirazi, Alan Sussman, Charles C. Weems, Jie Wu:
NSF/IEEE-TCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates. SIGCSE 2011: 617-618 - [r2]Joseph F. JáJá:
PRAM (Parallel Random Access Machines). Encyclopedia of Parallel Computing 2011: 1608-1615 - 2010
- [c53]Zheng Wei, Joseph F. JáJá:
Optimization of linked list prefix computations on multithreaded GPUs using CUDA. IPDPS 2010: 1-8
2000 – 2009
- 2009
- [j68]Qin Wang, Joseph F. JáJá:
Interactive direct volume rendering on desktop multicore processors. Concurr. Comput. Pract. Exp. 21(17): 2199-2212 (2009) - [j67]Sangchul Song, Joseph F. JáJá:
Techniques to audit and certify the long-term integrity of digital archives. Int. J. Digit. Libr. 10(2-3): 123-131 (2009) - [j66]Gregory V. Chockler, Eliezer Dekel, Joseph F. JáJá, Jimmy Lin:
Special Issue of the Journal of Parallel and Distributed Computing: Cloud Computing. J. Parallel Distributed Comput. 69(9): 813 (2009) - [j65]Joseph F. JáJá, Sangchul Song:
Robust Tools and Services for Long-Term Preservation of Digital Information. Libr. Trends 57(3): 580-594 (2009) - [j64]Jusub Kim, Joseph F. JáJá:
Streaming model based volume ray casting implementation for Cell Broadband Engine. Sci. Program. 17(1-2): 173-184 (2009) - 2008
- [j63]Qin Wang, Joseph F. JáJá:
Interactive High-Resolution Isosurface Ray Casting on Multicore Processors. IEEE Trans. Vis. Comput. Graph. 14(3): 603-614 (2008) - [c52]Jusub Kim, Joseph F. JáJá:
Streaming Model Based Volume Ray Casting Implementation for Cell Broadband Engine. EGPGV@Eurographics 2008: 9-16 - 2007
- [j62]Qin Wang, Joseph F. JáJá, Amitabh Varshney:
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering. J. Parallel Distributed Comput. 67(5): 592-603 (2007) - [c51]Sangchul Song, Joseph F. JáJá:
New techniques for ensuring the long term integrity of digital archives. DG.O 2007: 57-65 - [c50]Jusub Kim, Joseph F. JáJá:
Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data. SSDBM 2007: 8 - [c49]Jusub Kim, Joseph F. JáJá:
Information-Aware 2n-Tree for Efficient Out-of-Core Indexing of Very Large Multidimensional Volumetric Data. SSDBM 2007: 9 - [r1]Joseph F. JáJá, Qingmin Shi, Amitabh Varshney:
Parallel Algorithms for Volumetric Surface Construction. Handbook of Parallel Computing 2007 - 2006
- [j61]Qingmin Shi, Joseph F. JáJá:
Isosurface Extraction and Spatial Filtering using Persistent Octree (POT). IEEE Trans. Vis. Comput. Graph. 12(5): 1283-1290 (2006) - [c48]Joseph F. JáJá:
Robust technologies for automated ingestion and long-term preservation of digital information. DG.O 2006: 285-286 - [c47]Qin Wang, Joseph F. JáJá, Amitabh Varshney:
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering. IPDPS 2006 - 2005
- [j60]Qingmin Shi, Joseph F. JáJá:
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Inf. Process. Lett. 95(3): 382-388 (2005) - [j59]Qingmin Shi, Joseph F. JáJá:
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry. SIAM J. Comput. 34(6): 1474-1492 (2005) - [j58]Qingmin Shi, Joseph F. JáJá:
A new framework for addressing temporal range queries and some preliminary results. Theor. Comput. Sci. 332(1-3): 109-121 (2005) - [c46]Reagan W. Moore, Joseph F. JáJá, Robert Chadduck:
Mitigating Risk of Data Loss in Preservation Environments. MSST 2005: 39-48 - [c45]Joseph F. 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 - 2004
- [j57]Qingmin Shi, Joseph F. JáJá:
Fast Algorithms For 3-D Dominance Reporting And Counting. Int. J. Found. Comput. Sci. 15(4): 673-684 (2004) - [c44]Joseph F. JáJá, Christian Worm Mortensen, Qingmin Shi:
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. ISAAC 2004: 558-568 - [c43]Qingmin Shi, Joseph F. JáJá:
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects. ISAAC 2004: 822-834 - [c42]Joseph F. JáJá:
Strategies for Exploring Large Scale Data. ISPAN 2004: 2 - [c41]Joseph F. JáJá, Jusub Kim, Qin Wang:
Temporal Range Exploration of Large Scale Multidimensional Time Series Data. SSDBM 2004: 95-104 - 2003
- [c40]Qingmin Shi, Joseph F. JáJá:
Fast Algorithms for a Class of Temporal Range Queries. WADS 2003: 91-102 - 2002
- [c39]Qingmin Shi, Joseph F. JáJá:
Efficient Techniques for Range Search Queries on Earth Science Data. SSDBM 2002: 142-151 - 2001
- [j56]David R. Helman, Joseph F. JáJá:
Prefix Computations on Symmetric Multiprocessors. J. Parallel Distributed Comput. 61(2): 265-278 (2001) - [c38]Joseph F. JáJá:
On Computation Models for Clusters of Symmetric Multiprocessors. IPDPS 2001: 136 - 2000
- [j55]Joseph F. JáJá:
A perspective on Quicksort. Comput. Sci. Eng. 2(1): 43-49 (2000) - [c37]Manuel Rodríguez-Martínez, Nick Roussopoulos, John M. McGann, Stephen Kelley, Vadim Katz, Zhexuan Song, Joseph F. JáJá:
MOCHA: A Database Middleware System Featuring Automatic Deployment of Application-Specific Functionality. SIGMOD Conference 2000: 594
1990 – 1999
- 1999
- [j54]David R. Helman, Joseph F. JáJá:
Sorting on Clusters of SMPs. Informatica (Slovenia) 23(1) (1999) - [j53]David A. Bader, Joseph F. JáJá:
SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). J. Parallel Distributed Comput. 58(1): 92-108 (1999) - [c36]David R. Helman, Joseph F. JáJá:
Designing Practical Efficient Algorithms for Symmetric Multiprocessors. ALENEX 1999: 37-56 - [c35]David R. Helman, Joseph F. JáJá:
Prefix Computations on Symmetric Multiprocessors. IPPS/SPDP 1999: 7-13 - 1998
- [j52]David R. Helman, Joseph F. JáJá, David A. Bader:
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. ACM J. Exp. Algorithmics 3: 4 (1998) - [j51]David R. Helman, David A. Bader, Joseph F. JáJá:
A Randomized Parallel Sorting Algorithm with an Experimental Study. J. Parallel Distributed Comput. 52(1): 1-23 (1998) - [c34]David R. Helman, Joseph F. JáJá:
Sorting on Clusters of SMPs. IPPS/SPDP 1998: 561-567 - 1997
- [j50]Hassan Fallah-Adl, Joseph F. JáJá, Shunlin Liang:
Fast algorithms for estimating aerosol optical depth and correcting Thematic Mapper imagery. J. Supercomput. 10(4): 315-329 (1997) - 1996
- [j49]Tinku Acharya, Joseph F. JáJá:
An On-Line Variable-Length Binary Encoding of Text. Inf. Sci. 94(1-4): 1-22 (1996) - [j48]David A. Bader, David R. Helman, Joseph F. JáJá:
Practical Parallel Algorithms for Personalized Communication and Integer Sorting. ACM J. Exp. Algorithmics 1: 3 (1996) - [j47]David A. Bader, Joseph F. JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. J. Parallel Distributed Comput. 35(2): 173-190 (1996) - [j46]Joseph F. JáJá, Kwan Woo Ryu:
An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Process. Lett. 6(2): 187-193 (1996) - [j45]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. Theor. Comput. Sci. 154(2): 225-245 (1996) - [j44]David A. Bader, Joseph F. JáJá, David Harwood, Larry S. Davis:
Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study. J. Supercomput. 10(2): 141-168 (1996) - [j43]Joseph F. JáJá, Kwan Woo Ryu:
The Block Distributed Memory Model. IEEE Trans. Parallel Distributed Syst. 7(8): 830-840 (1996) - [c33]Tinku Acharya, Joseph F. JáJá:
Enhancing Lempel-Ziv Codes Using an On-Line Variable Length Binary Encoding. Data Compression Conference 1996: 419 - [c32]Joseph F. JáJá:
On Combining Technology and Theory in Search of a Parallel Computation Model. ICPP Workshop 1996: 115-123 - [c31]Hassan Fallah-Adl, Joseph F. JáJá, Shunlin Liang:
Efficient Algorithms for Estimating Atmosperic Parameters for Surface Reflectance Retrieval. ICPP, Vol. 2 1996: 132-141 - [c30]David A. Bader, Joseph F. JáJá:
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection. IPPS 1996: 292-301 - [c29]David A. Bader, Joseph F. 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 - [c28]David R. Helman, David A. Bader, Joseph F. JáJá:
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract). SPAA 1996: 211-222 - 1995
- [j42]Robert Snelick, Joseph F. 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) - [j41]David R. Helman, Joseph F. JáJá:
Efficient Image Processing Algorithms on the Scan Line Array Processor. IEEE Trans. Pattern Anal. Mach. Intell. 17(1): 47-56 (1995) - [j40]David A. Bader, Joseph F. JáJá, Rama Chellappa:
Scalable data parallel algorithms for texture synthesis using Gibbs random fields. IEEE Trans. Image Process. 4(10): 1456-1460 (1995) - [c27]Ying-Min Huang, Joseph F. JáJá:
An Optimal Ear Decomposition Algorithm with Applications on Fixed-Size Linear Arrays. ICPP (3) 1995: 97-104 - [c26]David A. Bader, Joseph F. JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract). PPoPP 1995: 123-133 - [c25]Hassan Fallah-Adl, Joseph F. JáJá, Shunlin Liang, Yoram J. Kaufman, John R. Townshend:
Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data. SC 1995: 12 - 1994
- [j39]Joseph F. JáJá, Pearl Y. Wang:
Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction. J. Parallel Distributed Comput. 21(1): 1-3 (1994) - [j38]Omer Berkman, Joseph F. 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) - [j37]Robert Snelick, Joseph F. JáJá, Raghu Kacker, Gordon Lyon:
Synthetic-perturbation Techniques for Screening Shared Memory Programs. Softw. Pract. Exp. 24(8): 679-701 (1994) - [j36]Joseph F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. Theor. Comput. Sci. 129(2): 293-307 (1994) - [j35]K. J. Ray Liu, Ching-Te Chiu, Ravi K. Kolagotla, Joseph F. JáJá:
Optimal unified architectures for the real-time computation of time-recursive discrete sinusoidal transforms. IEEE Trans. Circuits Syst. Video Technol. 4(2): 168-180 (1994) - [c24]Joseph F. JáJá, Kwan Woo Ryu, Uzi Vishkin:
Sorting Strings and Constructing Digital Search Trees in Parallel. IPPS 1994: 349-356 - [c23]Joseph F. JáJá, Kwan Woo Ryu:
The Block Distributed Memory Model for Shared Memory Multiprocessors. IPPS 1994: 752-756 - 1993
- [j34]Joseph F. JáJá, Kwan Woo Ryu:
Optimal Algorithms on the Pipelined Hypercube and Related Networks. IEEE Trans. Parallel Distributed Syst. 4(5): 582-591 (1993) - [j33]Ravi K. Kolagotla, Shu-sun Yu, Joseph F. JáJá:
VLSI implementation of a tree searched vector quantizer. IEEE Trans. Signal Process. 41(2): 901-905 (1993) - [j32]Ravi K. Kolagotla, Shu-sun Yu, Joseph F. JáJá:
Systolic architectures for finite-state vector quantization. J. VLSI Signal Process. 5(2-3): 249-259 (1993) - [c22]Kuo J. Ray Liu, Ching-Te Chiu, Ravi K. Kolagotla, Joseph F. JáJá:
Optimal unified IIR architectures for time-recursive discrete sinusoidal transforms. ICASSP (3) 1993: 73-76 - [c21]Robert Snelick, Joseph F. JáJá, Raghu Kacker, Gordon Lyon:
Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs (Extended Abstract). ICPP (2) 1993: 2-10 - [c20]David R. Helman, Joseph F. JáJá:
Efficient Image Processing Algorithms on the Scan Line Array Processor. ICPP (3) 1993: 90-93 - [c19]Joseph F. JáJá:
Designing Efficient Parallel Algorithms: Models and Paradigms with Applications to Image Processing. IPPS 1993: 385 - [c18]Joseph F. JáJá, Kwan Woo Ryu:
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. SPAA 1993: 230-239 - 1992
- [b1]Joseph F. JáJá:
An Introduction to Parallel Algorithms. Addison-Wesley 1992, ISBN 0-201-54856-9 - [j31]Ronald I. Greenberg, Joseph F. JáJá, Sridhar Krishnamurthy:
On the Difficulty of Manhattan Channel Routing. Inf. Process. Lett. 44(5): 281-284 (1992) - [j30]Joseph F. JáJá, Kwan Woo Ryu:
Load Balancing and Routing on the Hypercube and Related Networks. J. Parallel Distributed Comput. 14(4): 431-435 (1992) - [c17]Ravi K. Kolagotla, Shu-sun Yu, Joseph F. JáJá:
Systolic architectures for finite-state vector quantization. ASAP 1992: 481-495 - 1991
- [j29]S. Alice Wu, Joseph F. JáJá:
Optimal Algorithms for Adjacent Side Routing. Algorithmica 6(4): 565-578 (1991) - [j28]Joseph F. JáJá:
Parallel algorithms for VLSI routing. Integr. 12(3): 305-320 (1991) - [j27]Joseph F. JáJá, Shing-Chong Chang:
Parallel Algorithms for Channel Routing in the Knock-Knee Model. SIAM J. Comput. 20(2): 228-245 (1991) - [j26]Chaitali Chakrabarti, Joseph F. JáJá:
VLSI Architectures for Multidimensional Transforms. IEEE Trans. Computers 40(9): 1053-1057 (1991) - [c16]Joseph F. JáJá:
VLSI routing on the pipelined hypercube and related networks. Great Lakes Symposium on VLSI 1991: 7-11 - 1990
- [j25]Chaitali Chakrabarti, Joseph F. 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) - [j24]Kwan Woo Ryu, Joseph F. JáJá:
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube. IEEE Trans. Parallel Distributed Syst. 1(1): 83-90 (1990) - [c15]Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990: 871-881 - [c14]Sridhar Krishnamurthy, Joseph F. JáJá:
An efficient parallel algorithm for channel routing. ICCD 1990: 400-403 - [c13]Joseph F. JáJá, Kwan Woo Ryu:
Load Balancing on the Hypercube and Related Networks. ICPP (1) 1990: 203-210 - [c12]Chaitali Chakrabarti, Joseph F. JáJá:
A parallel algorithm for template matching on an SIMD mesh connected computer. ICPR (2) 1990: 362-367
1980 – 1989
- 1989
- [j23]Joseph F. JáJá, Sau-Mou Wu:
A New Approach to Realizing Partially Symmetric Functions. IEEE Trans. Computers 38(6): 896-898 (1989) - [j22]Joseph F. JáJá, S. Alice Wu:
On routing two-terminal nets in the presence of obstacles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(5): 563-570 (1989) - [c11]Kwan Woo Ryu, Joseph F. JáJá:
List Ranking on the Hypercube. ICPP (3) 1989: 20-23 - [c10]Shing-Chong Chang, Joseph F. JáJá:
Parallel Algorithms for Wiring Module Pins to Frame Pads. ICPP (3) 1989: 102-105 - 1988
- [c9]Deepak D. Sherlekar, Joseph F. JáJá:
Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree. AWOC 1988: 268-277 - 1986
- [j21]Joseph F. JáJá, Jean Takche:
On the Validity of the Direct Sum Conjecture. SIAM J. Comput. 15(4): 1004-1020 (1986) - [j20]Robert Michael Owens, Joseph F. JáJá:
A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. 34(4): 979-989 (1986) - [c8]Robert Michael Owens, Joseph F. JáJá:
Optimal Algorithms for Mesh-Connected Parallel Processors with Serial Memories. ICPP 1986: 812-818 - 1985
- [j19]Joseph F. JáJá, Jean Takche:
Improved Lower Bounds for Some Matrix Multiplication Problems. Inf. Process. Lett. 21(3): 123-127 (1985) - [j18]Robert Michael Owens, Joseph F. JáJá:
Parallel Sorting with Serial Momories. IEEE Trans. Computers 34(4): 379-383 (1985) - [c7]Joseph F. JáJá:
Identification Is Easier Than Decoding. FOCS 1985: 43-50 - 1984
- [j17]Joseph F. JáJá, Viktor K. Prasanna:
Information Transfer in Distributed Computing with Applications to VLSI. J. ACM 31(1): 150-162 (1984) - [j16]Joseph F. JáJá:
The VLSI Complexity of Selected Graph Problems. J. ACM 31(2): 377-391 (1984) - [j15]Joseph F. JáJá, Viktor K. Prasanna, Janos Simon:
Information Transfer under Different Sets of Protocols. SIAM J. Comput. 13(4): 840-849 (1984) - [j14]Joseph F. JáJá, Robert Michael Owens:
VLSI Sorting with Reduced Hardware. IEEE Trans. Computers 33(7): 668-671 (1984) - 1983
- [j13]Joseph F. JáJá, Robert Michael Owens:
An architecture for a VLSI FFT processor. Integr. 1(4): 305-316 (1983) - [j12]Joseph F. JáJá:
Time-Space Trade-offs for Some Algebraic Problems. J. ACM 30(3): 657-667 (1983) - [c6]Joseph F. JáJá:
On the Computational Complexity of the Permanent (Extended Abstract). FOCS 1983: 312-319 - 1982
- [j11]Joseph F. JáJá, Janos Simon:
Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Informatica 17: 411-423 (1982) - [j10]Joseph F. JáJá:
The Computational Complexity of a Set of Quadratic Functions. J. Comput. Syst. Sci. 24(2): 209-223 (1982) - [j9]Joseph F. JáJá, Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11(2): 314-328 (1982) - [j8]Teofilo F. Gonzalez, Joseph F. JáJá:
Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. 11(4): 633-662 (1982) - [j7]Greg N. Frederickson, Joseph F. JáJá:
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. Theor. Comput. Sci. 19: 189-201 (1982) - 1981
- [j6]Greg N. Frederickson, Joseph F. JáJá:
Approximation Algorithms for Several Graph Augmentation Problems. SIAM J. Comput. 10(2): 270-283 (1981) - [j5]Carla D. Savage, Joseph F. JáJá:
Fast, Efficient Parallel Algorithms for Some Graph Problems. SIAM J. Comput. 10(4): 682-691 (1981) - [c5]Joseph F. JáJá:
Computation of Algebraic Functions with Root Extractions. FOCS 1981: 95-100 - 1980
- [j4]Joseph F. JáJá:
Computations of Bilinear Forms over Finite Fields. J. ACM 27(4): 822-830 (1980) - [j3]Teofilo F. Gonzalez, Joseph F. JáJá:
On the Complexity of Computing Bilinear Forms with {0, 1} Constants. J. Comput. Syst. Sci. 20(1): 77-95 (1980) - [j2]Joseph F. JáJá:
On the Complexity of Bilinear Forms with Commutativity. SIAM J. Comput. 9(4): 713-728 (1980) - [c4]Joseph F. JáJá, Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). MFCS 1980: 305-319 - [c3]Joseph F. JáJá:
Time-Space Tradeoffs for some Algebraic Problems. STOC 1980: 339-350
1970 – 1979
- 1979
- [j1]Joseph F. JáJá:
Optimal Evaluation of Pairs of Bilinear Forms. SIAM J. Comput. 8(3): 443-462 (1979) - [c2]Joseph F. JáJá:
On the Complexity of Bilinear Forms with Commutativity. STOC 1979: 197-208 - 1978
- [c1]Joseph F. JáJá:
Optimal Evaluation of Pairs of Bilinear Forms. STOC 1978: 173-183
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
