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
1Mert Saglam Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anand Natarajan, Thomas Vidick Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yiding Feng, Jason D. Hartline An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents). Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lior Eldar, Saeed Mehraban Approximating the Permanent of a Random Matrix with Vanishing Mean. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohsen Ghaffari 0001, David G. Harris 0001, Fabian Kuhn On Derandomizing Local Distributed Algorithms. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandro Chiesa, Michael A. Forbes 0001, Tom Gur, Nicholas Spooner Spatial Isolation Implies Zero Knowledge Even in a Quantum World. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bojan Mohar, Yifan Jing Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Justin Holmgren, Alex Lombardi Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Renato Paes Leme, Jon Schneider Contextual Search via Intrinsic Volumes. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laura Sanità The Diameter of the Fractional Matching Polytope and Its Hardness Implications. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sarvar Patel, Giuseppe Persiano, Mariana Raykova 0001, Kevin Yeo PanORAMa: Oblivious RAM with Logarithmic Overhead. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Huan Li 0002, Aaron Schild Spectral Subspace Sparsification. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Daniel Neuen, Pascal Schweitzer A Faster Isomorphism Test for Graphs of Small Degree. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vera Traub, Jens Vygen Beating the Integrality Ratio for s-t-Tours in Graphs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay An ETH-Tight Exact Algorithm for Euclidean TSP. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Learning Sums of Independent Random Variables with Sparse Collective Support. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shiri Chechik Near-Optimal Approximate Decremental All Pairs Shortest Paths. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Clément Carbonnel, Miguel Romero 0001, Stanislav Zivný The Complexity of General-Valued CSPs Seen from the Other Side. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pranjal Awasthi, Aravindan Vijayaraghavan Towards Learning Sparsely Used Dictionaries with Arbitrary Supports. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006 Faster Exact and Approximate Algorithms for k-Cut. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1John Kallaugher, Michael Kapralov, Eric Price 0001 The Sketching Complexity of Graph and Hypergraph Counting. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten Hölder Homeomorphisms and Approximate Nearest Neighbors. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Justin Holmgren, Ron Rothblum Delegating Computations with (Almost) Minimal Time and Space Overhead. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann Balancing Vectors in Any Norm. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Josh Alman, Virginia Vassilevska Williams Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexandr Andoni, Zhao Song 0002, Clifford Stein 0001, Zhengyu Wang, Peilin Zhong Parallel Graph Connectivity in Log Diameter Rounds. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis Efficient Density Evaluation for Smooth Kernels. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shuichi Hirahara Non-Black-Box Worst-Case to Average-Case Reductions within NP. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Kleinberg, Nicole Immorlica Recharging Bandits. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rajesh Jayaram, David P. Woodruff Perfect Lp Sampling in a Data Stream. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Adamczyk, Michal Wlodarczyk 0001 Random Order Contention Resolution Schemes. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Sohler, David P. Woodruff Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Igor Carboni Oliveira, Rahul Santhanam Hardness Magnification for Natural Problems. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jatin Batra, Naveen Garg 0001, Amit Kumar 0001 Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Urmila Mahadev Classical Homomorphic Encryption for Quantum Circuits. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aaron Sidford, Kevin Tian Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum Flow. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zvika Brakerski, Paul F. Christiano, Urmila Mahadev, Umesh V. Vazirani, Thomas Vidick A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nima Anari, Vijay V. Vazirani Planar Graph Perfect Matching Is in NC. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan 0001 A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rasmus Kyng, Zhao Song 0002 A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mika Göös, Aviad Rubinstein Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Allen Liu, Ankur Moitra Efficiently Learning Mixtures of Mallows Models. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari Classical Lower Bounds from Quantum Upper Bounds. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikkel Thorup (eds.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis Efficient Statistics, in High Dimensions, from Truncated Samples. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kuan Cheng, Zhengzhong Jin, Xin Li 0006, Ke Wu 0001 Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis PPP-Completeness with Connections to Cryptography. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael A. Forbes 0001, Zander Kelley Pseudorandom Generators for Read-Once Branching Programs, in Any Order. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marco Bressan 0002, Enoch Peserico, Luca Pretto Sublinear Algorithms for Local Graph Centrality Estimation. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Timothy Chu, Yu Gao 0001, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Guy N. Rothblum Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Urmila Mahadev Classical Verification of Quantum Computations. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael A. Bender, Martin Farach-Colton, Mayank Goswami 0001, Rob Johnson, Samuel McCauley, Shikha Singh 0002 Bloom Filters, Adaptivity, and the Dictionary Problem. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres Testing Graph Clusterability: Algorithms and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1James R. Lee Fusible HSTs and the Randomized k-Server Conjecture. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maria-Florina Balcan, Travis Dick, Ellen Vitercik Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Natan Rubin An Improved Bound for Weak Epsilon-Nets in the Plane. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé EPTAS for Max Clique on Disks and Unit Balls. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan Non-Malleable Codes for Small-Depth Circuits. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li 0015, Xuan Wu 0002 Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yannai A. Gonczarowski, S. Matthew Weinberg The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter 0005, Avi Wigderson Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Shachar Lovett MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Diptarka Chakraborty, Debarati Das 0001, Elazar Goldenberg, Michal Koucký 0001, Michael E. Saks Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Willy Quach, Hoeteck Wee, Daniel Wichs Laconic Function Evaluation and Applications. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Subhash Khot, Dor Minzer, Muli Safra Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sebastian Forster, Danupon Nanongkai A Faster Distributed Single-Source Shortest Paths Algorithm. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1William Hoza, David Zuckerman Simple Optimal Hitting Sets for Small-Success RL. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Nikhil S. Mande A Short List of Equalities Induces Large Sign Rank. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vitaly Feldman, Ilya Mironov, Kunal Talwar, Abhradeep Thakurta Privacy Amplification by Iteration. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Johan Håstad Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs. Search on Bibsonomy FOCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Kane 0001, Shachar Lovett, Sankeerth Rao The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Tali Kaufman High Dimensional Expanders Imply Agreement Expanders. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yi-Jun Chang, Seth Pettie A Time Hierarchy Theorem for the LOCAL Model. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Allan Grønlund, Kasper Green Larsen A Dichotomy for Regular Expression Membership Testing. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dakshita Khurana, Amit Sahai How to Achieve Non-Malleability in One or Two Rounds. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Adam R. Klivans, Raghu Meka Learning Graphical Models Using Multiplicative Weights. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Paris Siminelakis Hashing-Based-Estimators for Kernel Density in High Dimensions. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuela Fischer, Mohsen Ghaffari 0001, Fabian Kuhn Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Krati Nayyar, Sharath Raghvendra An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang Active Classification with Comparison Queries. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Huijia Lin, Rafael Pass, Pratik Soni Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rishab Goyal, Venkata Koppula, Brent Waters Lockable Obfuscation. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1David R. Karger Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere Random Θ(log n)-CNFs Are Hard for Cutting Planes. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. Search on Bibsonomy FOCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #601 - #700 of 3592 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][>>]
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