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/journals/siamcomp/siamcomp47.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/0009MS18,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
title = {An O(log m)-Competitive Algorithm for Online Machine Minimization},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2057--2077},
year = {2018},
url = {https://doi.org/10.1137/17M116032X},
doi = {10.1137/17M116032X},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/0009MS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AaronsonA18,
author = {Scott Aaronson and
Andris Ambainis},
title = {Forrelation: {A} Problem That Optimally Separates Quantum from Classical
Computing},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {982--1038},
year = {2018},
url = {https://doi.org/10.1137/15M1050902},
doi = {10.1137/15M1050902},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AaronsonA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbboudBP18,
author = {Amir Abboud and
Greg Bodwin and
Seth Pettie},
title = {A Hierarchy of Lower Bounds for Sublinear Additive Spanners},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2203--2236},
year = {2018},
url = {https://doi.org/10.1137/16M1105815},
doi = {10.1137/16M1105815},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbboudBP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbboudBW18,
author = {Amir Abboud and
Arturs Backurs and
Virginia Vassilevska Williams},
title = {If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2527--2555},
year = {2018},
url = {https://doi.org/10.1137/16M1061771},
doi = {10.1137/16M1061771},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbboudBW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbboudWY18,
author = {Amir Abboud and
Virginia Vassilevska Williams and
Huacheng Yu},
title = {Matching Triangles and Basing Hardness on an Extremely Popular Conjecture},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1098--1122},
year = {2018},
url = {https://doi.org/10.1137/15M1050987},
doi = {10.1137/15M1050987},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbboudWY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalDL18,
author = {Divesh Aggarwal and
Yevgeniy Dodis and
Shachar Lovett},
title = {Non-Malleable Codes from Additive Combinatorics},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {524--546},
year = {2018},
url = {https://doi.org/10.1137/140985251},
doi = {10.1137/140985251},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalDL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderGMMM18,
author = {Eric Allender and
Joshua A. Grochow and
Dieter van Melkebeek and
Cristopher Moore and
Andrew Morgan},
title = {Minimum Circuit Size, Graph Isomorphism, and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1339--1372},
year = {2018},
url = {https://doi.org/10.1137/17M1157970},
doi = {10.1137/17M1157970},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AllenderGMMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndoniKR18,
author = {Alexandr Andoni and
Robert Krauthgamer and
Ilya P. Razenshteyn},
title = {Sketching and Embedding are Equivalent for Norms},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {890--916},
year = {2018},
url = {https://doi.org/10.1137/15M1017958},
doi = {10.1137/15M1017958},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AndoniKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ApplebaumL18,
author = {Benny Applebaum and
Shachar Lovett},
title = {Algebraic Attacks against Random Local Functions and Their Countermeasures},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {52--79},
year = {2018},
url = {https://doi.org/10.1137/16M1085942},
doi = {10.1137/16M1085942},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ApplebaumL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AryaFM18,
author = {Sunil Arya and
Guilherme Dias da Fonseca and
David M. Mount},
title = {Approximate Polytope Membership Queries},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {1--51},
year = {2018},
url = {https://doi.org/10.1137/16M1061096},
doi = {10.1137/16M1061096},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AryaFM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BackursI18,
author = {Arturs Backurs and
Piotr Indyk},
title = {Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless
{SETH} is False)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1087--1097},
year = {2018},
url = {https://doi.org/10.1137/15M1053128},
doi = {10.1137/15M1053128},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BackursI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalcanH18,
author = {Maria{-}Florina Balcan and
Nicholas J. A. Harvey},
title = {Submodular Functions: Learnability, Structure, and Optimization},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {703--754},
year = {2018},
url = {https://doi.org/10.1137/120888909},
doi = {10.1137/120888909},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BalcanH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalGG18,
author = {Nikhil Bansal and
Anupam Gupta and
Guru Guruganesh},
title = {On the Lov{\'{a}}sz Theta Function for Independent Sets in Sparse
Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1039--1055},
year = {2018},
url = {https://doi.org/10.1137/15M1051002},
doi = {10.1137/15M1051002},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BansalGG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalGN018,
author = {Nikhil Bansal and
Shashwat Garg and
Jesper Nederlof and
Nikhil Vyas},
title = {Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related
Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1755--1777},
year = {2018},
url = {https://doi.org/10.1137/17M1158203},
doi = {10.1137/17M1158203},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BansalGN018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Barman18,
author = {Siddharth Barman},
title = {Approximating Nash Equilibria and Dense Subgraphs via an Approximate
Version of Carath{\'{e}}odory's Theorem},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {960--981},
year = {2018},
url = {https://doi.org/10.1137/15M1050574},
doi = {10.1137/15M1050574},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Barman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaCR18,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
title = {Fault-Tolerant Subgraph for Single-Source Reachability: General and
Optimal},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {80--95},
year = {2018},
url = {https://doi.org/10.1137/16M1087643},
doi = {10.1137/16M1087643},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaCR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS18,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected
Version)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {617--650},
year = {2018},
url = {https://doi.org/10.1137/16M1106158},
doi = {10.1137/16M1106158},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BateniHL18,
author = {Mohammad Hossein Bateni and
Mohammad Taghi Hajiaghayi and
Vahid Liaghat},
title = {Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner
Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1275--1293},
year = {2018},
url = {https://doi.org/10.1137/15M102695X},
doi = {10.1137/15M102695X},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BateniHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BelkinRV18,
author = {Mikhail Belkin and
Luis Rademacher and
James R. Voss},
title = {Eigenvectors of Orthogonally Decomposable Functions},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {547--615},
year = {2018},
url = {https://doi.org/10.1137/17M1122013},
doi = {10.1137/17M1122013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BelkinRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BenderKPY18,
author = {Michael A. Bender and
Tsvi Kopelowitz and
Seth Pettie and
Maxwell Young},
title = {Contention Resolution with Constant Throughput and Log-Logstar Channel
Accesses},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1735--1754},
year = {2018},
url = {https://doi.org/10.1137/17M1158604},
doi = {10.1137/17M1158604},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BenderKPY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharyaHI18,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {859--887},
year = {2018},
url = {https://doi.org/10.1137/140998925},
doi = {10.1137/140998925},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BitanskyCGHJLPT18,
author = {Nir Bitansky and
Ran Canetti and
Sanjam Garg and
Justin Holmgren and
Abhishek Jain and
Huijia Lin and
Rafael Pass and
Sidharth Telang and
Vinod Vaikuntanathan},
title = {Indistinguishability Obfuscation for {RAM} Programs and Succinct Randomized
Encodings},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1123--1210},
year = {2018},
url = {https://doi.org/10.1137/15M1050963},
doi = {10.1137/15M1050963},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BitanskyCGHJLPT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BousquetDT18,
author = {Nicolas Bousquet and
Jean Daligault and
St{\'{e}}phan Thomass{\'{e}}},
title = {Multicut Is {FPT}},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {166--207},
year = {2018},
url = {https://doi.org/10.1137/140961808},
doi = {10.1137/140961808},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BousquetDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BravermanGKMT18,
author = {Mark Braverman and
Ankit Garg and
Young Kun{-}Ko and
Jieming Mao and
Dave Touchette},
title = {Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity
of Disjointness},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2277--2314},
year = {2018},
url = {https://doi.org/10.1137/16M1061400},
doi = {10.1137/16M1061400},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BravermanGKMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchbinderNS18,
author = {Niv Buchbinder and
Joseph (Seffi) Naor and
Roy Schwartz},
title = {Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1463--1482},
year = {2018},
url = {https://doi.org/10.1137/15M1045521},
doi = {10.1137/15M1045521},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuchbinderNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BunUV18,
author = {Mark Bun and
Jonathan R. Ullman and
Salil P. Vadhan},
title = {Fingerprinting Codes and the Price of Approximate Differential Privacy},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1888--1938},
year = {2018},
url = {https://doi.org/10.1137/15M1033587},
doi = {10.1137/15M1033587},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BunUV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CanonneGR18,
author = {Cl{\'{e}}ment L. Canonne and
Themis Gouleakis and
Ronitt Rubinfeld},
title = {Sampling Correctors},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1373--1423},
year = {2018},
url = {https://doi.org/10.1137/16M1076666},
doi = {10.1137/16M1076666},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CanonneGR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartyEKP18,
author = {Deeparnab Chakrabarty and
Alina Ene and
Ravishankar Krishnaswamy and
Debmalya Panigrahi},
title = {Online Buy-at-Bulk Network Design},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1505--1528},
year = {2018},
url = {https://doi.org/10.1137/16M1117317},
doi = {10.1137/16M1117317},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChakrabartyEKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanCWZ18,
author = {T.{-}H. Hubert Chan and
Fei Chen and
Xiaowei Wu and
Zhichao Zhao},
title = {Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1529--1546},
year = {2018},
url = {https://doi.org/10.1137/140984051},
doi = {10.1137/140984051},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanCWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanHJ18,
author = {T.{-}H. Hubert Chan and
Shuguang Hu and
Shaofeng H.{-}C. Jiang},
title = {A {PTAS} for the Steiner Forest Problem in Doubling Metrics},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1705--1734},
year = {2018},
url = {https://doi.org/10.1137/16M1107206},
doi = {10.1137/16M1107206},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanHJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanN18,
author = {Timothy M. Chan and
Yakov Nekrich},
title = {Towards an Optimal Method for Dynamic Planar Point Location},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2337--2361},
year = {2018},
url = {https://doi.org/10.1137/16M1066506},
doi = {10.1137/16M1066506},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chekuri018,
author = {Chandra Chekuri and
Chao Xu},
title = {Minimum Cuts and Sparsification in Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2118--2156},
year = {2018},
url = {https://doi.org/10.1137/18M1163865},
doi = {10.1137/18M1163865},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chekuri018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriS18,
author = {Chandra Chekuri and
Anastasios Sidiropoulos},
title = {Approximation Algorithms for Euler Genus and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1610--1643},
year = {2018},
url = {https://doi.org/10.1137/14099228X},
doi = {10.1137/14099228X},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenHNVW18,
author = {Aloni Cohen and
Justin Holmgren and
Ryo Nishimaki and
Vinod Vaikuntanathan and
Daniel Wichs},
title = {Watermarking Cryptographic Capabilities},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2157--2202},
year = {2018},
url = {https://doi.org/10.1137/18M1164834},
doi = {10.1137/18M1164834},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CohenHNVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeG18,
author = {Richard Cole and
Vasilis Gkatzelis},
title = {Approximating the Nash Social Welfare with Indivisible Items},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1211--1236},
year = {2018},
url = {https://doi.org/10.1137/15M1053682},
doi = {10.1137/15M1053682},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CousinsV18,
author = {Ben Cousins and
Santosh S. Vempala},
title = {Gaussian Cooling and O\({}^{\mbox{*(n\({}^{\mbox{3)}}\)}}\) Algorithms
for Volume and Gaussian Volume},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1237--1273},
year = {2018},
url = {https://doi.org/10.1137/15M1054250},
doi = {10.1137/15M1054250},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CousinsV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajD18,
author = {Artur Czumaj and
Peter Davies},
title = {Deterministic Communication in Radio Networks},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {218--240},
year = {2018},
url = {https://doi.org/10.1137/17M1111322},
doi = {10.1137/17M1111322},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CzumajD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DanielySS18,
author = {Amit Daniely and
Michael Schapira and
Gal Shahaf},
title = {Inapproximability of Truthful Mechanisms via Generalizations of the
Vapnik-Chervonenkis Dimension},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {96--120},
year = {2018},
url = {https://doi.org/10.1137/15M1045971},
doi = {10.1137/15M1045971},
timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DanielySS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisKI18,
author = {Costis Daskalakis and
Yael Kalai and
Sandy Irani},
title = {Special Section on the Forty-Seventh Annual {ACM} Symposium on Theory
of Computing {(STOC} 2015)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {888--889},
year = {2018},
url = {https://doi.org/10.1137/18N974571},
doi = {10.1137/18N974571},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DaskalakisKI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DavidF18,
author = {Roee David and
Uriel Feige},
title = {Random Walks with the Minimum Degree Local Rule Have O(n\({}^{\mbox{2)}}\)
Cover Time},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {755--768},
year = {2018},
url = {https://doi.org/10.1137/17M1119901},
doi = {10.1137/17M1119901},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DavidF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DixitRTV18,
author = {Kashyap Dixit and
Sofya Raskhodnikova and
Abhradeep Thakurta and
Nithin Varma},
title = {Erasure-Resilient Property Testing},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {295--329},
year = {2018},
url = {https://doi.org/10.1137/16M1075661},
doi = {10.1137/16M1075661},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DixitRTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinFN18,
author = {Michael Elkin and
Arnold Filtser and
Ofer Neiman},
title = {Prioritized Metric Structures and Embedding},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {829--858},
year = {2018},
url = {https://doi.org/10.1137/17M1118749},
doi = {10.1137/17M1118749},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ElkinFN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanPV18,
author = {Vitaly Feldman and
Will Perkins and
Santosh S. Vempala},
title = {On the Complexity of Random Satisfiability Problems with Planted Solutions},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1294--1338},
year = {2018},
url = {https://doi.org/10.1137/16M1078471},
doi = {10.1137/16M1078471},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanPV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanZ18,
author = {Moran Feldman and
Rico Zenklusen},
title = {The Submodular Secretary Problem Goes Linear},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {330--366},
year = {2018},
url = {https://doi.org/10.1137/16M1105220},
doi = {10.1137/16M1105220},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmannFKP18,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
title = {A (1+{\(\epsilon\)})-Embedding of Low Highway Dimension Graphs into
Bounded Treewidth Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1667--1704},
year = {2018},
url = {https://doi.org/10.1137/16M1067196},
doi = {10.1137/16M1067196},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmannFKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GandikotaGG18,
author = {Venkata Gandikota and
Badih Ghazi and
Elena Grigorescu},
title = {NP-Hardness of Reed-Solomon Decoding, and the Prouhet-Tarry-Escott
Problem},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1547--1584},
year = {2018},
url = {https://doi.org/10.1137/16M110349X},
doi = {10.1137/16M110349X},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GandikotaGG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GhaffariKKLP18,
author = {Mohsen Ghaffari and
Andreas Karrenbauer and
Fabian Kuhn and
Christoph Lenzen and
Boaz Patt{-}Shamir},
title = {Near-Optimal Distributed Maximum Flow},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2078--2117},
year = {2018},
url = {https://doi.org/10.1137/17M113277X},
doi = {10.1137/17M113277X},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GhaffariKKLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GiannakopoulosK18,
author = {Yiannis Giannakopoulos and
Elias Koutsoupias},
title = {Duality and Optimality of Auctions for Uniform Distributions},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {121--165},
year = {2018},
url = {https://doi.org/10.1137/16M1072218},
doi = {10.1137/16M1072218},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GiannakopoulosK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolabLLN18,
author = {Wojciech M. Golab and
Xiaozhou (Steve) Li and
Alejandro L{\'{o}}pez{-}Ortiz and
Naomi Nishimura},
title = {Computing k-Atomicity in Polynomial Time},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {420--455},
year = {2018},
url = {https://doi.org/10.1137/16M1056389},
doi = {10.1137/16M1056389},
timestamp = {Wed, 10 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolabLLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Goos0018,
author = {Mika G{\"{o}}{\"{o}}s and
Rahul Jain and
Thomas Watson},
title = {Extension Complexity of Independent Set Polytopes},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {241--269},
year = {2018},
url = {https://doi.org/10.1137/16M109884X},
doi = {10.1137/16M109884X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Goos0018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosP018,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {Deterministic Communication vs. Partition Number},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2435--2450},
year = {2018},
url = {https://doi.org/10.1137/16M1059369},
doi = {10.1137/16M1059369},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoosP018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosP18,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi},
title = {Communication Lower Bounds via Critical Block Sensitivity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1778--1806},
year = {2018},
url = {https://doi.org/10.1137/16M1082007},
doi = {10.1137/16M1082007},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoosP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKM18,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
title = {Pseudorandomness via the Discrete Fourier Transform},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2451--2487},
year = {2018},
url = {https://doi.org/10.1137/16M1062132},
doi = {10.1137/16M1062132},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GottlobM18,
author = {Georg Gottlob and
Enrico Malizia},
title = {Achieving New Upper Bounds for the Hypergraph Duality Problem through
Logic},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {456--492},
year = {2018},
url = {https://doi.org/10.1137/15M1027267},
doi = {10.1137/15M1027267},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GottlobM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaramatyLV18,
author = {Elad Haramaty and
Chin Ho Lee and
Emanuele Viola},
title = {Bounded Independence Plus Noise Fools Products},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {493--523},
year = {2018},
url = {https://doi.org/10.1137/17M1129088},
doi = {10.1137/17M1129088},
timestamp = {Wed, 23 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HaramatyLV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HatamiHL18,
author = {Hamed Hatami and
Kaave Hosseini and
Shachar Lovett},
title = {Structure of Protocols for {XOR} Functions},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {208--217},
year = {2018},
url = {https://doi.org/10.1137/17M1136869},
doi = {10.1137/17M1136869},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HatamiHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuangMR18,
author = {Zhiyi Huang and
Yishay Mansour and
Tim Roughgarden},
title = {Making the Most of Your Samples},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {651--674},
year = {2018},
url = {https://doi.org/10.1137/16M1065719},
doi = {10.1137/16M1065719},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuangMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanMRS18,
author = {Haim Kaplan and
Wolfgang Mulzer and
Liam Roditty and
Paul Seiferth},
title = {Spanners for Directed Transmission Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1585--1609},
year = {2018},
url = {https://doi.org/10.1137/16M1059692},
doi = {10.1137/16M1059692},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaplanMRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kawarabayashi018,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi},
title = {All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality
in Planar Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1483--1504},
year = {2018},
url = {https://doi.org/10.1137/130932326},
doi = {10.1137/130932326},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kawarabayashi018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KesselheimRTV18,
author = {Thomas Kesselheim and
Klaus Radke and
Andreas T{\"{o}}nnis and
Berthold V{\"{o}}cking},
title = {Primal Beats Dual on Online Packing LPs in the Random-Order Model},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1939--1964},
year = {2018},
url = {https://doi.org/10.1137/15M1033708},
doi = {10.1137/15M1033708},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KesselheimRTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotMS18,
author = {Subhash Khot and
Dor Minzer and
Muli Safra},
title = {On Monotonicity Testing and Boolean Isoperimetric-type Theorems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2238--2276},
year = {2018},
url = {https://doi.org/10.1137/16M1065872},
doi = {10.1137/16M1065872},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhotMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kolmogorov18,
author = {Vladimir Kolmogorov},
title = {Commutativity in the Algorithmic Lov{\'{a}}sz Local Lemma},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2029--2056},
year = {2018},
url = {https://doi.org/10.1137/16M1093306},
doi = {10.1137/16M1093306},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kolmogorov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KorulaMZ18,
author = {Nitish Korula and
Vahab S. Mirrokni and
Morteza Zadimoghaddam},
title = {Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random
Order},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {1056--1086},
year = {2018},
url = {https://doi.org/10.1137/15M1051142},
doi = {10.1137/15M1051142},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KorulaMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lee018,
author = {Yin Tat Lee and
He Sun},
title = {Constructing Linear-Sized Spectral Sparsification in Almost-Linear
Time},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2315--2336},
year = {2018},
url = {https://doi.org/10.1137/16M1061850},
doi = {10.1137/16M1061850},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lee018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiTW18,
author = {Fu Li and
Iddo Tzameret and
Zhengyu Wang},
title = {Characterizing Propositional Proofs as Noncommutative Formulas},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1424--1462},
year = {2018},
url = {https://doi.org/10.1137/16M1107632},
doi = {10.1137/16M1107632},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LinW18,
author = {Jiabao Lin and
Hanpin Wang},
title = {The Complexity of Boolean Holant Problems with Nonnegative Weights},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {798--828},
year = {2018},
url = {https://doi.org/10.1137/17M113304X},
doi = {10.1137/17M113304X},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LinW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LokshtanovMS18,
author = {Daniel Lokshtanov and
D{\'{a}}niel Marx and
Saket Saurabh},
title = {Slightly Superexponential Parameterized Problems},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {675--702},
year = {2018},
url = {https://doi.org/10.1137/16M1104834},
doi = {10.1137/16M1104834},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LokshtanovMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MadelaineM18,
author = {Florent R. Madelaine and
Barnaby Martin},
title = {On the Complexity of the Model Checking Problem},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {769--797},
year = {2018},
url = {https://doi.org/10.1137/140965715},
doi = {10.1137/140965715},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MadelaineM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarcusSS18,
author = {Adam W. Marcus and
Daniel A. Spielman and
Nikhil Srivastava},
title = {Interlacing Families {IV:} Bipartite Ramanujan Graphs of All Sizes},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2488--2509},
year = {2018},
url = {https://doi.org/10.1137/16M106176X},
doi = {10.1137/16M106176X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MarcusSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mehta18,
author = {Ruta Mehta},
title = {Constant Rank Two-Player Games are PPAD-hard},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1858--1887},
year = {2018},
url = {https://doi.org/10.1137/15M1032338},
doi = {10.1137/15M1032338},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mehta18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MooreV18,
author = {Cristopher Moore and
Santosh S. Vempala},
title = {Special Section on the Fifty-Sixth Annual {IEEE} Symposium on Foundations
of Computer Science {(FOCS} 2015)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2237},
year = {2018},
url = {https://doi.org/10.1137/18N974698},
doi = {10.1137/18N974698},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MooreV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MukhopadhyayRS18,
author = {Sagnik Mukhopadhyay and
Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {Separation Between Deterministic and Randomized Query Complexity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1644--1666},
year = {2018},
url = {https://doi.org/10.1137/17M1124115},
doi = {10.1137/17M1124115},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MukhopadhyayRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rossman18,
author = {Benjamin Rossman},
title = {Formulas versus Circuits for Small Distance Connectivity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1986--2028},
year = {2018},
url = {https://doi.org/10.1137/15M1027310},
doi = {10.1137/15M1027310},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rossman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rubinstein18,
author = {Aviad Rubinstein},
title = {Inapproximability of Nash Equilibrium},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {917--959},
year = {2018},
url = {https://doi.org/10.1137/15M1039274},
doi = {10.1137/15M1039274},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rubinstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov18,
author = {Alexander A. Sherstov},
title = {Compressing Interactive Communication Under Product Distributions},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {2},
pages = {367--419},
year = {2018},
url = {https://doi.org/10.1137/16M109380X},
doi = {10.1137/16M109380X},
timestamp = {Wed, 23 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sherstov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov18a,
author = {Alexander A. Sherstov},
title = {Breaking the Minsky-Papert Barrier for Constant-Depth Circuits},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1809--1857},
year = {2018},
url = {https://doi.org/10.1137/15M1015704},
doi = {10.1137/15M1015704},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sherstov18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov18b,
author = {Alexander A. Sherstov},
title = {The Power of Asymmetry in Constant-Depth Circuits},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2362--2434},
year = {2018},
url = {https://doi.org/10.1137/16M1064477},
doi = {10.1137/16M1064477},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sherstov18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SinghV18,
author = {Mohit Singh and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Approximating Minimum Cost Connectivity Orientation and Augmentation},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {270--293},
year = {2018},
url = {https://doi.org/10.1137/15100583X},
doi = {10.1137/15100583X},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SinghV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SmithK18,
author = {Adam Smith and
Jochen K{\"{o}}nemann},
title = {Special Section on the Forty-Sixth Annual {ACM} Symposium on Theory
of Computing {(STOC} 2014)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1807--1808},
year = {2018},
url = {https://doi.org/10.1137/18N974637},
doi = {10.1137/18N974637},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SmithK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Thorup18,
author = {Mikkel Thorup},
title = {Sample(x)=(a*x{\textless}=t) Is a Distinguisher with Probability 1/8},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2510--2526},
year = {2018},
url = {https://doi.org/10.1137/16M1059461},
doi = {10.1137/16M1059461},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Thorup18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Williams18,
author = {R. Ryan Williams},
title = {Faster All-Pairs Shortest Paths via Circuit Complexity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1965--1985},
year = {2018},
url = {https://doi.org/10.1137/15M1024524},
doi = {10.1137/15M1024524},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Williams18.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-05-24 11:09 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:
