2009 50th Annual IEEE Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9781424451166

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

[Front cover]

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.83 ◽

2009 ◽

Keyword(s):

Front Cover

Download Full-text

Dynamic and Non-uniform Pricing Strategies for Revenue Maximization

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.43 ◽

2009 ◽

Cited By ~ 7

Author(s):

Tanmoy Chakraborty ◽

Zhiyi Huang ◽

Sanjeev Khanna

Keyword(s):

Revenue Maximization ◽

Pricing Strategies ◽

Uniform Pricing

Download Full-text

Reducibility among Fractional Stability Problems

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.57 ◽

2009 ◽

Cited By ~ 15

Author(s):

Shiva Kintali ◽

Laura J. Poplawski ◽

Rajmohan Rajaraman ◽

Ravi Sundaram ◽

Shang-Hua Teng

Keyword(s):

Stability Problems

Download Full-text

Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.73 ◽

2009 ◽

Cited By ~ 22

Author(s):

Prasad Raghavendra ◽

David Steurer

Keyword(s):

Integrality Gaps ◽

Unique Games

Download Full-text

Space-Efficient Framework for Top-k String Retrieval Problems

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.19 ◽

2009 ◽

Cited By ~ 51

Author(s):

Wing-Kai Hon ◽

Rahul Shah ◽

Jeffrey Scott Vitter

Download Full-text

Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.81 ◽

2009 ◽

Cited By ~ 15

Author(s):

Gagan Goel ◽

Chinmay Karande ◽

Pushkar Tripathi ◽

Lei Wang

Keyword(s):

Combinatorial Problems ◽

Cost Functions ◽

Multi Agent

Download Full-text

Efficient Sketches for Earth-Mover Distance, with Applications

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.25 ◽

2009 ◽

Cited By ~ 14

Author(s):

Alexandr Andoni ◽

Khanh Do Ba ◽

Piotr Indyk ◽

David Woodruff

Keyword(s):

Earth Mover

Download Full-text

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.9 ◽

2009 ◽

Cited By ~ 18

Author(s):

Zeev Nutov

Keyword(s):

Minimum Cost

Download Full-text

Two-Message Quantum Interactive Proofs Are in PSPACE

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.30 ◽

2009 ◽

Cited By ~ 13

Author(s):

Rahul Jain ◽

Sarvagya Upadhyay ◽

John Watrous

Keyword(s):

Interactive Proofs

Download Full-text

The Complexity of Rationalizing Network Formation

2009 50th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2009.48 ◽

2009 ◽

Cited By ~ 2

Author(s):

Shankar Kalyanaraman ◽

Christopher Umans

Keyword(s):

Network Formation

Download Full-text

2009 50th Annual IEEE Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

[Front cover]

Dynamic and Non-uniform Pricing Strategies for Revenue Maximization

Reducibility among Fractional Stability Problems

Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES

Space-Efficient Framework for Top-k String Retrieval Problems

Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions

Efficient Sketches for Earth-Mover Distance, with Applications

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

Two-Message Quantum Interactive Proofs Are in PSPACE

The Complexity of Rationalizing Network Formation

2009 50th Annual IEEE Symposium on Foundations of Computer Science
Latest Publications