ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Latest Publications
TOTAL DOCUMENTS
92
(FIVE YEARS 0)
H-INDEX
22
(FIVE YEARS 0)
Published By IEEE
9780769548746, 9781467343831
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.9
◽
2012
◽
Cited By ~ 8
Author(s):
Lyle Ramshaw
◽
Robert E. Tarjan
Keyword(s):
Bipartite Graphs
◽
Weight Scaling
Download Full-text
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.36
◽
2012
◽
Cited By ~ 42
Author(s):
Zhiyi Huang
◽
Sampath Kannan
Keyword(s):
Social Welfare
Download Full-text
[Copyright notice]
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.3
◽
2012
◽
Keyword(s):
Copyright Notice
Download Full-text
Combinatorial Coloring of 3-Colorable Graphs
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.16
◽
2012
◽
Cited By ~ 7
Author(s):
Ken-ichi Kawarabayashi
◽
Mikkel Thorup
Download Full-text
Constructing Non-malleable Commitments: A Black-Box Approach
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.47
◽
2012
◽
Cited By ~ 39
Author(s):
Vipul Goyal
◽
Chen-Kuei Lee
◽
Rafail Ostrovsky
◽
Ivan Visconti
Keyword(s):
Black Box
Download Full-text
Table of contents
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.8
◽
2012
◽
Download Full-text
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.45
◽
2012
◽
Cited By ~ 1
Author(s):
Costas Busch
◽
Chinmoy Dutta
◽
Jaikumar Radhakrishnan
◽
Rajmohan Rajaraman
◽
Srivathsan Srinivasagopalan
Keyword(s):
Steiner Trees
Download Full-text
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.11
◽
2012
◽
Cited By ~ 19
Author(s):
Tsuyoshi Ito
◽
Thomas Vidick
Keyword(s):
Interactive Proof
Download Full-text
An Additive Combinatorics Approach Relating Rank to Communication Complexity
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.39
◽
2012
◽
Cited By ~ 6
Author(s):
Eli Ben-Sasson
◽
Shachar Lovett
◽
Noga Ron-Zewi
Keyword(s):
Communication Complexity
◽
Additive Combinatorics
Download Full-text
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
◽
10.1109/focs.2012.54
◽
2012
◽
Cited By ~ 12
Author(s):
Julia Chuzhoy
◽
Shi Li
Keyword(s):
Approximation Algorithm
◽
Disjoint Paths
◽
Edge Disjoint
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close