Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Joseph Anderson, Navin Goyal, Anupama Nandi, Luis Rademacher |
Heavy-Tailed Independent Component Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 290-309, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Constantinos Daskalakis, Gautam Kamath 0001, Christos Tzamos |
On the Structure, Covering, and Learning of Poisson Multinomial Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1203-1217, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Xin Li 0006 |
Three-Source Extractors for Polylogarithmic Min-Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 863-882, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth L. Clarkson, David P. Woodruff |
Input Sparsity and Hardness for Robust Subspace Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 310-329, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Rico Zenklusen |
An O(1)-Approximation for Minimum Spanning Tree Interdiction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 709-728, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette |
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 773-791, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Sanjam Garg, Steve Lu 0001, Rafail Ostrovsky |
Black-Box Garbled RAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 210-229, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Barna Saha |
Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 118-135, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Parinya Chalermsook, Mayank Goswami 0001, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak |
Pattern-Avoiding Access in Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 410-423, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Konstantin Makarychev, Yury Makarychev, Yuan Zhou 0007 |
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 975-993, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen |
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 845-862, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong |
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1049-1065, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Martin Grohe, Pascal Schweitzer |
Isomorphism Testing for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1010-1029, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams |
Tight Hardness Results for LCS and Other Sequence Similarity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 59-78, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Tsvi Kopelowitz, Ely Porat |
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 601-613, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De |
Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 883-902, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Khot, Dor Minzer, Muli Safra |
On Monotonicity Testing and Boolean Isoperimetric Type Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 52-58, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Eric Price 0001, Zhao Song 0002 |
A Robust Sparse Fourier Transform in the Continuous Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 583-600, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | John Augustine, Gopal Pandurangan, Peter Robinson 0002, Scott T. Roche, Eli Upfal |
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 350-369, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Xi Chen 0001, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis |
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1464-1479, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös |
Lower Bounds for Clique vs. Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1066-1076, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Craig Gentry, Allison Bishop Lewko, Amit Sahai, Brent Waters |
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 151-170, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Siu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals |
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 466-485, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Jop Briët, Oded Regev 0001, Rishi Saket |
Tight Hardness of the Non-commutative Grothendieck Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1108-1122, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg |
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 330-349, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami (eds.) |
IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![IEEE Computer Society, 978-1-4673-8191-8 The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
1 | Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor |
Quantum Expander Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 810-824, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ola Svensson |
Approximating ATSP by Relaxing Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1-19, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Eldar Fischer, Oded Lachish, Yadu Vasudev |
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1163-1182, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Radu Curticapean, Mingji Xia |
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 994-1009, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Abbe, Colin Sandon |
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 670-688, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ronen Eldan, James R. Lee |
Talagrand's Convolution Conjecture on Gaussian Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1395-1408, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Kyle Luh, Van Vu |
Random Matrices: l1 Concentration and Dictionary Learning with Few Samples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1409-1425, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi |
Tight Bounds for Online Vector Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 525-544, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alan Guo, Elad Haramaty, Madhu Sudan 0001 |
Robust Testing of Lifted Codes with Applications to Low-Degree Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 825-844, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Flavio Chierichetti, Abhimanyu Das, Anirban Dasgupta 0001, Ravi Kumar 0001 |
Approximate Modularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1143-1162, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Helmut Seidl, Sebastian Maneth, Gregor Kemper |
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 943-962, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Yu Cheng 0002, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng |
Mixture Selection, Mechanism Design, and Signaling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1426-1445, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin |
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1183-1202, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 748-758, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen |
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1311-1326, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alexander A. Sherstov |
The Power of Asymmetry in Constant-Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 431-450, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein |
Welfare Maximization with Limited Interaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1499-1512, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan |
Differentially Private Release and Learning of Threshold Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 634-649, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Yin Tat Lee, He Sun 0001 |
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 250-269, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson |
No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 1123-1142, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Yin Tat Lee, Aaron Sidford |
Efficient Inverse Maintenance and Faster Algorithms for Linear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pp. 230-249, 2015, IEEE Computer Society, 978-1-4673-8191-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Uriel Feige, Tomer Koren, Moshe Tennenholtz |
Chasing Ghosts: Competing with Stateful Policies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 100-109, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Constantinos Daskalakis, Qinxuan Pan |
A Counter-example to Karlin's Strong Conjecture for Fictitious Play. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 11-20, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Adi Livnat, Christos H. Papadimitriou, Aviad Rubinstein, Gregory Valiant, Andrew Wan |
Satisfiability and Evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 524-530, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Khot, Rishi Saket |
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 206-215, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | George Barmpalias, Richard Elwes, Andy Lewis-Pye |
Digital Morphogenesis via Schelling Segregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 156-165, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Dorit Aharonov, Aram W. Harrow, Zeph Landau, Daniel Nagaj, Mario Szegedy, Umesh V. Vazirani |
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 246-255, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Nima Anari, Gagan Goel, Afshin Nikzad |
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 266-275, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Moritz Hardt |
Understanding Alternating Minimization for Matrix Completion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 651-660, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy |
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 31-40, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Toby S. Cubitt, Ashley Montanaro |
Complexity Classification of Local Hamiltonian Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 120-129, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Oded Lachish |
O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 326-335, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 444-453, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Anat Ganor, Gillat Kol, Ran Raz |
Exponential Separation of Information and Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 176-185, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Dana Moshkovitz |
Parallel Repetition from Fortification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 414-423, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Xi Chen 0001, Rocco A. Servedio, Li-Yang Tan |
New Algorithms and Lower Bounds for Monotonicity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 286-295, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Achlioptas, Fotis Iliopoulos |
Random Walks That Find Perfect Objects and the Lovasz Local Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 494-503, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Tali Kaufman, David Kazhdan, Alexander Lubotzky |
Ramanujan Complexes and Bounded Degree Topological Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 484-493, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann |
Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 661-670, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Raef Bassily, Adam D. Smith, Abhradeep Thakurta |
Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 464-473, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Eshan Chattopadhyay, David Zuckerman |
Non-malleable Codes against Constant Split-State Tampering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 306-315, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ilario Bonacina, Nicola Galesi, Neil Thapen |
Total Space in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 641-650, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Neeraj Kayal, Nutan Limaye, Chandan Saha 0001, Srikanth Srinivasan 0001 |
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 61-70, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Tim Roughgarden |
Barriers to Near-Optimal Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 71-80, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 276-285, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs |
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 531-540, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Indyk, Michael Kapralov |
Sample-Optimal Fourier Sampling in Any Constant Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 514-523, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kapralov, Yin Tat Lee, Cameron Musco, Christopher Musco, Aaron Sidford |
Single Pass Spectral Sparsification in Dynamic Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 561-570, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Yuan Li, Alexander A. Razborov, Benjamin Rossman |
On the AC0 Complexity of Subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 344-353, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Zengfeng Huang, Ke Yi 0001 |
The Communication Complexity of Distributed epsilon-Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 591-600, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Bernhard Haeupler |
Interactive Channel Capacity Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 226-235, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra |
Topology Matters in Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 631-640, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Nabil H. Mustafa, Rajiv Raman 0001, Saurabh Ray |
Settling the APX-Hardness Status for Geometric Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 541-550, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | George Giakkoupis, Philipp Woelfel |
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 504-513, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Shaddin Dughmi |
On the Hardness of Signaling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 354-363, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Radu Curticapean, Dániel Marx |
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 130-139, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Gregory Valiant, Paul Valiant |
An Automatic Inequality Prover and Instance Optimal Identity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 51-60, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Tobias Christiani, Rasmus Pagh |
Generating k-Independent Variables in Constant Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 196-205, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Oded Goldreich 0001, Dana Ron |
On Learning and Testing Dynamic Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 336-343, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Joshua A. Grochow, Toniann Pitassi |
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 110-119, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
One-Way Functions and (Im)Perfect Obfuscation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 374-383, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Craig Gentry, Shai Halevi, Mariana Raykova 0001, Daniel Wichs |
Outsourcing Private RAM Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 404-413, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | |
55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![IEEE Computer Society, 978-1-4799-6517-5 The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
1 | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 186-195, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Leonid Gurvits, Alex Samorodnitsky |
Bounds on the Permanent and Some Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 90-99, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Avishay Tal |
Shrinkage of De Morgan Formulae by Spectral Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 551-560, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald |
An Algebraic Approach to Non-malleability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 41-50, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Sian-Jheng Lin, Wei-Ho Chung, Yunghsiang S. Han |
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 316-325, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg |
A Simple and Approximately Optimal Mechanism for an Additive Buyer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 21-30, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | François Le Gall |
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 216-225, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Klim Efremenko |
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 236-245, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer |
Spectral Approaches to Nearest Neighbor Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 581-590, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych |
Online Bipartite Matching in Offline Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 384-393, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
1 | Barna Saha |
The Dyck Language Edit Distance Problem in Near-Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 611-620, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|