|
|
Venues (Conferences, Journals, ...)
|
|
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 |
1 | Mert Saglam |
Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 967-978, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Anand Natarajan, Thomas Vidick |
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 731-742, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yiding Feng, Jason D. Hartline |
An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 404-415, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak |
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 136-147, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Lior Eldar, Saeed Mehraban |
Approximating the Permanent of a Random Matrix with Vanishing Mean. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 23-34, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Mohsen Ghaffari 0001, David G. Harris 0001, Fabian Kuhn |
On Derandomizing Local Distributed Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 662-673, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alessandro Chiesa, Michael A. Forbes 0001, Tom Gur, Nicholas Spooner |
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 755-765, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant |
Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 35-46, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Bojan Mohar, Yifan Jing |
Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 719-730, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Justin Holmgren, Alex Lombardi |
Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product Functions and Their Applications). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 850-858, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Renato Paes Leme, Jon Schneider |
Contextual Search via Intrinsic Volumes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 268-282, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Laura Sanità |
The Diameter of the Fractional Matching Polytope and Its Hardness Implications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 910-921, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sarvar Patel, Giuseppe Persiano, Mariana Raykova 0001, Kevin Yeo |
PanORAMa: Oblivious RAM with Logarithmic Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 871-882, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Huan Li 0002, Aaron Schild |
Spectral Subspace Sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 385-396, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Martin Grohe, Daniel Neuen, Pascal Schweitzer |
A Faster Isomorphism Test for Graphs of Small Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 89-100, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Vera Traub, Jens Vygen |
Beating the Integrality Ratio for s-t-Tours in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 766-777, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay |
An ETH-Tight Exact Algorithm for Euclidean TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 450-461, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Anindya De, Philip M. Long, Rocco A. Servedio |
Learning Sums of Independent Random Variables with Sparse Collective Support. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 297-308, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Shiri Chechik |
Near-Optimal Approximate Decremental All Pairs Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 170-181, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Clément Carbonnel, Miguel Romero 0001, Stanislav Zivný |
The Complexity of General-Valued CSPs Seen from the Other Side. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 236-246, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pranjal Awasthi, Aravindan Vijayaraghavan |
Towards Learning Sparsely Used Dictionaries with Arbitrary Supports. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 283-296, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006 |
Faster Exact and Approximate Algorithms for k-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 113-123, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | John Kallaugher, Michael Kapralov, Eric Price 0001 |
The Sketching Complexity of Graph and Hypergraph Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 556-567, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
Hölder Homeomorphisms and Approximate Nearest Neighbors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 159-169, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Justin Holmgren, Ron Rothblum |
Delegating Computations with (Almost) Minimal Time and Space Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 124-135, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann |
Balancing Vectors in Any Norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 1-10, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Josh Alman, Virginia Vassilevska Williams |
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 580-591, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Alexandr Andoni, Zhao Song 0002, Clifford Stein 0001, Zhengyu Wang, Peilin Zhong |
Parallel Graph Connectivity in Log Diameter Rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 674-685, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis |
Efficient Density Evaluation for Smooth Kernels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 615-626, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Shuichi Hirahara |
Non-Black-Box Worst-Case to Average-Case Reductions within NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 247-258, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Robert Kleinberg, Nicole Immorlica |
Recharging Bandits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 309-319, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rajesh Jayaram, David P. Woodruff |
Perfect Lp Sampling in a Data Stream. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 544-555, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Christian Borgs, Jennifer T. Chayes, Adam D. Smith, Ilias Zadik |
Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 533-543, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marek Adamczyk, Michal Wlodarczyk 0001 |
Random Order Contention Resolution Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 790-801, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Christian Sohler, David P. Woodruff |
Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 802-813, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Igor Carboni Oliveira, Rahul Santhanam |
Hardness Magnification for Natural Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 65-76, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jatin 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 778-789, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 898-909, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Urmila Mahadev |
Classical Homomorphic Encryption for Quantum Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 332-338, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Aaron Sidford, Kevin Tian |
Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 922-933, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Zvika 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 320-331, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Nima Anari, Vijay V. Vazirani |
Planar Graph Perfect Matching Is in NC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 650-661, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan 0001 |
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 934-945, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rasmus Kyng, Zhao Song 0002 |
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 373-384, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Aviad Rubinstein |
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 397-403, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Matthew 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 101-112, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Amos 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 838-849, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Allen Liu, Ankur Moitra |
Efficiently Learning Mixtures of Mallows Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 627-638, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low |
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 350-360, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari |
Classical Lower Bounds from Quantum Upper Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 339-349, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Mikkel Thorup (eds.) |
59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![IEEE Computer Society, 978-1-5386-4230-6 The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
1 | Constantinos Daskalakis, Themis Gouleakis, Christos Tzamos, Manolis Zampetakis |
Efficient Statistics, in High Dimensions, from Truncated Samples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 639-649, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kuan Cheng, Zhengzhong Jin, Xin Li 0006, Ke Wu 0001 |
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 200-211, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Katerina Sotiraki, Manolis Zampetakis, Giorgos Zirdelis |
PPP-Completeness with Connections to Cryptography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 148-158, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Forbes 0001, Zander Kelley |
Pseudorandom Generators for Read-Once Branching Programs, in Any Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 946-955, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marco Bressan 0002, Enoch Peserico, Luca Pretto |
Sublinear Algorithms for Local Graph Centrality Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 709-718, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Timothy 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 361-372, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Oded Goldreich 0001, Guy N. Rothblum |
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 77-88, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Urmila Mahadev |
Classical Verification of Quantum Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 259-267, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 182-193, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres |
Testing Graph Clusterability: Algorithms and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 497-508, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | James R. Lee |
Fusible HSTs and the Randomized k-Server Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 438-449, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Maria-Florina Balcan, Travis Dick, Ellen Vitercik |
Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 603-614, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Natan Rubin |
An Improved Bound for Weak Epsilon-Nets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 224-235, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé |
EPTAS for Max Clique on Disks and Unit Balls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 568-579, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan |
Non-Malleable Codes for Small-Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 826-837, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li 0015, Xuan Wu 0002 |
Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 814-825, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Yannai A. Gonczarowski, S. Matthew Weinberg |
The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 416-426, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Peter 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 883-897, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters |
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 212-223, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Shachar Lovett |
MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 194-199, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Diptarka 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](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 979-990, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Willy Quach, Hoeteck Wee, Daniel Wichs |
Laconic Function Evaluation and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 859-870, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Khot, Dor Minzer, Muli Safra |
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 592-601, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Forster, Danupon Nanongkai |
A Faster Distributed Single-Source Shortest Paths Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 686-697, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | William Hoza, David Zuckerman |
Simple Optimal Hitting Sets for Small-Success RL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 59-64, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk |
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 474-484, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Nikhil S. Mande |
A Short List of Equalities Induces Large Sign Rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 47-58, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Vitaly Feldman, Ilya Mironov, Kunal Talwar, Abhradeep Thakurta |
Privacy Amplification by Iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 521-532, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 485-496, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola |
Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 956-966, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Johan Håstad |
Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 602, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Paul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier |
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 540-551, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Kane 0001, Shachar Lovett, Sankeerth Rao |
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 252-259, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, Tali Kaufman |
High Dimensional Expanders Imply Agreement Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 974-985, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Yi-Jun Chang, Seth Pettie |
A Time Hierarchy Theorem for the LOCAL Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 156-167, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Allan Grønlund, Kasper Green Larsen |
A Dichotomy for Regular Expression Membership Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 307-318, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dakshita Khurana, Amit Sahai |
How to Achieve Non-Malleability in One or Two Rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 564-575, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Adam R. Klivans, Raghu Meka |
Learning Graphical Models Using Multiplicative Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 343-354, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Moses Charikar, Paris Siminelakis |
Hashing-Based-Estimators for Kernel Density in High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 1032-1043, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Manuela Fischer, Mohsen Ghaffari 0001, Fabian Kuhn |
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 180-191, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Krati Nayyar, Sharath Raghvendra |
An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 505-515, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Parinya 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](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 743-754, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward |
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 61-72, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Daniel M. Kane, Shachar Lovett, Shay Moran, Jiapeng Zhang |
Active Classification with Comparison Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 355-366, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Huijia Lin, Rafael Pass, Pratik Soni |
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 576-587, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Rishab Goyal, Venkata Koppula, Brent Waters |
Lockable Obfuscation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 612-621, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | David R. Karger |
Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 755-766, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random Θ(log n)-CNFs Are Hard for Cutting Planes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 109-120, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan |
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 801-812, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|