2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9780769548746, 9781467343831

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2012.8 ◽

2012 ◽

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

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):

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

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

Matching with Our Eyes Closed

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2012.19 ◽

2012 ◽

Cited By ~ 7

Author(s):

Gagan Goel ◽

Pushkar Tripathi

Keyword(s):

Eyes Closed

Download Full-text

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2012.73 ◽

2012 ◽

Cited By ~ 79

Author(s):

Niv Buchbinder ◽

Moran Feldman ◽

Joseph Naor ◽

Roy Schwartz

Keyword(s):

Linear Time ◽

Submodular Maximization

Download Full-text

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Table of contents

Constructing Non-malleable Commitments: A Black-Box Approach

A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs

The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal

[Copyright notice]

Combinatorial Coloring of 3-Colorable Graphs

An Additive Combinatorics Approach Relating Rank to Communication Complexity

A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2

Matching with Our Eyes Closed

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

Export Citation Format

2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Table of contents

Constructing Non-malleable Commitments: A Black-Box Approach

A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs

The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal

[Copyright notice]

Combinatorial Coloring of 3-Colorable Graphs

An Additive Combinatorics Approach Relating Rank to Communication Complexity

A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2

Matching with Our Eyes Closed

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Latest Publications