40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769504094

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Edge-disjoint routing in plane switch graphs in linear time

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814604 ◽

2003 ◽

Cited By ~ 1

Author(s):

K. Weihe

Keyword(s):

Linear Time ◽

Edge Disjoint

Hardness of approximating Σ/sub 2//sup p/ minimization problems

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814619 ◽

2003 ◽

Cited By ~ 5

Author(s):

C. Umans

Keyword(s):

Minimization Problems

Long-lived adaptive collect with applications

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814598 ◽

2003 ◽

Cited By ~ 19

Author(s):

Y. Afek ◽

G. Stupp ◽

D. Touitou

An algorithmic theory of learning: robust concepts and random projection

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814637 ◽

2003 ◽

Cited By ~ 59

Author(s):

R.I. Arriaga ◽

S. Vempala

Keyword(s):

Random Projection

Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814628 ◽

2003 ◽

Cited By ~ 86

Author(s):

A. Sahai

Keyword(s):

Zero Knowledge ◽

Chosen Ciphertext Security ◽

Adaptive Chosen Ciphertext Security

Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814580 ◽

2003 ◽

Cited By ~ 62

Author(s):

V. King

Keyword(s):

Transitive Closure ◽

Shortest Paths ◽

Dynamic Algorithms ◽

All Pairs Shortest Paths

Algorithmic aspects of protein structure similarity

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814624 ◽

2003 ◽

Cited By ~ 58

Author(s):

D. Goldman ◽

S. Istrail ◽

C.H. Papadimitriou

Keyword(s):

Protein Structure ◽

Structure Similarity

Random walks on truncated cubes and sampling 0-1 knapsack solutions

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814595 ◽

2003 ◽

Cited By ~ 6

Author(s):

B. Morris ◽

A. Sinclair

Keyword(s):

Random Walks

Error reduction for extractors

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814591 ◽

2003 ◽

Cited By ~ 12

Author(s):

R. Raz ◽

O. Reingold ◽

S. Vadhan

Keyword(s):

Error Reduction

Cuts, trees and l/sub 1/-embeddings of graphs

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) ◽

10.1109/sffcs.1999.814611 ◽

2003 ◽

Cited By ~ 4

Author(s):

A. Gupta ◽

I. Newman ◽

Y. Rabinovich ◽

A. Sinclair

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Edge-disjoint routing in plane switch graphs in linear time

Hardness of approximating Σ/sub 2//sup p/ minimization problems

Long-lived adaptive collect with applications

An algorithmic theory of learning: robust concepts and random projection

Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security

Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs

Algorithmic aspects of protein structure similarity

Random walks on truncated cubes and sampling 0-1 knapsack solutions

Error reduction for extractors

Cuts, trees and l/sub 1/-embeddings of graphs

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
Latest Publications