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