| Publication | Date of Publication | Type |
|---|
Average circuit depth and average communication complexity
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Global strategies for augmenting the efficiency of TSP heuristics
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Self-correcting for function fields of finite transcendental degree
Automata, Languages and Programming | 2019-01-10 | Paper |
Spectral analysis of Boolean functions as a graph eigenvalue problem
IEEE Transactions on Computers | 2018-07-09 | Paper |
A characterization of bent functions in terms of strongly regular graphs
IEEE Transactions on Computers | 2018-07-09 | Paper |
Checking properties of polynomials
Automata, Languages and Programming | 2018-07-04 | Paper |
An experimental study of different approaches to solve the market equilibrium problem
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
Checking approximate computations over the reals
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
On the polynomial time computation of equilibria for certain exchange economies
| 2014-10-13 | Paper |
Leontief economies encode nonzero sum two-player games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Market equilibrium via the excess demand function
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
Information Processing Letters | 2009-12-04 | Paper |
Approximation algorithms for a hierarchically structured bin packing problem
Information Processing Letters | 2009-07-09 | Paper |
Computing Equilibrium Prices in Exchange Economies with Tax Distortions
Automata, Languages and Programming | 2009-03-12 | Paper |
The complexity of equilibria: Hardness results for economies via a correspondence with games
Theoretical Computer Science | 2008-12-12 | Paper |
An optimal multiprocessor combinatorial auction solver
Computers & Operations Research | 2008-10-08 | Paper |
Computation of market equilibria by convex programming
| 2008-09-12 | Paper |
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
Lecture Notes in Computer Science | 2008-03-11 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
scientific article; zbMATH DE number 2197920 (Why is no real title available?)
| 2005-08-23 | Paper |
On the hardness of approximating the permanent of structured matrices
Computational Complexity | 2004-05-27 | Paper |
Computation of sparse circulant permanents via determinants
Linear Algebra and its Applications | 2003-02-05 | Paper |
scientific article; zbMATH DE number 1760004 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1538937 (Why is no real title available?)
| 2002-01-02 | Paper |
scientific article; zbMATH DE number 1577997 (Why is no real title available?)
| 2001-09-20 | Paper |
The role of arithmetic in fast parallel matrix inversion
Algorithmica | 2001-08-09 | Paper |
scientific article; zbMATH DE number 1507223 (Why is no real title available?)
| 2001-02-12 | Paper |
Matrix rigidity
Linear Algebra and its Applications | 2001-01-03 | Paper |
Matrix rank and communication complexity
Linear Algebra and its Applications | 2001-01-03 | Paper |
Some structural properties of low-rank matrices related to computational complexity
Theoretical Computer Science | 2000-06-04 | Paper |
scientific article; zbMATH DE number 1453451 (Why is no real title available?)
| 2000-05-28 | Paper |
scientific article; zbMATH DE number 1453452 (Why is no real title available?)
| 2000-05-28 | Paper |
How fast can one compute the permanent of circulant matrices?
Linear Algebra and its Applications | 1999-11-29 | Paper |
Hardness results and spectral techniques for combinatorial problems on circulant graphs
Linear Algebra and its Applications | 1999-11-28 | Paper |
Parallel algorithms for certain matrix computations
Theoretical Computer Science | 1998-07-22 | Paper |
On the permanent of certain \((0,1)\) Toeplitz matrices
Linear Algebra and its Applications | 1997-11-18 | Paper |
A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
SIAM Journal on Matrix Analysis and Applications | 1997-10-19 | Paper |
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
INFORMS Journal on Computing | 1997-07-06 | Paper |
Strong NP-completeness of a matrix similarity problem
Theoretical Computer Science | 1997-02-27 | Paper |
Algebraic techniques in communication complexity
Information Processing Letters | 1997-02-27 | Paper |
Transitive Cellular Automata are Sensitive
The American Mathematical Monthly | 1996-09-12 | Paper |
The Padé method for computing the matrix exponential
Linear Algebra and its Applications | 1996-06-30 | Paper |
Checking robust nonsingularity of tridiagonal matrices in linear time
BIT | 1996-06-09 | Paper |
A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
Linear Algebra and its Applications | 1995-07-03 | Paper |
Oracle computations in parallel numerical linear algebra
Theoretical Computer Science | 1994-10-30 | Paper |
Error analysis of two algorithms for the computation of the matrix exponential
Calcolo | 1993-05-24 | Paper |
scientific article; zbMATH DE number 108376 (Why is no real title available?)
| 1993-01-23 | Paper |
Traveling salesman problem and local search
Applied Mathematics Letters | 1993-01-06 | Paper |
Parallel algebraic reductions among numerical problems
Applied Mathematics Letters | 1992-09-26 | Paper |
Matrix inversion in RNC\(^ 1\)
Journal of Complexity | 1992-06-26 | Paper |
Parallelism and fast solution of linear systems
Computers & Mathematics with Applications | 1990-01-01 | Paper |
Parallel solution of linear systems by repeated squaring
Applied Mathematics Letters | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4182691 (Why is no real title available?)
| 1990-01-01 | Paper |
A fast algorithm for the division of two polynomial matrices
IEEE Transactions on Automatic Control | 1989-01-01 | Paper |
A Monte Carlo method for the parallel solution of linear systems
Journal of Complexity | 1989-01-01 | Paper |
A Note on Quadrant Interlocking Factorization
IMA Journal of Numerical Analysis | 1989-01-01 | Paper |
Parallel solution of block tridiagonal linear systems
Linear Algebra and its Applications | 1988-01-01 | Paper |
Fast parallel algorithms for matrix inversion and linear systems solution
Applied Mathematics Letters | 1988-01-01 | Paper |
The bit-cost of some algorithms for the solution of linear systems
Computers & Mathematics with Applications | 1988-01-01 | Paper |
Matrix-vector multiplication: Parallel algorithms and architectures
Computers & Mathematics with Applications | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4100489 (Why is no real title available?)
| 1988-01-01 | Paper |
New techniques for the solution of linear systems by iterative methods
Computers & Mathematics with Applications | 1987-01-01 | Paper |
Low rank modifications of Jacobi and JOR iterative methods
Computers & Mathematics with Applications | 1987-01-01 | Paper |
Iterative methods for the parallel solution of linear systems
Computers & Mathematics with Applications | 1987-01-01 | Paper |
On the VLSI complexity of some arithmetic and numerical problems
Calcolo | 1987-01-01 | Paper |
Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems
Calcolo | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4016032 (Why is no real title available?)
| 1986-01-01 | Paper |
A VLSI fast solver for tridiagonal linear systems
Information Processing Letters | 1986-01-01 | Paper |
Area-time tradeoffs for bilinear forms computations in VLSI
Information Processing Letters | 1986-01-01 | Paper |
Area-time complexity of the unconstrained minimization problem
Calcolo | 1986-01-01 | Paper |
The matrix equation MX + XN = B in the VLSI model
International Journal of Computer Mathematics | 1986-01-01 | Paper |
VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
Information Processing Letters | 1985-01-01 | Paper |
