2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

100

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9780769545714, 9781457718434

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Range Searching in the Group Model and Combinatorial Discrepancy

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.14 ◽

2011 ◽

Cited By ~ 4

Author(s):

Kasper Green Larsen

Keyword(s):

Range Searching ◽

Group Model ◽

Combinatorial Discrepancy

Download Full-text

Efficient and Explicit Coding for Interactive Communication

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.51 ◽

2011 ◽

Cited By ~ 37

Author(s):

Ran Gelles ◽

Ankur Moitra ◽

Amit Sahai

Keyword(s):

Interactive Communication

Download Full-text

Mechanism Design with Set-Theoretic Beliefs

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.11 ◽

2011 ◽

Cited By ~ 2

Author(s):

Jing Chen ◽

Silvio Micali

Keyword(s):

Mechanism Design

Download Full-text

Foreword

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.4 ◽

2011 ◽

Download Full-text

New Extension of the Weil Bound for Character Sums with Applications to Coding

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.41 ◽

2011 ◽

Cited By ~ 8

Author(s):

Tali Kaufman ◽

Shachar Lovett

Keyword(s):

Character Sums ◽

Weil Bound

Download Full-text

Balls and Bins: Smaller Hash Families and Faster Evaluation

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.49 ◽

2011 ◽

Cited By ~ 6

Author(s):

L. Elisa Celis ◽

Omer Reingold ◽

Gil Segev ◽

Udi Wieder

Download Full-text

A Nearly-m log n Time Solver for SDD Linear Systems

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.85 ◽

2011 ◽

Cited By ~ 48

Author(s):

Ioannis Koutis ◽

Gary L. Miller ◽

Richard Peng

Keyword(s):

Linear Systems

Download Full-text

Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.15 ◽

2011 ◽

Cited By ~ 5

Author(s):

Christian Wulff-Nilsen

Keyword(s):

Minor Free Graphs

Download Full-text

Approximating Graphic TSP by Matchings

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.56 ◽

2011 ◽

Cited By ~ 29

Author(s):

Tobias Moemke ◽

Ola Svensson

Download Full-text

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.23 ◽

2011 ◽

Cited By ~ 112

Author(s):

Marek Cygan ◽

Jesper Nederlof ◽

Marcin Pilipczuk ◽

Michal Pilipczuk ◽

Joham M.M. van Rooij ◽

...

Keyword(s):

Exponential Time ◽

Single Exponential

Download Full-text

2011 IEEE 52nd Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

On Range Searching in the Group Model and Combinatorial Discrepancy

Efficient and Explicit Coding for Interactive Communication

Mechanism Design with Set-Theoretic Beliefs

Foreword

New Extension of the Weil Bound for Character Sums with Applications to Coding

Balls and Bins: Smaller Hash Families and Faster Evaluation

A Nearly-m log n Time Solver for SDD Linear Systems

Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

Approximating Graphic TSP by Matchings

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Latest Publications