| Publication | Date of Publication | Type |
|---|
| Average circuit depth and average communication complexity | 2023-05-08 | Paper |
| Global strategies for augmenting the efficiency of TSP heuristics | 2023-01-18 | Paper |
| Self-correcting for function fields of finite transcendental degree | 2019-01-10 | Paper |
| A characterization of bent functions in terms of strongly regular graphs | 2018-07-09 | Paper |
| Spectral analysis of Boolean functions as a graph eigenvalue problem | 2018-07-09 | Paper |
| Checking properties of polynomials | 2018-07-04 | Paper |
| An experimental study of different approaches to solve the market equilibrium problem | 2017-06-15 | Paper |
| Checking approximate computations over the reals | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921655 | 2014-10-13 | Paper |
| Market equilibrium via the excess demand function | 2010-08-16 | Paper |
| Leontief economies encode nonzero sum two-player games | 2010-08-16 | Paper |
| On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games | 2009-12-04 | Paper |
| Approximation algorithms for a hierarchically structured bin packing problem | 2009-07-09 | Paper |
| Computing Equilibrium Prices in Exchange Economies with Tax Distortions | 2009-03-12 | Paper |
| The complexity of equilibria: Hardness results for economies via a correspondence with games | 2008-12-12 | Paper |
| An optimal multiprocessor combinatorial auction solver | 2008-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524715 | 2008-09-12 | Paper |
| Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games | 2008-03-11 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466063 | 2005-08-23 | Paper |
| On the hardness of approximating the permanent of structured matrices | 2004-05-27 | Paper |
| Computation of sparse circulant permanents via determinants | 2003-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536926 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4519381 | 2002-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704232 | 2001-09-20 | Paper |
| The role of arithmetic in fast parallel matrix inversion | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503943 | 2001-02-12 | Paper |
| Matrix rigidity | 2001-01-03 | Paper |
| Matrix rank and communication complexity | 2001-01-03 | Paper |
| Some structural properties of low-rank matrices related to computational complexity | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955547 | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955548 | 2000-05-28 | Paper |
| How fast can one compute the permanent of circulant matrices? | 1999-11-29 | Paper |
| Hardness results and spectral techniques for combinatorial problems on circulant graphs | 1999-11-28 | Paper |
| Parallel algorithms for certain matrix computations | 1998-07-22 | Paper |
| On the permanent of certain \((0,1)\) Toeplitz matrices | 1997-11-18 | Paper |
| A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices | 1997-10-19 | Paper |
| Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP | 1997-07-06 | Paper |
| Strong NP-completeness of a matrix similarity problem | 1997-02-27 | Paper |
| Algebraic techniques in communication complexity | 1997-02-27 | Paper |
| Transitive Cellular Automata are Sensitive | 1996-09-12 | Paper |
| The Padé method for computing the matrix exponential | 1996-06-30 | Paper |
| Checking robust nonsingularity of tridiagonal matrices in linear time | 1996-06-09 | Paper |
| A fast and stable parallel QR algorithm for symmetric tridiagonal matrices | 1995-07-03 | Paper |
| Oracle computations in parallel numerical linear algebra | 1994-10-30 | Paper |
| Error analysis of two algorithms for the computation of the matrix exponential | 1993-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023834 | 1993-01-23 | Paper |
| Traveling salesman problem and local search | 1993-01-06 | Paper |
| Parallel algebraic reductions among numerical problems | 1992-09-26 | Paper |
| Matrix inversion in RNC\(^ 1\) | 1992-06-26 | Paper |
| Parallelism and fast solution of linear systems | 1990-01-01 | Paper |
| Parallel solution of linear systems by repeated squaring | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5748802 | 1990-01-01 | Paper |
| A Monte Carlo method for the parallel solution of linear systems | 1989-01-01 | Paper |
| A fast algorithm for the division of two polynomial matrices | 1989-01-01 | Paper |
| A Note on Quadrant Interlocking Factorization | 1989-01-01 | Paper |
| Fast parallel algorithms for matrix inversion and linear systems solution | 1988-01-01 | Paper |
| Parallel solution of block tridiagonal linear systems | 1988-01-01 | Paper |
| The bit-cost of some algorithms for the solution of linear systems | 1988-01-01 | Paper |
| Matrix-vector multiplication: Parallel algorithms and architectures | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826004 | 1988-01-01 | Paper |
| New techniques for the solution of linear systems by iterative methods | 1987-01-01 | Paper |
| Low rank modifications of Jacobi and JOR iterative methods | 1987-01-01 | Paper |
| Iterative methods for the parallel solution of linear systems | 1987-01-01 | Paper |
| On the VLSI complexity of some arithmetic and numerical problems | 1987-01-01 | Paper |
| Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems | 1986-01-01 | Paper |
| Area-time tradeoffs for bilinear forms computations in VLSI | 1986-01-01 | Paper |
| Area-time complexity of the unconstrained minimization problem | 1986-01-01 | Paper |
| A VLSI fast solver for tridiagonal linear systems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028201 | 1986-01-01 | Paper |
| The matrix equation MX + XN = B in the VLSI model | 1986-01-01 | Paper |
| VLSI implementation of fast solvers for band linear systems with constant coefficient matrix | 1985-01-01 | Paper |
