Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/focs/focs2018.bht:"
download as .bib file
@inproceedings{DBLP:conf/focs/0002PP18,
author = {Marco Bressan and
Enoch Peserico and
Luca Pretto},
editor = {Mikkel Thorup},
title = {Sublinear Algorithms for Local Graph Centrality Estimation},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {709--718},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00073},
doi = {10.1109/FOCS.2018.00073},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002PP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS18,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
editor = {Mikkel Thorup},
title = {Finding Forbidden Minors in Sublinear Time: {A} n1/2+o(1)-Query One-Sided
Tester for Minor Closed Properties on Bounded Degree Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {509--520},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00055},
doi = {10.1109/FOCS.2018.00055},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0003SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Adamczyk018,
author = {Marek Adamczyk and
Michal Wlodarczyk},
editor = {Mikkel Thorup},
title = {Random Order Contention Resolution Schemes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {790--801},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00080},
doi = {10.1109/FOCS.2018.00080},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Adamczyk018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanW18,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {Mikkel Thorup},
title = {Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {580--591},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00061},
doi = {10.1109/FOCS.2018.00061},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariGV18,
author = {Nima Anari and
Shayan Oveis Gharan and
Cynthia Vinzant},
editor = {Mikkel Thorup},
title = {Log-Concave Polynomials, Entropy, and a Deterministic Approximation
Algorithm for Counting Bases of Matroids},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {35--46},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00013},
doi = {10.1109/FOCS.2018.00013},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariGV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariV18,
author = {Nima Anari and
Vijay V. Vazirani},
editor = {Mikkel Thorup},
title = {Planar Graph Perfect Matching Is in {NC}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {650--661},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00068},
doi = {10.1109/FOCS.2018.00068},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniNNRW18,
author = {Alexandr Andoni and
Assaf Naor and
Aleksandar Nikolov and
Ilya P. Razenshteyn and
Erik Waingarten},
editor = {Mikkel Thorup},
title = {H{\"{o}}lder Homeomorphisms and Approximate Nearest Neighbors},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {159--169},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00024},
doi = {10.1109/FOCS.2018.00024},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniNNRW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniSSWZ18,
author = {Alexandr Andoni and
Zhao Song and
Clifford Stein and
Zhengyu Wang and
Peilin Zhong},
editor = {Mikkel Thorup},
title = {Parallel Graph Connectivity in Log Diameter Rounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {674--685},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00070},
doi = {10.1109/FOCS.2018.00070},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniSSWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AwasthiV18,
author = {Pranjal Awasthi and
Aravindan Vijayaraghavan},
editor = {Mikkel Thorup},
title = {Towards Learning Sparsely Used Dictionaries with Arbitrary Supports},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {283--296},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00035},
doi = {10.1109/FOCS.2018.00035},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AwasthiV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarT18,
author = {Yossi Azar and
Noam Touitou},
editor = {Mikkel Thorup},
title = {Improved Online Algorithm for Weighted Flow Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {427--437},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00048},
doi = {10.1109/FOCS.2018.00048},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AzarT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BackursCIS18,
author = {Arturs Backurs and
Moses Charikar and
Piotr Indyk and
Paris Siminelakis},
editor = {Mikkel Thorup},
title = {Efficient Density Evaluation for Smooth Kernels},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {615--626},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00065},
doi = {10.1109/FOCS.2018.00065},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BackursCIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BalcanDV18,
author = {Maria{-}Florina Balcan and
Travis Dick and
Ellen Vitercik},
editor = {Mikkel Thorup},
title = {Dispersion for Data-Driven Algorithm Design, Online Learning, and
Private Optimization},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {603--614},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00064},
doi = {10.1109/FOCS.2018.00064},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BalcanDV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BallDGMT18,
author = {Marshall Ball and
Dana Dachman{-}Soled and
Siyao Guo and
Tal Malkin and
Li{-}Yang Tan},
editor = {Mikkel Thorup},
title = {Non-Malleable Codes for Small-Depth Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {826--837},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00083},
doi = {10.1109/FOCS.2018.00083},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BallDGMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Batra0K18,
author = {Jatin Batra and
Naveen Garg and
Amit Kumar},
editor = {Mikkel Thorup},
title = {Constant Factor Approximation Algorithm for Weighted Flow Time on
a Single Machine in Pseudo-Polynomial Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {778--789},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00079},
doi = {10.1109/FOCS.2018.00079},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Batra0K18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelHMO18,
author = {Amos Beimel and
Iftach Haitner and
Nikolaos Makriyannis and
Eran Omri},
editor = {Mikkel Thorup},
title = {Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales
and Differentially Private Sampling},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {838--849},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00084},
doi = {10.1109/FOCS.2018.00084},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeimelHMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidBGK18,
author = {Shalev Ben{-}David and
Adam Bouland and
Ankit Garg and
Robin Kothari},
editor = {Mikkel Thorup},
title = {Classical Lower Bounds from Quantum Upper Bounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {339--349},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00040},
doi = {10.1109/FOCS.2018.00040},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidBGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderFGJM018,
author = {Michael A. Bender and
Martin Farach{-}Colton and
Mayank Goswami and
Rob Johnson and
Samuel McCauley and
Shikha Singh},
editor = {Mikkel Thorup},
title = {Bloom Filters, Adaptivity, and the Dictionary Problem},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {182--193},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00026},
doi = {10.1109/FOCS.2018.00026},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenderFGJM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BergBKK18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
editor = {Mikkel Thorup},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {450--461},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00050},
doi = {10.1109/FOCS.2018.00050},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BergBKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhargavaSV18,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
editor = {Mikkel Thorup},
title = {Deterministic Factorization of Sparse Polynomials with Bounded Individual
Degree},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {485--496},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00053},
doi = {10.1109/FOCS.2018.00053},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BhargavaSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonamyBBCT18,
author = {Marthe Bonamy and
Edouard Bonnet and
Nicolas Bousquet and
Pierre Charbit and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Mikkel Thorup},
title = {{EPTAS} for Max Clique on Disks and Unit Balls},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {568--579},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00060},
doi = {10.1109/FOCS.2018.00060},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BonamyBBCT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorgsCSZ18,
author = {Christian Borgs and
Jennifer T. Chayes and
Adam D. Smith and
Ilias Zadik},
editor = {Mikkel Thorup},
title = {Revealing Network Structure, Confidentially: Improved Rates for Node-Private
Graphon Estimation},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {533--543},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00057},
doi = {10.1109/FOCS.2018.00057},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorgsCSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakerskiCMVV18,
author = {Zvika Brakerski and
Paul F. Christiano and
Urmila Mahadev and
Umesh V. Vazirani and
Thomas Vidick},
editor = {Mikkel Thorup},
title = {A Cryptographic Test of Quantumness and Certifiable Randomness from
a Single Quantum Device},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {320--331},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00038},
doi = {10.1109/FOCS.2018.00038},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrakerskiCMVV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurgisserFGOWW18,
author = {Peter B{\"{u}}rgisser and
Cole Franks and
Ankit Garg and
Rafael Mendes de Oliveira and
Michael Walter and
Avi Wigderson},
editor = {Mikkel Thorup},
title = {Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment
Polytopes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {883--897},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00088},
doi = {10.1109/FOCS.2018.00088},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BurgisserFGOWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Carbonnel0Z18,
author = {Cl{\'{e}}ment Carbonnel and
Miguel Romero and
Stanislav Zivn{\'{y}}},
editor = {Mikkel Thorup},
title = {The Complexity of General-Valued CSPs Seen from the Other Side},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {236--246},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00031},
doi = {10.1109/FOCS.2018.00031},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Carbonnel0Z18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabortyDGKS18,
author = {Diptarka Chakraborty and
Debarati Das and
Elazar Goldenberg and
Michal Kouck{\'{y}} and
Michael E. Saks},
editor = {Mikkel Thorup},
title = {Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic
Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {979--990},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00096},
doi = {10.1109/FOCS.2018.00096},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabortyDGKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayM18,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande},
editor = {Mikkel Thorup},
title = {A Short List of Equalities Induces Large Sign Rank},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {47--58},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00014},
doi = {10.1109/FOCS.2018.00014},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chechik18,
author = {Shiri Chechik},
editor = {Mikkel Thorup},
title = {Near-Optimal Approximate Decremental All Pairs Shortest Paths},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {170--181},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00025},
doi = {10.1109/FOCS.2018.00025},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chechik18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChengJLW18,
author = {Kuan Cheng and
Zhengzhong Jin and
Xin Li and
Ke Wu},
editor = {Mikkel Thorup},
title = {Deterministic Document Exchange Protocols, and Almost Optimal Binary
Codes for Edit Errors},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {200--211},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00028},
doi = {10.1109/FOCS.2018.00028},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChengJLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiesaFGS18,
author = {Alessandro Chiesa and
Michael A. Forbes and
Tom Gur and
Nicholas Spooner},
editor = {Mikkel Thorup},
title = {Spatial Isolation Implies Zero Knowledge Even in a Quantum World},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {755--765},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00077},
doi = {10.1109/FOCS.2018.00077},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChiesaFGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChillaraEL018,
author = {Suryajith Chillara and
Christian Engels and
Nutan Limaye and
Srikanth Srinivasan},
editor = {Mikkel Thorup},
title = {A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear
Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {934--945},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00092},
doi = {10.1109/FOCS.2018.00092},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChillaraEL018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiplunkarKKMP18,
author = {Ashish Chiplunkar and
Michael Kapralov and
Sanjeev Khanna and
Aida Mousavifar and
Yuval Peres},
editor = {Mikkel Thorup},
title = {Testing Graph Clusterability: Algorithms and Lower Bounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {497--508},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00054},
doi = {10.1109/FOCS.2018.00054},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKKMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuGPSSW18,
author = {Timothy Chu and
Yu Gao and
Richard Peng and
Sushant Sachdeva and
Saurabh Sawlani and
Junxing Wang},
editor = {Mikkel Thorup},
title = {Graph Sparsification, Spectral Sketches, and Faster Resistance Computation,
via Short Cycle Decompositions},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {361--372},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00042},
doi = {10.1109/FOCS.2018.00042},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChuGPSSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenKKPPRS18,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
editor = {Mikkel Thorup},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {898--909},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00089},
doi = {10.1109/FOCS.2018.00089},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenKKPPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DadushNTT18,
author = {Daniel Dadush and
Aleksandar Nikolov and
Kunal Talwar and
Nicole Tomczak{-}Jaegermann},
editor = {Mikkel Thorup},
title = {Balancing Vectors in Any Norm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00010},
doi = {10.1109/FOCS.2018.00010},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DadushNTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaskalakisGTZ18,
author = {Constantinos Daskalakis and
Themis Gouleakis and
Christos Tzamos and
Manolis Zampetakis},
editor = {Mikkel Thorup},
title = {Efficient Statistics, in High Dimensions, from Truncated Samples},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {639--649},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00067},
doi = {10.1109/FOCS.2018.00067},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaskalakisGTZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeLS18,
author = {Anindya De and
Philip M. Long and
Rocco A. Servedio},
editor = {Mikkel Thorup},
title = {Learning Sums of Independent Random Variables with Sparse Collective
Support},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {297--308},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00036},
doi = {10.1109/FOCS.2018.00036},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EldarM18,
author = {Lior Eldar and
Saeed Mehraban},
editor = {Mikkel Thorup},
title = {Approximating the Permanent of a Random Matrix with Vanishing Mean},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {23--34},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00012},
doi = {10.1109/FOCS.2018.00012},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EldarM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EsfandiariM18,
author = {Hossein Esfandiari and
Michael Mitzenmacher},
editor = {Mikkel Thorup},
title = {Metric Sublinear Algorithms via Linear Sampling},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {11--22},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00011},
doi = {10.1109/FOCS.2018.00011},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EsfandiariM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FahrbachMPSWX18,
author = {Matthew Fahrbach and
Gary L. Miller and
Richard Peng and
Saurabh Sawlani and
Junxing Wang and
Shen Chen Xu},
editor = {Mikkel Thorup},
title = {Graph Sketching against Adaptive Adversaries Applied to the Minimum
Degree Algorithm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {101--112},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00019},
doi = {10.1109/FOCS.2018.00019},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FahrbachMPSWX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FawziGL18,
author = {Omar Fawzi and
Antoine Grospellier and
Anthony Leverrier},
editor = {Mikkel Thorup},
title = {Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00076},
doi = {10.1109/FOCS.2018.00076},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FawziGL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanMTT18,
author = {Vitaly Feldman and
Ilya Mironov and
Kunal Talwar and
Abhradeep Thakurta},
editor = {Mikkel Thorup},
title = {Privacy Amplification by Iteration},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {521--532},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00056},
doi = {10.1109/FOCS.2018.00056},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanMTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FengH18,
author = {Yiding Feng and
Jason D. Hartline},
editor = {Mikkel Thorup},
title = {An End-to-End Argument in Mechanism Design (Prior-Independent Auctions
for Budgeted Agents)},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {404--415},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00046},
doi = {10.1109/FOCS.2018.00046},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FengH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FerberJ18,
author = {Asaf Ferber and
Vishesh Jain},
editor = {Mikkel Thorup},
title = {1-Factorizations of Pseudorandom Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {698--708},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00072},
doi = {10.1109/FOCS.2018.00072},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FerberJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ForbesK18,
author = {Michael A. Forbes and
Zander Kelley},
editor = {Mikkel Thorup},
title = {Pseudorandom Generators for Read-Once Branching Programs, in Any Order},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {946--955},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00093},
doi = {10.1109/FOCS.2018.00093},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ForbesK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ForsterN18,
author = {Sebastian Forster and
Danupon Nanongkai},
editor = {Mikkel Thorup},
title = {A Faster Distributed Single-Source Shortest Paths Algorithm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {686--697},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00071},
doi = {10.1109/FOCS.2018.00071},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ForsterN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaffariHK18,
author = {Mohsen Ghaffari and
David G. Harris and
Fabian Kuhn},
editor = {Mikkel Thorup},
title = {On Derandomizing Local Distributed Algorithms},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {662--673},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00069},
doi = {10.1109/FOCS.2018.00069},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhaffariHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldreichR18,
author = {Oded Goldreich and
Guy N. Rothblum},
editor = {Mikkel Thorup},
title = {Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct
Interactive Proof Systems},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {77--88},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00017},
doi = {10.1109/FOCS.2018.00017},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldreichR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GonczarowskiW18,
author = {Yannai A. Gonczarowski and
S. Matthew Weinberg},
editor = {Mikkel Thorup},
title = {The Sample Complexity of Up-to-{\(\epsilon\)} Multi-Dimensional Revenue
Maximization},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {416--426},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00047},
doi = {10.1109/FOCS.2018.00047},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GonczarowskiW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosR18,
author = {Mika G{\"{o}}{\"{o}}s and
Aviad Rubinstein},
editor = {Mikkel Thorup},
title = {Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {397--403},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00045},
doi = {10.1109/FOCS.2018.00045},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrinbergSV18,
author = {Aryeh Grinberg and
Ronen Shaltiel and
Emanuele Viola},
editor = {Mikkel Thorup},
title = {Indistinguishability by Adaptive Procedures with Advice, and Lower
Bounds on Hardness Amplification Proofs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {956--966},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00094},
doi = {10.1109/FOCS.2018.00094},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrinbergSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GroheNS18,
author = {Martin Grohe and
Daniel Neuen and
Pascal Schweitzer},
editor = {Mikkel Thorup},
title = {A Faster Isomorphism Test for Graphs of Small Degree},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {89--100},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00018},
doi = {10.1109/FOCS.2018.00018},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GroheNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaLL18,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Mikkel Thorup},
title = {Faster Exact and Approximate Algorithms for k-Cut},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {113--123},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00020},
doi = {10.1109/FOCS.2018.00020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuptaLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaahHKL18,
author = {Jeongwan Haah and
Matthew B. Hastings and
Robin Kothari and
Guang Hao Low},
editor = {Mikkel Thorup},
title = {Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {350--360},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00041},
doi = {10.1109/FOCS.2018.00041},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaahHKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaitnerNOSS18,
author = {Iftach Haitner and
Kobbi Nissim and
Eran Omri and
Ronen Shaltiel and
Jad Silbak},
editor = {Mikkel Thorup},
title = {Computational Two-Party Correlation: {A} Dichotomy for Key-Agreement
Protocols},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {136--147},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00022},
doi = {10.1109/FOCS.2018.00022},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaitnerNOSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hastad18,
author = {Johan H{\aa}stad},
editor = {Mikkel Thorup},
title = {Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {602},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00063},
doi = {10.1109/FOCS.2018.00063},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hastad18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hirahara18,
author = {Shuichi Hirahara},
editor = {Mikkel Thorup},
title = {Non-Black-Box Worst-Case to Average-Case Reductions within {NP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {247--258},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00032},
doi = {10.1109/FOCS.2018.00032},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hirahara18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmgrenL18,
author = {Justin Holmgren and
Alex Lombardi},
editor = {Mikkel Thorup},
title = {Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product
Functions and Their Applications)},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {850--858},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00085},
doi = {10.1109/FOCS.2018.00085},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmgrenL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmgrenR18,
author = {Justin Holmgren and
Ron Rothblum},
editor = {Mikkel Thorup},
title = {Delegating Computations with (Almost) Minimal Time and Space Overhead},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {124--135},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00021},
doi = {10.1109/FOCS.2018.00021},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmgrenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HozaZ18,
author = {William Hoza and
David Zuckerman},
editor = {Mikkel Thorup},
title = {Simple Optimal Hitting Sets for Small-Success {RL}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {59--64},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00015},
doi = {10.1109/FOCS.2018.00015},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HozaZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangJLW18,
author = {Lingxiao Huang and
Shaofeng H.{-}C. Jiang and
Jian Li and
Xuan Wu},
editor = {Mikkel Thorup},
title = {Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {814--825},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00082},
doi = {10.1109/FOCS.2018.00082},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HuangJLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IwataYY18,
author = {Yoichi Iwata and
Yutaro Yamaguchi and
Yuichi Yoshida},
editor = {Mikkel Thorup},
title = {0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time {FPT}
Algorithms},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {462--473},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00051},
doi = {10.1109/FOCS.2018.00051},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IwataYY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JayaramW18,
author = {Rajesh Jayaram and
David P. Woodruff},
editor = {Mikkel Thorup},
title = {Perfect Lp Sampling in a Data Stream},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {544--555},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00058},
doi = {10.1109/FOCS.2018.00058},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JayaramW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KallaugherKP18,
author = {John Kallaugher and
Michael Kapralov and
Eric Price},
editor = {Mikkel Thorup},
title = {The Sketching Complexity of Graph and Hypergraph Counting},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {556--567},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00059},
doi = {10.1109/FOCS.2018.00059},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KallaugherKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotMS18,
author = {Subhash Khot and
Dor Minzer and
Muli Safra},
editor = {Mikkel Thorup},
title = {Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {592--601},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00062},
doi = {10.1109/FOCS.2018.00062},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KhotMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KleinbergI18,
author = {Robert Kleinberg and
Nicole Immorlica},
editor = {Mikkel Thorup},
title = {Recharging Bandits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {309--319},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00037},
doi = {10.1109/FOCS.2018.00037},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KleinbergI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KoppartyRSW18,
author = {Swastik Kopparty and
Noga Ron{-}Zewi and
Shubhangi Saraf and
Mary Wootters},
editor = {Mikkel Thorup},
title = {Improved Decoding of Folded Reed-Solomon and Multiplicity Codes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {212--223},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00029},
doi = {10.1109/FOCS.2018.00029},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KoppartyRSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngS18,
author = {Rasmus Kyng and
Zhao Song},
editor = {Mikkel Thorup},
title = {A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral
Sparsifiers from a few Random Spanning Trees},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {373--384},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00043},
doi = {10.1109/FOCS.2018.00043},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lee18,
author = {James R. Lee},
editor = {Mikkel Thorup},
title = {Fusible HSTs and the Randomized k-Server Conjecture},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {438--449},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00049},
doi = {10.1109/FOCS.2018.00049},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lee18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LemeS18,
author = {Renato Paes Leme and
Jon Schneider},
editor = {Mikkel Thorup},
title = {Contextual Search via Intrinsic Volumes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {268--282},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00034},
doi = {10.1109/FOCS.2018.00034},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LemeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiS18,
author = {Huan Li and
Aaron Schild},
editor = {Mikkel Thorup},
title = {Spectral Subspace Sparsification},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {385--396},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00044},
doi = {10.1109/FOCS.2018.00044},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LiS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuM18,
author = {Allen Liu and
Ankur Moitra},
editor = {Mikkel Thorup},
title = {Efficiently Learning Mixtures of Mallows Models},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {627--638},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00066},
doi = {10.1109/FOCS.2018.00066},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiuM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lovett18,
author = {Shachar Lovett},
editor = {Mikkel Thorup},
title = {{MDS} Matrices over Small Fields: {A} Proof of the {GM-MDS} Conjecture},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {194--199},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00027},
doi = {10.1109/FOCS.2018.00027},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lovett18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mahadev18,
author = {Urmila Mahadev},
editor = {Mikkel Thorup},
title = {Classical Verification of Quantum Computations},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {259--267},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00033},
doi = {10.1109/FOCS.2018.00033},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mahadev18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mahadev18a,
author = {Urmila Mahadev},
editor = {Mikkel Thorup},
title = {Classical Homomorphic Encryption for Quantum Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {332--338},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00039},
doi = {10.1109/FOCS.2018.00039},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mahadev18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MarxPP18,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Mikkel Thorup},
title = {On Subexponential Parameterized Algorithms for Steiner Tree and Directed
Subset {TSP} on Planar Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {474--484},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00052},
doi = {10.1109/FOCS.2018.00052},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MarxPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoharJ18,
author = {Bojan Mohar and
Yifan Jing},
editor = {Mikkel Thorup},
title = {Efficient Polynomial-Time Approximation Scheme for the Genus of Dense
Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {719--730},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00074},
doi = {10.1109/FOCS.2018.00074},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MoharJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NatarajanV18,
author = {Anand Natarajan and
Thomas Vidick},
editor = {Mikkel Thorup},
title = {Low-Degree Testing for Quantum States, and a Quantum Entangled Games
{PCP} for {QMA}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {731--742},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00075},
doi = {10.1109/FOCS.2018.00075},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NatarajanV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OliveiraS18,
author = {Igor Carboni Oliveira and
Rahul Santhanam},
editor = {Mikkel Thorup},
title = {Hardness Magnification for Natural Problems},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {65--76},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00016},
doi = {10.1109/FOCS.2018.00016},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/OliveiraS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatelP0Y18,
author = {Sarvar Patel and
Giuseppe Persiano and
Mariana Raykova and
Kevin Yeo},
editor = {Mikkel Thorup},
title = {PanORAMa: Oblivious {RAM} with Logarithmic Overhead},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {871--882},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00087},
doi = {10.1109/FOCS.2018.00087},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatelP0Y18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/QuachWW18,
author = {Willy Quach and
Hoeteck Wee and
Daniel Wichs},
editor = {Mikkel Thorup},
title = {Laconic Function Evaluation and Applications},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {859--870},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00086},
doi = {10.1109/FOCS.2018.00086},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/QuachWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rubin18,
author = {Natan Rubin},
editor = {Mikkel Thorup},
title = {An Improved Bound for Weak Epsilon-Nets in the Plane},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {224--235},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00030},
doi = {10.1109/FOCS.2018.00030},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rubin18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Saglam18,
author = {Mert Saglam},
editor = {Mikkel Thorup},
title = {Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {967--978},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00095},
doi = {10.1109/FOCS.2018.00095},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Saglam18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Sanita18,
author = {Laura Sanit{\`{a}}},
editor = {Mikkel Thorup},
title = {The Diameter of the Fractional Matching Polytope and Its Hardness
Implications},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {910--921},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00090},
doi = {10.1109/FOCS.2018.00090},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Sanita18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SidfordT18,
author = {Aaron Sidford and
Kevin Tian},
editor = {Mikkel Thorup},
title = {Coordinate Methods for Accelerating {\(\mathscr{l}\)}{\(\infty\)}
Regression and Faster Approximate Maximum Flow},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {922--933},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00091},
doi = {10.1109/FOCS.2018.00091},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SidfordT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SohlerW18,
author = {Christian Sohler and
David P. Woodruff},
editor = {Mikkel Thorup},
title = {Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {802--813},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00081},
doi = {10.1109/FOCS.2018.00081},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/SohlerW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SotirakiZZ18,
author = {Katerina Sotiraki and
Manolis Zampetakis and
Giorgos Zirdelis},
editor = {Mikkel Thorup},
title = {PPP-Completeness with Connections to Cryptography},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {148--158},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00023},
doi = {10.1109/FOCS.2018.00023},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SotirakiZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TraubV18,
author = {Vera Traub and
Jens Vygen},
editor = {Mikkel Thorup},
title = {Beating the Integrality Ratio for s-t-Tours in Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {766--777},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00078},
doi = {10.1109/FOCS.2018.00078},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TraubV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2018,
editor = {Mikkel Thorup},
title = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://ieeexplore.ieee.org/xpl/conhome/8554191/proceeding},
isbn = {978-1-5386-4230-6},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 17:38 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
