| Publication | Date of Publication | Type |
|---|
A new approach to realizing partially symmetric functions
IEEE Transactions on Computers | 2018-09-14 | Paper |
Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition
IEEE Transactions on Computers | 2018-09-14 | Paper |
Achieving Native GPU Performance for Out-of-Card Large Dense Matrix Multiplication
Parallel Processing Letters | 2017-12-15 | Paper |
Fast algorithms for a class of temporal range queries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Information Processing Letters | 2009-12-04 | Paper |
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
Journal of Parallel and Distributed Computing | 2007-05-23 | Paper |
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
Algorithms and Computation | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
SIAM Journal on Computing | 2005-09-16 | Paper |
Power balance and apportionment algorithms for the United States Congress
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Irredundant intervals
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science | 2005-04-06 | Paper |
Prefix computations on symmetric multiprocessors
Journal of Parallel and Distributed Computing | 2001-08-14 | Paper |
A randomized parallel sorting algorithm with an experimental study
Journal of Parallel and Distributed Computing | 1999-03-30 | Paper |
Sorting strings and constructing digital search trees in parallel
Theoretical Computer Science | 1997-09-09 | Paper |
Using synthetic perturbations and statistical screening to assay shared-memory programs
Information Processing Letters | 1997-02-28 | Paper |
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima
SIAM Journal on Computing | 1994-08-14 | Paper |
An efficient parallel algorithm for the single function coarsest partition problem
Theoretical Computer Science | 1994-07-31 | Paper |
On the difficulty of Manhattan channel routing
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 107951 (Why is no real title available?) | 1993-01-23 | Paper |
Load balancing and routing on the hypercube and related networks
Journal of Parallel and Distributed Computing | 1993-01-17 | Paper |
Optimal algorithms for adjacent side routing
Algorithmica | 1991-01-01 | Paper |
Parallel Algorithms for Channel Routing in the Knock-Knee Model
SIAM Journal on Computing | 1991-01-01 | Paper |
Parallel algorithms for planar graph isomorphism and related problems
IEEE Transactions on Circuits and Systems | 1988-01-01 | Paper |
On the Validity of the Direct Sum Conjecture
SIAM Journal on Computing | 1986-01-01 | Paper |
Improved lower bounds for some matrix multiplication problems
Information Processing Letters | 1985-01-01 | Paper |
Parallel Sorting with Serial Memories
IEEE Transactions on Computers | 1985-01-01 | Paper |
Information Transfer in Distributed Computing with Applications to VLSI
Journal of the ACM | 1984-01-01 | Paper |
The VLSI Complexity of Selected Graph Problems
Journal of the ACM | 1984-01-01 | Paper |
Information Transfer under Different Sets of Protocols
SIAM Journal on Computing | 1984-01-01 | Paper |
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers | 1984-01-01 | Paper |
Time-Space trade-offs for some algebraic problems
Journal of the ACM | 1983-01-01 | Paper |
On the relationship between the biconnectivity augmentation and traveling salesman problems
Theoretical Computer Science | 1982-01-01 | Paper |
Parallel Algorithms in Graph Theory: Planarity Testing
SIAM Journal on Computing | 1982-01-01 | Paper |
Space efficient algorithms for some graph theoretical problems
Acta Informatica | 1982-01-01 | Paper |
Evaluation of Arithmetic Expressions with Algebraic Identities
SIAM Journal on Computing | 1982-01-01 | Paper |
The computational complexity of a set of quadratic functions
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Fast, Efficient Parallel Algorithms for Some Graph Problems
SIAM Journal on Computing | 1981-01-01 | Paper |
Approximation Algorithms for Several Graph Augmentation Problems
SIAM Journal on Computing | 1981-01-01 | Paper |
On the Complexity of Bilinear Forms with Commutativity
SIAM Journal on Computing | 1980-01-01 | Paper |
On the complexity of computing bilinear forms with \(\{0,1\}\) constants
Journal of Computer and System Sciences | 1980-01-01 | Paper |
Computations of Bilinear Forms over Finite Fields
Journal of the ACM | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3714956 (Why is no real title available?) | 1980-01-01 | Paper |
Optimal Evaluation of Pairs of Bilinear Forms
SIAM Journal on Computing | 1979-01-01 | Paper |
An Addendum to Kronecker’s Theory of Pencils
SIAM Journal on Applied Mathematics | 1979-01-01 | Paper |
