Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp49.bht:"
@article{DBLP:journals/siamcomp/Aaronson20, author = {Scott Aaronson}, title = {Shadow Tomography of Quantum States}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M120275X}, doi = {10.1137/18M120275X}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Aaronson20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AhmadianNSW20, author = {Sara Ahmadian and Ashkan Norouzi{-}Fard and Ola Svensson and Justin Ward}, title = {Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/18M1171321}, doi = {10.1137/18M1171321}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AhmadianNSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AntoniadisIKMNP20, author = {Antonios Antoniadis and Sungjin Im and Ravishankar Krishnaswamy and Benjamin Moseley and Viswanath Nagarajan and Kirk Pruhs and Clifford Stein}, title = {Hallucination Helps: Energy Efficient Virtual Circuit Routing}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {37--66}, year = {2020}, url = {https://doi.org/10.1137/18M1228591}, doi = {10.1137/18M1228591}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AntoniadisIKMNP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AronovBK20, author = {Boris Aronov and Gali Bar{-}On and Matthew J. Katz}, title = {Resolving {SINR} Queries in a Dynamic Setting}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1271--1290}, year = {2020}, url = {https://doi.org/10.1137/19M128733X}, doi = {10.1137/19M128733X}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AronovBK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AronovEZ20, author = {Boris Aronov and Esther Ezra and Joshua Zahl}, title = {Constructive Polynomial Partitioning for Algebraic Curves in {\(\mathbb{R}\)}\({}^{\mbox{3}}\) with Applications}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1109--1127}, year = {2020}, url = {https://doi.org/10.1137/19M1257548}, doi = {10.1137/19M1257548}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AronovEZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BartoP20, author = {Libor Barto and Michael Pinsker}, title = {Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {365--393}, year = {2020}, url = {https://doi.org/10.1137/18M1216213}, doi = {10.1137/18M1216213}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BartoP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BecchettiCNPT20, author = {Luca Becchetti and Andrea E. F. Clementi and Emanuele Natale and Francesco Pasquale and Luca Trevisan}, title = {Find Your Place: Simple Distributed Algorithms for Community Detection}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {821--864}, year = {2020}, url = {https://doi.org/10.1137/19M1243026}, doi = {10.1137/19M1243026}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BecchettiCNPT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BergBKMZ20, author = {Mark de Berg and Hans L. Bodlaender and S{\'{a}}ndor Kisfaludi{-}Bak and D{\'{a}}niel Marx and Tom C. van der Zanden}, title = {A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1291--1331}, year = {2020}, url = {https://doi.org/10.1137/20M1320870}, doi = {10.1137/20M1320870}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BergBKMZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BerkholzN20, author = {Christoph Berkholz and Jakob Nordstr{\"{o}}m}, title = {Supercritical Space-Width Trade-offs for Resolution}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {98--118}, year = {2020}, url = {https://doi.org/10.1137/16M1109072}, doi = {10.1137/16M1109072}, timestamp = {Thu, 19 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BerkholzN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BezakovaGGS20, author = {Ivona Bez{\'{a}}kov{\'{a}} and Andreas Galanis and Leslie Ann Goldberg and Daniel Stefankovic}, title = {Inapproximability of the Independent Set Polynomial in the Complex Plane}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1184485}, doi = {10.1137/18M1184485}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BezakovaGGS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BoulandCHTV20, author = {Adam Bouland and Lijie Chen and Dhiraj Holden and Justin Thaler and Prashant Nalini Vasudevan}, title = {On the Power of Statistical Zero Knowledge}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1161749}, doi = {10.1137/17M1161749}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BoulandCHTV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BrakensiekGWZ20, author = {Joshua Brakensiek and Venkatesan Guruswami and Marcin Wrochna and Stanislav Zivn{\'{y}}}, title = {The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1232--1248}, year = {2020}, url = {https://doi.org/10.1137/20M1312745}, doi = {10.1137/20M1312745}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BrakensiekGWZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BravermanCG20, author = {Mark Braverman and Gil Cohen and Sumegha Garg}, title = {Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1197734}, doi = {10.1137/18M1197734}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BravermanCG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BroadbentJSW20, author = {Anne Broadbent and Zhengfeng Ji and Fang Song and John Watrous}, title = {Zero-Knowledge Proof Systems for {QMA}}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {245--283}, year = {2020}, url = {https://doi.org/10.1137/18M1193530}, doi = {10.1137/18M1193530}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BroadbentJSW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BunT20, author = {Mark Bun and Justin Thaler}, title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1161737}, doi = {10.1137/17M1161737}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BunT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChalermsookCKLM20, author = {Parinya Chalermsook and Marek Cygan and Guy Kortsarz and Bundit Laekhanukit and Pasin Manurangsi and Danupon Nanongkai and Luca Trevisan}, title = {From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {772--810}, year = {2020}, url = {https://doi.org/10.1137/18M1166869}, doi = {10.1137/18M1166869}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChalermsookCKLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChanHJ20, author = {Timothy M. Chan and Sariel Har{-}Peled and Mitchell Jones}, title = {On Locality-Sensitive Orderings and Their Applications}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {583--600}, year = {2020}, url = {https://doi.org/10.1137/19M1246493}, doi = {10.1137/19M1246493}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChanHJ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChangLP20, author = {Yi{-}Jun Chang and Wenzheng Li and Seth Pettie}, title = {Distributed ({\(\Delta\)}+1)-Coloring via Ultrafast Graph Shattering}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {497--539}, year = {2020}, url = {https://doi.org/10.1137/19M1249527}, doi = {10.1137/19M1249527}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChangLP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChattopadhyayGL20, author = {Eshan Chattopadhyay and Vipul Goyal and Xin Li}, title = {Nonmalleable Extractors and Codes, with Their Many Tampered Extensions}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, pages = {999--1040}, year = {2020}, url = {https://doi.org/10.1137/18M1176622}, doi = {10.1137/18M1176622}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayGL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CheeDKLW20, author = {Yeow Meng Chee and Duc Tu Dao and Han Mao Kiah and San Ling and Hengjia Wei}, title = {Robust Positioning Patterns with Low Redundancy}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {284--317}, year = {2020}, url = {https://doi.org/10.1137/19M1253472}, doi = {10.1137/19M1253472}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CheeDKLW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChitnisFHM20, author = {Rajesh Hemant Chitnis and Andreas Emil Feldmann and Mohammad Taghi Hajiaghayi and D{\'{a}}niel Marx}, title = {Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {318--364}, year = {2020}, url = {https://doi.org/10.1137/18M122371X}, doi = {10.1137/18M122371X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChitnisFHM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CzumajLMMOS20, author = {Artur Czumaj and Jakub Lacki and Aleksander Madry and Slobodan Mitrovic and Krzysztof Onak and Piotr Sankowski}, title = {Round Compression for Parallel Matching Algorithms}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1197655}, doi = {10.1137/18M1197655}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CzumajLMMOS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DadushH20, author = {Daniel Dadush and Sophie Huiberts}, title = {A Friendly Smoothed Analysis of the Simplex Method}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1197205}, doi = {10.1137/18M1197205}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/DadushH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DuanP20, author = {Ran Duan and Seth Pettie}, title = {Connectivity Oracles for Graphs Subject to Vertex Failures}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1363--1396}, year = {2020}, url = {https://doi.org/10.1137/17M1146610}, doi = {10.1137/17M1146610}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/DuanP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DurfeePPR20, author = {David Durfee and John Peebles and Richard Peng and Anup B. Rao}, title = {Determinant-Preserving Sparsification of {SDDM} Matrices}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/18M1165979}, doi = {10.1137/18M1165979}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DurfeePPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DuttingFKL20, author = {Paul D{\"{u}}tting and Michal Feldman and Thomas Kesselheim and Brendan Lucier}, title = {Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {540--582}, year = {2020}, url = {https://doi.org/10.1137/20M1323850}, doi = {10.1137/20M1323850}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DuttingFKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DvirGGW20, author = {Zeev Dvir and Sivakanth Gopi and Yuzhou Gu and Avi Wigderson}, title = {Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {465--496}, year = {2020}, url = {https://doi.org/10.1137/19M124647X}, doi = {10.1137/19M124647X}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DvirGGW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/EbrahimiSV20, author = {Javad B. Ebrahimi and Damian Straszak and Nisheeth K. Vishnoi}, title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1249--1270}, year = {2020}, url = {https://doi.org/10.1137/19M1309523}, doi = {10.1137/19M1309523}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/EbrahimiSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/EdenRS20, author = {Talya Eden and Dana Ron and C. Seshadhri}, title = {On Approximating the Number of k-Cliques in Sublinear Time}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {747--771}, year = {2020}, url = {https://doi.org/10.1137/18M1176701}, doi = {10.1137/18M1176701}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/EdenRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FeigeFT20, author = {Uriel Feige and Michal Feldman and Inbal Talgam{-}Cohen}, title = {Approximate Modularity Revisited}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {67--97}, year = {2020}, url = {https://doi.org/10.1137/18M1173873}, doi = {10.1137/18M1173873}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FeigeFT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FeldmanSS20, author = {Dan Feldman and Melanie Schmidt and Christian Sohler}, title = {Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {601--657}, year = {2020}, url = {https://doi.org/10.1137/18M1209854}, doi = {10.1137/18M1209854}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FiltserS20, author = {Arnold Filtser and Shay Solomon}, title = {The Greedy Spanner Is Existentially Optimal}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {429--447}, year = {2020}, url = {https://doi.org/10.1137/18M1210678}, doi = {10.1137/18M1210678}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FiltserS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Fineman20, author = {Jeremy T. Fineman}, title = {Nearly Work-Efficient Parallel Algorithm for Digraph Reachability}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1197850}, doi = {10.1137/18M1197850}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Fineman20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FominLST20, author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios M. Thilikos}, title = {Bidimensionality and Kernels}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1397--1422}, year = {2020}, url = {https://doi.org/10.1137/16M1080264}, doi = {10.1137/16M1080264}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/FominLST20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FoxRSWW20, author = {Jacob Fox and Tim Roughgarden and C. Seshadhri and Fan Wei and Nicole Wein}, title = {Finding Cliques in Social Networks: {A} New Distribution-Free Model}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {448--464}, year = {2020}, url = {https://doi.org/10.1137/18M1210459}, doi = {10.1137/18M1210459}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FoxRSWW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GeorgiadisIP20, author = {Loukas Georgiadis and Giuseppe F. Italiano and Nikos Parotsidis}, title = {Strong Connectivity in Directed Graphs under Failures, with Applications}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, pages = {865--926}, year = {2020}, url = {https://doi.org/10.1137/19M1258530}, doi = {10.1137/19M1258530}, timestamp = {Tue, 01 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/GeorgiadisIP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GoosPW20, author = {Mika G{\"{o}}{\"{o}}s and Toniann Pitassi and Thomas Watson}, title = {Query-to-Communication Lifting for {BPP}}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M115339X}, doi = {10.1137/17M115339X}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GoosPW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GoyalKW20, author = {Rishab Goyal and Venkata Koppula and Brent Waters}, title = {Collusion Resistant Traitor Tracing from Learning with Errors}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1197825}, doi = {10.1137/18M1197825}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/GoyalKW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GrossmanM20, author = {Ofer Grossman and Dana Moshkovitz}, title = {Amplification and Derandomization without Slowdown}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, pages = {959--998}, year = {2020}, url = {https://doi.org/10.1137/17M1110596}, doi = {10.1137/17M1110596}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/GrossmanM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HaitnerNOSS20, author = {Iftach Haitner and Kobbi Nissim and Eran Omri and Ronen Shaltiel and Jad Silbak}, title = {Computational Two-Party Correlation: {A} Dichotomy for Key-Agreement Protocols}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1041--1082}, year = {2020}, url = {https://doi.org/10.1137/19M1236837}, doi = {10.1137/19M1236837}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/HaitnerNOSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Harris20, author = {David G. Harris}, title = {Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {711--746}, year = {2020}, url = {https://doi.org/10.1137/19M1279241}, doi = {10.1137/19M1279241}, timestamp = {Thu, 24 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Harris20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HarveyV20, author = {Nicholas J. A. Harvey and Jan Vondr{\'{a}}k}, title = {An Algorithmic Proof of the Lov{\'{a}}sz Local Lemma via Resampling Oracles}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {394--428}, year = {2020}, url = {https://doi.org/10.1137/18M1167176}, doi = {10.1137/18M1167176}, timestamp = {Wed, 20 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HarveyV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HemenwayRW20, author = {Brett Hemenway and Noga Ron{-}Zewi and Mary Wootters}, title = {Local List Recovery of High-Rate Tensor Codes and Applications}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M116149X}, doi = {10.1137/17M116149X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HemenwayRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HenzingerRW20, author = {Monika Henzinger and Satish Rao and Di Wang}, title = {Local Flow Partitioning for Faster Edge Connectivity}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {1--36}, year = {2020}, url = {https://doi.org/10.1137/18M1180335}, doi = {10.1137/18M1180335}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HozaZ20, author = {William M. Hoza and David Zuckerman}, title = {Simple Optimal Hitting Sets for Small-Success {RL}}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {811--820}, year = {2020}, url = {https://doi.org/10.1137/19M1268707}, doi = {10.1137/19M1268707}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HozaZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HubacekY20, author = {Pavel Hub{\'{a}}cek and Eylon Yogev}, title = {Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1128--1172}, year = {2020}, url = {https://doi.org/10.1137/17M1118014}, doi = {10.1137/17M1118014}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HubacekY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ImM20, author = {Sungjin Im and Benjamin Moseley}, title = {Fair Scheduling via Iterative Quasi-Uniform Sampling}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {3}, pages = {658--680}, year = {2020}, url = {https://doi.org/10.1137/18M1202451}, doi = {10.1137/18M1202451}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ImM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/JansenR20, author = {Klaus Jansen and Lars Rohwedder}, title = {A Quasi-Polynomial Approximation for the Restricted Assignment Problem}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1083--1108}, year = {2020}, url = {https://doi.org/10.1137/19M128257X}, doi = {10.1137/19M128257X}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/JansenR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/JenssenKP20, author = {Matthew Jenssen and Peter Keevash and Will Perkins}, title = {Algorithms for {\#}BIS-Hard Problems on Expander Graphs}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, pages = {681--710}, year = {2020}, url = {https://doi.org/10.1137/19M1286669}, doi = {10.1137/19M1286669}, timestamp = {Fri, 08 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/JenssenKP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/JinLTX20, author = {Yaonan Jin and Pinyan Lu and Zhihao Gavin Tang and Tao Xiao}, title = {Tight Revenue Gaps Among Simple Mechanisms}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, pages = {927--958}, year = {2020}, url = {https://doi.org/10.1137/19M126178X}, doi = {10.1137/19M126178X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/JinLTX20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/JuknaS20, author = {Stasys Jukna and Hannes Seiwert}, title = {Approximation Limitations of Pure Dynamic Programming}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {170--205}, year = {2020}, url = {https://doi.org/10.1137/18M1196339}, doi = {10.1137/18M1196339}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/JuknaS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KabanetsRS20, author = {Valentine Kabanets and Sofya Raskhodnikova and Chaitanya Swamy}, title = {Special Section on the Fifty-Eighth Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2017)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/20N975099}, doi = {10.1137/20N975099}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KabanetsRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KlassenMPIHT20, author = {Joel Klassen and Milad Marvian and Stephen Piddock and Marios Ioannou and Itay Hen and Barbara M. Terhal}, title = {Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1332--1362}, year = {2020}, url = {https://doi.org/10.1137/19M1287511}, doi = {10.1137/19M1287511}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KlassenMPIHT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KozmaS20, author = {L{\'{a}}szl{\'{o}} Kozma and Thatchaphol Saranurak}, title = {Smooth Heaps and a Dual View of Self-Adjusting Data Structures}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1195188}, doi = {10.1137/18M1195188}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KozmaS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KyngZ20, author = {Rasmus Kyng and Peng Zhang}, title = {Hardness Results for Structured Linear Systems}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1161774}, doi = {10.1137/17M1161774}, timestamp = {Mon, 28 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KyngZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LarsenWY20, author = {Kasper Green Larsen and Omri Weinstein and Huacheng Yu}, title = {Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1198429}, doi = {10.1137/18M1198429}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/LarsenWY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Li20, author = {Shi Li}, title = {Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1156332}, doi = {10.1137/17M1156332}, timestamp = {Fri, 30 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Li20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LinPS20, author = {Huijia Lin and Rafael Pass and Pratik Soni}, title = {Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {4}, year = {2020}, url = {https://doi.org/10.1137/17M1163177}, doi = {10.1137/17M1163177}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/LinPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LoeraHR20, author = {Jes{\'{u}}s A. De Loera and Jamie Haddock and Luis Rademacher}, title = {The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {138--169}, year = {2020}, url = {https://doi.org/10.1137/18M1221072}, doi = {10.1137/18M1221072}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/LoeraHR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MurrayW20, author = {Cody D. Murray and R. Ryan Williams}, title = {Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/18M1195887}, doi = {10.1137/18M1195887}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/MurrayW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PlautR20, author = {Benjamin Plaut and Tim Roughgarden}, title = {Communication Complexity of Discrete Fair Division}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {206--243}, year = {2020}, url = {https://doi.org/10.1137/19M1244305}, doi = {10.1137/19M1244305}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/PlautR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Sherstov20, author = {Alexander A. Sherstov}, title = {Algorithmic Polynomials}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1173--1231}, year = {2020}, url = {https://doi.org/10.1137/19M1278831}, doi = {10.1137/19M1278831}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Sherstov20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Vidick20, author = {Thomas Vidick}, title = {Erratum: Three-Player Entangled {XOR} Games are NP-hard to Approximate}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1423--1427}, year = {2020}, url = {https://doi.org/10.1137/20M1368598}, doi = {10.1137/20M1368598}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Vidick20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/VidickNA20, author = {Thomas Vidick and Danupon Nanongkai and Dimitris Achlioptas}, title = {Special Section on the Fiftieth Annual {ACM} Symposium on Theory of Computing {(STOC} 2018)}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {5}, year = {2020}, url = {https://doi.org/10.1137/20N975154}, doi = {10.1137/20N975154}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/VidickNA20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Viola20, author = {Emanuele Viola}, title = {Sampling Lower Bounds: Boolean Average-Case and Permutations}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {1}, pages = {119--137}, year = {2020}, url = {https://doi.org/10.1137/18M1198405}, doi = {10.1137/18M1198405}, timestamp = {Wed, 11 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Viola20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.