UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 76

Sortiert nach

An improved exponential-time algorithm for k -SAT

Journal of the ACM, 2005-05, Vol.52 (3), p.337-364

2005

Volltextzugriff (PDF)

An optimal on-line algorithm for metrical task system

Journal of the ACM, 1992-10, Vol.39 (4), p.745-763

1992

Volltextzugriff (PDF)

Size-depth tradeoffs for threshold circuits

SIAM journal on computing, 1997-06, Vol.26 (3), p.693-707

1997

Volltextzugriff (PDF)

Almost Linear Size Edit Distance Sketch

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.956-967

2024

Volltextzugriff (PDF)

Special issue “Conference on Computational Complexity 2014” Guest Editor’s Foreword

Computational complexity, 2015-06, Vol.24 (2), p.197-199

Saks, Michael E.

2015

Volltextzugriff (PDF)

On Online Labeling with Large Label Set

SIAM journal on discrete mathematics, 2019-01, Vol.33 (3), p.1175-1193

2019

Volltextzugriff (PDF)

Low distortion euclidean embeddings of trees

Israel journal of mathematics, 1998-01, Vol.106 (1), p.339-348

1998

Volltextzugriff (PDF)

An improved exponential-time algorithm for κ-SAT

Journal of the ACM, 2005, Vol.52 (3), p.337-364

2005

Volltextzugriff (PDF)

Size-depth trade-offs for threshold circuits

Annual ACM Symposium on Theory of Computing: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing; 16-18 May 1993, 1993, p.541-550

1993

Volltextzugriff (PDF)

A Limit Theorem for (min, +) Matrix Multiplication

Mathematics of operations research, 1988-11, Vol.13 (4), p.606-618

Saks, Michael E

1988

Volltextzugriff (PDF)

An improved exponential-time algorithm for k-SAT

Annual Symposium on Foundations of Computer Science, 1998, p.628-637

1998

Volltextzugriff (PDF)

A New Approach to the Sensitivity Conjecture

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015, p.247-254

2015

Volltextzugriff (PDF)

Trees and Euclidean metrics

Annual ACM Symposium on Theory of Computing: Proceedings of the thirtieth annual ACM symposium on Theory of computing; 24-26 May 1998, 1998, p.169-175

1998

Volltextzugriff (PDF)

Exponential lower bounds for depth 3 Boolean circuits

Annual ACM Symposium on Theory of Computing: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing; 04-06 May 1997, 1997, p.86-91

1997

Volltextzugriff (PDF)

Approximating Threshold Circuits by Rational Functions

Information and computation, 1994-08, Vol.112 (2), p.257-272

1994

Volltextzugriff (PDF)

On computing majority by comparisons

Combinatorica (Budapest. 1981), 1991-12, Vol.11 (4), p.383-387

1991

Volltextzugriff (PDF)

Exponential lower bounds for depth three Boolean circuits

Computational complexity, 2000-11, Vol.9 (1), p.1-15

2000

Volltextzugriff (PDF)

On threshold circuits for parity (abstract)

Annual Workshop on Computational Learning Theory: Proceedings of the third annual workshop on Computational learning theory; 06-08 Aug. 1990, 1990, p.390-390

1990

Volltextzugriff (PDF)