The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "FOCS"( http://dblp.L3S.de/Venues/FOCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/focs

Publication years (Num. hits)
1975 (29) 1976 (32) 1977 (32) 1978 (34) 1979 (44) 1980 (46) 1981 (52) 1982 (47) 1983 (61) 1984 (60) 1985 (62) 1986 (55) 1987 (56) 1988 (60) 1989 (100) 1990 (93) 1991 (87) 1992 (78) 1993 (75) 1994 (74) 1995 (74) 1996 (66) 1997 (64) 1998 (80) 1999 (68) 2000 (67) 2001 (66) 2002 (81) 2003 (65) 2004 (65) 2005 (74) 2006 (72) 2007 (67) 2008 (83) 2009 (74) 2010 (83) 2011 (89) 2012 (81) 2013 (80) 2014 (69) 2015 (87) 2016 (87) 2017 (91) 2018 (88) 2019 (93) 2020 (128) 2021 (118) 2022 (112) 2023 (143)
Publication types (Num. hits)
inproceedings(3542) proceedings(50)
Venues (Conferences, Journals, ...)
FOCS(3592)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4036 occurrences of 1595 keywords

Results
Found 3592 publication records. Showing 3592 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Badih Ghazi, Pritish Kamath, Madhu Sudan 0001 Decidability of Non-interactive Simulation of Joint Distributions. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1András Sebö, Anke van Zuylen The Salesman's Improved Paths: A 3/2+1/34 Approximation. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Aleksander Madry Computing Maximum Flow with Augmenting Electrical Flows. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sungjin Im, Shi Li 0001 Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward A New Framework for Distributed Submodular Maximization. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain 0001, Robin Kothari, Troy Lee, Miklos Santha Separations in Communication Complexity Using Cheat Sheets and Information Complexity. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zachary Remscrim The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Charilaos Efthymiou 0001, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gil Cohen Making the Most of Advice: New Correlation Breakers and Their Applications. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Ikenmeyer, Greta Panova Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng On Fully Dynamic Graph Sparsifiers. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Rasmus Kyng, Sushant Sachdeva Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shahar Dobzinski Computational Efficiency Requires Simple Taxation. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Djamal Belazzougui, Qin Zhang 0001 Edit Distance: Sketching, Streaming, and Document Exchange. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal 0001, Daniel Dadush, Shashwat Garg An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Fabrizio Grandoni 0001, Barna Saha, Virginia Vassilevska Williams Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1David R. Karger A Fast and Simple Unbiased Estimator for Network (Un)reliability. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shay Solomon Fully Dynamic Maximal Matching in Constant Update Time. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vipul Goyal, Yuval Ishai, Hemanta K. Maji, Amit Sahai, Alexander A. Sherstov Bounded-Communication Leakage Resilience via Parity-Resilient Circuits. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ran Raz Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arturs Backurs, Piotr Indyk Which Regular Expression Patterns Are Hard to Match? Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang A PTAS for the Steiner Forest Problem in Doubling Metrics. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anand Louis, Santosh S. Vempala Accelerated Newton Iteration for Roots of Black Box Polynomials. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vipul Goyal, Dakshita Khurana, Amit Sahai Breaking the Three Round Barrier for Non-malleable Commitments. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yiling Chen 0001, Bo Waggoner Informational Substitutes. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski Local Conflict Coloring. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Oded Regev 0001 Towards Strong Reverse Minkowski-Type Inequalities for Lattices. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Søren Dahlgaard Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1W. T. Gowers 0001, Emanuele Viola The Multiparty Communication Complexity of Interleaved Group Products. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Xue Chen 0001, Daniel M. Kane, Eric Price 0001, Zhao Song 0002 Fourier-Sparse Interpolation without a Frequency Gap. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tim Roughgarden, Omri Weinstein On the Communication Complexity of Approximate Fixed Points. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Adam D. Smith Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Kasper Green Larsen, Jelani Nelson, Huy L. Nguyen, Mikkel Thorup Heavy Hitters via Cluster-Preserving Clustering. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shiteng Chen, Periklis A. Papakonstantinou Depth-Reduction for Composites. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yijia Chen, Bingkai Lin The Constant Inapproximability of the Parameterized Dominating Set Problem. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alina Ene, Huy L. Nguyen Constrained Submodular Maximization: Beyond 1/e. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eshan Chattopadhyay, Xin Li 0006 Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers Universal Simulation of Directed Systems in the Abstract Tile Assembly Model Requires Undirectedness. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Noam Nisan Knuth Prize Lecture: Complexity of Communication in Markets. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jasper C. H. Lee, Paul Valiant Optimizing Star-Convex Functions. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Kevin A. Lai, Anup B. Rao, Santosh S. Vempala Agnostic Estimation of Mean and Covariance. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amit Chakrabarti, Sagar Kale Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Xin Li 0006 Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Susanna F. de Rezende, Jakob Nordström, Marc Vinyals How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anindya De, Michael E. Saks, Sijian Tang Noisy Population Recovery in Polynomial Time. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour Local Search Yields a PTAS for k-Means in Doubling Metrics. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tengyu Ma 0001, Jonathan Shi, David Steurer Polynomial-Time Tensor Decompositions with Sum-of-Squares. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Vasilis Syrgkanis Learning in Auctions: Regret is Hard, Envy is Easy. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Elkin, Ofer Neiman Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane A New Approach for Testing Properties of Discrete Distributions. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Irit Dinur (eds.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  BibTeX  RDF
1Peter Bürgisser, Christian Ikenmeyer, Greta Panova No Occurrence Obstructions in Geometric Complexity Theory. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Josh Alman, Timothy M. Chan, R. Ryan Williams Polynomial Representations of Threshold Functions and Algorithmic Applications. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mika Göös, Toniann Pitassi, Thomas Watson 0001 Deterministic Communication vs. Partition Number. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan 0001, Saket Saurabh 0001 FO Model Checking on Posets of Bounded Width. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael A. Forbes 0001 Deterministic Divisibility Testing via Shifted Partial Derivatives. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Vinod Vaikuntanathan Indistinguishability Obfuscation from Functional Encryption. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek The Complexity of General-Valued CSPs. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sungjin Im, Janardhan Kulkarni, Kamesh Munagala Competitive Flow Time Algorithms for Polyhedral Scheduling. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dominic W. Berry, Andrew M. Childs, Robin Kothari Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Yakov Nekrich Towards an Optimal Method for Dynamic Planar Point Location. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Omer Paneth, Alon Rosen On the Cryptographic Hardness of Finding a Nash Equilibrium. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pu Gao, Nicholas C. Wormald Uniform Generation of Random Regular Graphs. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Gilad Asharov, Gil Segev 0001 Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Micha Sharir, Noam Solomon Incidences between Points and Lines in R^4. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup Hashing for Statistics over K-Partitions. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Rico Zenklusen The Submodular Secretary Problem Goes Linear. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams If the Current Clique Algorithms are Optimal, So is Valiant's Parser. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan Optimal Auctions vs. Anonymous Pricing. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff Compressing and Teaching for Low VC-Dimension. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nicholas J. A. Harvey, Jan Vondrák An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, Adam D. Smith, Thomas Steinke 0002, Jonathan R. Ullman, Salil P. Vadhan Robust Traceability from Trace Amounts. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Talya Eden, Amit Levi, Dana Ron, C. Seshadhri 0001 Approximately Counting Triangles in Sublinear Time. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nima Anari, Shayan Oveis Gharan Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Charles Bordenave, Marc Lelarge, Laurent Massoulié Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi Online Buy-at-Bulk Network Design. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan An Average-Case Depth Hierarchy Theorem for Boolean Circuits. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Daniel M. Kane, Raghu Meka Pseudorandomness via the Discrete Fourier Transform. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jin-Yi Cai, Zhiguo Fu, Heng Guo 0001, Tyson Williams A Holant Dichotomy: Is the FKT Algorithm Universal? Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lee-Ad Gottlieb A Light Metric Spanner. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Josh Alman, Ryan Williams 0001 Probabilistic Polynomials and Hamming Nearest Neighbors. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sarah R. Allen, Ryan O'Donnell, David Witmer How to Refute a Random CSP. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Raphaël Clifford, Allan Grønlund, Kasper Green Larsen New Unconditional Hardness Results for Dynamic and Online Problems. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava 0001 Symbolic Integration and the Complexity of Computing Averages. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Marvin Künnemann Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Mikkel Thorup Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amir Nayyeri, Benjamin Raichel Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ruoyu Sun 0001, Zhi-Quan Luo Guaranteed Matrix Completion via Nonconvex Factorization. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jacob Holm, Eva Rotenberg, Mikkel Thorup Planar Reachability in Linear Space and Constant Time. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Vitaly Feldman, Jan Vondrák Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS Functions. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Benjamin Rossman The Average Sensitivity of Bounded-Depth Formulas. Search on Bibsonomy FOCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #801 - #900 of 3592 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license