ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
Latest Publications
TOTAL DOCUMENTS
82
(FIVE YEARS 0)
H-INDEX
21
(FIVE YEARS 0)
Published By IEEE Comput. Soc
0769518222
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Correlation clustering
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181947
◽
2003
◽
Cited By ~ 68
Author(s):
N. Bansal
◽
A. Blum
◽
S. Chawla
Keyword(s):
Correlation Clustering
Download Full-text
On random symmetric travelling salesman problems
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1182004
◽
2003
◽
Author(s):
A. Frieze
Keyword(s):
Travelling Salesman
Download Full-text
Graph isomorphism is in SPP
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181999
◽
2003
◽
Cited By ~ 15
Author(s):
V. Arvind
◽
P.P. Kurur
Keyword(s):
Graph Isomorphism
Download Full-text
On the (non)universality of the one-time pad
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181962
◽
2003
◽
Cited By ~ 21
Author(s):
Y. Dodis
◽
J. Spencer
Keyword(s):
The One
Download Full-text
Auctions with severely bounded communication
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181965
◽
2003
◽
Cited By ~ 13
Author(s):
L. Blumrosen
◽
N. Nisan
Download Full-text
Quantum computation and lattice problems
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181976
◽
2003
◽
Cited By ~ 12
Author(s):
O. Regev
Keyword(s):
Quantum Computation
Download Full-text
Abstract combinatorial programs and efficient property testers
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181885
◽
2003
◽
Cited By ~ 3
Author(s):
A. Czumaj
◽
C. Sohler
Download Full-text
Zero-knowledge: abstract of a tutorial
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181876
◽
2003
◽
Cited By ~ 1
Author(s):
O. Goldreich
Keyword(s):
Zero Knowledge
Download Full-text
Dependent rounding in bipartite graphs
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181955
◽
2003
◽
Cited By ~ 18
Author(s):
R. Gandhi
◽
S. Khuller
◽
S. Parthasarathy
◽
A. Srinivasan
Keyword(s):
Bipartite Graphs
Download Full-text
The parameterized complexity of counting problems
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
◽
10.1109/sfcs.2002.1181978
◽
2003
◽
Cited By ~ 8
Author(s):
J. Flum
◽
M. Grohe
Keyword(s):
Parameterized Complexity
◽
Counting Problems
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close