44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Computer. Soc

0769520405

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Machine learning: my favorite results, directions, and open problems

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238174 ◽

2005 ◽

Author(s):

A. Blum

Keyword(s):

Machine Learning ◽

Open Problems

Download Full-text

Rank bounds and integrality gaps for cutting planes procedures

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238206 ◽

2004 ◽

Cited By ~ 10

Author(s):

J. Buresh-Oppenheim ◽

N. Galesi ◽

S. Hoory ◽

A. Magen ◽

T. Pitassi

Keyword(s):

Cutting Planes ◽

Integrality Gaps

Download Full-text

Performance analysis of dynamic processes

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238176 ◽

2004 ◽

Author(s):

E. Upfal

Keyword(s):

Performance Analysis ◽

Dynamic Processes

Download Full-text

On worst-case to average-case reductions for NP problems

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238205 ◽

2004 ◽

Cited By ~ 15

Author(s):

A. Bogdanov ◽

L. Trevisan

Keyword(s):

Worst Case ◽

Average Case ◽

Np Problems

Download Full-text

Bounded-concurrent secure two-party computation in a constant number of rounds

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238214 ◽

2004 ◽

Cited By ~ 22

Author(s):

R. Pass ◽

A. Rosen

Keyword(s):

Constant Number

Download Full-text

Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238215 ◽

2004 ◽

Cited By ~ 4

Author(s):

D.A. Spielman ◽

Shang-Hua Teng

Keyword(s):

Linear Systems ◽

Diagonally Dominant

Download Full-text

Locally testable cyclic codes

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238186 ◽

2004 ◽

Cited By ~ 9

Author(s):

L. Babai ◽

A. Shpilka ◽

D. Stefankovic

Keyword(s):

Cyclic Codes

Download Full-text

On the impossibility of dimension reduction in /spl lscr//sub 1/

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238224 ◽

2004 ◽

Cited By ~ 2

Author(s):

B. Brinkman ◽

M. Charikar

Keyword(s):

Dimension Reduction

Download Full-text

Zero-knowledge sets

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238183 ◽

2004 ◽

Cited By ~ 41

Author(s):

S. Micali ◽

M. Rabin ◽

J. Kilian

Keyword(s):

Zero Knowledge

Download Full-text

On the implementation of huge random objects

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238182 ◽

2004 ◽

Cited By ~ 5

Author(s):

O. Goldreich ◽

S. Goldwasser ◽

A. Nussboim

Download Full-text

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Computer. Soc

Machine learning: my favorite results, directions, and open problems

Rank bounds and integrality gaps for cutting planes procedures

Performance analysis of dynamic processes

On worst-case to average-case reductions for NP problems

Bounded-concurrent secure two-party computation in a constant number of rounds

Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/

Locally testable cyclic codes

On the impossibility of dimension reduction in /spl lscr//sub 1/

Zero-knowledge sets

On the implementation of huge random objects

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Latest Publications