Joseph JáJá
According to our database^{1},
Joseph JáJá
authored at least 143 papers
between 1978 and 2018.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2001, "For contributions to the design and analysis of parallel algorithms, algebraic and combinatorial complexity, VLSI architectures, and highperformance computing.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
LEICA: Laplacian eigenmaps for group ICA decomposition of fMRI data.
NeuroImage, 2018
Learning GraphLevel Representations with Gated Recurrent Neural Networks.
CoRR, 2018
A High Performance Implementation of Spectral Clustering on CPUGPU Platforms.
CoRR, 2018
Network Summarization with Preserved Spectral Properties.
CoRR, 2018
A DataDriven Approach to Extract Connectivity Structures from Diffusion Tensor Imaging Data.
CoRR, 2018
2016
Achieving Native GPU Performance for OutofCard Large Dense Matrix Multiplication.
Parallel Processing Letters, 2016
ConnectivityBased Brain Parcellation  A ConnectivityBased Atlas for Schizophrenia Research.
Neuroinformatics, 2016
Scalable Algorithms for Generating and Analyzing Structural Brain Networks with a Varying Number of Nodes.
CoRR, 2016
RealTime AgentBased Modeling Simulation with inSitu Visualization of Complex Biological Systems: A Case Study on Vocal Fold Inflammation and Healing.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016
A High Performance Implementation of Spectral Clustering on CPUGPU Platforms.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016
2015
A datadriven approach to extract connectivity structures from diffusion tensor imaging data.
Proceedings of the 2015 IEEE International Conference on Big Data, 2015
2014
An Optimized FFTBased Direct Poisson Solver on CUDA GPUs.
IEEE Trans. Parallel Distrib. Syst., 2014
Optimized FFT computations on heterogeneous platforms with application to the Poisson equation.
J. Parallel Distrib. Comput., 2014
From Maxout to ChannelOut: Encoding Information on Sparse Pathways.
Proceedings of the Artificial Neural Networks and Machine Learning  ICANN 2014, 2014
2013
From Maxout to ChannelOut: Encoding Information on Sparse Pathways.
CoRR, 2013
High Performance FFT Based Poisson Solver on a CPUGPU Heterogeneous Platform.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013
2012
Hierarchical Exploration of Volumes Using Multilevel Segmentation of the IntensityGradient Histograms.
IEEE Trans. Vis. Comput. Graph., 2012
An Optimized HighThroughput Strategy for Constructing Inverted Files.
IEEE Trans. Parallel Distrib. Syst., 2012
Optimization of Linked List Prefix Computations on Multithreaded GPUs using CUDA.
Parallel Processing Letters, 2012
A fast algorithm for constructing inverted files on heterogeneous platforms.
J. Parallel Distrib. Comput., 2012
2011
PRAM (Parallel Random Access Machines).
Proceedings of the Encyclopedia of Parallel Computing, 2011
Special Issue on Cloud Computing.
J. Parallel Distrib. Comput., 2011
NSF/IEEETCPP curriculum initiative on parallel and distributed computing: core topics for undergraduates.
Proceedings of the 42nd ACM technical symposium on Computer science education, 2011
A Fast Algorithm for Constructing Inverted Files on Heterogeneous Platforms.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
2010
Optimization of linked list prefix computations on multithreaded GPUs using CUDA.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010
2009
Streaming model based volume ray casting implementation for Cell Broadband Engine.
Scientific Programming, 2009
Robust Tools and Services for LongTerm Preservation of Digital Information.
Library Trends, 2009
Special Issue of the Journal of Parallel and Distributed Computing: Cloud Computing.
J. Parallel Distrib. Comput., 2009
Techniques to audit and certify the longterm integrity of digital archives.
Int. J. on Digital Libraries, 2009
Interactive direct volume rendering on desktop multicore processors.
Concurrency and Computation: Practice and Experience, 2009
2008
Interactive HighResolution Isosurface Ray Casting on Multicore Processors.
IEEE Trans. Vis. Comput. Graph., 2008
Streaming Model Based Volume Ray Casting Implementation for Cell Broadband Engine.
Proceedings of the Eurographics Symposium on Parallel Graphics and Visualization, 2008
2007
Parallel Algorithms for Volumetric Surface Construction.
Proceedings of the Handbook of Parallel Computing  Models, Algorithms and Applications., 2007
An efficient and scalable parallel algorithm for outofcore isosurface extraction and rendering.
J. Parallel Distrib. Comput., 2007
InformationAware 2^{n}Tree for Efficient OutofCore Indexing of Very Large Multidimensional Volumetric Data.
Proceedings of the 19th International Conference on Scientific and Statistical Database Management, 2007
Componentbased Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data.
Proceedings of the 19th International Conference on Scientific and Statistical Database Management, 2007
New techniques for ensuring the long term integrity of digital archives.
Proceedings of the 8th Annual International Conference on Digital Government Research, 2007
2006
Isosurface Extraction and Spatial Filtering using Persistent Octree (POT).
IEEE Trans. Vis. Comput. Graph., 2006
An efficient and scalable parallel algorithm for outofcore isosurface extraction and rendering.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006
Robust technologies for automated ingestion and longterm preservation of digital information.
Proceedings of the 7th Annual International Conference on Digital Government Research, 2006
2005
A new framework for addressing temporal range queries and some preliminary results.
Theor. Comput. Sci., 2005
Novel Transformation Techniques Using QHeaps with Applications to Computational Geometry.
SIAM J. Comput., 2005
Optimal and nearoptimal algorithms for generalized intersection reporting on pointer machines.
Inf. Process. Lett., 2005
Mitigating Risk of Data Loss in Preservation Environments.
Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (MSST 2005), 2005
Scalable, Reliable Marshalling and Organization of Distributed Large Scale Data Onto Enterprise Storage Environments.
Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (MSST 2005), 2005
2004
Fast Algorithms For 3D Dominance Reporting And Counting.
Int. J. Found. Comput. Sci., 2004
Temporal Range Exploration of Large Scale Multidimensional Time Series Data.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004
Strategies for Exploring Large Scale Data.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004
Techniques for Indexing and Querying Temporal Observations for a Collection of Objects.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
SpaceEfficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Fast Algorithms for a Class of Temporal Range Queries.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
2002
Efficient Techniques for Range Search Queries on Earth Science Data.
Proceedings of the 14th International Conference on Scientific and Statistical Database Management, 2002
2001
Prefix Computations on Symmetric Multiprocessors.
J. Parallel Distrib. Comput., 2001
On Computation Models for Clusters of Symmetric Multiprocessors.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS01), 2001
2000
A perspective on Quicksort.
Computing in Science and Engineering, 2000
MOCHA: A Database Middleware System Featuring Automatic Deployment of ApplicationSpecific Functionality.
Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000
1999
SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs).
J. Parallel Distrib. Comput., 1999
Sorting on Clusters of SMPs.
Informatica (Slovenia), 1999
Prefix Computations on Symmetric Multiprocessors.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999
Designing Practical Efficient Algorithms for Symmetric Multiprocessors.
Proceedings of the Algorithm Engineering and Experimentation, 1999
1998
A Randomized Parallel Sorting Algorithm with an Experimental Study.
J. Parallel Distrib. Comput., 1998
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.
ACM Journal of Experimental Algorithmics, 1998
Sorting on Clusters of SMPs.
IPPS/SPDP, 1998
1997
Fast algorithms for estimating aerosol optical depth and correcting Thematic Mapper imagery.
The Journal of Supercomputing, 1997
1996
The Block Distributed Memory Model.
IEEE Trans. Parallel Distrib. Syst., 1996
Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study.
The Journal of Supercomputing, 1996
Sorting Strings and Constructing Digital Search Trees in Parallel.
Theor. Comput. Sci., 1996
An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Processing Letters, 1996
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study.
J. Parallel Distrib. Comput., 1996
Practical Parallel Algorithms for Personalized Communication and Integer Sorting.
ACM Journal of Experimental Algorithmics, 1996
An OnLine VariableLength Binary Encoding of Text.
Inf. Sci., 1996
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract).
SPAA, 1996
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study.
Proceedings of IPPS '96, 1996
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection.
Proceedings of IPPS '96, 1996
On Combining Technology and Theory in Search of a Parallel Computation Model.
Proceedings of the 1996 International Conference on Parallel Processing Workshop, 1996
Efficient Algorithms for Estimating Atmosperic Parameters for Surface Reflectance Retrieval.
Proceedings of the 1996 International Conference on Parallel Processing, 1996
Enhancing LempelZiv Codes Using an OnLine Variable Length Binary Encoding.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996
1995
Scalable data parallel algorithms for texture synthesis using Gibbs random fields.
IEEE Trans. Image Processing, 1995
Efficient Image Processing Algorithms on the Scan Line Array Processor.
IEEE Trans. Pattern Anal. Mach. Intell., 1995
Using Synthetic Perturbations and Statistical Screening to Assay SharedMemory Programs.
Inf. Process. Lett., 1995
Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data.
Proceedings of the Proceedings Supercomputing '95, San Diego, CA, USA, December 48, 1995, 1995
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract).
Proceedings of the Fifth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1995
An Optimal Ear Decomposition Algorithm with Applications on FixedSize Linear Arrays.
Proceedings of the 1995 International Conference on Parallel Processing, 1995
1994
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem.
Theor. Comput. Sci., 1994
Syntheticperturbation Techniques for Screening Shared Memory Programs.
Softw., Pract. Exper., 1994
TopBottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.
SIAM J. Comput., 1994
Special Issue on Data Parallel Algorithms and Programming  Guest Editors' Introduction.
J. Parallel Distrib. Comput., 1994
Sorting Strings and Constructing Digital Search Trees in Parallel.
Proceedings of the 8th International Symposium on Parallel Processing, 1994
The Block Distributed Memory Model for Shared Memory Multiprocessors.
Proceedings of the 8th International Symposium on Parallel Processing, 1994
1993
Systolic architectures for finitestate vector quantization.
VLSI Signal Processing, 1993
VLSI implementation of a tree searched vector quantizer.
IEEE Trans. Signal Processing, 1993
Optimal Algorithms on the Pipelined Hypercube and Related Networks.
IEEE Trans. Parallel Distrib. Syst., 1993
An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem.
SPAA, 1993
Designing Efficient Parallel Algorithms: Models and Paradigms with Applications to Image Processing.
Proceedings of the Seventh International Parallel Processing Symposium, 1993
Using SyntheticPerturbation Techniques for Tuning Shared Memory Programs (Extended Abstract).
Proceedings of the 1993 International Conference on Parallel Processing, 1993
Efficient Image Processing Algorithms on the Scan Line Array Processor.
Proceedings of the 1993 International Conference on Parallel Processing, 1993
1992
Load Balancing and Routing on the Hypercube and Related Networks.
J. Parallel Distrib. Comput., 1992
On the Difficulty of Manhattan Channel Routing.
Inf. Process. Lett., 1992
An Introduction to Parallel Algorithms
AddisonWesley, ISBN: 0201548569, 1992
1991
VLSI Architectures for Multidimensional Transforms.
IEEE Trans. Computers, 1991
Parallel Algorithms for Channel Routing in the KnockKnee Model.
SIAM J. Comput., 1991
Parallel algorithms for VLSI routing.
Integration, 1991
Optimal Algorithms for Adjacent Side Routing.
Algorithmica, 1991
VLSI routing on the pipelined hypercube and related networks.
Proceedings of the First Great Lakes Symposium on VLSI, 1991
1990
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.
IEEE Trans. Parallel Distrib. Syst., 1990
Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition.
IEEE Trans. Computers, 1990
Load Balancing on the Hypercube and Related Networks.
Proceedings of the 1990 International Conference on Parallel Processing, 1990
An efficient parallel algorithm for channel routing.
Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990
Some TriplyLogarithmic Parallel Algorithms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
On routing twoterminal nets in the presence of obstacles.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1989
A New Approach to Realizing Partially Symmetric Functions.
IEEE Trans. Computers, 1989
List Ranking on the Hypercube.
Proceedings of the International Conference on Parallel Processing, 1989
Parallel Algorithms for Wiring Module Pins to Frame Pads.
Proceedings of the International Conference on Parallel Processing, 1989
1988
Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1986
A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1986
On the Validity of the Direct Sum Conjecture.
SIAM J. Comput., 1986
Optimal Algorithms for MeshConnected Parallel Processors with Serial Memories.
Proceedings of the International Conference on Parallel Processing, 1986
1985
Parallel Sorting with Serial Momories.
IEEE Trans. Computers, 1985
Improved Lower Bounds for Some Matrix Multiplication Problems.
Inf. Process. Lett., 1985
Identification Is Easier Than Decoding
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
VLSI Sorting with Reduced Hardware.
IEEE Trans. Computers, 1984
Information Transfer under Different Sets of Protocols.
SIAM J. Comput., 1984
Information Transfer in Distributed Computing with Applications to VLSI.
J. ACM, 1984
The VLSI Complexity of Selected Graph Problems.
J. ACM, 1984
1983
TimeSpace Tradeoffs for Some Algebraic Problems
J. ACM, July, 1983
An architecture for a VLSI FFT processor.
Integration, 1983
On the Computational Complexity of the Permanent (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
Theor. Comput. Sci., 1982
Parallel Algorithms in Graph Theory: Planarity Testing.
SIAM J. Comput., 1982
Evaluation of Arithmetic Expressions with Algebraic Identities.
SIAM J. Comput., 1982
The Computational Complexity of a Set of Quadratic Functions.
J. Comput. Syst. Sci., 1982
Space Efficient Algorithms for Some Graph Theoretical Problems.
Acta Inf., 1982
1981
Fast, Efficient Parallel Algorithms for Some Graph Problems.
SIAM J. Comput., 1981
Approximation Algorithms for Several Graph Augmentation Problems.
SIAM J. Comput., 1981
Computation of Algebraic Functions with Root Extractions
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1980
On the Complexity of Bilinear Forms with Commutativity.
SIAM J. Comput., 1980
On the Complexity of Computing Bilinear Forms with {0, 1} Constants.
J. Comput. Syst. Sci., 1980
Computations of Bilinear Forms over Finite Fields.
J. ACM, 1980
TimeSpace Tradeoffs for some Algebraic Problems
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version).
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980
1979
Optimal Evaluation of Pairs of Bilinear Forms.
SIAM J. Comput., 1979
On the Complexity of Bilinear Forms with Commutativity
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979
1978
Optimal Evaluation of Pairs of Bilinear Forms
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978