Proceedings of 37th Conference on Foundations of Computer Science SFCS-96
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818675942

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Maximum likelihood decoding of Reed Solomon codes

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548475 ◽

2002 ◽

Cited By ~ 4

Author(s):

M. Sudan

Keyword(s):

Maximum Likelihood ◽

Maximum Likelihood Decoding ◽

Reed Solomon Codes

Download Full-text

Computing permanents over fields of characteristic 3: where and why it becomes difficult

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548469 ◽

2002 ◽

Cited By ~ 2

Author(s):

G. Kogan

Keyword(s):

Characteristic 3

Download Full-text

Polynomial simulations of decohered quantum computers

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548463 ◽

2002 ◽

Cited By ~ 9

Author(s):

D. Aharonov ◽

M. Ben-Or

Keyword(s):

Quantum Computers

Download Full-text

Learning linear transformations

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548495 ◽

2002 ◽

Cited By ~ 11

Author(s):

A. Frieze ◽

M. Jerrum ◽

R. Kannan

Keyword(s):

Linear Transformations

Download Full-text

Potential of the approximation method

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548502 ◽

2002 ◽

Cited By ~ 5

Author(s):

K. Amano ◽

A. Maruoka

Keyword(s):

Approximation Method

Download Full-text

New lower bounds for halfspace emptiness

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548506 ◽

2002 ◽

Cited By ~ 1

Author(s):

J. Erickson

Keyword(s):

Lower Bounds

Download Full-text

The regularity lemma and approximation schemes for dense problems

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548459 ◽

2002 ◽

Cited By ~ 33

Author(s):

A. Frieze ◽

R. Kannan

Keyword(s):

Approximation Schemes ◽

Regularity Lemma

Download Full-text

Optimal dynamic interval management in external memory

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548515 ◽

2002 ◽

Cited By ~ 35

Author(s):

L. Arge ◽

J.S. Vitter

Keyword(s):

External Memory ◽

Optimal Dynamic

Download Full-text

Gadgets, approximation, and linear programming

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548521 ◽

2002 ◽

Cited By ~ 16

Author(s):

L. Trevisan ◽

G.B. Sorkin ◽

M. Sudan ◽

D.P. Williamson

Keyword(s):

Linear Programming

Download Full-text

A 3-approximation for the minimum tree spanning k vertices

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96 ◽

10.1109/sfcs.1996.548489 ◽

2002 ◽

Cited By ~ 37

Author(s):

N. Garg

Download Full-text

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Maximum likelihood decoding of Reed Solomon codes

Computing permanents over fields of characteristic 3: where and why it becomes difficult

Polynomial simulations of decohered quantum computers

Learning linear transformations

Potential of the approximation method

New lower bounds for halfspace emptiness

The regularity lemma and approximation schemes for dense problems

Optimal dynamic interval management in external memory

Gadgets, approximation, and linear programming

A 3-approximation for the minimum tree spanning k vertices

Proceedings of 37th Conference on Foundations of Computer Science SFCS-96
Latest Publications