Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Local Privacy and Statistical Minimax Rates
Duchi, John C., Jordan, Michael I., Wainwright, Martin J.
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Garg, Sanjam, Gentry, Craig, Halevi, Shai, Raykova, Mariana, Sahai, Amit, Waters, Brent
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries
Garay, Juan, Katz, Jonathan, Maurer, Ueli, Tackmann, Bjorn, Zikas, Vassilis
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable
Cygan, Marek, Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Direct Products in Communication Complexity
Braverman, Mark, Rao, Anup, Weinstein, Omri, Yehudayoff, Amir
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
A Tight Bound for Set Disjointness in the Message-Passing Model
Braverman, Mark, Ellen, Faith, Oshman, Rotem, Pitassi, Toniann, Vaikuntanathan, Vinod
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Approximate Constraint Satisfaction Requires Large LP Relaxations
Siu On Chan, Lee, James R., Raghavendra, Prasad, Steurer, David
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Learning Sums of Independent Integer Random Variables
Daskalakis, Constantinos, Diakonikolas, Ilias, ODonnell, Ryan, Servedio, Rocco A., Li-Yang Tan
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
An O(c^k n) 5-Approximation Algorithm for Treewidth
Bodlaender, Hans L., Drange, Pal Gronas, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel, Pilipczuk, Michal
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
The Complexity of Approximating Vertex Expansion
Louis, Anand, Raghavendra, Prasad, Vempala, Santosh
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits
Impagliazzo, Russell, Paturi, Ramamohan, Schneider, Stefan
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Approximation Algorithms for Euler Genus and Related Problems
Chekuri, Chandra, Sidiropoulos, Anastasios
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
An Optimal Randomized Online Algorithm for Reordering Buffer Management
Avigdor-Elgrabli, Noa, Rabani, Yuval
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
Konemann, Jochen, Sadeghian, Sina, Sanita, Laura
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Estimating the Distance from Testable Affine-Invariant Properties
Hatami, Hamed, Lovett, Shachar
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Non-positive Curvature and the Planar Embedding Conjecture
Sidiropoulos, Anastasios
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
Dujmovic, Vida, Morin, Pat, Wood, David R.
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding
Awards: FOCS 2013 [2 awards]
Published in Annual Symposium on Foundations of Computer Science
(01.10.2013)
Get full text
Conference Proceeding