Searching...
Advanced Search
F
FOCS
2008
2008 49th Annual IEEE Symposium on Foundations of Computer Science
Abstract - Dense Subsets of Pseudorandom Sets
This Publication
Digital Library
Advanced Search
This Publication
Subscribe to this Publication
Login to access your subscribed content
Bibliographic References
ASCII Text
BibTex
Refworks Procite/RefMan
2008 49th Annual IEEE Symposium on Foundations of Computer Science
October 25-October 28
ISBN: 978-0-7695-3436-7
Table of Contents
Papers
Cover Art
(PDF)
pp. C4,C1
ABSTRACT
PDF
Title Page i
(PDF)
pp. i
ABSTRACT
PDF
Title Page iii
(PDF)
pp. iii
ABSTRACT
PDF
Copyright Page
(PDF)
pp. iv
ABSTRACT
PDF
Table of Contents
(PDF)
pp. v-xi
ABSTRACT
PDF
Foreword
(PDF)
pp. xii
ABSTRACT
PDF
Committees
(PDF)
pp. xiii
ABSTRACT
PDF
Reviewers
(PDF)
pp. xiv-xvi
ABSTRACT
PDF
The Polynomial Method in Quantum and Classical Computing
(Abstract)
Scott Aaronson
pp. 3
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Theory of Sponsored Search Auctions
(Abstract)
Gagan Aggarwal
S. Muthukrishnan
pp. 7
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Average-case Complexity
(Abstract)
Luca Trevisan
pp. 11
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Truthful Approximation Schemes for Single-Parameter Agents
(Abstract)
Peerapong Dhangwatnotai
Shahar Dobzinski
Shaddin Dughmi
Tim Roughgarden
pp. 15-24
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games
(Abstract)
Constantinos Daskalakis
Christos H. Papadimitriou
pp. 25-34
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply
(Abstract)
Maurice Cheung
Chaitanya Swamy
pp. 35-44
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
(Abstract)
Nikhil R. Devanur
Ravi Kannan
pp. 45-53
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Sign-Rank of AC^O
(Abstract)
Alexander A. Razborov
Alexander A. Sherstov
pp. 57-66
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Arithmetic Circuits: A Chasm at Depth Four
(Abstract)
Manindra Agrawal
V. Vinay
pp. 67-75
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Dense Subsets of Pseudorandom Sets
(Abstract)
Omer Reingold
Luca Trevisan
Madhur Tulsiani
Salil Vadhan
pp. 76-85
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Almost-Natural Proofs
(Abstract)
Timothy Y. Chow
pp. 86-91
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Dynamic Connectivity: Connecting to Networks and Geometry
(Abstract)
Timothy M. Chan
Mihai Patrascu
Liam Roditty
pp. 95-104
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Algorithms for Single-Source Vertex Connectivity
(Abstract)
Julia Chuzhoy
Sanjeev Khanna
pp. 105-114
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
(Abstract)
Glencora Borradaile
Philip N. Klein
Claire Mathieu
pp. 115-124
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Degree Bounded Network Design with Metric Costs
(Abstract)
Yuk Hei Chan
Wai Shing Fung
Lap Chi Lau
Chun Kong Yung
pp. 125-134
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
(Abstract)
Raphael Yuster
pp. 137-145
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast Modular Composition in any Characteristic
(Abstract)
Kiran S. Kedlaya
Christopher Umans
pp. 146-155
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes
(Abstract)
Elchanan Mossel
pp. 156-165
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Worst Case to Average Case Reductions for Polynomials
(Abstract)
Tali Kaufman
Shachar Lovett
pp. 166-175
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Union of Cylinders in Three Dimensions
(Abstract)
Esther Ezra
pp. 179-188
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Spherical Cubes and Rounding in High Dimensions
(Abstract)
Guy Kindler
Ryan OʼDonnell
Anup Rao
Avi Wigderson
pp. 189-198
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Near-Optimal Sparse Recovery in the L1 Norm
(Abstract)
Piotr Indyk
Milan Ruzic
pp. 199-207
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On Basing Lower-Bounds for Learning on Worst-Case Assumptions
(Abstract)
Benny Applebaum
Boaz Barak
David Xiao
pp. 211-220
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Bayesian Learner is Optimal for Noisy Binary Search
(Abstract)
Michael Ben-Or
Avinatan Hassidim
pp. 221-230
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Hardness of Minimizing and Learning DNF Expressions
(Abstract)
Subhash Khot
Rishi Saket
pp. 231-240
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Elections Can be Manipulated Often
(Abstract)
Ehud Friedgut
Gil Kalai
Noam Nisan
pp. 243-249
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Hardness of Being Truthful
(Abstract)
Christos Papadimitriou
Michael Schapira
Yaron Singer
pp. 250-259
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Multi-unit Auctions with Budget Limits
(Abstract)
Shahar Dobzinski
Ron Lavi
Noam Nisan
pp. 260-269
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors
(Abstract)
Ran Raz
Amir Yehudayoff
pp. 273-282
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
(Abstract)
Dan Boneh
Periklis Papakonstantinou
Charles Rackoff
Yevgeniy Vahlis
Brent Waters
pp. 283-292
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Leakage-Resilient Cryptography
(Abstract)
Stefan Dziembowski
Krzysztof Pietrzak
pp. 293-302
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Succincter
(Abstract)
Mihai Patrascu
pp. 305-313
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Two Query PCP with Sub-Constant Error
(Abstract)
Dana Moshkovitz
Ran Raz
pp. 314-323
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Constant-Time Approximation Algorithms via Local Improvements
(Abstract)
Huy N. Nguyen
Krzysztof Onak
pp. 327-336
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Some Results on Greedy Embeddings in Metric Spaces
(Abstract)
Ankur Moitra
Tom Leighton
pp. 337-346
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Set Covering with our Eyes Closed
(Abstract)
Fabrizio Grandoni
Anupam Gupta
Stefano Leonardi
Pauli Miettinen
Piotr Sankowski
Mohit Singh
pp. 347-356
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Minimizing Movement in Mobile Facility Location Problems
(Abstract)
Zachary Friggstad
Mohammad R. Salavatipour
pp. 357-366
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Counterexample to Strong Parallel Repetition
(Abstract)
Ran Raz
pp. 369-373
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Rounding Parallel Repetitions of Unique Games
(Abstract)
Boaz Barak
Moritz Hardt
Ishay Haviv
Anup Rao
Oded Regev
David Steurer
pp. 374-383
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Unbounded-Error Communication Complexity of Symmetric Functions
(Abstract)
Alexander A. Sherstov
pp. 384-393
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
(Abstract)
Chinmoy Dutta
Jaikumar Radhakrishnan
pp. 394-402
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Inapproximability for Metric Embeddings into R^d
(Abstract)
Jiri Matousek
Anastasios Sidiropoulos
pp. 405-413
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
(Abstract)
Rina Panigrahy
Kunal Talwar
Udi Wieder
pp. 414-423
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Hardness of Nearest Neighbor under L-infinity
(Abstract)
Alexandr Andoni
Dorian Croitoru
Mihai Patrascu
pp. 424-433
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
(Data) STRUCTURES
(Abstract)
Mihai Patrascu
pp. 434-443
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Entangled Games are Hard to Approximate
(Abstract)
Julia Kempe
Hirotada Kobayashi
Keiji Matsumoto
Ben Toner
Thomas Vidick
pp. 447-456
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Unique Games with Entangled Provers are Easy
(Abstract)
Julia Kempe
Oded Regev
Ben Toner
pp. 457-466
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Quantum Multi Prover Interactive Proofs with Communicating Provers
(Abstract)
Michael Ben Or
Avinatan Hassidim
Haran Pilpel
pp. 467-476
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs
(Abstract)
Avraham Ben-Aroya
Oded Regev
Ronald de Wolf
pp. 477-486
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Sketching and Streaming Entropy via Approximation Theory
(Abstract)
Nicholas J.A. Harvey
Jelani Nelson
Krzysztof Onak
pp. 489-498
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
(Abstract)
Paul Beame
Dang-Trinh Huynh-Ngoc
pp. 499-508
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Clock Synchronization with Bounded Global and Local Skew
(Abstract)
Christoph Lenzen
Thomas Locher
Roger Wattenhofer
pp. 509-518
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
(Abstract)
Yefim Dinitz
Michael Elkin
Shay Solomon
pp. 519-528
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
What Can We Learn Privately?
(Abstract)
Shiva Prasad Kasiviswanathan
Homin K. Lee
Kobbi Nissim
Sofya Raskhodnikova
Adam Smith
pp. 531-540
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Learning Geometric Concepts via Gaussian Surface Area
(Abstract)
Adam R. Klivans
Ryan OʼDonnell
Rocco A. Servedio
pp. 541-550
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Isotropic PCA and Affine-Invariant Clustering
(Abstract)
Spencer Charles Brubaker
Santosh Vempala
pp. 551-560
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Approximate Kernel Clustering
(Abstract)
Subhash Khot
Assaf Naor
pp. 561-570
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
(Abstract)
Venkatesan Guruswami
Rajsekar Manokaran
Prasad Raghavendra
pp. 573-582
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
(Acyclic) Job Shops are Hard to Approximate
(Abstract)
Monaldo Mastrolilli
Ola Svensson
pp. 583-592
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Linear Level Lasserre Lower Bounds for Certain k-CSPs
(Abstract)
Grant Schoenebeck
pp. 593-602
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The Power of Reordering for Online Minimum Makespan Scheduling
(Abstract)
Matthias Englert
Deniz özmen
Matthias Westermann
pp. 603-612
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Locally Testing Direct Product in the Low Error Range
(Abstract)
Irit Dinur
Elazar Goldenberg
pp. 613-622
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Kakeya Sets, New Mergers and Old Extractors
(Abstract)
Zeev Dvir
Avi Wigderson
pp. 625-633
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
(Abstract)
Siu On Chan
Michael Molloy
pp. 634-643
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
(Abstract)
Jin-Yi Cai
Pinyan Lu
Mingji Xia
pp. 644-653
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Network Extractor Protocols
(Abstract)
Yael Tauman Kalai
Xin Li
Anup Rao
David Zuckerman
pp. 654-663
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time
(Abstract)
Laszlo Babai
Paolo Codenotti
pp. 667-676
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Computing the Tutte Polynomial in Vertex-Exponential Time
(Abstract)
Andreas Björklund
Thore Husfeldt
Petteri Kaski
Mikko Koivisto
pp. 677-686
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
(Abstract)
Deeparnab Chakrabarty
Gagan Goel
pp. 687-696
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
(Abstract)
Zoya Svitkina
Lisa Fleischer
pp. 697-706
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution
(Abstract)
Eli Ben-Sasson
Jakob Nordström
pp. 709-718
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
(Abstract)
Satyen Kale
Yuval Peres
C. Seshadhri
pp. 719-728
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier
(Abstract)
Sébastien Roch
pp. 729-738
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Size Bounds and Query Plans for Relational Joins
(Abstract)
Albert Atserias
Martin Grohe
Dániel Marx
pp. 739-748
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows
(Abstract)
Punyashloka Biswal
James R. Lee
Satish Rao
pp. 751-760
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
(Abstract)
Amit Chakrabarti
Alexander Jaffe
James R. Lee
Justin Vincent
pp. 761-770
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width
(Abstract)
Ken-ichi Kawarabayashi
Bojan Mohar
Bruce Reed
pp. 771-780
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Nearly Tight Low Stretch Spanning Trees
(Abstract)
Ittai Abraham
Yair Bartal
Ofer Neiman
pp. 781-790
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Algorithmic Barriers from Phase Transitions
(Abstract)
Dimitris Achlioptas
Amin Coja-Oghlan
pp. 793-802
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Mixing Time of Exponential Random Graphs
(Abstract)
Shankar Bhamidi
Guy Bresler
Allan Sly
pp. 803-812
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
k-Wise Independent Random Graphs
(Abstract)
Noga Alon
Asaf Nussboim
pp. 813-822
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Broadcasting with Side Information
(Abstract)
Noga Alon
Eyal Lubetzky
Uri Stav
Amit Weinstein
Avinatan Hassidim
pp. 823-832
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author Index
(PDF)
pp. 833-835
ABSTRACT
PDF
Roster Page
(PDF)
pp. 836
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
