The following pages link to Joseph F. Ja'Ja' (Q1365678):
Displaying 50 items.
- (Q169717) (redirect page) (← links)
- Using synthetic perturbations and statistical screening to assay shared-memory programs (Q673609) (← links)
- (Q802876) (redirect page) (← links)
- Optimal algorithms for adjacent side routing (Q802877) (← links)
- An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering (Q882153) (← links)
- (Q1041793) (redirect page) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- (Q1068533) (redirect page) (← links)
- Improved lower bounds for some matrix multiplication problems (Q1068534) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- Space efficient algorithms for some graph theoretical problems (Q1160148) (← links)
- The computational complexity of a set of quadratic functions (Q1163861) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- Load balancing and routing on the hypercube and related networks (Q1200133) (← links)
- On the difficulty of Manhattan channel routing (Q1209358) (← links)
- A randomized parallel sorting algorithm with an experimental study (Q1268779) (← links)
- (Q1329731) (redirect page) (← links)
- An efficient parallel algorithm for the single function coarsest partition problem (Q1329732) (← links)
- Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING (Q3022028) (← links)
- Time-Space trade-offs for some algebraic problems (Q3026340) (← links)
- Information Transfer in Distributed Computing with Applications to VLSI (Q3028340) (← links)
- Parallel Algorithms for Channel Routing in the Knock-Knee Model (Q3210179) (← links)
- Parallel Sorting with Serial Memories (Q3219773) (← links)
- VLSI Sorting with Reduced Hardware (Q3323283) (← links)
- Information Transfer under Different Sets of Protocols (Q3340150) (← links)
- On the Validity of the Direct Sum Conjecture (Q3756515) (← links)
- The VLSI Complexity of Selected Graph Problems (Q3768399) (← links)
- Parallel algorithms for planar graph isomorphism and related problems (Q3801100) (← links)
- Optimal Evaluation of Pairs of Bilinear Forms (Q3851620) (← links)
- An Addendum to Kronecker’s Theory of Pencils (Q3859926) (← links)
- Computations of Bilinear Forms over Finite Fields (Q3898026) (← links)
- On the Complexity of Bilinear Forms with Commutativity (Q3898027) (← links)
- (Q3906438) (← links)
- Approximation Algorithms for Several Graph Augmentation Problems (Q3910552) (← links)
- Fast, Efficient Parallel Algorithms for Some Graph Problems (Q3932299) (← links)
- Parallel Algorithms in Graph Theory: Planarity Testing (Q3957959) (← links)
- Evaluation of Arithmetic Expressions with Algebraic Identities (Q3959418) (← links)
- (Q4023519) (← links)
- Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima (Q4302276) (← links)
- Achieving Native GPU Performance for Out-of-Card Large Dense Matrix Multiplication (Q4598919) (← links)
- Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry (Q5317207) (← links)
- Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition (Q5375453) (← links)
- A new approach to realizing partially symmetric functions (Q5375483) (← links)
- Irredundant intervals (Q5463367) (← links)
- Power balance and apportionment algorithms for the United States Congress (Q5463383) (← links)
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting (Q5712144) (← links)
- Algorithms and Computation (Q5712169) (← links)
- Algorithms and Data Structures (Q5900745) (← links)
