Search dblp for Publications

export results for "stream:streams/journals/siamcomp:"

more than 1000 matches, exporting first 1000 hits only!

 download as .bib file

@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 = {Mon, 17 Aug 2020 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/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 = {Fri, 22 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BartoP20.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/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/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 = {Wed, 22 Jul 2020 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/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, 05 Sep 2020 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 = {Fri, 22 May 2020 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/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 = {Wed, 22 Jul 2020 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/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 = {Wed, 11 Mar 2020 00:00:00 +0100},
  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 = {Wed, 22 Jul 2020 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/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 = {Wed, 20 May 2020 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/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/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 = {Thu, 19 Mar 2020 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/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/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 = {Wed, 11 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JuknaS20.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 = {Thu, 19 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LoeraHR20.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/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}
}
@article{DBLP:journals/siamcomp/0001LLZ19,
  author    = {Heng Guo and
               Chao Liao and
               Pinyan Lu and
               Chihao Zhang},
  title     = {Counting Hypergraph Colorings in the Local Lemma Regime},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1397--1424},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1202955},
  doi       = {10.1137/18M1202955},
  timestamp = {Sat, 21 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001LLZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001S19,
  author    = {Mrinal Kumar and
               Ramprasad Saptharishi},
  title     = {The Computational Power of Depth Five Arithmetic Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {144--180},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1173319},
  doi       = {10.1137/18M1173319},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001S19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001S19a,
  author    = {George Christodoulou and
               Alkmini Sgouritsa},
  title     = {Designing Networks with Good Equilibria under Uncertainty},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1364--1396},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1096694},
  doi       = {10.1137/16M1096694},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001S19a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbamBS19,
  author    = {Mohammad Ali Abam and
               Mark de Berg and
               Mohammad Javad Rezaei Seraji},
  title     = {Geodesic Spanners for Points on a Polyhedral Terrain},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1796--1810},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M119358X},
  doi       = {10.1137/18M119358X},
  timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbamBS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamGGNT19,
  author    = {Ittai Abraham and
               Cyril Gavoille and
               Anupam Gupta and
               Ofer Neiman and
               Kunal Talwar},
  title     = {Cops, Robbers, and Threatening Skeletons: Padded Decomposition for
               Minor-Free Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {1120--1145},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1112406},
  doi       = {10.1137/17M1112406},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbrahamGGNT19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamN19,
  author    = {Ittai Abraham and
               Ofer Neiman},
  title     = {Using Petal-Decompositions to Build a Low Stretch Spanning Tree},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {227--248},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1115575},
  doi       = {10.1137/17M1115575},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbrahamN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AchlioptasIK19,
  author    = {Dimitris Achlioptas and
               Fotis Iliopoulos and
               Vladimir Kolmogorov},
  title     = {A Local Lemma for Focused Stochastic Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1583--1602},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M109332X},
  doi       = {10.1137/16M109332X},
  timestamp = {Mon, 04 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AchlioptasIK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Annamalai19,
  author    = {Chidambaram Annamalai},
  title     = {Lazy Local Search Meets Machine Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1503--1543},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1139175},
  doi       = {10.1137/17M1139175},
  timestamp = {Mon, 04 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Annamalai19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArunachalamBP19,
  author    = {Srinivasan Arunachalam and
               Jop Bri{\"{e}}t and
               Carlos Palazuelos},
  title     = {Quantum Query Algorithms Are Completely Bounded Forms},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {903--925},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M117563X},
  doi       = {10.1137/18M117563X},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArunachalamBP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaCHP19,
  author    = {Hagit Attiya and
               Armando Casta{\~{n}}eda and
               Maurice Herlihy and
               Ami Paz},
  title     = {Bounds on the Step and Namespace Complexity of Renaming},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {1--32},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1081439},
  doi       = {10.1137/16M1081439},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AttiyaCHP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BanksKM19,
  author    = {Jess Banks and
               Robert Kleinberg and
               Cristopher Moore},
  title     = {The Lov{\'{a}}sz Theta Function for Random Regular Graphs and
               Community Detection in the Hard Regime},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {1098--1119},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1180396},
  doi       = {10.1137/18M1180396},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BanksKM19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalDG19,
  author    = {Nikhil Bansal and
               Daniel Dadush and
               Shashwat Garg},
  title     = {An Algorithm for Koml{\'{o}}s Conjecture Matching Banaszczyk's
               Bound},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {534--553},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1126795},
  doi       = {10.1137/17M1126795},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalDG19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakHKKMP19,
  author    = {Boaz Barak and
               Samuel B. Hopkins and
               Jonathan A. Kelner and
               Pravesh K. Kothari and
               Ankur Moitra and
               Aaron Potechin},
  title     = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {687--735},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1138236},
  doi       = {10.1137/17M1138236},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarakHKKMP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaCC019,
  author    = {Surender Baswana and
               Shreejit Ray Chaudhury and
               Keerti Choudhary and
               Shahbaz Khan},
  title     = {Dynamic {DFS} in Undirected Graphs: Breaking the O(m) Barrier},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1335--1363},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M114306X},
  doi       = {10.1137/17M114306X},
  timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BaswanaCC019.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BekosFGMMRU19,
  author    = {Michael A. Bekos and
               Henry F{\"{o}}rster and
               Martin Gronemann and
               Tamara Mchedlidze and
               Fabrizio Montecchiani and
               Chrysanthi N. Raftopoulou and
               Torsten Ueckerdt},
  title     = {Planar Graphs of Bounded Degree Have Bounded Queue Number},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1487--1502},
  year      = {2019},
  url       = {https://doi.org/10.1137/19M125340X},
  doi       = {10.1137/19M125340X},
  timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BekosFGMMRU19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BezakovaGGGS19,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Andreas Galanis and
               Leslie Ann Goldberg and
               Heng Guo and
               Daniel Stefankovic},
  title     = {Approximation via Correlation Decay When Strong Spatial Mixing Fails},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {279--349},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1083906},
  doi       = {10.1137/16M1083906},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BezakovaGGGS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BjorklundH19,
  author    = {Andreas Bj{\"{o}}rklund and
               Thore Husfeldt},
  title     = {Shortest Two Disjoint Paths in Polynomial Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1698--1710},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1223034},
  doi       = {10.1137/18M1223034},
  timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BjorklundH19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodirskyMPP19,
  author    = {Manuel Bodirsky and
               Barnaby Martin and
               Michael Pinsker and
               Andr{\'{a}}s Pongr{\'{a}}cz},
  title     = {Constraint Satisfaction Problems for Reducts of Homogeneous Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1224--1264},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1082974},
  doi       = {10.1137/16M1082974},
  timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BodirskyMPP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoissonnatRW19,
  author    = {Jean{-}Daniel Boissonnat and
               Mael Rouxel{-}Labb{\'{e}} and
               Mathijs H. M. J. Wintraecken},
  title     = {Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {1046--1097},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1152292},
  doi       = {10.1137/17M1152292},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoissonnatRW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrassardNTTU19,
  author    = {Gilles Brassard and
               Ashwin Nayak and
               Alain Tapp and
               Dave Touchette and
               Falk Unger},
  title     = {Noisy Interactive Quantum Communication},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1147--1195},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M109867X},
  doi       = {10.1137/16M109867X},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BrassardNTTU19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BringmannGSW19,
  author    = {Karl Bringmann and
               Fabrizio Grandoni and
               Barna Saha and
               Virginia Vassilevska Williams},
  title     = {Truly Subcubic Algorithms for Language Edit Distance and {RNA} Folding
               via Fast Bounded-Difference Min-Plus Product},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {481--512},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M112720X},
  doi       = {10.1137/17M112720X},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BringmannGSW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartiC0TV19,
  author    = {Amit Chakrabarti and
               Graham Cormode and
               Andrew McGregor and
               Justin Thaler and
               Suresh Venkatasubramanian},
  title     = {Verifiable Stream Computation and Arthur-Merlin Communication},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1265--1299},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M112289X},
  doi       = {10.1137/17M112289X},
  timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartiC0TV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangKP19,
  author    = {Yi{-}Jun Chang and
               Tsvi Kopelowitz and
               Seth Pettie},
  title     = {An Exponential Separation between Randomized and Deterministic Complexity
               in the {LOCAL} Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {122--143},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1117537},
  doi       = {10.1137/17M1117537},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChangKP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangP19,
  author    = {Yi{-}Jun Chang and
               Seth Pettie},
  title     = {A Time Hierarchy Theorem for the {LOCAL} Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {33--69},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1157957},
  doi       = {10.1137/17M1157957},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChangP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenL19,
  author    = {Yijia Chen and
               Bingkai Lin},
  title     = {The Constant Inapproximability of the Parameterized Dominating Set
               Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {513--533},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1127211},
  doi       = {10.1137/17M1127211},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenLL19,
  author    = {Jing Chen and
               Bo Li and
               Yingkai Li},
  title     = {Efficient Approximations for the Online Dispersion Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {373--416},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1131027},
  doi       = {10.1137/17M1131027},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenLL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenP19,
  author    = {Shiteng Chen and
               Periklis A. Papakonstantinou},
  title     = {Depth Reduction for Composites},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {668--686},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1129672},
  doi       = {10.1137/17M1129672},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenVY19,
  author    = {Hubie Chen and
               Matt Valeriote and
               Yuichi Yoshida},
  title     = {Constant-Query Testability of Assignments to Constraint Satisfaction
               Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {1022--1045},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M121085X},
  doi       = {10.1137/18M121085X},
  timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenVY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChierichettiKPT19,
  author    = {Flavio Chierichetti and
               Ravi Kumar and
               Alessandro Panconesi and
               Erisa Terolli},
  title     = {On the Distortion of Locality Sensitive Hashing},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {350--372},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1127752},
  doi       = {10.1137/17M1127752},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChierichettiKPT19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChillaraL019,
  author    = {Suryajith Chillara and
               Nutan Limaye and
               Srikanth Srinivasan},
  title     = {Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication
               with Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {70--92},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1191567},
  doi       = {10.1137/18M1191567},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChillaraL019.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChristodoulouGG19,
  author    = {George Christodoulou and
               Martin Gairing and
               Yiannis Giannakopoulos and
               Paul G. Spirakis},
  title     = {The Price of Stability of Weighted Congestion Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1544--1582},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1207880},
  doi       = {10.1137/18M1207880},
  timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChristodoulouGG19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cohen-AddadKM19,
  author    = {Vincent Cohen{-}Addad and
               Philip N. Klein and
               Claire Mathieu},
  title     = {Local Search Yields Approximation Schemes for k-Means and k-Median
               in Euclidean and Minor-Free Metrics},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {644--667},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M112717X},
  doi       = {10.1137/17M112717X},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Cohen-AddadKM19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganLPPS19,
  author    = {Marek Cygan and
               Daniel Lokshtanov and
               Marcin Pilipczuk and
               Michal Pilipczuk and
               Saket Saurabh},
  title     = {Minimum Bisection Is Fixed-Parameter Tractable},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {417--450},
  year      = {2019},
  url       = {https://doi.org/10.1137/140988553},
  doi       = {10.1137/140988553},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CyganLPPS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DalmauKKMMO19,
  author    = {V{\'{\i}}ctor Dalmau and
               Marcin Kozik and
               Andrei A. Krokhin and
               Konstantin Makarychev and
               Yury Makarychev and
               Jakub Oprsal},
  title     = {Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1763--1795},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1163932},
  doi       = {10.1137/18M1163932},
  timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DalmauKKMMO19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DemaineFKMS19,
  author    = {Erik D. Demaine and
               S{\'{a}}ndor P. Fekete and
               Phillip Keldenich and
               Henk Meijer and
               Christian Scheffer},
  title     = {Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots
               with Bounded Stretch},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1727--1762},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1194341},
  doi       = {10.1137/18M1194341},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DemaineFKMS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasKKL19,
  author    = {Ilias Diakonikolas and
               Gautam Kamath and
               Daniel Kane and
               Jerry Li and
               Ankur Moitra and
               Alistair Stewart},
  title     = {Robust Estimators in High-Dimensions Without the Computational Intractability},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {742--864},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1126680},
  doi       = {10.1137/17M1126680},
  timestamp = {Wed, 11 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DiakonikolasKKL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurMK19,
  author    = {Irit Dinur and
               Or Meir and
               Swastik Kopparty},
  title     = {Special Section on the Fifty-Seventh Annual {IEEE} Symposium on Foundations
               of Computer Science {(FOCS} 2016)},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {451},
  year      = {2019},
  url       = {https://doi.org/10.1137/19N974762},
  doi       = {10.1137/19N974762},
  timestamp = {Thu, 23 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DinurMK19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EfthymiouHSVY19,
  author    = {Charilaos Efthymiou and
               Thomas P. Hayes and
               Daniel Stefankovic and
               Eric Vigoda and
               Yitong Yin},
  title     = {Convergence of {MCMC} and Loopy {BP} in the Tree Uniqueness Region
               for the Hard-Core Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {581--643},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1127144},
  doi       = {10.1137/17M1127144},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EfthymiouHSVY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinN19,
  author    = {Michael Elkin and
               Ofer Neiman},
  title     = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest
               Paths},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1436--1480},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1166791},
  doi       = {10.1137/18M1166791},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ElkinN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FarruggiaFFV19,
  author    = {Andrea Farruggia and
               Paolo Ferragina and
               Antonio Frangioni and
               Rossano Venturini},
  title     = {Bicriteria Data Compression},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1603--1642},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1121457},
  doi       = {10.1137/17M1121457},
  timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FarruggiaFFV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Filtser19,
  author    = {Arnold Filtser},
  title     = {Steiner Point Removal with Distortion O(log k) using the Relaxed-Voronoi
               Algorithm},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {249--278},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1184400},
  doi       = {10.1137/18M1184400},
  timestamp = {Fri, 31 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Filtser19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriedmanRV19,
  author    = {Rotem Arnon Friedman and
               Renato Renner and
               Thomas Vidick},
  title     = {Simple and Tight Device-Independent Security Proofs},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {181--225},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1174726},
  doi       = {10.1137/18M1174726},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriedmanRV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriggstadRS19,
  author    = {Zachary Friggstad and
               Mohsen Rezapour and
               Mohammad R. Salavatipour},
  title     = {Local Search Yields a {PTAS} for k-Means in Doubling Metrics},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {452--480},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1127181},
  doi       = {10.1137/17M1127181},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriggstadRS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FungHHP19,
  author    = {Wai Shing Fung and
               Ramesh Hariharan and
               Nicholas J. A. Harvey and
               Debmalya Panigrahi},
  title     = {A General Framework for Graph Sparsification},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1196--1223},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1091666},
  doi       = {10.1137/16M1091666},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FungHHP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GowersV19,
  author    = {W. T. Gowers and
               Emanuele Viola},
  title     = {Interleaved Group Products},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {554--580},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1126783},
  doi       = {10.1137/17M1126783},
  timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GowersV19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuoJ19,
  author    = {Heng Guo and
               Mark Jerrum},
  title     = {A Polynomial-Time Approximation Algorithm for All-Terminal Network
               Reliability},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {964--978},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1201846},
  doi       = {10.1137/18M1201846},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuoJ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImKKP19,
  author    = {Sungjin Im and
               Nathaniel Kell and
               Janardhan Kulkarni and
               Debmalya Panigrahi},
  title     = {Tight Bounds for Online Vector Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {1},
  pages     = {93--121},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M111835X},
  doi       = {10.1137/17M111835X},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImKKP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IvanyosQ19,
  author    = {G{\'{a}}bor Ivanyos and
               Youming Qiao},
  title     = {Algorithms Based on *-Algebras, and Their Applications to Isomorphism
               of Polynomials with One Secret, Group Isomorphism, and Polynomial
               Identity Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {926--963},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1165682},
  doi       = {10.1137/18M1165682},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IvanyosQ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaneLR19,
  author    = {Daniel Kane and
               Shachar Lovett and
               Sankeerth Rao},
  title     = {The Independence Number of the Birkhoff Polytope Graph, and Applications
               to Maximally Recoverable Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1425--1435},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1205856},
  doi       = {10.1137/18M1205856},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaneLR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Knudsen19,
  author    = {Mathias B{\ae}k Tejs Knudsen},
  title     = {Linear Hashing Is Awesome},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {2},
  pages     = {736--741},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1126801},
  doi       = {10.1137/17M1126801},
  timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Knudsen19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KobayashiGN19,
  author    = {Hirotada Kobayashi and
               Fran{\c{c}}ois Le Gall and
               Harumichi Nishimura},
  title     = {Generalized Quantum Arthur-Merlin Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {865--902},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1160173},
  doi       = {10.1137/17M1160173},
  timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KobayashiGN19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LenstraS19,
  author    = {Hendrik W. Lenstra Jr. and
               Alice Silverberg},
  title     = {Testing Isomorphism of Lattices over CM-Orders},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {4},
  pages     = {1300--1334},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M115390X},
  doi       = {10.1137/17M115390X},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LenstraS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiNW19,
  author    = {Yi Li and
               Huy L. Nguyen and
               David P. Woodruff},
  title     = {On Approximating Matrix Norms in Data Streams},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1643--1697},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1152255},
  doi       = {10.1137/17M1152255},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LiNW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MelkebeekP19,
  author    = {Dieter van Melkebeek and
               Gautam Prakriya},
  title     = {Derandomizing Isolation in Space-Bounded Settings},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {3},
  pages     = {979--1021},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1130538},
  doi       = {10.1137/17M1130538},
  timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MelkebeekP19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchwartzW19,
  author    = {Oded Schwartz and
               Elad Weiss},
  title     = {Revisiting "Computation of Matrix Chain Products"},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {5},
  pages     = {1481--1486},
  year      = {2019},
  url       = {https://doi.org/10.1137/18M1195401},
  doi       = {10.1137/18M1195401},
  timestamp = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SchwartzW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zuckerman19,
  author    = {David Zuckerman},
  title     = {Certifiably Pseudorandom Financial Derivatives},
  journal   = {{SIAM} J. Comput.},
  volume    = {48},
  number    = {6},
  pages     = {1711--1726},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1161828},
  doi       = {10.1137/17M1161828},
  timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Zuckerman19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 = {Mon, 16 Sep 2019 01:00:00 +0200},
  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 = {Mon, 23 Jul 2018 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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  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 = {Mon, 23 Jul 2018 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 = {Fri, 02 Nov 2018 00:00:00 +0100},
  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 = {Mon, 23 Jul 2018 01:00:00 +0200},
  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, 16 Jun 2020 01:00:00 +0200},
  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 = {Wed, 23 May 2018 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, 23 Jul 2018 01:00:00 +0200},
  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 = {Mon, 23 Jul 2018 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 = {Sat, 05 Sep 2020 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 = {Tue, 16 Jun 2020 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 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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  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 = {Wed, 03 Jul 2019 01:00:00 +0200},
  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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  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 = {Tue, 13 Mar 2018 00:00:00 +0100},
  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 = {Sun, 05 Jan 2020 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 = {Thu, 24 Oct 2019 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 = {Fri, 05 Apr 2019 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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  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 = {Fri, 05 Apr 2019 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 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, 23 May 2018 01:00:00 +0200},
  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 = {Mon, 15 Jun 2020 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 = {Fri, 05 Apr 2019 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 = {Fri, 05 Apr 2019 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 = {Fri, 05 Apr 2019 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 = {Wed, 25 Sep 2019 01:00:00 +0200},
  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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  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 = {Fri, 05 Apr 2019 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 = {Tue, 13 Mar 2018 00:00:00 +0100},
  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 = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Williams18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlamdariABCLBFH17,
  author    = {Soroush Alamdari and
               Patrizio Angelini and
               Fidel Barrera{-}Cruz and
               Timothy M. Chan and
               Giordano Da Lozzo and
               Giuseppe Di Battista and
               Fabrizio Frati and
               Penny Haxell and
               Anna Lubiw and
               Maurizio Patrignani and
               Vincenzo Roselli and
               Sahil Singla and
               Bryan T. Wilkinson},
  title     = {How to Morph Planar Graph Drawings},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {824--852},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1069171},
  doi       = {10.1137/16M1069171},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlamdariABCLBFH17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonCGMMS17,
  author    = {Noga Alon and
               Nicol{\`{o}} Cesa{-}Bianchi and
               Claudio Gentile and
               Shie Mannor and
               Yishay Mansour and
               Ohad Shamir},
  title     = {Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1785--1826},
  year      = {2017},
  url       = {https://doi.org/10.1137/140989455},
  doi       = {10.1137/140989455},
  timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonCGMMS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnSS17,
  author    = {Hyung{-}Chan An and
               Mohit Singh and
               Ola Svensson},
  title     = {LP-Based Algorithms for Capacitated Facility Location},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {272--306},
  year      = {2017},
  url       = {https://doi.org/10.1137/151002320},
  doi       = {10.1137/151002320},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AnSS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AustrinGH17,
  author    = {Per Austrin and
               Venkatesan Guruswami and
               Johan H{\aa}stad},
  title     = {(2+{\(\epsilon\)})-Sat Is NP-hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1554--1573},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1006507},
  doi       = {10.1137/15M1006507},
  timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AustrinGH17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BannaiIINTT17,
  author    = {Hideo Bannai and
               Tomohiro I and
               Shunsuke Inenaga and
               Yuto Nakashima and
               Masayuki Takeda and
               Kazuya Tsuruta},
  title     = {The "Runs" Theorem},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1501--1514},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1011032},
  doi       = {10.1137/15M1011032},
  timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BannaiIINTT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeiCGL17,
  author    = {Xiaohui Bei and
               Ning Chen and
               Nick Gravin and
               Pinyan Lu},
  title     = {Worst-Case Mechanism Design via Bayesian Analysis},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1428--1448},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1067275},
  doi       = {10.1137/16M1067275},
  timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeiCGL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeigiEG17,
  author    = {Salman Beigi and
               Omid Etesami and
               Amin Gohari},
  title     = {Deterministic Randomness Extraction from Generalized and Distributed
               Santha-Vazirani Sources},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {1--36},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1027206},
  doi       = {10.1137/15M1027206},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeigiEG17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorradaileKMNW17,
  author    = {Glencora Borradaile and
               Philip N. Klein and
               Shay Mozes and
               Yahav Nussbaum and
               Christian Wulff{-}Nilsen},
  title     = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
               in Near-Linear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1280--1303},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1042929},
  doi       = {10.1137/15M1042929},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BorradaileKMNW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoutsidisW17,
  author    = {Christos Boutsidis and
               David P. Woodruff},
  title     = {Optimal {CUR} Matrix Decompositions},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {543--589},
  year      = {2017},
  url       = {https://doi.org/10.1137/140977898},
  doi       = {10.1137/140977898},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoutsidisW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BravermanE17,
  author    = {Mark Braverman and
               Klim Efremenko},
  title     = {List and Unique Coding for Interactive Communication in the Presence
               of Adversarial Noise},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {388--428},
  year      = {2017},
  url       = {https://doi.org/10.1137/141002001},
  doi       = {10.1137/141002001},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BravermanE17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BurgisserCMW17,
  author    = {Peter B{\"{u}}rgisser and
               Matthias Christandl and
               Ketan D. Mulmuley and
               Michael Walter},
  title     = {Membership in Moment Polytopes is in {NP} and coNP},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {972--991},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1048859},
  doi       = {10.1137/15M1048859},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BurgisserCMW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloCKSV17,
  author    = {Sergio Cabello and
               Josef Cibulka and
               Jan Kyncl and
               Maria Saumell and
               Pavel Valtr},
  title     = {Peeling Potatoes Near-Optimally in Near-Linear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1574--1602},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1079695},
  doi       = {10.1137/16M1079695},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CabelloCKSV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiLX17,
  author    = {Jin{-}Yi Cai and
               Pinyan Lu and
               Mingji Xia},
  title     = {Holographic Algorithms with Matchgates Capture Precisely Tractable
               Planar {\#}CSP},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {853--889},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1073984},
  doi       = {10.1137/16M1073984},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CaiLX17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Censor-HillelHK17,
  author    = {Keren Censor{-}Hillel and
               Bernhard Haeupler and
               Jonathan A. Kelner and
               Petar Maymounkov},
  title     = {Rumor Spreading with No Dependence on Conductance},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {58--79},
  year      = {2017},
  url       = {https://doi.org/10.1137/14099992X},
  doi       = {10.1137/14099992X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Censor-HillelHK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChaillouxK17,
  author    = {Andr{\'{e}} Chailloux and
               Iordanis Kerenidis},
  title     = {Physical Limitations of Quantum Cryptographic Primitives or Optimal
               Bounds for Quantum Coin Flipping and Bit Commitment},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1647--1677},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1010853},
  doi       = {10.1137/15M1010853},
  timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChaillouxK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenD17,
  author    = {Ho{-}Lin Chen and
               David Doty},
  title     = {Parallelism and Time in Hierarchical Self-Assembly},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {661--709},
  year      = {2017},
  url       = {https://doi.org/10.1137/151004161},
  doi       = {10.1137/151004161},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenD17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenHL017,
  author    = {Danny Z. Chen and
               Ziyun Huang and
               Yangwei Liu and
               Jinhui Xu},
  title     = {On Clustering Induced Voronoi Diagrams},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1679--1711},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1044874},
  doi       = {10.1137/15M1044874},
  timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenHL017.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChildsKS17,
  author    = {Andrew M. Childs and
               Robin Kothari and
               Rolando D. Somma},
  title     = {Quantum Algorithm for Systems of Linear Equations with Exponentially
               Improved Dependence on Precision},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1920--1950},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1087072},
  doi       = {10.1137/16M1087072},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChildsKS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChuzhoyR17,
  author    = {Julia Chuzhoy and
               Alexander Russell},
  title     = {Special Section on the Fifty-Fifth Annual {ACM} Symposium on Foundations
               of Coomputer Science {(FOCS} 2014)},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {160},
  year      = {2017},
  url       = {https://doi.org/10.1137/16N974309},
  doi       = {10.1137/16N974309},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChuzhoyR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DavidDGKS17,
  author    = {Roee David and
               Irit Dinur and
               Elazar Goldenberg and
               Guy Kindler and
               Igor Shinkar},
  title     = {Direct Sum Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1336--1369},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1061655},
  doi       = {10.1137/16M1061655},
  timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DavidDGKS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdenLRS17,
  author    = {Talya Eden and
               Amit Levi and
               Dana Ron and
               C. Seshadhri},
  title     = {Approximately Counting Triangles in Sublinear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1603--1646},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1054389},
  doi       = {10.1137/15M1054389},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EdenLRS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EneHR17,
  author    = {Alina Ene and
               Sariel Har{-}Peled and
               Benjamin Raichel},
  title     = {Geometric Packing under Nonuniform Constraints},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1745--1784},
  year      = {2017},
  url       = {https://doi.org/10.1137/120898413},
  doi       = {10.1137/120898413},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EneHR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EstebanF17,
  author    = {Juan Luis Esteban and
               Ramon Ferrer{-}i{-}Cancho},
  title     = {A Correction on Shiloach's Algorithm for Minimum Linear Arrangement
               of Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1146--1151},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1046289},
  doi       = {10.1137/15M1046289},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EstebanF17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiSY17,
  author    = {Kousha Etessami and
               Alistair Stewart and
               Mihalis Yannakakis},
  title     = {A Polynomial Time Algorithm for Computing Extinction Probabilities
               of Multitype Branching Processes},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1515--1553},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M105678X},
  doi       = {10.1137/16M105678X},
  timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EtessamiSY17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeKT17,
  author    = {Uriel Feige and
               Tomer Koren and
               Moshe Tennenholtz},
  title     = {Chasing Ghosts: Competing with Stateful Policies},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {190--223},
  year      = {2017},
  url       = {https://doi.org/10.1137/14100227X},
  doi       = {10.1137/14100227X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeigeKT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GamarnikS17,
  author    = {David Gamarnik and
               Madhu Sudan},
  title     = {Performance of Sequential Local Algorithms for the Random {NAE-K-SAT}
               Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {590--619},
  year      = {2017},
  url       = {https://doi.org/10.1137/140989728},
  doi       = {10.1137/140989728},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GamarnikS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GaoW17,
  author    = {Pu Gao and
               Nicholas C. Wormald},
  title     = {Uniform Generation of Random Regular Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1395--1427},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1052779},
  doi       = {10.1137/15M1052779},
  timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GaoW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GavinskyMWW17,
  author    = {Dmitry Gavinsky and
               Or Meir and
               Omri Weinstein and
               Avi Wigderson},
  title     = {Toward Better Formula Lower Bounds: The Composition of a Function
               and a Universal Relation},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {114--131},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1018319},
  doi       = {10.1137/15M1018319},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GavinskyMWW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GellesH17,
  author    = {Ran Gelles and
               Bernhard Haeupler},
  title     = {Capacity of Interactive Communication over Erasure Channels and Channels
               with Feedback},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1449--1472},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1052202},
  doi       = {10.1137/15M1052202},
  timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GellesH17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrecoS17,
  author    = {Gianluigi Greco and
               Francesco Scarcello},
  title     = {The Power of Local Consistency in Conjunctive Queries and Constraint
               Satisfaction Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1111--1145},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1090272},
  doi       = {10.1137/16M1090272},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrecoS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrochowQ17,
  author    = {Joshua A. Grochow and
               Youming Qiao},
  title     = {Algorithms for Group Isomorphism via Group Extensions and Cohomology},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1153--1216},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1009767},
  doi       = {10.1137/15M1009767},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrochowQ17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaR17,
  author    = {Rishi Gupta and
               Tim Roughgarden},
  title     = {A {PAC} Approach to Application-Specific Algorithm Selection},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {992--1017},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1050276},
  doi       = {10.1137/15M1050276},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuptaR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHHSV17,
  author    = {Venkatesan Guruswami and
               Prahladh Harsha and
               Johan H{\aa}stad and
               Srikanth Srinivasan and
               Girish Varma},
  title     = {Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree
               Long Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {132--159},
  year      = {2017},
  url       = {https://doi.org/10.1137/140995520},
  doi       = {10.1137/140995520},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuruswamiHHSV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiL17,
  author    = {Venkatesan Guruswami and
               Euiwoong Lee},
  title     = {Nearly Optimal NP-Hardness of Unique Coverage},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1018--1028},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1070682},
  doi       = {10.1137/16M1070682},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuruswamiL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerT17,
  author    = {Iftach Haitner and
               Eliad Tsfadia},
  title     = {An Almost-Optimally Fair Three-Party Coin-Flipping Protocol},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {479--542},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1009147},
  doi       = {10.1137/15M1009147},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HajiaghayiLP17,
  author    = {MohammadTaghi Hajiaghayi and
               Vahid Liaghat and
               Debmalya Panigrahi},
  title     = {Online Node-weighted Steiner Forest and Extensions via Disk Paintings},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {911--935},
  year      = {2017},
  url       = {https://doi.org/10.1137/14098692X},
  doi       = {10.1137/14098692X},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HajiaghayiLP17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HalldorssonHMW17,
  author    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Stephan Holzer and
               Pradipta Mitra and
               Roger Wattenhofer},
  title     = {The Power of Oblivious Wireless Power},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1062--1086},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1023348},
  doi       = {10.1137/15M1023348},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HalldorssonHMW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-PeledQ17,
  author    = {Sariel Har{-}Peled and
               Kent Quanrud},
  title     = {Approximation Algorithms for Polynomial-Expansion and Low-Density
               Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1712--1744},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1079336},
  doi       = {10.1137/16M1079336},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Har-PeledQ17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HazanKS17,
  author    = {Elad Hazan and
               Satyen Kale and
               Shai Shalev{-}Shwartz},
  title     = {Near-Optimal Algorithms for Online Matrix Prediction},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {744--773},
  year      = {2017},
  url       = {https://doi.org/10.1137/120895731},
  doi       = {10.1137/120895731},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HazanKS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuangY17,
  author    = {Zengfeng Huang and
               Ke Yi},
  title     = {The Communication Complexity of Distributed epsilon-Approximations},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1370--1394},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1093604},
  doi       = {10.1137/16M1093604},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HuangY17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KapralovLMMS17,
  author    = {Michael Kapralov and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Aaron Sidford},
  title     = {Single Pass Spectral Sparsification in Dynamic Streams},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {456--477},
  year      = {2017},
  url       = {https://doi.org/10.1137/141002281},
  doi       = {10.1137/141002281},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KapralovLMMS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KayalLSS17,
  author    = {Neeraj Kayal and
               Nutan Limaye and
               Chandan Saha and
               Srikanth Srinivasan},
  title     = {An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {307--335},
  year      = {2017},
  url       = {https://doi.org/10.1137/151002423},
  doi       = {10.1137/151002423},
  timestamp = {Tue, 17 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KayalLSS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotS17,
  author    = {Subhash Khot and
               Rishi Saket},
  title     = {Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2\({}^{\mbox{(log
               n)\({}^{\mbox{{\O}mega(1)}}\)}}\) Colors},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {235--271},
  year      = {2017},
  url       = {https://doi.org/10.1137/15100240X},
  doi       = {10.1137/15100240X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KhotS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KolmogorovKR17,
  author    = {Vladimir Kolmogorov and
               Andrei A. Krokhin and
               Michal Rol{\'{\i}}nek},
  title     = {The Complexity of General-Valued CSPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1087--1110},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1091836},
  doi       = {10.1137/16M1091836},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KolmogorovKR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KomargodskiRT17,
  author    = {Ilan Komargodski and
               Ran Raz and
               Avishay Tal},
  title     = {Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching
               Worst-Case Lower Bound},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {37--57},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1048045},
  doi       = {10.1137/15M1048045},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KomargodskiRT17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KumarS17,
  author    = {Mrinal Kumar and
               Shubhangi Saraf},
  title     = {On the Power of Homogeneous Depth 4 Arithmetic Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {336--387},
  year      = {2017},
  url       = {https://doi.org/10.1137/140999335},
  doi       = {10.1137/140999335},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KumarS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KwokLL17,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee},
  title     = {Improved Cheeger's Inequality and Analysis of Local Graph Partitioning
               using Vertex Expansion and Expansion Profile},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {890--910},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1079816},
  doi       = {10.1137/16M1079816},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KwokLL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LenzenRS17,
  author    = {Christoph Lenzen and
               Joel Rybicki and
               Jukka Suomela},
  title     = {Efficient Counting with Optimal Resilience},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1473--1500},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M107877X},
  doi       = {10.1137/16M107877X},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LenzenRS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiRR17,
  author    = {Yuan Li and
               Alexander A. Razborov and
               Benjamin Rossman},
  title     = {On the AC\({}^{\mbox{0}}\) Complexity of Subgraph Isomorphism},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {936--971},
  year      = {2017},
  url       = {https://doi.org/10.1137/14099721X},
  doi       = {10.1137/14099721X},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LiRR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LokshtanovPPS17,
  author    = {Daniel Lokshtanov and
               Marcin Pilipczuk and
               Michal Pilipczuk and
               Saket Saurabh},
  title     = {Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs
               of Bounded Treewidth},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {161--189},
  year      = {2017},
  url       = {https://doi.org/10.1137/140999980},
  doi       = {10.1137/140999980},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LokshtanovPPS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lopez-AltTV17,
  author    = {Adriana L{\'{o}}pez{-}Alt and
               Eran Tromer and
               Vinod Vaikuntanathan},
  title     = {Multikey Fully Homomorphic Encryption and Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1827--1892},
  year      = {2017},
  url       = {https://doi.org/10.1137/14100124X},
  doi       = {10.1137/14100124X},
  timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Lopez-AltTV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LucierB17,
  author    = {Brendan Lucier and
               Allan Borodin},
  title     = {Equilibria of Greedy Combinatorial Auctions},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {620--660},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1048720},
  doi       = {10.1137/15M1048720},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LucierB17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegowMS17,
  author    = {Nicole Megow and
               Julie Mei{\ss}ner and
               Martin Skutella},
  title     = {Randomization Helps Computing a Minimum Spanning Tree under Uncertainty},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1217--1240},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1088375},
  doi       = {10.1137/16M1088375},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MegowMS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MillerS17,
  author    = {Carl A. Miller and
               Yaoyun Shi},
  title     = {Universal Security for Randomness Expansion from the Spot-Checking
               Protocol},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1304--1335},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1044333},
  doi       = {10.1137/15M1044333},
  timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MillerS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NavarroN17,
  author    = {Gonzalo Navarro and
               Yakov Nekrich},
  title     = {Time-Optimal Top-k Document Retrieval},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {80--113},
  year      = {2017},
  url       = {https://doi.org/10.1137/140998949},
  doi       = {10.1137/140998949},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NavarroN17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatelR17,
  author    = {Viresh Patel and
               Guus Regts},
  title     = {Deterministic Polynomial-Time Approximation Algorithms for Partition
               Functions and Graph Polynomials},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {6},
  pages     = {1893--1919},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1101003},
  doi       = {10.1137/16M1101003},
  timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PatelR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Peng0Z17,
  author    = {Richard Peng and
               He Sun and
               Luca Zanetti},
  title     = {Partitioning Well-Clustered Graphs: Spectral Clustering Works!},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {710--743},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1047209},
  doi       = {10.1137/15M1047209},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Peng0Z17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PoloczekSWZ17,
  author    = {Matthias Poloczek and
               Georg Schnitger and
               David P. Williamson and
               Anke van Zuylen},
  title     = {Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms
               and Inapproximability Bounds},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {1029--1061},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1053369},
  doi       = {10.1137/15M1053369},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PoloczekSWZ17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rothvoss17,
  author    = {Thomas Rothvoss},
  title     = {Constructive Discrepancy Minimization for Convex Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {224--234},
  year      = {2017},
  url       = {https://doi.org/10.1137/141000282},
  doi       = {10.1137/141000282},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Rothvoss17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaksS17,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Estimating the Longest Increasing Sequence in Polylogarithmic Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {774--823},
  year      = {2017},
  url       = {https://doi.org/10.1137/130942152},
  doi       = {10.1137/130942152},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SaksS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ThapperZ17,
  author    = {Johan Thapper and
               Stanislav Zivn{\'{y}}},
  title     = {The Power of Sherali-Adams Relaxations for General-Valued CSPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {4},
  pages     = {1241--1279},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1079245},
  doi       = {10.1137/16M1079245},
  timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ThapperZ17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ValiantV17,
  author    = {Gregory Valiant and
               Paul Valiant},
  title     = {An Automatic Inequality Prover and Instance Optimal Identity Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {429--455},
  year      = {2017},
  url       = {https://doi.org/10.1137/151002526},
  doi       = {10.1137/151002526},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ValiantV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001KKS16,
  author    = {Ankit Gupta and
               Pritish Kamath and
               Neeraj Kayal and
               Ramprasad Saptharishi},
  title     = {Arithmetic Circuits: {A} Chasm at Depth 3},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {1064--1079},
  year      = {2016},
  url       = {https://doi.org/10.1137/140957123},
  doi       = {10.1137/140957123},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001KKS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalSSS16,
  author    = {Manindra Agrawal and
               Chandan Saha and
               Ramprasad Saptharishi and
               Nitin Saxena},
  title     = {Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k
               Formulas and Depth-3 Transcendence Degree-k Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1533--1562},
  year      = {2016},
  url       = {https://doi.org/10.1137/130910725},
  doi       = {10.1137/130910725},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgrawalSSS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovCGKM16,
  author    = {Dorit Aharonov and
               Andr{\'{e}} Chailloux and
               Maor Ganz and
               Iordanis Kerenidis and
               Lo{\"{\i}}ck Magnin},
  title     = {A Simpler Proof of the Existence of Quantum Weak Coin Flipping with
               Arbitrarily Small Bias},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {633--679},
  year      = {2016},
  url       = {https://doi.org/10.1137/14096387X},
  doi       = {10.1137/14096387X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AharonovCGKM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ambainis16,
  author    = {Andris Ambainis},
  title     = {Superlinear Advantage for Exact Quantum Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {617--631},
  year      = {2016},
  url       = {https://doi.org/10.1137/130939043},
  doi       = {10.1137/130939043},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ambainis16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndrewsAZ16,
  author    = {Matthew Andrews and
               Spyridon Antonakopoulos and
               Lisa Zhang},
  title     = {Minimum-Cost Network Design with (Dis)economies of Scale},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {49--66},
  year      = {2016},
  url       = {https://doi.org/10.1137/110825959},
  doi       = {10.1137/110825959},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndrewsAZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AroraGKM16,
  author    = {Sanjeev Arora and
               Rong Ge and
               Ravi Kannan and
               Ankur Moitra},
  title     = {Computing a Nonnegative Matrix Factorization - Provably},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1582--1611},
  year      = {2016},
  url       = {https://doi.org/10.1137/130913869},
  doi       = {10.1137/130913869},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AroraGKM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AsharovS16,
  author    = {Gilad Asharov and
               Gil Segev},
  title     = {Limits on the Power of Indistinguishability Obfuscation and Functional
               Encryption},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2117--2176},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1034064},
  doi       = {10.1137/15M1034064},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AsharovS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AspnesCAH16,
  author    = {James Aspnes and
               Keren Censor{-}Hillel and
               Hagit Attiya and
               Danny Hendler},
  title     = {Lower Bounds for Restricted-Use Objects},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {734--762},
  year      = {2016},
  url       = {https://doi.org/10.1137/130905022},
  doi       = {10.1137/130905022},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AspnesCAH16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AspnesIM16,
  author    = {James Aspnes and
               Yuval Ishai and
               Peter Bro Miltersen},
  title     = {Special Section on the Forty-Fifth Annual {ACM} Symposium on the Theory
               of Computing {(STOC} 2013)},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {459--460},
  year      = {2016},
  url       = {https://doi.org/10.1137/16N97405X},
  doi       = {10.1137/16N97405X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AspnesIM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalcanL16,
  author    = {Maria{-}Florina Balcan and
               Yingyu Liang},
  title     = {Clustering under Perturbation Resilience},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {102--155},
  year      = {2016},
  url       = {https://doi.org/10.1137/140981575},
  doi       = {10.1137/140981575},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BalcanL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarceloRV16,
  author    = {Pablo Barcel{\'{o}} and
               Miguel Romero and
               Moshe Y. Vardi},
  title     = {Semantic Acyclicity on Graph Databases},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1339--1376},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1034714},
  doi       = {10.1137/15M1034714},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarceloRV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartalGK16,
  author    = {Yair Bartal and
               Lee{-}Ad Gottlieb and
               Robert Krauthgamer},
  title     = {The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial
               Time Approximation Scheme},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1563--1581},
  year      = {2016},
  url       = {https://doi.org/10.1137/130913328},
  doi       = {10.1137/130913328},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BartalGK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoK16,
  author    = {Libor Barto and
               Marcin Kozik},
  title     = {Robustly Solvable Constraint Satisfaction Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1646--1669},
  year      = {2016},
  url       = {https://doi.org/10.1137/130915479},
  doi       = {10.1137/130915479},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BartoK16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameBI16,
  author    = {Paul Beame and
               Chris Beck and
               Russell Impagliazzo},
  title     = {Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds
               for Superlinear Space},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1612--1645},
  year      = {2016},
  url       = {https://doi.org/10.1137/130914085},
  doi       = {10.1137/130914085},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeameBI16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bernstein16,
  author    = {Aaron Bernstein},
  title     = {Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {548--574},
  year      = {2016},
  url       = {https://doi.org/10.1137/130938670},
  doi       = {10.1137/130938670},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Bernstein16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BiCR16,
  author    = {Jingguo Bi and
               Qi Cheng and
               J. Maurice Rojas},
  title     = {Sublinear Root Detection and New Hardness Results for Sparse Polynomials
               over Finite Fields},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1433--1447},
  year      = {2016},
  url       = {https://doi.org/10.1137/140990401},
  doi       = {10.1137/140990401},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BiCR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BitanskyCPR16,
  author    = {Nir Bitansky and
               Ran Canetti and
               Omer Paneth and
               Alon Rosen},
  title     = {On the Existence of Extractable One-Way Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1910--1952},
  year      = {2016},
  url       = {https://doi.org/10.1137/140975048},
  doi       = {10.1137/140975048},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BitanskyCPR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodlaenderDDFLP16,
  author    = {Hans L. Bodlaender and
               P{\aa}l Gr{\o}n{\aa}s Drange and
               Markus S. Dregi and
               Fedor V. Fomin and
               Daniel Lokshtanov and
               Michal Pilipczuk},
  title     = {A c\({}^{\mbox{k}}\) n 5-Approximation Algorithm for Treewidth},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {317--378},
  year      = {2016},
  url       = {https://doi.org/10.1137/130947374},
  doi       = {10.1137/130947374},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BodlaenderDDFLP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonacinaGT16,
  author    = {Ilario Bonacina and
               Nicola Galesi and
               Neil Thapen},
  title     = {Total Space in Resolution},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1894--1909},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1023269},
  doi       = {10.1137/15M1023269},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BonacinaGT16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiCL16,
  author    = {Jin{-}Yi Cai and
               Xi Chen and
               Pinyan Lu},
  title     = {Nonnegative Weighted {\#}CSP: An Effective Complexity Dichotomy},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2177--2198},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1032314},
  doi       = {10.1137/15M1032314},
  timestamp = {Wed, 21 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CaiCL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiGW16,
  author    = {Jin{-}Yi Cai and
               Heng Guo and
               Tyson Williams},
  title     = {A Complete Dichotomy Rises from the Capture of Vanishing Signatures},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1671--1728},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1049798},
  doi       = {10.1137/15M1049798},
  timestamp = {Fri, 11 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CaiGW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CanettiLP16,
  author    = {Ran Canetti and
               Huijia Lin and
               Rafael Pass},
  title     = {Adaptive Hardness and Composable Security in the Plain Model from
               Standard Assumptions},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1793--1834},
  year      = {2016},
  url       = {https://doi.org/10.1137/110847196},
  doi       = {10.1137/110847196},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CanettiLP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CastanedaIRR16,
  author    = {Armando Casta{\~{n}}eda and
               Damien Imbs and
               Sergio Rajsbaum and
               Michel Raynal},
  title     = {Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent
               Objects},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {379--414},
  year      = {2016},
  url       = {https://doi.org/10.1137/130936828},
  doi       = {10.1137/130936828},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CastanedaIRR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartyS16,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An o(n) Monotonicity Tester for Boolean Functions over the Hypercube},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {461--472},
  year      = {2016},
  url       = {https://doi.org/10.1137/13092770X},
  doi       = {10.1137/13092770X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartyS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabortyFGM16,
  author    = {Sourav Chakraborty and
               Eldar Fischer and
               Yonatan Goldhirsh and
               Arie Matsliah},
  title     = {On the Power of Conditional Samples in Distribution Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1261--1296},
  year      = {2016},
  url       = {https://doi.org/10.1137/140964199},
  doi       = {10.1137/140964199},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabortyFGM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChattopadhyayEE16,
  author    = {Arkadev Chattopadhyay and
               Jeff Edmonds and
               Faith Ellen and
               Toniann Pitassi},
  title     = {Upper and Lower Bounds on the Power of Advice},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1412--1432},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1031862},
  doi       = {10.1137/15M1031862},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChattopadhyayEE16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenD16,
  author    = {Hubie Chen and
               V{\'{\i}}ctor Dalmau},
  title     = {Decomposing Quantified Conjunctive (or Disjunctive) Formulas},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2066--2086},
  year      = {2016},
  url       = {https://doi.org/10.1137/140957378},
  doi       = {10.1137/140957378},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenD16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChitnisCHPP16,
  author    = {Rajesh Chitnis and
               Marek Cygan and
               MohammadTaghi Hajiaghayi and
               Marcin Pilipczuk and
               Michal Pilipczuk},
  title     = {Designing {FPT} Algorithms for Cut Problems Using Randomized Contractions},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1171--1229},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1032077},
  doi       = {10.1137/15M1032077},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChitnisCHPP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChungPS16,
  author    = {Kai{-}Min Chung and
               Rafael Pass and
               Karn Seth},
  title     = {Non-Black-Box Simulation from One-Way Functions and Applications to
               Resettable Security},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {415--458},
  year      = {2016},
  url       = {https://doi.org/10.1137/130946083},
  doi       = {10.1137/130946083},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChungPS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chuzhoy16,
  author    = {Julia Chuzhoy},
  title     = {Routing in Undirected Graphs with Constant Congestion},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1490--1532},
  year      = {2016},
  url       = {https://doi.org/10.1137/130910464},
  doi       = {10.1137/130910464},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chuzhoy16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ClarksonDMMMW16,
  author    = {Kenneth L. Clarkson and
               Petros Drineas and
               Malik Magdon{-}Ismail and
               Michael W. Mahoney and
               Xiangrui Meng and
               David P. Woodruff},
  title     = {The Fast Cauchy Transform and Faster Robust Linear Regression},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {763--810},
  year      = {2016},
  url       = {https://doi.org/10.1137/140963698},
  doi       = {10.1137/140963698},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ClarksonDMMMW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cohen16,
  author    = {Gil Cohen},
  title     = {Local Correlation Breakers and Applications to Three-Source Extractors
               and Mergers},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1297--1338},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1029837},
  doi       = {10.1137/15M1029837},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Cohen16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CreusGGR16,
  author    = {Carles Creus and
               Adri{\`{a}} Gasc{\'{o}}n and
               Guillem Godoy and
               Lander Ramos},
  title     = {The {HOM} Problem is EXPTIME-Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1230--1260},
  year      = {2016},
  url       = {https://doi.org/10.1137/140999104},
  doi       = {10.1137/140999104},
  timestamp = {Fri, 01 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CreusGGR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CubittM16,
  author    = {Toby S. Cubitt and
               Ashley Montanaro},
  title     = {Complexity Classification of Local Hamiltonian Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {268--316},
  year      = {2016},
  url       = {https://doi.org/10.1137/140998287},
  doi       = {10.1137/140998287},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CubittM16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganPP16,
  author    = {Marek Cygan and
               Marcin Pilipczuk and
               Michal Pilipczuk},
  title     = {Known Algorithms for Edge Clique Cover are Probably Optimal},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {67--83},
  year      = {2016},
  url       = {https://doi.org/10.1137/130947076},
  doi       = {10.1137/130947076},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CyganPP16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisDY16,
  author    = {Constantinos Daskalakis and
               Ilias Diakonikolas and
               Mihalis Yannakakis},
  title     = {How Good is the Chord Algorithm?},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {811--858},
  year      = {2016},
  url       = {https://doi.org/10.1137/13093875X},
  doi       = {10.1137/13093875X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DaskalakisDY16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Efthymiou16,
  author    = {Charilaos Efthymiou},
  title     = {A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs
               Uniqueness Threshold},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2087--2116},
  year      = {2016},
  url       = {https://doi.org/10.1137/140977643},
  doi       = {10.1137/140977643},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Efthymiou16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EngelbergN16,
  author    = {Roee Engelberg and
               Joseph Naor},
  title     = {Equilibria in Online Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {232--267},
  year      = {2016},
  url       = {https://doi.org/10.1137/090760386},
  doi       = {10.1137/090760386},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EngelbergN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EvansKLS16,
  author    = {William S. Evans and
               David G. Kirkpatrick and
               Maarten L{\"{o}}ffler and
               Frank Staals},
  title     = {Minimizing Co-location Potential of Moving Entities},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1870--1893},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1031217},
  doi       = {10.1137/15M1031217},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EvansKLS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ezra16,
  author    = {Esther Ezra},
  title     = {A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal
               Shatter Dimension},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {84--101},
  year      = {2016},
  url       = {https://doi.org/10.1137/140977746},
  doi       = {10.1137/140977746},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ezra16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanGL16,
  author    = {Michal Feldman and
               Nick Gravin and
               Brendan Lucier},
  title     = {Combinatorial Walrasian Equilibrium},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {29--48},
  year      = {2016},
  url       = {https://doi.org/10.1137/13094339X},
  doi       = {10.1137/13094339X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanGL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanV16,
  author    = {Vitaly Feldman and
               Jan Vondr{\'{a}}k},
  title     = {Optimal Bounds on Approximation of Submodular and {XOS} Functions
               by Juntas},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {1129--1170},
  year      = {2016},
  url       = {https://doi.org/10.1137/140958207},
  doi       = {10.1137/140958207},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FoxPS16,
  author    = {Jacob Fox and
               J{\'{a}}nos Pach and
               Andrew Suk},
  title     = {A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its
               Applications in Geometry and Property Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2199--2223},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1007355},
  doi       = {10.1137/15M1007355},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FoxPS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalanisGJ16,
  author    = {Andreas Galanis and
               Leslie Ann Goldberg and
               Mark Jerrum},
  title     = {Approximately Counting H-Colorings is {\textdollar}{\textbackslash}{\#}{\textbackslash}mathrm\{BIS\}{\textdollar}-Hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {680--711},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1020551},
  doi       = {10.1137/15M1020551},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GalanisGJ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalanisSVY16,
  author    = {Andreas Galanis and
               Daniel Stefankovic and
               Eric Vigoda and
               Linji Yang},
  title     = {Ferromagnetic Potts Model: Refined {\#}BIS-hardness and Related Results},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {2004--2065},
  year      = {2016},
  url       = {https://doi.org/10.1137/140997580},
  doi       = {10.1137/140997580},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GalanisSVY16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargGH0SW16,
  author    = {Sanjam Garg and
               Craig Gentry and
               Shai Halevi and
               Mariana Raykova and
               Amit Sahai and
               Brent Waters},
  title     = {Candidate Indistinguishability Obfuscation and Functional Encryption
               for All Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {882--929},
  year      = {2016},
  url       = {https://doi.org/10.1137/14095772X},
  doi       = {10.1137/14095772X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GargGH0SW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GhashamiLPW16,
  author    = {Mina Ghashami and
               Edo Liberty and
               Jeff M. Phillips and
               David P. Woodruff},
  title     = {Frequent Directions: Simple and Deterministic Matrix Sketching},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1762--1792},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1009718},
  doi       = {10.1137/15M1009718},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GhashamiLPW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoosLMWZ16,
  author    = {Mika G{\"{o}}{\"{o}}s and
               Shachar Lovett and
               Raghu Meka and
               Thomas Watson and
               David Zuckerman},
  title     = {Rectangles Are Nonnegative Juntas},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1835--1869},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M103145X},
  doi       = {10.1137/15M103145X},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoosLMWZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GossetN16,
  author    = {David Gosset and
               Daniel Nagaj},
  title     = {Quantum 3-SAT Is QMA\({}_{\mbox{1}}\)-Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {1080--1128},
  year      = {2016},
  url       = {https://doi.org/10.1137/140957056},
  doi       = {10.1137/140957056},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GossetN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniR16,
  author    = {Fabrizio Grandoni and
               Thomas Rothvo{\ss}},
  title     = {Pricing on Paths: {A} {PTAS} for the Highway Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {216--231},
  year      = {2016},
  url       = {https://doi.org/10.1137/140998846},
  doi       = {10.1137/140998846},
  timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrandoniR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuG016,
  author    = {Albert Gu and
               Anupam Gupta and
               Amit Kumar},
  title     = {The Power of Deferral: Maintaining a Constant-Competitive Steiner
               Tree Online},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {1--28},
  year      = {2016},
  url       = {https://doi.org/10.1137/140955276},
  doi       = {10.1137/140955276},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuG016.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaRS16,
  author    = {Rishi Gupta and
               Tim Roughgarden and
               C. Seshadhri},
  title     = {Decompositions of Triangle-Dense Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {197--215},
  year      = {2016},
  url       = {https://doi.org/10.1137/140955331},
  doi       = {10.1137/140955331},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuptaRS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HardtIMW16,
  author    = {Moritz Hardt and
               Yuval Ishai and
               Raghu Meka and
               Virginia Vassilevska Williams},
  title     = {Special Section on the Fifty-Fourth Annual {IEEE} Symposium on Foundations
               of Computer Science {(FOCS} 2013)},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {881},
  year      = {2016},
  url       = {https://doi.org/10.1137/16N974115},
  doi       = {10.1137/16N974115},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HardtIMW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HenzingerKN16,
  author    = {Monika Henzinger and
               Sebastian Krinninger and
               Danupon Nanongkai},
  title     = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier
               and Derandomization},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {947--1006},
  year      = {2016},
  url       = {https://doi.org/10.1137/140957299},
  doi       = {10.1137/140957299},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HenzingerKN16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HsuHRRW16,
  author    = {Justin Hsu and
               Zhiyi Huang and
               Aaron Roth and
               Tim Roughgarden and
               Zhiwei Steven Wu},
  title     = {Private Matchings and Allocations},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {1953--1984},
  year      = {2016},
  url       = {https://doi.org/10.1137/15100271X},
  doi       = {10.1137/15100271X},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HsuHRRW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IwataWY16,
  author    = {Yoichi Iwata and
               Magnus Wahlstr{\"{o}}m and
               Yuichi Yoshida},
  title     = {Half-integrality, LP-branching, and {FPT} Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1377--1411},
  year      = {2016},
  url       = {https://doi.org/10.1137/140962838},
  doi       = {10.1137/140962838},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IwataWY16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiS16,
  author    = {Shi Li and
               Ola Svensson},
  title     = {Approximating k-Median via Pseudo-Approximation},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {530--547},
  year      = {2016},
  url       = {https://doi.org/10.1137/130938645},
  doi       = {10.1137/130938645},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LiS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McGregorS16,
  author    = {Andrew McGregor and
               Rahul Santhanam},
  title     = {Special Section on the Forty-Fourth Annual {ACM} Symposium on Theory
               of Computing {(STOC} 2012)},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1448--1449},
  year      = {2016},
  url       = {https://doi.org/10.1137/16N974127},
  doi       = {10.1137/16N974127},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/McGregorS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegowSVW16,
  author    = {Nicole Megow and
               Martin Skutella and
               Jos{\'{e}} Verschae and
               Andreas Wiese},
  title     = {The Power of Recourse for Online {MST} and {TSP}},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {859--880},
  year      = {2016},
  url       = {https://doi.org/10.1137/130917703},
  doi       = {10.1137/130917703},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MegowSVW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Moitra16,
  author    = {Ankur Moitra},
  title     = {An Almost Optimal Algorithm for Computing Nonnegative Rank},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {156--173},
  year      = {2016},
  url       = {https://doi.org/10.1137/140990139},
  doi       = {10.1137/140990139},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Moitra16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NikolovT016,
  author    = {Aleksandar Nikolov and
               Kunal Talwar and
               Li Zhang},
  title     = {The Geometry of Differential Privacy: The Small Database and Approximate
               Cases},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {575--616},
  year      = {2016},
  url       = {https://doi.org/10.1137/130938943},
  doi       = {10.1137/130938943},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NikolovT016.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PhillipsVZ16,
  author    = {Jeff M. Phillips and
               Elad Verbin and
               Qin Zhang},
  title     = {Lower Bounds for Number-in-Hand Multiparty Communication Complexity,
               Made Easy},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {1},
  pages     = {174--196},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1007525},
  doi       = {10.1137/15M1007525},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PhillipsVZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RodittyZ16,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {A Fully Dynamic Reachability Algorithm for Directed Graphs with an
               Almost Linear Update Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {712--733},
  year      = {2016},
  url       = {https://doi.org/10.1137/13093618X},
  doi       = {10.1137/13093618X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rothvoss16,
  author    = {Thomas Rothvoss},
  title     = {Better Bin Packing Approximations via Discrepancy Theory},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {930--946},
  year      = {2016},
  url       = {https://doi.org/10.1137/140955367},
  doi       = {10.1137/140955367},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Rothvoss16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schmidt16,
  author    = {Jens M. Schmidt},
  title     = {Mondshein Sequences (a.k.a. (2, 1)-Orders)},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {6},
  pages     = {1985--2003},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1030030},
  doi       = {10.1137/15M1030030},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Schmidt16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov16,
  author    = {Alexander A. Sherstov},
  title     = {The Multiparty Communication Complexity of Set Disjointness},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {4},
  pages     = {1450--1489},
  year      = {2016},
  url       = {https://doi.org/10.1137/120891587},
  doi       = {10.1137/120891587},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sherstov16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ullman16,
  author    = {Jonathan Ullman},
  title     = {Answering n\({}^{\mbox{2+o(1)}}\) Counting Queries with Differential
               Privacy is Hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {473--496},
  year      = {2016},
  url       = {https://doi.org/10.1137/130928121},
  doi       = {10.1137/130928121},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ullman16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vegh16,
  author    = {L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title     = {A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems
               with Separable Convex Objectives},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {5},
  pages     = {1729--1761},
  year      = {2016},
  url       = {https://doi.org/10.1137/140978296},
  doi       = {10.1137/140978296},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Vegh16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vidick16,
  author    = {Thomas Vidick},
  title     = {Three-Player Entangled {XOR} Games are NP-Hard to Approximate},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {1007--1063},
  year      = {2016},
  url       = {https://doi.org/10.1137/140956622},
  doi       = {10.1137/140956622},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Vidick16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Williams16,
  author    = {R. Ryan Williams},
  title     = {Natural Proofs versus Derandomization},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {497--529},
  year      = {2016},
  url       = {https://doi.org/10.1137/130938219},
  doi       = {10.1137/130938219},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Williams16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001GMRY15,
  author    = {Andreas G{\"{o}}bel and
               Leslie Ann Goldberg and
               Colin McQuillan and
               David Richerby and
               Tomoyuki Yamakami},
  title     = {Counting List Matrix Partitions of Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {1089--1118},
  year      = {2015},
  url       = {https://doi.org/10.1137/140963029},
  doi       = {10.1137/140963029},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001GMRY15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001S15,
  author    = {Mrinal Kumar and
               Shubhangi Saraf},
  title     = {The Limits of Depth Reduction for Arithmetic Formulas: It's All About
               the Top Fan-In},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1601--1625},
  year      = {2015},
  url       = {https://doi.org/10.1137/140999220},
  doi       = {10.1137/140999220},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001S15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamBN15,
  author    = {Ittai Abraham and
               Yair Bartal and
               Ofer Neiman},
  title     = {Embedding Metrics into Ultrametrics and Graphs into Spanning Trees
               with Constant Average Distortion},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {160--192},
  year      = {2015},
  url       = {https://doi.org/10.1137/120884390},
  doi       = {10.1137/120884390},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbrahamBN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamCKS15,
  author    = {Ittai Abraham and
               Shiri Chechik and
               David Kempe and
               Aleksandrs Slivkins},
  title     = {Low-Distortion Inference of Latent Similarities from a Multiplex Social
               Network},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {617--668},
  year      = {2015},
  url       = {https://doi.org/10.1137/130949191},
  doi       = {10.1137/130949191},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbrahamCKS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalGKS15,
  author    = {Manindra Agrawal and
               Rohit Gurjar and
               Arpita Korwar and
               Nitin Saxena},
  title     = {Hitting-Sets for {ROABP} and Sum of Set-Multilinear Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {669--697},
  year      = {2015},
  url       = {https://doi.org/10.1137/140975103},
  doi       = {10.1137/140975103},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgrawalGKS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovE15,
  author    = {Dorit Aharonov and
               Lior Eldar},
  title     = {Quantum Locally Testable Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1230--1262},
  year      = {2015},
  url       = {https://doi.org/10.1137/140975498},
  doi       = {10.1137/140975498},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AharonovE15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ApplebaumIKW15,
  author    = {Benny Applebaum and
               Yuval Ishai and
               Eyal Kushilevitz and
               Brent Waters},
  title     = {Encoding Functions with Constant Online Rate, or How to Compress Garbled
               Circuit Keys},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {433--466},
  year      = {2015},
  url       = {https://doi.org/10.1137/130929643},
  doi       = {10.1137/130929643},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ApplebaumIKW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalLNZ15,
  author    = {Nikhil Bansal and
               Kang{-}Won Lee and
               Viswanath Nagarajan and
               Murtaza Zafer},
  title     = {Minimum Congestion Mapping in a Cloud},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {819--843},
  year      = {2015},
  url       = {https://doi.org/10.1137/110845239},
  doi       = {10.1137/110845239},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalLNZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakGHMRS15,
  author    = {Boaz Barak and
               Parikshit Gopalan and
               Johan H{\aa}stad and
               Raghu Meka and
               Prasad Raghavendra and
               David Steurer},
  title     = {Making the Long Code Shorter},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1287--1324},
  year      = {2015},
  url       = {https://doi.org/10.1137/130929394},
  doi       = {10.1137/130929394},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarakGHMRS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS15,
  author    = {Surender Baswana and
               Manoj Gupta and
               Sandeep Sen},
  title     = {Fully Dynamic Maximal Matching in O(log n) Update Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {88--113},
  year      = {2015},
  url       = {https://doi.org/10.1137/130914140},
  doi       = {10.1137/130914140},
  timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BaswanaGS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BelkinS15,
  author    = {Mikhail Belkin and
               Kaushik Sinha},
  title     = {Polynomial Learning of Distribution Families},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {889--911},
  year      = {2015},
  url       = {https://doi.org/10.1137/13090818X},
  doi       = {10.1137/13090818X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BelkinS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonR15,
  author    = {Eli Ben{-}Sasson and
               Noga Ron{-}Zewi},
  title     = {From Affine to Two-Source Extractors via Approximate Duality},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1670--1697},
  year      = {2015},
  url       = {https://doi.org/10.1137/12089003X},
  doi       = {10.1137/12089003X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-SassonR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BenczurK15,
  author    = {Andr{\'{a}}s A. Bencz{\'{u}}r and
               David R. Karger},
  title     = {Randomized Approximation Schemes for Cuts and Flows in Capacitated
               Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {290--319},
  year      = {2015},
  url       = {https://doi.org/10.1137/070705970},
  doi       = {10.1137/070705970},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BenczurK15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BilleLRSSW15,
  author    = {Philip Bille and
               Gad M. Landau and
               Rajeev Raman and
               Kunihiko Sadakane and
               Srinivasa Rao Satti and
               Oren Weimann},
  title     = {Random Access to Grammar-Compressed Strings and Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {513--539},
  year      = {2015},
  url       = {https://doi.org/10.1137/130936889},
  doi       = {10.1137/130936889},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BilleLRSSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BitanskyP15,
  author    = {Nir Bitansky and
               Omer Paneth},
  title     = {On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1325--1383},
  year      = {2015},
  url       = {https://doi.org/10.1137/130928236},
  doi       = {10.1137/130928236},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BitanskyP15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlaisT15,
  author    = {Eric Blais and
               Li{-}Yang Tan},
  title     = {Approximating Boolean Functions with Depth-2 Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1583--1600},
  year      = {2015},
  url       = {https://doi.org/10.1137/14097402X},
  doi       = {10.1137/14097402X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BlaisT15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlaisWY15,
  author    = {Eric Blais and
               Amit Weinstein and
               Yuichi Yoshida},
  title     = {Partially Symmetric Functions Are Efficiently Isomorphism Testable},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {411--432},
  year      = {2015},
  url       = {https://doi.org/10.1137/140971877},
  doi       = {10.1137/140971877},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BlaisWY15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoissonnatWY15,
  author    = {Jean{-}Daniel Boissonnat and
               Camille Wormser and
               Mariette Yvinec},
  title     = {Anisotropic Delaunay Mesh Generation},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {467--512},
  year      = {2015},
  url       = {https://doi.org/10.1137/140955446},
  doi       = {10.1137/140955446},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoissonnatWY15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseFRV15,
  author    = {Prosenjit Bose and
               Rolf Fagerberg and
               Andr{\'{e}} van Renssen and
               Sander Verdonschot},
  title     = {Optimal Local Routing on Delaunay Triangulations Defined by Empty
               Equilateral Triangles},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1626--1649},
  year      = {2015},
  url       = {https://doi.org/10.1137/140988103},
  doi       = {10.1137/140988103},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoseFRV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Braverman15,
  author    = {Mark Braverman},
  title     = {Interactive Information Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1698--1739},
  year      = {2015},
  url       = {https://doi.org/10.1137/130938517},
  doi       = {10.1137/130938517},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Braverman15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrunschCMRR15,
  author    = {Tobias Brunsch and
               Kamiel Cornelissen and
               Bodo Manthey and
               Heiko R{\"{o}}glin and
               Clemens R{\"{o}}sner},
  title     = {Smoothed Analysis of the Successive Shortest Path Algorithm},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1798--1819},
  year      = {2015},
  url       = {https://doi.org/10.1137/140989893},
  doi       = {10.1137/140989893},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BrunschCMRR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchbinderFNS15,
  author    = {Niv Buchbinder and
               Moran Feldman and
               Joseph Naor and
               Roy Schwartz},
  title     = {A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular
               Maximization},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1384--1402},
  year      = {2015},
  url       = {https://doi.org/10.1137/130929205},
  doi       = {10.1137/130929205},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BuchbinderFNS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BulanekKS15,
  author    = {Jan Bul{\'{a}}nek and
               Michal Kouck{\'{y}} and
               Michael E. Saks},
  title     = {Tight Lower Bounds for the Online Labeling Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1765--1797},
  year      = {2015},
  url       = {https://doi.org/10.1137/130907653},
  doi       = {10.1137/130907653},
  timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BulanekKS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CanonneRS15,
  author    = {Cl{\'{e}}ment L. Canonne and
               Dana Ron and
               Rocco A. Servedio},
  title     = {Testing Probability Distributions using Conditional Samples},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {540--616},
  year      = {2015},
  url       = {https://doi.org/10.1137/130945508},
  doi       = {10.1137/130945508},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CanonneRS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanLNS15,
  author    = {T.{-}H. Hubert Chan and
               Mingfei Li and
               Li Ning and
               Shay Solomon},
  title     = {New Doubling Spanners: Better and Simpler},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {37--53},
  year      = {2015},
  url       = {https://doi.org/10.1137/130930984},
  doi       = {10.1137/130930984},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanLNS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chazelle15,
  author    = {Bernard Chazelle},
  title     = {Diffusive Influence Systems},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1403--1442},
  year      = {2015},
  url       = {https://doi.org/10.1137/120882640},
  doi       = {10.1137/120882640},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chazelle15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKRV15,
  author    = {Chandra Chekuri and
               Sreeram Kannan and
               Adnan Raja and
               Pramod Viswanath},
  title     = {Multicommodity Flows and Cuts in Polymatroidal Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {912--943},
  year      = {2015},
  url       = {https://doi.org/10.1137/130906830},
  doi       = {10.1137/130906830},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChekuriKRV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DieudonnePV15,
  author    = {Yoann Dieudonn{\'{e}} and
               Andrzej Pelc and
               Vincent Villain},
  title     = {How to Meet Asynchronously at Polynomial Cost},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {844--867},
  year      = {2015},
  url       = {https://doi.org/10.1137/130931990},
  doi       = {10.1137/130931990},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DieudonnePV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Drucker15,
  author    = {Andrew Drucker},
  title     = {New Limits to Classical and Quantum Instance Compression},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1443--1479},
  year      = {2015},
  url       = {https://doi.org/10.1137/130927115},
  doi       = {10.1137/130927115},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Drucker15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinS15,
  author    = {Michael Elkin and
               Shay Solomon},
  title     = {Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning
               Ones},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {996--1025},
  year      = {2015},
  url       = {https://doi.org/10.1137/13094791X},
  doi       = {10.1137/13094791X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ElkinS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanX15,
  author    = {Vitaly Feldman and
               David Xiao},
  title     = {Sample Complexity Bounds on Differentially Private Learning via Communication
               Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1740--1764},
  year      = {2015},
  url       = {https://doi.org/10.1137/140991844},
  doi       = {10.1137/140991844},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanX15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fernandez-BacaG15,
  author    = {David Fern{\'{a}}ndez{-}Baca and
               Sylvain Guillemot and
               Brad Shutters and
               Sudheer Vakati},
  title     = {Fixed-Parameter Algorithms for Finding Agreement Supertrees},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {384--410},
  year      = {2015},
  url       = {https://doi.org/10.1137/120897559},
  doi       = {10.1137/120897559},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Fernandez-BacaG15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FilmusLNRT15,
  author    = {Yuval Filmus and
               Massimo Lauria and
               Jakob Nordstr{\"{o}}m and
               Noga Ron{-}Zewi and
               Neil Thapen},
  title     = {Space Complexity in Polynomial Calculus},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {1119--1153},
  year      = {2015},
  url       = {https://doi.org/10.1137/120895950},
  doi       = {10.1137/120895950},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FilmusLNRT15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerK15,
  author    = {Felix A. Fischer and
               Max Klimm},
  title     = {Optimal Impartial Selection},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1263--1285},
  year      = {2015},
  url       = {https://doi.org/10.1137/140995775},
  doi       = {10.1137/140995775},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerK15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominTV15,
  author    = {Fedor V. Fomin and
               Ioan Todinca and
               Yngve Villanger},
  title     = {Large Induced Subgraphs via Triangulations and {CMSO}},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {54--87},
  year      = {2015},
  url       = {https://doi.org/10.1137/140964801},
  doi       = {10.1137/140964801},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FominTV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FournierLMS15,
  author    = {Herv{\'{e}} Fournier and
               Nutan Limaye and
               Guillaume Malod and
               Srikanth Srinivasan},
  title     = {Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1173--1201},
  year      = {2015},
  url       = {https://doi.org/10.1137/140990280},
  doi       = {10.1137/140990280},
  timestamp = {Tue, 17 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FournierLMS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FujinagaYOKY15,
  author    = {Nao Fujinaga and
               Yukiko Yamauchi and
               Hirotaka Ono and
               Shuji Kijima and
               Masafumi Yamashita},
  title     = {Pattern Formation by Oblivious Asynchronous Mobile Robots},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {740--785},
  year      = {2015},
  url       = {https://doi.org/10.1137/140958682},
  doi       = {10.1137/140958682},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FujinagaYOKY15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FukunagaN015,
  author    = {Takuro Fukunaga and
               Zeev Nutov and
               R. Ravi},
  title     = {Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity
               Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1202--1229},
  year      = {2015},
  url       = {https://doi.org/10.1137/13094503X},
  doi       = {10.1137/13094503X},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FukunagaN015.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargMSV15,
  author    = {Jugal Garg and
               Ruta Mehta and
               Milind A. Sohoni and
               Vijay V. Vazirani},
  title     = {A Complementary Pivot Algorithm for Market Equilibrium under Separable,
               Piecewise-Linear Concave Utilities},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1820--1847},
  year      = {2015},
  url       = {https://doi.org/10.1137/140971002},
  doi       = {10.1137/140971002},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GargMSV15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldwasserR15,
  author    = {Shafi Goldwasser and
               Guy N. Rothblum},
  title     = {How to Compute in the Presence of Leakage},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1480--1549},
  year      = {2015},
  url       = {https://doi.org/10.1137/130931461},
  doi       = {10.1137/130931461},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldwasserR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GroheM15,
  author    = {Martin Grohe and
               D{\'{a}}niel Marx},
  title     = {Structure Theorem and Isomorphism Test for Graphs with Excluded Topological
               Subgraphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {114--159},
  year      = {2015},
  url       = {https://doi.org/10.1137/120892234},
  doi       = {10.1137/120892234},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GroheM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerHRS15,
  author    = {Iftach Haitner and
               Jonathan J. Hoch and
               Omer Reingold and
               Gil Segev},
  title     = {Finding Collisions in Interactive Protocols - Tight Lower Bounds on
               the Round and Communication Complexities of Statistically Hiding Commitments},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {193--242},
  year      = {2015},
  url       = {https://doi.org/10.1137/130938438},
  doi       = {10.1137/130938438},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerHRS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-PeledK15,
  author    = {Sariel Har{-}Peled and
               Nirman Kumar},
  title     = {Approximating Minimization Diagrams and Generalized Proximity Search},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {944--974},
  year      = {2015},
  url       = {https://doi.org/10.1137/140959067},
  doi       = {10.1137/140959067},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Har-PeledK15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HrubesT15,
  author    = {Pavel Hrubes and
               Iddo Tzameret},
  title     = {Short Proofs for the Determinant Identities},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {340--383},
  year      = {2015},
  url       = {https://doi.org/10.1137/130917788},
  doi       = {10.1137/130917788},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HrubesT15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KammaKN15,
  author    = {Lior Kamma and
               Robert Krauthgamer and
               Huy L. Nguyen},
  title     = {Cutting Corners Cheaply, or How to Remove Steiner Points},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {975--995},
  year      = {2015},
  url       = {https://doi.org/10.1137/140951382},
  doi       = {10.1137/140951382},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KammaKN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KargerL15,
  author    = {David R. Karger and
               Matthew S. Levine},
  title     = {Fast Augmenting Paths by Random Sampling from Residual Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {320--339},
  year      = {2015},
  url       = {https://doi.org/10.1137/070705994},
  doi       = {10.1137/070705994},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KargerL15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KerenidisLLRX15,
  author    = {Iordanis Kerenidis and
               Sophie Laplante and
               Virginie Lerays and
               J{\'{e}}r{\'{e}}mie Roland and
               David Xiao},
  title     = {Lower Bounds on Information Complexity via Zero-Communication Protocols
               and Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1550--1572},
  year      = {2015},
  url       = {https://doi.org/10.1137/130928273},
  doi       = {10.1137/130928273},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KerenidisLLRX15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KleinY15,
  author    = {Philip N. Klein and
               Neal E. Young},
  title     = {On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering
               Approximation Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {1154--1172},
  year      = {2015},
  url       = {https://doi.org/10.1137/12087222X},
  doi       = {10.1137/12087222X},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KleinY15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KobayashiGN15,
  author    = {Hirotada Kobayashi and
               Fran{\c{c}}ois Le Gall and
               Harumichi Nishimura},
  title     = {Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {2},
  pages     = {243--289},
  year      = {2015},
  url       = {https://doi.org/10.1137/140971944},
  doi       = {10.1137/140971944},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KobayashiGN15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KolmogorovTZ15,
  author    = {Vladimir Kolmogorov and
               Johan Thapper and
               Stanislav Zivn{\'{y}}},
  title     = {The Power of Linear Programming for General-Valued CSPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {1},
  pages     = {1--36},
  year      = {2015},
  url       = {https://doi.org/10.1137/130945648},
  doi       = {10.1137/130945648},
  timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KolmogorovTZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KopczynskiT15,
  author    = {Eryk Kopczynski and
               Tony Tan},
  title     = {Regular Graphs and the Spectra of Two-Variable Logic with Counting},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {786--818},
  year      = {2015},
  url       = {https://doi.org/10.1137/130943625},
  doi       = {10.1137/130943625},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KopczynskiT15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LonatiMPP15,
  author    = {Violetta Lonati and
               Dino Mandrioli and
               Federica Panella and
               Matteo Pradella},
  title     = {Operator Precedence Languages: Their Automata-Theoretic and Logic
               Characterization},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {4},
  pages     = {1026--1088},
  year      = {2015},
  url       = {https://doi.org/10.1137/140978818},
  doi       = {10.1137/140978818},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LonatiMPP15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LovettM15,
  author    = {Shachar Lovett and
               Raghu Meka},
  title     = {Constructive Discrepancy Minimization by Walking on the Edges},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1573--1582},
  year      = {2015},
  url       = {https://doi.org/10.1137/130929400},
  doi       = {10.1137/130929400},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LovettM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarcoK15,
  author    = {Gianluca De Marco and
               Dariusz R. Kowalski},
  title     = {Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in
               a Dynamic Multiple-Access Channel},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {868--888},
  year      = {2015},
  url       = {https://doi.org/10.1137/140982763},
  doi       = {10.1137/140982763},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MarcoK15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MustafaRR15,
  author    = {Nabil H. Mustafa and
               Rajiv Raman and
               Saurabh Ray},
  title     = {Quasi-Polynomial Time Approximation Scheme for Weighted Geometric
               Set Cover on Pseudodisks and Halfspaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {6},
  pages     = {1650--1669},
  year      = {2015},
  url       = {https://doi.org/10.1137/14099317X},
  doi       = {10.1137/14099317X},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MustafaRR15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Roughgarden15,
  author    = {Tim Roughgarden},
  title     = {Special Section on the Fifty-Third {IEEE} Annual Symposium on Foundations
               of Computer Science {(FOCS} 2012)},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1286},
  year      = {2015},
  url       = {https://doi.org/10.1137/15N973939},
  doi       = {10.1137/15N973939},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Roughgarden15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WilsonZ15,
  author    = {David Bruce Wilson and
               Uri Zwick},
  title     = {A Forward-Backward Single-Source Shortest Paths Algorithm},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {698--739},
  year      = {2015},
  url       = {https://doi.org/10.1137/140970975},
  doi       = {10.1137/140970975},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/WilsonZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001DL14,
  author    = {Abhishek Bhowmick and
               Zeev Dvir and
               Shachar Lovett},
  title     = {New Bounds for Matching Vector Families},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1654--1683},
  year      = {2014},
  url       = {https://doi.org/10.1137/130932296},
  doi       = {10.1137/130932296},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001DL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AaronsonD14,
  author    = {Scott Aaronson and
               Andrew Drucker},
  title     = {A Full Characterization of Quantum Advice},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1131--1183},
  year      = {2014},
  url       = {https://doi.org/10.1137/110856939},
  doi       = {10.1137/110856939},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AaronsonD14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalAKS14,
  author    = {Pankaj K. Agarwal and
               Rinat Ben Avraham and
               Haim Kaplan and
               Micha Sharir},
  title     = {Computing the Discrete Fr{\'{e}}chet Distance in Subquadratic
               Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {429--449},
  year      = {2014},
  url       = {https://doi.org/10.1137/130920526},
  doi       = {10.1137/130920526},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgarwalAKS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AigerKS14,
  author    = {Dror Aiger and
               Haim Kaplan and
               Micha Sharir},
  title     = {Reporting Neighbors in High-Dimensional Euclidean Space},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1363--1395},
  year      = {2014},
  url       = {https://doi.org/10.1137/12089867X},
  doi       = {10.1137/12089867X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AigerKS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Alaei14,
  author    = {Saeed Alaei},
  title     = {Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms
               to Many Buyers},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {930--972},
  year      = {2014},
  url       = {https://doi.org/10.1137/120878422},
  doi       = {10.1137/120878422},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Alaei14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmirFGKLL14,
  author    = {Amihood Amir and
               Gianni Franceschini and
               Roberto Grossi and
               Tsvi Kopelowitz and
               Moshe Lewenstein and
               Noa Lewenstein},
  title     = {Managing Unbounded-Length Keys in Comparison-Driven Data Structures
               with Applications to Online Indexing},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1396--1416},
  year      = {2014},
  url       = {https://doi.org/10.1137/110836377},
  doi       = {10.1137/110836377},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AmirFGKLL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ApplebaumIK14,
  author    = {Benny Applebaum and
               Yuval Ishai and
               Eyal Kushilevitz},
  title     = {How to Garble Arithmetic Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {905--929},
  year      = {2014},
  url       = {https://doi.org/10.1137/120875193},
  doi       = {10.1137/120875193},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ApplebaumIK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AronovBES14,
  author    = {Boris Aronov and
               Mark de Berg and
               Esther Ezra and
               Micha Sharir},
  title     = {Improved Bounds for the Union of Locally Fat Objects in the Plane},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {543--572},
  year      = {2014},
  url       = {https://doi.org/10.1137/120891241},
  doi       = {10.1137/120891241},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AronovBES14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BabaioffSS14,
  author    = {Moshe Babaioff and
               Yogeshwer Sharma and
               Aleksandrs Slivkins},
  title     = {Characterizing Truthful Multi-armed Bandit Mechanisms},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {194--230},
  year      = {2014},
  url       = {https://doi.org/10.1137/120878768},
  doi       = {10.1137/120878768},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BabaioffSS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalFKMNNS14,
  author    = {Nikhil Bansal and
               Uriel Feige and
               Robert Krauthgamer and
               Konstantin Makarychev and
               Viswanath Nagarajan and
               Joseph Naor and
               Roy Schwartz},
  title     = {Min-Max Graph Partitioning and Small Set Expansion},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {872--904},
  year      = {2014},
  url       = {https://doi.org/10.1137/120873996},
  doi       = {10.1137/120873996},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalFKMNNS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalP14,
  author    = {Nikhil Bansal and
               Kirk Pruhs},
  title     = {The Geometry of Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1684--1698},
  year      = {2014},
  url       = {https://doi.org/10.1137/130911317},
  doi       = {10.1137/130911317},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarceloL014,
  author    = {Pablo Barcel{\'{o}} and
               Leonid Libkin and
               Miguel Romero},
  title     = {Efficient Approximations of Conjunctive Queries},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1085--1130},
  year      = {2014},
  url       = {https://doi.org/10.1137/130911731},
  doi       = {10.1137/130911731},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarceloL014.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarenboimEK14,
  author    = {Leonid Barenboim and
               Michael Elkin and
               Fabian Kuhn},
  title     = {Distributed (Delta+1)-Coloring in Linear (in Delta) Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {72--95},
  year      = {2014},
  url       = {https://doi.org/10.1137/12088848X},
  doi       = {10.1137/12088848X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarenboimEK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-OrHP14,
  author    = {Michael Ben{-}Or and
               Avinatan Hassidim and
               Haran Pilpel},
  title     = {Quantum Multiprover Interactive Proofs with Communicating Provers},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {987--1011},
  year      = {2014},
  url       = {https://doi.org/10.1137/090777724},
  doi       = {10.1137/090777724},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-OrHP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonO14,
  title     = {Special Section on the Fifty-Second {IEEE} Annual Symposium on Foundations
               of Computer Science {(FOCS} 2011)},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {654},
  year      = {2014},
  url       = {https://doi.org/10.1137/14097361X},
  doi       = {10.1137/14097361X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-SassonO14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bjorklund14,
  author    = {Andreas Bj{\"{o}}rklund},
  title     = {Determinant Sums for Undirected Hamiltonicity},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {280--299},
  year      = {2014},
  url       = {https://doi.org/10.1137/110839229},
  doi       = {10.1137/110839229},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Bjorklund14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonsmaSW14,
  author    = {Paul S. Bonsma and
               Jens Schulz and
               Andreas Wiese},
  title     = {A Constant-Factor Approximation Algorithm for Unsplittable Flow on
               Paths},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {767--799},
  year      = {2014},
  url       = {https://doi.org/10.1137/120868360},
  doi       = {10.1137/120868360},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BonsmaSW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoutsidisDM14,
  author    = {Christos Boutsidis and
               Petros Drineas and
               Malik Magdon{-}Ismail},
  title     = {Near-Optimal Column-Based Matrix Reconstruction},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {687--717},
  year      = {2014},
  url       = {https://doi.org/10.1137/12086755X},
  doi       = {10.1137/12086755X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoutsidisDM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrakerskiV14,
  author    = {Zvika Brakerski and
               Vinod Vaikuntanathan},
  title     = {Efficient Fully Homomorphic Encryption from (Standard) {\textdollar}{\textbackslash}mathsf\{LWE\}{\textdollar}},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {831--871},
  year      = {2014},
  url       = {https://doi.org/10.1137/120868669},
  doi       = {10.1137/120868669},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BrakerskiV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BravermanRRY14,
  author    = {Mark Braverman and
               Anup Rao and
               Ran Raz and
               Amir Yehudayoff},
  title     = {Pseudorandom Generators for Regular Branching Programs},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {973--986},
  year      = {2014},
  url       = {https://doi.org/10.1137/120875673},
  doi       = {10.1137/120875673},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BravermanRRY14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrennerN14,
  author    = {Hai Brenner and
               Kobbi Nissim},
  title     = {Impossibility of Differentially Private Universally Optimal Mechanisms},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1513--1540},
  year      = {2014},
  url       = {https://doi.org/10.1137/110846671},
  doi       = {10.1137/110846671},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BrennerN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanCFGGOS14,
  author    = {Harry Buhrman and
               Nishanth Chandran and
               Serge Fehr and
               Ran Gelles and
               Vipul Goyal and
               Rafail Ostrovsky and
               Christian Schaffner},
  title     = {Position-Based Quantum Cryptography: Impossibility and Constructions},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {150--178},
  year      = {2014},
  url       = {https://doi.org/10.1137/130913687},
  doi       = {10.1137/130913687},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BuhrmanCFGGOS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BulatovM14,
  author    = {Andrei A. Bulatov and
               D{\'{a}}niel Marx},
  title     = {Constraint Satisfaction Parameterized by Solution Size},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {573--616},
  year      = {2014},
  url       = {https://doi.org/10.1137/120882160},
  doi       = {10.1137/120882160},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BulatovM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CadekKMVW14,
  author    = {Martin Cadek and
               Marek Krc{\'{a}}l and
               Jir{\'{\i}} Matousek and
               Luk{\'{a}}s Vokr{\'{\i}}nek and
               Uli Wagner},
  title     = {Polynomial-Time Computation of Homotopy Groups and Postnikov Systems
               in Fixed Dimension},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1728--1780},
  year      = {2014},
  url       = {https://doi.org/10.1137/120899029},
  doi       = {10.1137/120899029},
  timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CadekKMVW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandranGMO14,
  author    = {Nishanth Chandran and
               Vipul Goyal and
               Ryan Moriarty and
               Rafail Ostrovsky},
  title     = {Position-Based Cryptography},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1291--1341},
  year      = {2014},
  url       = {https://doi.org/10.1137/100805005},
  doi       = {10.1137/100805005},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChandranGMO14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriVZ14,
  author    = {Chandra Chekuri and
               Jan Vondr{\'{a}}k and
               Rico Zenklusen},
  title     = {Submodular Function Maximization via the Multilinear Relaxation and
               Contention Resolution Schemes},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {6},
  pages     = {1831--1879},
  year      = {2014},
  url       = {https://doi.org/10.1137/110839655},
  doi       = {10.1137/110839655},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChekuriVZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengJ14,
  author    = {Siu{-}Wing Cheng and
               Jiongxin Jin},
  title     = {Approximate Shortest Descending Paths},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {410--428},
  year      = {2014},
  url       = {https://doi.org/10.1137/130913808},
  doi       = {10.1137/130913808},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChengJ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheriyanV14,
  author    = {Joseph Cheriyan and
               L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title     = {Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free
               Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1342--1362},
  year      = {2014},
  url       = {https://doi.org/10.1137/120902847},
  doi       = {10.1137/120902847},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CheriyanV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChierichettiK14,
  author    = {Flavio Chierichetti and
               Jon M. Kleinberg},
  title     = {Voting with Limited Information and Many Alternatives},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1615--1653},
  year      = {2014},
  url       = {https://doi.org/10.1137/130936592},
  doi       = {10.1137/130936592},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChierichettiK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChierichettiKP14,
  author    = {Flavio Chierichetti and
               Jon M. Kleinberg and
               Alessandro Panconesi},
  title     = {How to Schedule a Cascade in an Arbitrary Graph},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {6},
  pages     = {1906--1920},
  year      = {2014},
  url       = {https://doi.org/10.1137/130936580},
  doi       = {10.1137/130936580},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChierichettiKP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ClarksonMS14,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {617--653},
  year      = {2014},
  url       = {https://doi.org/10.1137/12089702X},
  doi       = {10.1137/12089702X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ClarksonMS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenRS14,
  author    = {Gil Cohen and
               Ran Raz and
               Gil Segev},
  title     = {Nonmalleable Extractors with Short Seeds and Applications to Privacy
               Amplification},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {450--476},
  year      = {2014},
  url       = {https://doi.org/10.1137/130908634},
  doi       = {10.1137/130908634},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenRS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Coja-OghlanF14,
  author    = {Amin Coja{-}Oghlan and
               Alan M. Frieze},
  title     = {Analyzing Walksat on Random Formulas},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1456--1485},
  year      = {2014},
  url       = {https://doi.org/10.1137/12090191X},
  doi       = {10.1137/12090191X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Coja-OghlanF14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasRST14,
  author    = {Ilias Diakonikolas and
               Prasad Raghavendra and
               Rocco A. Servedio and
               Li{-}Yang Tan},
  title     = {Average Sensitivity and Noise Sensitivity of Polynomial Threshold
               Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {231--253},
  year      = {2014},
  url       = {https://doi.org/10.1137/110855223},
  doi       = {10.1137/110855223},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DiakonikolasRST14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinitzK14,
  author    = {Michael Dinitz and
               Guy Kortsarz},
  title     = {Matroid Secretary for Regular and Decomposable Matroids},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1807--1830},
  year      = {2014},
  url       = {https://doi.org/10.1137/13094030X},
  doi       = {10.1137/13094030X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DinitzK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DodisLWZ14,
  author    = {Yevgeniy Dodis and
               Xin Li and
               Trevor D. Wooley and
               David Zuckerman},
  title     = {Privacy Amplification and Nonmalleable Extractors Via Character Sums},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {800--830},
  year      = {2014},
  url       = {https://doi.org/10.1137/120868414},
  doi       = {10.1137/120868414},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DodisLWZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DughmiR14,
  author    = {Shaddin Dughmi and
               Tim Roughgarden},
  title     = {Black-Box Randomized Reductions in Algorithmic Mechanism Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {312--336},
  year      = {2014},
  url       = {https://doi.org/10.1137/110843654},
  doi       = {10.1137/110843654},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DughmiR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EnglertGKRTT14,
  author    = {Matthias Englert and
               Anupam Gupta and
               Robert Krauthgamer and
               Harald R{\"{a}}cke and
               Inbal Talgam{-}Cohen and
               Kunal Talwar},
  title     = {Vertex Sparsifiers: New Results from Old Techniques},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1239--1262},
  year      = {2014},
  url       = {https://doi.org/10.1137/130908440},
  doi       = {10.1137/130908440},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EnglertGKRTT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EnglertOW14,
  author    = {Matthias Englert and
               Deniz {\"{O}}zmen and
               Matthias Westermann},
  title     = {The Power of Reordering for Online Minimum Makespan Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1220--1237},
  year      = {2014},
  url       = {https://doi.org/10.1137/130919738},
  doi       = {10.1137/130919738},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EnglertOW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaustRRTV14,
  author    = {Sebastian Faust and
               Tal Rabin and
               Leonid Reyzin and
               Eran Tromer and
               Vinod Vaikuntanathan},
  title     = {Protecting Circuits from Computationally Bounded and Noisy Leakage},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1564--1614},
  year      = {2014},
  url       = {https://doi.org/10.1137/120880343},
  doi       = {10.1137/120880343},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FaustRRTV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FilmusW14,
  author    = {Yuval Filmus and
               Justin Ward},
  title     = {Monotone Submodular Maximization over a Matroid via Non-Oblivious
               Local Search},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {514--542},
  year      = {2014},
  url       = {https://doi.org/10.1137/130920277},
  doi       = {10.1137/130920277},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FilmusW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominGLS14,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1541--1563},
  year      = {2014},
  url       = {https://doi.org/10.1137/130910932},
  doi       = {10.1137/130910932},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FominGLS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriedlIMSS14,
  author    = {Katalin Friedl and
               G{\'{a}}bor Ivanyos and
               Fr{\'{e}}d{\'{e}}ric Magniez and
               Miklos Santha and
               Pranab Sen},
  title     = {Hidden Translation and Translating Coset in Quantum Computing},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {1--24},
  year      = {2014},
  url       = {https://doi.org/10.1137/130907203},
  doi       = {10.1137/130907203},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriedlIMSS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeGRV14,
  author    = {Alan M. Frieze and
               Navin Goyal and
               Luis Rademacher and
               Santosh S. Vempala},
  title     = {Expanders via Random Spanning Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {497--513},
  year      = {2014},
  url       = {https://doi.org/10.1137/120890971},
  doi       = {10.1137/120890971},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriezeGRV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ14,
  author    = {Leslie Ann Goldberg and
               Mark Jerrum},
  title     = {The Complexity of Computing the Sign of the Tutte Polynomial},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {6},
  pages     = {1921--1952},
  year      = {2014},
  url       = {https://doi.org/10.1137/12088330X},
  doi       = {10.1137/12088330X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldbergJ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniKLV14,
  author    = {Fabrizio Grandoni and
               Piotr Krysta and
               Stefano Leonardi and
               Carmine Ventre},
  title     = {Utilitarian Mechanism Design for Multiobjective Optimization},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1263--1290},
  year      = {2014},
  url       = {https://doi.org/10.1137/130913602},
  doi       = {10.1137/130913602},
  timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrandoniKLV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerO14,
  author    = {Iftach Haitner and
               Eran Omri},
  title     = {Coin Flipping with Constant Bias Implies One-Way Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {389--409},
  year      = {2014},
  url       = {https://doi.org/10.1137/120887631},
  doi       = {10.1137/120887631},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerO14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-PeledK14,
  author    = {Sariel Har{-}Peled and
               Nirman Kumar},
  title     = {Down the Rabbit Hole: Robust Proximity Search and Density Estimation
               in Sublinear Space},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1486--1511},
  year      = {2014},
  url       = {https://doi.org/10.1137/130916448},
  doi       = {10.1137/130916448},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Har-PeledK14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hastad14,
  author    = {Johan H{\aa}stad},
  title     = {On the NP-Hardness of Max-Not-2},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {179--193},
  year      = {2014},
  url       = {https://doi.org/10.1137/120882718},
  doi       = {10.1137/120882718},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Hastad14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hastad14a,
  author    = {Johan H{\aa}stad},
  title     = {On the Correlation of Parity and Small-Depth Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1699--1708},
  year      = {2014},
  url       = {https://doi.org/10.1137/120897432},
  doi       = {10.1137/120897432},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Hastad14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HastadJLS14,
  author    = {Johan H{\aa}stad and
               Bettina Just and
               J. C. Lagarias and
               Claus{-}Peter Schnorr},
  title     = {Erratum: Polynomial Time Algorithms for Finding Integer Relations
               Among Real Numbers},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {254},
  year      = {2014},
  url       = {https://doi.org/10.1137/130947799},
  doi       = {10.1137/130947799},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HastadJLS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HatamiL14,
  author    = {Hamed Hatami and
               Shachar Lovett},
  title     = {Correlation Testing for Affine Invariant Properties on {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\)
               in the High Error Regime},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {4},
  pages     = {1417--1455},
  year      = {2014},
  url       = {https://doi.org/10.1137/110831349},
  doi       = {10.1137/110831349},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HatamiL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hertli14,
  author    = {Timon Hertli},
  title     = {3-SAT Faster and Simpler - Unique-SAT Bounds for {PPSZ} Hold in General},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {718--729},
  year      = {2014},
  url       = {https://doi.org/10.1137/120868177},
  doi       = {10.1137/120868177},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Hertli14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuberKP14,
  author    = {Anna Huber and
               Andrei A. Krokhin and
               Robert Powell},
  title     = {Skew Bisubmodularity and Valued CSPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1064--1084},
  year      = {2014},
  url       = {https://doi.org/10.1137/120893549},
  doi       = {10.1137/120893549},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HuberKP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImMP14,
  author    = {Sungjin Im and
               Benjamin Moseley and
               Kirk Pruhs},
  title     = {Online Scheduling with General Cost Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {126--143},
  year      = {2014},
  url       = {https://doi.org/10.1137/120902288},
  doi       = {10.1137/120902288},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImMP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kavitha14,
  author    = {Telikepalli Kavitha},
  title     = {A Size-Popularity Tradeoff in the Stable Marriage Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {52--71},
  year      = {2014},
  url       = {https://doi.org/10.1137/120902562},
  doi       = {10.1137/120902562},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Kavitha14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotPV14,
  author    = {Subhash Khot and
               Preyas Popat and
               Nisheeth K. Vishnoi},
  title     = {Almost Polynomial Factor Hardness for Closest Vector Problem with
               Preprocessing},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1184--1205},
  year      = {2014},
  url       = {https://doi.org/10.1137/130919623},
  doi       = {10.1137/130919623},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KhotPV14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KieronskiMPT14,
  author    = {Emanuel Kieronski and
               Jakub Michaliszyn and
               Ian Pratt{-}Hartmann and
               Lidia Tendera},
  title     = {Two-Variable First-Order Logic with Equivalence Closure},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1012--1063},
  year      = {2014},
  url       = {https://doi.org/10.1137/120900095},
  doi       = {10.1137/120900095},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KieronskiMPT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoutisMP14,
  author    = {Ioannis Koutis and
               Gary L. Miller and
               Richard Peng},
  title     = {Approaching Optimality for Solving {SDD} Linear Systems},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {337--354},
  year      = {2014},
  url       = {https://doi.org/10.1137/110845914},
  doi       = {10.1137/110845914},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KoutisMP14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Landsberg14,
  author    = {J. M. Landsberg},
  title     = {New Lower Bounds for the Rank of Matrix Multiplication},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {144--149},
  year      = {2014},
  url       = {https://doi.org/10.1137/120880276},
  doi       = {10.1137/120880276},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Landsberg14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Larsen14,
  author    = {Kasper Green Larsen},
  title     = {On Range Searching in the Group Model and Combinatorial Discrepancy},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {673--686},
  year      = {2014},
  url       = {https://doi.org/10.1137/120865240},
  doi       = {10.1137/120865240},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Larsen14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LauMOT14,
  author    = {Lap Chi Lau and
               Tal Malkin and
               Ryan O'Donnell and
               Luca Trevisan},
  title     = {Special Section on the Fifty-First Annual {IEEE} Symposium on Foundations
               of Computer Science {(FOCS} 2010)},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {255},
  year      = {2014},
  url       = {https://doi.org/10.1137/140973608},
  doi       = {10.1137/140973608},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LauMOT14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lu14,
  author    = {Hsueh{-}I Lu},
  title     = {Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically
               Optimal Number of Bits},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {477--496},
  year      = {2014},
  url       = {https://doi.org/10.1137/120879142},
  doi       = {10.1137/120879142},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Lu14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MagniezMN14,
  author    = {Fr{\'{e}}d{\'{e}}ric Magniez and
               Claire Mathieu and
               Ashwin Nayak},
  title     = {Recognizing Well-Parenthesized Expressions in the Streaming Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {6},
  pages     = {1880--1905},
  year      = {2014},
  url       = {https://doi.org/10.1137/130926122},
  doi       = {10.1137/130926122},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MagniezMN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarxR14,
  author    = {D{\'{a}}niel Marx and
               Igor Razgon},
  title     = {Fixed-Parameter Tractability of Multicut Parameterized by the Size
               of the Cutset},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {355--388},
  year      = {2014},
  url       = {https://doi.org/10.1137/110855247},
  doi       = {10.1137/110855247},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MarxR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NavarroN14,
  author    = {Gonzalo Navarro and
               Yakov Nekrich},
  title     = {Optimal Dynamic Sequence Representations},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1781--1806},
  year      = {2014},
  url       = {https://doi.org/10.1137/130908245},
  doi       = {10.1137/130908245},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NavarroN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatrascuR14,
  author    = {Mihai Patrascu and
               Liam Roditty},
  title     = {Distance Oracles beyond the Thorup-Zwick Bound},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {300--311},
  year      = {2014},
  url       = {https://doi.org/10.1137/11084128X},
  doi       = {10.1137/11084128X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PatrascuR14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reichardt14,
  author    = {Ben W. Reichardt},
  title     = {Span Programs are Equivalent to Quantum Query Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {3},
  pages     = {1206--1219},
  year      = {2014},
  url       = {https://doi.org/10.1137/100792640},
  doi       = {10.1137/100792640},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Reichardt14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rossman14,
  author    = {Benjamin Rossman},
  title     = {The Monotone Complexity of k-Clique on Random Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {256--279},
  year      = {2014},
  url       = {https://doi.org/10.1137/110839059},
  doi       = {10.1137/110839059},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Rossman14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sitters14,
  author    = {Ren{\'{e}} Sitters},
  title     = {The Generalized Work Function Algorithm Is Competitive for the Generalized
               2-Server Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {96--125},
  year      = {2014},
  url       = {https://doi.org/10.1137/120885309},
  doi       = {10.1137/120885309},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sitters14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TulsianiW14,
  author    = {Madhur Tulsiani and
               Julia Wolf},
  title     = {Quadratic Goldreich-Levin Theorems},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {730--766},
  year      = {2014},
  url       = {https://doi.org/10.1137/12086827X},
  doi       = {10.1137/12086827X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/TulsianiW14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Viola14,
  author    = {Emanuele Viola},
  title     = {Extractors for Circuit Sources},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {655--672},
  year      = {2014},
  url       = {https://doi.org/10.1137/11085983X},
  doi       = {10.1137/11085983X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Viola14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Watson14,
  author    = {Thomas Watson},
  title     = {Time Hierarchies for Sampling Distributions},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {5},
  pages     = {1709--1727},
  year      = {2014},
  url       = {https://doi.org/10.1137/120898553},
  doi       = {10.1137/120898553},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Watson14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YousefiY14,
  author    = {Arman Yousefi and
               Neal E. Young},
  title     = {On a Linear Program for Minimum-Weight Triangulation},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {1},
  pages     = {25--51},
  year      = {2014},
  url       = {https://doi.org/10.1137/120887928},
  doi       = {10.1137/120887928},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/YousefiY14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/00010K13,
  author    = {Tanmoy Chakraborty and
               Zhiyi Huang and
               Sanjeev Khanna},
  title     = {Dynamic and Nonuniform Pricing Strategies for Revenue Maximization},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2424--2451},
  year      = {2013},
  url       = {https://doi.org/10.1137/100787799},
  doi       = {10.1137/100787799},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/00010K13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0001K13,
  author    = {George Christodoulou and
               Annam{\'{a}}ria Kov{\'{a}}cs},
  title     = {A Deterministic Truthful {PTAS} for Scheduling Related Machines},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1572--1595},
  year      = {2013},
  url       = {https://doi.org/10.1137/120866038},
  doi       = {10.1137/120866038},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/0001K13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalAKLS13,
  author    = {Pankaj K. Agarwal and
               Boris Aronov and
               Marc J. van Kreveld and
               Maarten L{\"{o}}ffler and
               Rodrigo I. Silveira},
  title     = {Computing Correlation between Piecewise-Linear Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1867--1887},
  year      = {2013},
  url       = {https://doi.org/10.1137/120900708},
  doi       = {10.1137/120900708},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgarwalAKLS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalHY13,
  author    = {Pankaj K. Agarwal and
               Sariel Har{-}Peled and
               Hai Yu},
  title     = {Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {442--458},
  year      = {2013},
  url       = {https://doi.org/10.1137/110830046},
  doi       = {10.1137/110830046},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgarwalHY13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalMS13,
  author    = {Pankaj K. Agarwal and
               Jir{\'{\i}} Matousek and
               Micha Sharir},
  title     = {On Range Searching with Semialgebraic Sets. {II}},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2039--2062},
  year      = {2013},
  url       = {https://doi.org/10.1137/120890855},
  doi       = {10.1137/120890855},
  timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgarwalMS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonBCGM13,
  author    = {Noga Alon and
               Eric Blais and
               Sourav Chakraborty and
               David Garc{\'{\i}}a{-}Soriano and
               Arie Matsliah},
  title     = {Nearly Tight Bounds for Testing Function Isomorphism},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {459--493},
  year      = {2013},
  url       = {https://doi.org/10.1137/110832677},
  doi       = {10.1137/110832677},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonBCGM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Applebaum13,
  author    = {Benny Applebaum},
  title     = {Pseudorandom Generators with Long Stretch and Low Locality from Random
               Local One-Way Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {2008--2037},
  year      = {2013},
  url       = {https://doi.org/10.1137/120884857},
  doi       = {10.1137/120884857},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Applebaum13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasGM13,
  author    = {Albert Atserias and
               Martin Grohe and
               D{\'{a}}niel Marx},
  title     = {Size Bounds and Query Plans for Relational Joins},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1737--1767},
  year      = {2013},
  url       = {https://doi.org/10.1137/110859440},
  doi       = {10.1137/110859440},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasM13,
  author    = {Albert Atserias and
               Elitza N. Maneva},
  title     = {Sherali-Adams Relaxations and Indistinguishability in Counting Logics},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {112--137},
  year      = {2013},
  url       = {https://doi.org/10.1137/120867834},
  doi       = {10.1137/120867834},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AtseriasM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AwerbuchAE13,
  author    = {Baruch Awerbuch and
               Yossi Azar and
               Amir Epstein},
  title     = {The Price of Routing Unsplittable Flow},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {160--177},
  year      = {2013},
  url       = {https://doi.org/10.1137/070702370},
  doi       = {10.1137/070702370},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AwerbuchAE13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalcanBM13,
  author    = {Maria{-}Florina Balcan and
               Avrim Blum and
               Yishay Mansour},
  title     = {Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {230--264},
  year      = {2013},
  url       = {https://doi.org/10.1137/110821317},
  doi       = {10.1137/110821317},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BalcanBM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalcanBS13,
  author    = {Maria{-}Florina Balcan and
               Mark Braverman and
               Daniel A. Spielman},
  title     = {Special Section on the Fiftieth Annual {IEEE} Symposium on Foundations
               of Computer Science {(FOCS} 2009)},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2286},
  year      = {2013},
  url       = {https://doi.org/10.1137/130973545},
  doi       = {10.1137/130973545},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BalcanBS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalHISZ13,
  author    = {Nikhil Bansal and
               Xin Han and
               Kazuo Iwama and
               Maxim Sviridenko and
               Guochuan Zhang},
  title     = {A Harmonic Algorithm for the 3D Strip Packing Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {579--592},
  year      = {2013},
  url       = {https://doi.org/10.1137/070691607},
  doi       = {10.1137/070691607},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalHISZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakBCR13,
  author    = {Boaz Barak and
               Mark Braverman and
               Xi Chen and
               Anup Rao},
  title     = {How to Compress Interactive Communication},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1327--1363},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811969},
  doi       = {10.1137/100811969},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarakBCR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BattistaFP13,
  author    = {Giuseppe Di Battista and
               Fabrizio Frati and
               J{\'{a}}nos Pach},
  title     = {On the Queue Number of Planar Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2243--2285},
  year      = {2013},
  url       = {https://doi.org/10.1137/130908051},
  doi       = {10.1137/130908051},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BattistaFP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseDMS13,
  author    = {Prosenjit Bose and
               Vida Dujmovic and
               Pat Morin and
               Michiel H. M. Smid},
  title     = {Robust Geometric Spanners},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1720--1736},
  year      = {2013},
  url       = {https://doi.org/10.1137/120874473},
  doi       = {10.1137/120874473},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoseDMS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreslerMS13,
  author    = {Guy Bresler and
               Elchanan Mossel and
               Allan Sly},
  title     = {Reconstruction of Markov Random Fields from Samples: Some Observations
               and Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {563--578},
  year      = {2013},
  url       = {https://doi.org/10.1137/100796029},
  doi       = {10.1137/100796029},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BreslerMS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BurtonH13,
  author    = {Benjamin A. Burton and
               Mathias Hiron},
  title     = {Locating Regions in a Sequence under Density Constraints},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1201--1215},
  year      = {2013},
  url       = {https://doi.org/10.1137/110830605},
  doi       = {10.1137/110830605},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BurtonH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ButmanCCJLPPS13,
  author    = {Ayelet Butman and
               Peter Clifford and
               Rapha{\"{e}}l Clifford and
               Markus Jalsenius and
               Noa Lewenstein and
               Benny Porat and
               Ely Porat and
               Benjamin Sach},
  title     = {Pattern Matching under Polynomial Transformation},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {611--633},
  year      = {2013},
  url       = {https://doi.org/10.1137/110853327},
  doi       = {10.1137/110853327},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ButmanCCJLPPS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloCE13,
  author    = {Sergio Cabello and
               Erin W. Chambers and
               Jeff Erickson},
  title     = {Multiple-Source Shortest Paths in Embedded Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1542--1571},
  year      = {2013},
  url       = {https://doi.org/10.1137/120864271},
  doi       = {10.1137/120864271},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CabelloCE13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabelloM13,
  author    = {Sergio Cabello and
               Bojan Mohar},
  title     = {Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity
               Hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1803--1829},
  year      = {2013},
  url       = {https://doi.org/10.1137/120872310},
  doi       = {10.1137/120872310},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CabelloM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiCL13,
  author    = {Jin{-}Yi Cai and
               Xi Chen and
               Pinyan Lu},
  title     = {Graph Homomorphisms with Complex Values: {A} Dichotomy Theorem},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {924--1029},
  year      = {2013},
  url       = {https://doi.org/10.1137/110840194},
  doi       = {10.1137/110840194},
  timestamp = {Wed, 21 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CaiCL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CelisRSW13,
  author    = {L. Elisa Celis and
               Omer Reingold and
               Gil Segev and
               Udi Wieder},
  title     = {Balls and Bins: Smaller Hash Families and Faster Evaluation},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1030--1050},
  year      = {2013},
  url       = {https://doi.org/10.1137/120871626},
  doi       = {10.1137/120871626},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CelisRSW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartiCKM13,
  author    = {Amit Chakrabarti and
               Graham Cormode and
               Ranganath Kondapally and
               Andrew McGregor},
  title     = {Information Cost Tradeoffs for Augmented Index and Streaming Language
               Recognition},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {61--83},
  year      = {2013},
  url       = {https://doi.org/10.1137/100816481},
  doi       = {10.1137/100816481},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartiCKM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanM13,
  author    = {Siu On Chan and
               Michael Molloy},
  title     = {A Dichotomy Theorem for the Resolution Complexity of Random Constraint
               Satisfaction Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {27--60},
  year      = {2013},
  url       = {https://doi.org/10.1137/110832240},
  doi       = {10.1137/110832240},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandrasekaranGH13,
  author    = {Karthekeyan Chandrasekaran and
               Navin Goyal and
               Bernhard Haeupler},
  title     = {Deterministic Algorithms for the Lov{\'{a}}sz Local Lemma},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2132--2155},
  year      = {2013},
  url       = {https://doi.org/10.1137/100799642},
  doi       = {10.1137/100799642},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChandrasekaranGH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangL13,
  author    = {Hsien{-}Chih Chang and
               Hsueh{-}I Lu},
  title     = {Computing the Girth of a Planar Graph in Linear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1077--1094},
  year      = {2013},
  url       = {https://doi.org/10.1137/110832033},
  doi       = {10.1137/110832033},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChangL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Charron-BostGWW13,
  author    = {Bernadette Charron{-}Bost and
               Antoine Gaillard and
               Jennifer L. Welch and
               Josef Widder},
  title     = {Link Reversal Routing with Binary Link Labels: Work Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {634--661},
  year      = {2013},
  url       = {https://doi.org/10.1137/110843095},
  doi       = {10.1137/110843095},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Charron-BostGWW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS13,
  author    = {Chandra Chekuri and
               Sanjeev Khanna and
               F. Bruce Shepherd},
  title     = {The All-or-Nothing Multicommodity Flow Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1467--1493},
  year      = {2013},
  url       = {https://doi.org/10.1137/100796820},
  doi       = {10.1137/100796820},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChekuriKS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenGW13,
  author    = {Victor Chen and
               Elena Grigorescu and
               Ronald de Wolf},
  title     = {Error-Correcting Data Structures},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {84--111},
  year      = {2013},
  url       = {https://doi.org/10.1137/110834949},
  doi       = {10.1137/110834949},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenGW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenHW13,
  author    = {Danny Z. Chen and
               John Hershberger and
               Haitao Wang},
  title     = {Computing Shortest Paths amid Convex Pseudodisks},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1158--1184},
  year      = {2013},
  url       = {https://doi.org/10.1137/110840030},
  doi       = {10.1137/110840030},
  timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenHW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheraghchiGV13,
  author    = {Mahdi Cheraghchi and
               Venkatesan Guruswami and
               Ameya Velingker},
  title     = {Restricted Isometry of Fourier Matrices and List Decodability of Random
               Linear Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1888--1914},
  year      = {2013},
  url       = {https://doi.org/10.1137/120896773},
  doi       = {10.1137/120896773},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CheraghchiGV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheungLL13,
  author    = {Ho Yee Cheung and
               Lap Chi Lau and
               Kai Man Leung},
  title     = {Graph Connectivities, Network Coding, and Expander Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {733--751},
  year      = {2013},
  url       = {https://doi.org/10.1137/110844970},
  doi       = {10.1137/110844970},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CheungLL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChierichettiKLPR13,
  author    = {Flavio Chierichetti and
               Ravi Kumar and
               Silvio Lattanzi and
               Alessandro Panconesi and
               Prabhakar Raghavan},
  title     = {Models for the Compressible Web},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1777--1802},
  year      = {2013},
  url       = {https://doi.org/10.1137/120879828},
  doi       = {10.1137/120879828},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChierichettiKLPR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChitnisHM13,
  author    = {Rajesh Hemant Chitnis and
               MohammadTaghi Hajiaghayi and
               D{\'{a}}niel Marx},
  title     = {Fixed-Parameter Tractability of Directed Multiway Cut Parameterized
               by the Size of the Cutset},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1674--1696},
  year      = {2013},
  url       = {https://doi.org/10.1137/12086217X},
  doi       = {10.1137/12086217X},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChitnisHM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenCCJZ13,
  author    = {David A. Cohen and
               Martin C. Cooper and
               P{\'{a}}id{\'{\i}} Creed and
               Peter G. Jeavons and
               Stanislav Zivn{\'{y}}},
  title     = {An Algebraic Theory of Complexity for Discrete Optimization},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1915--1939},
  year      = {2013},
  url       = {https://doi.org/10.1137/130906398},
  doi       = {10.1137/130906398},
  timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenCCJZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CorneilDH13,
  author    = {Derek G. Corneil and
               Barnaby Dalton and
               Michel Habib},
  title     = {LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem
               on Cocomparability Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {792--807},
  year      = {2013},
  url       = {https://doi.org/10.1137/11083856X},
  doi       = {10.1137/11083856X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CorneilDH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DeKSS13,
  author    = {Anindya De and
               Piyush P. Kurur and
               Chandan Saha and
               Ramprasad Saptharishi},
  title     = {Fast Integer Multiplication Using Modular Arithmetic},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {685--699},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811167},
  doi       = {10.1137/100811167},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DeKSS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DeckerISW13,
  author    = {Thomas Decker and
               G{\'{a}}bor Ivanyos and
               Miklos Santha and
               Pawel Wocjan},
  title     = {Hidden Symmetry Subgroup Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1987--2007},
  year      = {2013},
  url       = {https://doi.org/10.1137/120864416},
  doi       = {10.1137/120864416},
  timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DeckerISW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DengFG13,
  author    = {Ting Deng and
               Wenfei Fan and
               Floris Geerts},
  title     = {On the Complexity of Package Recommendation Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1940--1986},
  year      = {2013},
  url       = {https://doi.org/10.1137/120904524},
  doi       = {10.1137/120904524},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DengFG13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurH13,
  author    = {Irit Dinur and
               Prahladh Harsha},
  title     = {Composition of Low-Error 2-Query PCPs Using Decodable PCPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2452--2486},
  year      = {2013},
  url       = {https://doi.org/10.1137/100788161},
  doi       = {10.1137/100788161},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DinurH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DobzinskiD13,
  author    = {Shahar Dobzinski and
               Shaddin Dughmi},
  title     = {On the Power of Randomization in Algorithmic Mechanism Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2287--2304},
  year      = {2013},
  url       = {https://doi.org/10.1137/090780146},
  doi       = {10.1137/090780146},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DobzinskiD13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DriemelH13,
  author    = {Anne Driemel and
               Sariel Har{-}Peled},
  title     = {Jaywalking Your Dog: Computing the Fr{\'{e}}chet Distance with
               Shortcuts},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {5},
  pages     = {1830--1866},
  year      = {2013},
  url       = {https://doi.org/10.1137/120865112},
  doi       = {10.1137/120865112},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DriemelH13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirKSS13,
  author    = {Zeev Dvir and
               Swastik Kopparty and
               Shubhangi Saraf and
               Madhu Sudan},
  title     = {Extensions to the Method of Multiplicities, with Applications to Kakeya
               Sets and Mergers},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2305--2328},
  year      = {2013},
  url       = {https://doi.org/10.1137/100783704},
  doi       = {10.1137/100783704},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DvirKSS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerR13,
  author    = {Martin E. Dyer and
               David Richerby},
  title     = {An Effective Dichotomy for the Counting Constraint Satisfaction Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1245--1274},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811258},
  doi       = {10.1137/100811258},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DyerR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FerraginaNV13,
  author    = {Paolo Ferragina and
               Igor Nitto and
               Rossano Venturini},
  title     = {On the Bit-Complexity of Lempel-Ziv Compression},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1521--1541},
  year      = {2013},
  url       = {https://doi.org/10.1137/120869511},
  doi       = {10.1137/120869511},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FerraginaNV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominV13,
  author    = {Fedor V. Fomin and
               Yngve Villanger},
  title     = {Subexponential Parameterized Algorithm for Minimum Fill-In},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2197--2216},
  year      = {2013},
  url       = {https://doi.org/10.1137/11085390X},
  doi       = {10.1137/11085390X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FominV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FountoulakisPS13,
  author    = {Nikolaos Fountoulakis and
               Konstantinos Panagiotou and
               Angelika Steger},
  title     = {On the Insertion Time of Cuckoo Hashing},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2156--2181},
  year      = {2013},
  url       = {https://doi.org/10.1137/100797503},
  doi       = {10.1137/100797503},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FountoulakisPS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriggstadSS13,
  author    = {Zachary Friggstad and
               Mohammad R. Salavatipour and
               Zoya Svitkina},
  title     = {Asymmetric Traveling Salesman Path and Directed Latency Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1596--1619},
  year      = {2013},
  url       = {https://doi.org/10.1137/100797357},
  doi       = {10.1137/100797357},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriggstadSS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoaocKL13,
  author    = {Xavier Goaoc and
               Hyo{-}Sil Kim and
               Sylvain Lazard},
  title     = {Bounded-Curvature Shortest Paths through a Sequence of Points Using
               Convex Optimization},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {662--684},
  year      = {2013},
  url       = {https://doi.org/10.1137/100816079},
  doi       = {10.1137/100816079},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoaocKL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoelKK13,
  author    = {Ashish Goel and
               Michael Kapralov and
               Sanjeev Khanna},
  title     = {Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1392--1404},
  year      = {2013},
  url       = {https://doi.org/10.1137/100812513},
  doi       = {10.1137/100812513},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoelKK13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ13,
  author    = {Leslie Ann Goldberg and
               Mark Jerrum},
  title     = {A Polynomial-Time Algorithm for Estimating the Partition Function
               of the Ferromagnetic Ising Model on a Regular Matroid},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1132--1157},
  year      = {2013},
  url       = {https://doi.org/10.1137/110851213},
  doi       = {10.1137/110851213},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldbergJ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GollerL13,
  author    = {Stefan G{\"{o}}ller and
               Markus Lohrey},
  title     = {Branching-Time Model Checking of One-Counter Processes and Timed Automata},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {884--923},
  year      = {2013},
  url       = {https://doi.org/10.1137/120876435},
  doi       = {10.1137/120876435},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GollerL13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanMRZ13,
  author    = {Parikshit Gopalan and
               Raghu Meka and
               Omer Reingold and
               David Zuckerman},
  title     = {Pseudorandom Generators for Combinatorial Shapes},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1051--1076},
  year      = {2013},
  url       = {https://doi.org/10.1137/110854990},
  doi       = {10.1137/110854990},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GopalanMRZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniGLMSS13,
  author    = {Fabrizio Grandoni and
               Anupam Gupta and
               Stefano Leonardi and
               Pauli Miettinen and
               Piotr Sankowski and
               Mohit Singh},
  title     = {Set Covering with Our Eyes Closed},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {808--830},
  year      = {2013},
  url       = {https://doi.org/10.1137/100802888},
  doi       = {10.1137/100802888},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrandoniGLMSS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuoLV13,
  author    = {Heng Guo and
               Pinyan Lu and
               Leslie G. Valiant},
  title     = {The Complexity of Symmetric Boolean Parity Holant Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {324--356},
  year      = {2013},
  url       = {https://doi.org/10.1137/100815530},
  doi       = {10.1137/100815530},
  timestamp = {Fri, 11 Aug 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuoLV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaHRU13,
  author    = {Anupam Gupta and
               Moritz Hardt and
               Aaron Roth and
               Jonathan Ullman},
  title     = {Privately Releasing Conjunctions and the Statistical Query Barrier},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1494--1520},
  year      = {2013},
  url       = {https://doi.org/10.1137/110857714},
  doi       = {10.1137/110857714},
  timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuptaHRU13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Haitner13,
  author    = {Iftach Haitner},
  title     = {A Parallel Repetition Theorem for Any Interactive Argument},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2487--2501},
  year      = {2013},
  url       = {https://doi.org/10.1137/100810630},
  doi       = {10.1137/100810630},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Haitner13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerRV13,
  author    = {Iftach Haitner and
               Omer Reingold and
               Salil P. Vadhan},
  title     = {Efficiency Improvements in Constructing Pseudorandom Generators from
               One-Way Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1405--1430},
  year      = {2013},
  url       = {https://doi.org/10.1137/100814421},
  doi       = {10.1137/100814421},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerRV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-PeledK13,
  author    = {Sariel Har{-}Peled and
               Nirman Kumar},
  title     = {Approximate Nearest Neighbor Search for Low-Dimensional Queries},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {138--159},
  year      = {2013},
  url       = {https://doi.org/10.1137/110852711},
  doi       = {10.1137/110852711},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Har-PeledK13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaramatySS13,
  author    = {Elad Haramaty and
               Amir Shpilka and
               Madhu Sudan},
  title     = {Optimal Testing of Multivariate Polynomials over Small Prime Fields},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {536--562},
  year      = {2013},
  url       = {https://doi.org/10.1137/120879257},
  doi       = {10.1137/120879257},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaramatySS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HwangTC13,
  author    = {Hsien{-}Kuei Hwang and
               Tsung{-}Hsi Tsai and
               Wei{-}Mei Chen},
  title     = {Threshold Phenomena in k-Dominant Skylines of Random Samples},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {405--441},
  year      = {2013},
  url       = {https://doi.org/10.1137/110856952},
  doi       = {10.1137/110856952},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HwangTC13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JhaR13,
  author    = {Madhav Jha and
               Sofya Raskhodnikova},
  title     = {Testing and Reconstruction of Lipschitz Functions with Applications
               to Data Privacy},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {700--731},
  year      = {2013},
  url       = {https://doi.org/10.1137/110840741},
  doi       = {10.1137/110840741},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JhaR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KalePS13,
  author    = {Satyen Kale and
               Yuval Peres and
               C. Seshadhri},
  title     = {Noise Tolerance of Expanders and Sublinear Expansion Reconstruction},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {305--323},
  year      = {2013},
  url       = {https://doi.org/10.1137/110837863},
  doi       = {10.1137/110837863},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KalePS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanTZ13,
  author    = {Haim Kaplan and
               Robert Endre Tarjan and
               Uri Zwick},
  title     = {Soft Heaps Simplified},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1660--1673},
  year      = {2013},
  url       = {https://doi.org/10.1137/120880185},
  doi       = {10.1137/120880185},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaplanTZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarninMSV13,
  author    = {Zohar Shay Karnin and
               Partha Mukhopadhyay and
               Amir Shpilka and
               Ilya Volkovich},
  title     = {Deterministic Identity Testing of Depth-4 Multilinear Circuits with
               Bounded Top Fan-in},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2114--2131},
  year      = {2013},
  url       = {https://doi.org/10.1137/110824516},
  doi       = {10.1137/110824516},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KarninMSV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotM13,
  author    = {Subhash Khot and
               Dana Moshkovitz},
  title     = {\emph{NP}-Hardness of Approximately Solving Linear Equations over
               Reals},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {752--791},
  year      = {2013},
  url       = {https://doi.org/10.1137/110846415},
  doi       = {10.1137/110846415},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KhotM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KintaliPRST13,
  author    = {Shiva Kintali and
               Laura J. Poplawski and
               Rajmohan Rajaraman and
               Ravi Sundaram and
               Shang{-}Hua Teng},
  title     = {Reducibility among Fractional Stability Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2063--2113},
  year      = {2013},
  url       = {https://doi.org/10.1137/120874655},
  doi       = {10.1137/120874655},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KintaliPRST13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoppartyS13,
  author    = {Swastik Kopparty and
               Shubhangi Saraf},
  title     = {Local List-Decoding and Testing of Random Linear Codes from High Error},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1302--1326},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811945},
  doi       = {10.1137/100811945},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KoppartyS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LauS13,
  author    = {Lap Chi Lau and
               Mohit Singh},
  title     = {Additive Approximation for Bounded Degree Survivable Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2217--2242},
  year      = {2013},
  url       = {https://doi.org/10.1137/110854461},
  doi       = {10.1137/110854461},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LauS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LauY13,
  author    = {Lap Chi Lau and
               Chun Kong Yung},
  title     = {Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1185--1200},
  year      = {2013},
  url       = {https://doi.org/10.1137/100790239},
  doi       = {10.1137/100790239},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LauY13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeSV13,
  author    = {Jon Lee and
               Maxim Sviridenko and
               Jan Vondr{\'{a}}k},
  title     = {Matroid Matching: The Power of Local Search},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {357--379},
  year      = {2013},
  url       = {https://doi.org/10.1137/11083232X},
  doi       = {10.1137/11083232X},
  timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LeeSV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LinzJS13,
  author    = {Simone Linz and
               Katherine St. John and
               Charles Semple},
  title     = {Counting Trees in a Phylogenetic Network Is {\textbackslash}{\#}P-Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1768--1776},
  year      = {2013},
  url       = {https://doi.org/10.1137/12089394X},
  doi       = {10.1137/12089394X},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LinzJS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LovettP13,
  author    = {Shachar Lovett and
               Ely Porat},
  title     = {A Space Lower Bound for Dynamic Approximate Membership Data Structures},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2182--2196},
  year      = {2013},
  url       = {https://doi.org/10.1137/120867044},
  doi       = {10.1137/120867044},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LovettP13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Meir13,
  author    = {Or Meir},
  title     = {{IP} = {PSPACE} Using Error-Correcting Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {380--403},
  year      = {2013},
  url       = {https://doi.org/10.1137/110829660},
  doi       = {10.1137/110829660},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Meir13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MekaZ13,
  author    = {Raghu Meka and
               David Zuckerman},
  title     = {Pseudorandom Generators for Polynomial Threshold Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1275--1301},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811623},
  doi       = {10.1137/100811623},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MekaZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MicciancioV13,
  author    = {Daniele Micciancio and
               Panagiotis Voulgaris},
  title     = {A Deterministic Single Exponential Time Algorithm for Most Lattice
               Problems Based on Voronoi Cell Computations},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1364--1391},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811970},
  doi       = {10.1137/100811970},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MicciancioV13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Moitra13,
  author    = {Ankur Moitra},
  title     = {Vertex Sparsification and Oblivious Reductions},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2400--2423},
  year      = {2013},
  url       = {https://doi.org/10.1137/100787337},
  doi       = {10.1137/100787337},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Moitra13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NewmanR13,
  author    = {Ilan Newman and
               Yuri Rabinovich},
  title     = {On Multiplicative Lambda-Approximations and Some Geometric Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {855--883},
  year      = {2013},
  url       = {https://doi.org/10.1137/100801809},
  doi       = {10.1137/100801809},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NewmanR13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NewmanS13,
  author    = {Ilan Newman and
               Christian Sohler},
  title     = {Every Property of Hyperfinite Graphs Is Testable},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1095--1112},
  year      = {2013},
  url       = {https://doi.org/10.1137/120890946},
  doi       = {10.1137/120890946},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NewmanS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ODonnellW13,
  author    = {Ryan O'Donnell and
               Karl Wimmer},
  title     = {KKL, Kruskal-Katona, and Monotone Nets},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2375--2399},
  year      = {2013},
  url       = {https://doi.org/10.1137/100787325},
  doi       = {10.1137/100787325},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ODonnellW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Patel13,
  author    = {Viresh Patel},
  title     = {Determining Edge Expansion and Other Connectivity Measures of Graphs
               of Bounded Genus},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1113--1131},
  year      = {2013},
  url       = {https://doi.org/10.1137/100811416},
  doi       = {10.1137/100811416},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Patel13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PeikertKSFRS13,
  author    = {Chris Peikert and
               Robert Kleinberg and
               Aravind Srinivasan and
               Alan M. Frieze and
               Alexander Russell and
               Leonard J. Schulman},
  title     = {Special Section on the Forty-Second Annual {ACM} Symposium on Theory
               of Computing {(STOC} 2010)},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1216--1217},
  year      = {2013},
  url       = {https://doi.org/10.1137/130973429},
  doi       = {10.1137/130973429},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PeikertKSFRS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schmidt13,
  author    = {Jens M. Schmidt},
  title     = {Contractions, Removals, and Certifying 3-Connectivity in Linear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {494--535},
  year      = {2013},
  url       = {https://doi.org/10.1137/110848311},
  doi       = {10.1137/110848311},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Schmidt13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov13,
  author    = {Alexander A. Sherstov},
  title     = {The Intersection of Two Halfspaces Has High Threshold Degree},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {6},
  pages     = {2329--2374},
  year      = {2013},
  url       = {https://doi.org/10.1137/100785260},
  doi       = {10.1137/100785260},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sherstov13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SommaB13,
  author    = {Rolando D. Somma and
               Sergio Boixo},
  title     = {Spectral Gap Amplification},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {2},
  pages     = {593--610},
  year      = {2013},
  url       = {https://doi.org/10.1137/120871997},
  doi       = {10.1137/120871997},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SommaB13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Soto13,
  author    = {Jos{\'{e}} A. Soto},
  title     = {Matroid Secretary Problem in the Random-Assignment Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {178--211},
  year      = {2013},
  url       = {https://doi.org/10.1137/110852061},
  doi       = {10.1137/110852061},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Soto13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SpielmanT13,
  author    = {Daniel A. Spielman and
               Shang{-}Hua Teng},
  title     = {A Local Clustering Algorithm for Massive Graphs and Its Application
               to Nearly Linear Time Graph Partitioning},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {1--26},
  year      = {2013},
  url       = {https://doi.org/10.1137/080744888},
  doi       = {10.1137/080744888},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SpielmanT13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TancerT13,
  author    = {Martin Tancer and
               Dmitry Tonkonog},
  title     = {Nerves of Good Covers Are Algorithmically Unrecognizable},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1697--1719},
  year      = {2013},
  url       = {https://doi.org/10.1137/120891204},
  doi       = {10.1137/120891204},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/TancerT13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VerbinZ13,
  author    = {Elad Verbin and
               Qin Zhang},
  title     = {The Limits of Buffering: {A} Tight Lower Bound for Dynamic Membership
               in the External Memory Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {212--229},
  year      = {2013},
  url       = {https://doi.org/10.1137/110842211},
  doi       = {10.1137/110842211},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/VerbinZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vondrak13,
  author    = {Jan Vondr{\'{a}}k},
  title     = {Symmetry and Approximability of Submodular Maximization Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {265--304},
  year      = {2013},
  url       = {https://doi.org/10.1137/110832318},
  doi       = {10.1137/110832318},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Vondrak13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WhiddenBZ13,
  author    = {Chris Whidden and
               Robert G. Beiko and
               Norbert Zeh},
  title     = {Fixed-Parameter Algorithms for Maximum Agreement Forests},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1431--1466},
  year      = {2013},
  url       = {https://doi.org/10.1137/110845045},
  doi       = {10.1137/110845045},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/WhiddenBZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Williams13,
  author    = {Ryan Williams},
  title     = {Improving Exhaustive Search Implies Superpolynomial Lower Bounds},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {1218--1244},
  year      = {2013},
  url       = {https://doi.org/10.1137/10080703X},
  doi       = {10.1137/10080703X},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Williams13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WilliamsW13,
  author    = {Virginia Vassilevska Williams and
               Ryan Williams},
  title     = {Finding, Minimizing, and Counting Weighted Subgraphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {3},
  pages     = {831--854},
  year      = {2013},
  url       = {https://doi.org/10.1137/09076619X},
  doi       = {10.1137/09076619X},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/WilliamsW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Xia13,
  author    = {Ge Xia},
  title     = {The Stretch Factor of the Delaunay Triangulation Is Less than 1.998},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1620--1659},
  year      = {2013},
  url       = {https://doi.org/10.1137/110832458},
  doi       = {10.1137/110832458},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Xia13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalAKMTY12,
  author    = {Pankaj K. Agarwal and
               Lars Arge and
               Haim Kaplan and
               Eyal Molad and
               Robert Endre Tarjan and
               Ke Yi},
  title     = {An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {104--127},
  year      = {2012},
  url       = {https://doi.org/10.1137/10078791X},
  doi       = {10.1137/10078791X},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AgarwalAKMTY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AilonALZ12,
  author    = {Nir Ailon and
               Noa Avigdor{-}Elgrabli and
               Edo Liberty and
               Anke van Zuylen},
  title     = {Improved Approximation Algorithms for Bipartite Correlation Clustering},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1110--1121},
  year      = {2012},
  url       = {https://doi.org/10.1137/110848712},
  doi       = {10.1137/110848712},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AilonALZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndersonMSS12,
  author    = {Matthew Anderson and
               Dieter van Melkebeek and
               Nicole Schweikardt and
               Luc Segoufin},
  title     = {Locality from Circuit Lower Bounds},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1481--1523},
  year      = {2012},
  url       = {https://doi.org/10.1137/110856873},
  doi       = {10.1137/110856873},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndersonMSS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndoniO12,
  author    = {Alexandr Andoni and
               Krzysztof Onak},
  title     = {Approximating Edit Distance in Near-Linear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1635--1648},
  year      = {2012},
  url       = {https://doi.org/10.1137/090767182},
  doi       = {10.1137/090767182},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndoniO12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AroraLNRRV12,
  author    = {Sanjeev Arora and
               L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
               Ilan Newman and
               Yuval Rabani and
               Yuri Rabinovich and
               Santosh S. Vempala},
  title     = {Local Versus Global Properties of Metric Spaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {250--271},
  year      = {2012},
  url       = {https://doi.org/10.1137/090780304},
  doi       = {10.1137/090780304},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AroraLNRRV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalBN12,
  author    = {Nikhil Bansal and
               Niv Buchbinder and
               Joseph Naor},
  title     = {Randomized Competitive Algorithms for Generalized Caching},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {391--414},
  year      = {2012},
  url       = {https://doi.org/10.1137/090779000},
  doi       = {10.1137/090779000},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalBN12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BatsonSS12,
  author    = {Joshua D. Batson and
               Daniel A. Spielman and
               Nikhil Srivastava},
  title     = {Twice-Ramanujan Sparsifiers},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1704--1721},
  year      = {2012},
  url       = {https://doi.org/10.1137/090772873},
  doi       = {10.1137/090772873},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BatsonSS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameH12,
  author    = {Paul Beame and
               Trinh Huynh},
  title     = {Multiparty Communication Complexity and Threshold Circuit Size of
               sfAC\({}^{\mbox{0}}\)},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {484--518},
  year      = {2012},
  url       = {https://doi.org/10.1137/100792779},
  doi       = {10.1137/100792779},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeameH12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonK12,
  author    = {Eli Ben{-}Sasson and
               Swastik Kopparty},
  title     = {Affine Dispersers from Subspace Polynomials},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {880--914},
  year      = {2012},
  url       = {https://doi.org/10.1137/110826254},
  doi       = {10.1137/110826254},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-SassonK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharyyaGJRW12,
  author    = {Arnab Bhattacharyya and
               Elena Grigorescu and
               Kyomin Jung and
               Sofya Raskhodnikova and
               David P. Woodruff},
  title     = {Transitive-Closure Spanners},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1380--1425},
  year      = {2012},
  url       = {https://doi.org/10.1137/110826655},
  doi       = {10.1137/110826655},
  timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BhattacharyyaGJRW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BourgainGKS12,
  author    = {Jean Bourgain and
               Moubariz Z. Garaev and
               Sergei Konyagin and
               Igor E. Shparlinski},
  title     = {On the Hidden Shifted Power Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1524--1557},
  year      = {2012},
  url       = {https://doi.org/10.1137/110850414},
  doi       = {10.1137/110850414},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BourgainGKS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Censor-HillelS12,
  author    = {Keren Censor{-}Hillel and
               Hadas Shachnai},
  title     = {Fast Information Spreading in Graphs with Large Weak Conductance},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1451--1465},
  year      = {2012},
  url       = {https://doi.org/10.1137/110845380},
  doi       = {10.1137/110845380},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Censor-HillelS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartiR12,
  author    = {Amit Chakrabarti and
               Oded Regev},
  title     = {An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1299--1317},
  year      = {2012},
  url       = {https://doi.org/10.1137/120861072},
  doi       = {10.1137/120861072},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartiR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChambersEN12,
  author    = {Erin W. Chambers and
               Jeff Erickson and
               Amir Nayyeri},
  title     = {Homology Flows, Cohomology Cuts},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1605--1634},
  year      = {2012},
  url       = {https://doi.org/10.1137/090766863},
  doi       = {10.1137/090766863},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChambersEN12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanG12,
  author    = {T.{-}H. Hubert Chan and
               Anupam Gupta},
  title     = {Approximating {TSP} on Metrics with Bounded Global Growth},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {587--617},
  year      = {2012},
  url       = {https://doi.org/10.1137/090749396},
  doi       = {10.1137/090749396},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanG12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandranGR12,
  author    = {Harish Chandran and
               Nikhil Gopalkrishnan and
               John H. Reif},
  title     = {Tile Complexity of Linear Assemblies},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {1051--1073},
  year      = {2012},
  url       = {https://doi.org/10.1137/110822487},
  doi       = {10.1137/110822487},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChandranGR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenP12,
  author    = {Jen{-}Yeu Chen and
               Gopal Pandurangan},
  title     = {Almost-Optimal Gossip-Based Aggregate Computation},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {455--483},
  year      = {2012},
  url       = {https://doi.org/10.1137/100793104},
  doi       = {10.1137/100793104},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenP12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chepoi12,
  author    = {Victor Chepoi},
  title     = {Nice Labeling Problem for Event Structures: {A} Counterexample},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {715--727},
  year      = {2012},
  url       = {https://doi.org/10.1137/110837760},
  doi       = {10.1137/110837760},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chepoi12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChildsK12,
  author    = {Andrew M. Childs and
               Robin Kothari},
  title     = {Quantum Query Complexity of Minor-Closed Graph Properties},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1426--1450},
  year      = {2012},
  url       = {https://doi.org/10.1137/110833026},
  doi       = {10.1137/110833026},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChildsK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CieliebakFPS12,
  author    = {Mark Cieliebak and
               Paola Flocchini and
               Giuseppe Prencipe and
               Nicola Santoro},
  title     = {Distributed Computing by Mobile Robots: Gathering},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {829--879},
  year      = {2012},
  url       = {https://doi.org/10.1137/100796534},
  doi       = {10.1137/100796534},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CieliebakFPS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenFFKO12,
  author    = {Edith Cohen and
               Michal Feldman and
               Amos Fiat and
               Haim Kaplan and
               Svetlana Olonetsky},
  title     = {Envy-Free Makespan Approximation},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {12--25},
  year      = {2012},
  url       = {https://doi.org/10.1137/100801597},
  doi       = {10.1137/100801597},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenFFKO12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CyganPPW12,
  author    = {Marek Cygan and
               Marcin Pilipczuk and
               Michal Pilipczuk and
               Jakub Onufry Wojtaszczyk},
  title     = {A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn
               List Partition Problem (The Stubborn Problem Is Stubborn No More)},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {815--828},
  year      = {2012},
  url       = {https://doi.org/10.1137/110826813},
  doi       = {10.1137/110826813},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CyganPPW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DePVR12,
  author    = {Anindya De and
               Christopher Portmann and
               Thomas Vidick and
               Renato Renner},
  title     = {Trevisan's Extractor in the Presence of Quantum Side Information},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {915--940},
  year      = {2012},
  url       = {https://doi.org/10.1137/100813683},
  doi       = {10.1137/100813683},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DePVR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Devroye12,
  author    = {Luc Devroye},
  title     = {Simulating Size-constrained Galton-Watson Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {1--11},
  year      = {2012},
  url       = {https://doi.org/10.1137/090766632},
  doi       = {10.1137/090766632},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Devroye12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevHM12,
  author    = {Danny Dolev and
               Ezra N. Hoch and
               Yoram Moses},
  title     = {An Optimal Self-Stabilizing Firing Squad},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {415--435},
  year      = {2012},
  url       = {https://doi.org/10.1137/090776512},
  doi       = {10.1137/090776512},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DolevHM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Efremenko12,
  author    = {Klim Efremenko},
  title     = {3-Query Locally Decodable Codes of Subexponential Length},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1694--1703},
  year      = {2012},
  url       = {https://doi.org/10.1137/090772721},
  doi       = {10.1137/090772721},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Efremenko12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EllenHS12,
  author    = {Faith Ellen and
               Danny Hendler and
               Nir Shavit},
  title     = {On the Inherent Sequentiality of Concurrent Objects},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {519--536},
  year      = {2012},
  url       = {https://doi.org/10.1137/08072646X},
  doi       = {10.1137/08072646X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EllenHS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EmekHMPRR12,
  author    = {Yuval Emek and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Yishay Mansour and
               Boaz Patt{-}Shamir and
               Jaikumar Radhakrishnan and
               Dror Rawitz},
  title     = {Online Set Packing},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {728--746},
  year      = {2012},
  url       = {https://doi.org/10.1137/110820774},
  doi       = {10.1137/110820774},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EmekHMPRR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EnglertW12,
  author    = {Matthias Englert and
               Matthias Westermann},
  title     = {Considering Suppressed Packets Improves Buffer Management in Quality
               of Service Switches},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1166--1192},
  year      = {2012},
  url       = {https://doi.org/10.1137/110856745},
  doi       = {10.1137/110856745},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EnglertW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinMSV12,
  author    = {David Eppstein and
               Elena Mumford and
               Bettina Speckmann and
               Kevin Verbeek},
  title     = {Area-Universal and Constrained Rectangular Layouts},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {537--564},
  year      = {2012},
  url       = {https://doi.org/10.1137/110834032},
  doi       = {10.1137/110834032},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EppsteinMSV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EpsteinLMMMSS12,
  author    = {Leah Epstein and
               Asaf Levin and
               Alberto Marchetti{-}Spaccamela and
               Nicole Megow and
               Juli{\'{a}}n Mestre and
               Martin Skutella and
               Leen Stougie},
  title     = {Universal Sequencing on an Unreliable Machine},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {565--586},
  year      = {2012},
  url       = {https://doi.org/10.1137/110844210},
  doi       = {10.1137/110844210},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EpsteinLMMMSS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiMPWV12,
  author    = {Kousha Etessami and
               Dieter van Melkebeek and
               Seth Pettie and
               John Watrous and
               Salil P. Vadhan},
  title     = {Special Section on the Forty-Third Annual {ACM} Symposium on Theory
               of Computing {(STOC} 2011)},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1233--1234},
  year      = {2012},
  url       = {https://doi.org/10.1137/12097324X},
  doi       = {10.1137/12097324X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EtessamiMPWV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FakcharoenpholL12,
  author    = {Jittat Fakcharoenphol and
               Bundit Laekhanukit},
  title     = {An O(log\({}^{\mbox{2k)}}\)-Approximation Algorithm for the k-Vertex
               Connected Spanning Subgraph Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1095--1109},
  year      = {2012},
  url       = {https://doi.org/10.1137/110855910},
  doi       = {10.1137/110855910},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FakcharoenpholL12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanGRW12,
  author    = {Vitaly Feldman and
               Venkatesan Guruswami and
               Prasad Raghavendra and
               Yi Wu},
  title     = {Agnostic Learning of Monomials by Halfspaces Is Hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1558--1590},
  year      = {2012},
  url       = {https://doi.org/10.1137/120865094},
  doi       = {10.1137/120865094},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanGRW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriedrichGS12,
  author    = {Tobias Friedrich and
               Martin Gairing and
               Thomas Sauerwald},
  title     = {Quasirandom Load Balancing},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {747--771},
  year      = {2012},
  url       = {https://doi.org/10.1137/100799216},
  doi       = {10.1137/100799216},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriedrichGS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowG12,
  author    = {Harold N. Gabow and
               Suzanne Gallagher},
  title     = {Iterated Rounding Algorithms for the Smallest \emph{k}-Edge Connected
               Spanning Subgraph},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {61--103},
  year      = {2012},
  url       = {https://doi.org/10.1137/080732572},
  doi       = {10.1137/080732572},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GabowG12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeladeGM12,
  author    = {Wouter Gelade and
               Marc Gyssens and
               Wim Martens},
  title     = {Regular Expressions with Counting: Weak versus Strong Determinism},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {160--190},
  year      = {2012},
  url       = {https://doi.org/10.1137/100814196},
  doi       = {10.1137/100814196},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GeladeGM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GharibianK12,
  author    = {Sevag Gharibian and
               Julia Kempe},
  title     = {Approximation Algorithms for QMA-Complete Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {1028--1050},
  year      = {2012},
  url       = {https://doi.org/10.1137/110842272},
  doi       = {10.1137/110842272},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GharibianK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GhoshRS12,
  author    = {Arpita Ghosh and
               Tim Roughgarden and
               Mukund Sundararajan},
  title     = {Universally Utility-maximizing Privacy Mechanisms},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1673--1693},
  year      = {2012},
  url       = {https://doi.org/10.1137/09076828X},
  doi       = {10.1137/09076828X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GhoshRS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GibsonKKPV12,
  author    = {Matt Gibson and
               Gaurav Kanade and
               Erik Krohn and
               Imran A. Pirwani and
               Kasturi R. Varadarajan},
  title     = {On Clustering to Minimize the Sum of Radii},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {47--60},
  year      = {2012},
  url       = {https://doi.org/10.1137/100798144},
  doi       = {10.1137/100798144},
  timestamp = {Thu, 01 Mar 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GibsonKKPV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GilbertLPS12,
  author    = {Anna C. Gilbert and
               Yi Li and
               Ely Porat and
               Martin J. Strauss},
  title     = {Approximate Sparse Recovery: Optimizing Time and Measurements},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {436--453},
  year      = {2012},
  url       = {https://doi.org/10.1137/100816705},
  doi       = {10.1137/100816705},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GilbertLPS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldsteinK12,
  author    = {Darin Goldstein and
               Kojiro Kobayashi},
  title     = {On Minimal-Time Solutions of Firing Squad Synchronization Problems
               for Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {618--669},
  year      = {2012},
  url       = {https://doi.org/10.1137/110821019},
  doi       = {10.1137/110821019},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldsteinK12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinMY12,
  author    = {Mordecai J. Golin and
               Claire Mathieu and
               Neal E. Young},
  title     = {Huffman Coding with Letter Costs: {A} Linear-Time Approximation Scheme},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {684--713},
  year      = {2012},
  url       = {https://doi.org/10.1137/100794092},
  doi       = {10.1137/100794092},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GolinMY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrothS12,
  author    = {Jens Groth and
               Amit Sahai},
  title     = {Efficient Noninteractive Proof Systems for Bilinear Groups},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1193--1232},
  year      = {2012},
  url       = {https://doi.org/10.1137/080725386},
  doi       = {10.1137/080725386},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrothS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuerraouiHKT12,
  author    = {Rachid Guerraoui and
               Vassos Hadzilacos and
               Petr Kuznetsov and
               Sam Toueg},
  title     = {The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking
               Atomic Commit},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1343--1379},
  year      = {2012},
  url       = {https://doi.org/10.1137/070698877},
  doi       = {10.1137/070698877},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuerraouiHKT12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaKR12,
  author    = {Anupam Gupta and
               Ravishankar Krishnaswamy and
               R. Ravi},
  title     = {Online and Stochastic Survivable Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1649--1672},
  year      = {2012},
  url       = {https://doi.org/10.1137/09076725X},
  doi       = {10.1137/09076725X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuptaKR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImmorlicaKMSU12,
  author    = {Nicole Immorlica and
               Jonathan Katz and
               Michael Mitzenmacher and
               Rocco A. Servedio and
               Chris Umans},
  title     = {Special Section on the Forty-First Annual {ACM} Symposium on Theory
               of Computing {(STOC} 2009)},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1591--1592},
  year      = {2012},
  url       = {https://doi.org/10.1137/120973305},
  doi       = {10.1137/120973305},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImmorlicaKMSU12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoKW12,
  author    = {Russell Impagliazzo and
               Valentine Kabanets and
               Avi Wigderson},
  title     = {New Direct-Product Testers and 2-Query PCPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1722--1768},
  year      = {2012},
  url       = {https://doi.org/10.1137/09077299X},
  doi       = {10.1137/09077299X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoKW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IshaqueST12,
  author    = {Mashhood Ishaque and
               Bettina Speckmann and
               Csaba D. T{\'{o}}th},
  title     = {Shooting Permanent Rays among Disjoint Polygons in the Plane},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {1005--1027},
  year      = {2012},
  url       = {https://doi.org/10.1137/100804310},
  doi       = {10.1137/100804310},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IshaqueST12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IzumiSKIDWY12,
  author    = {Taisuke Izumi and
               Samia Souissi and
               Yoshiaki Katayama and
               Nobuhiro Inuzuka and
               Xavier D{\'{e}}fago and
               Koichi Wada and
               Masafumi Yamashita},
  title     = {The Gathering Problem for Two Oblivious Robots with Unreliable Compasses},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {26--46},
  year      = {2012},
  url       = {https://doi.org/10.1137/100797916},
  doi       = {10.1137/100797916},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IzumiSKIDWY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JanssonLL12,
  author    = {Jesper Jansson and
               Richard S. Lemence and
               Andrzej Lingas},
  title     = {The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {272--291},
  year      = {2012},
  url       = {https://doi.org/10.1137/100811489},
  doi       = {10.1137/100811489},
  timestamp = {Mon, 14 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JanssonLL12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarninRS12,
  author    = {Zohar Shay Karnin and
               Yuval Rabani and
               Amir Shpilka},
  title     = {Explicit Dimension Reduction and Its Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {219--249},
  year      = {2012},
  url       = {https://doi.org/10.1137/110828812},
  doi       = {10.1137/110828812},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KarninRS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirschmerV12,
  author    = {Markus Kirschmer and
               John Voight},
  title     = {Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion
               Orders},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {714},
  year      = {2012},
  url       = {https://doi.org/10.1137/120866063},
  doi       = {10.1137/120866063},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KirschmerV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LofflerM12,
  author    = {Maarten L{\"{o}}ffler and
               Wolfgang Mulzer},
  title     = {Triangulating the Square and Squaring the Triangle: Quadtrees and
               Delaunay Triangulations are Equivalent},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {941--974},
  year      = {2012},
  url       = {https://doi.org/10.1137/110825698},
  doi       = {10.1137/110825698},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LofflerM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MoitraO12,
  author    = {Ankur Moitra and
               Ryan O'Donnell},
  title     = {Pareto Optimal Solutions for Smoothed Analysts},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1266--1284},
  year      = {2012},
  url       = {https://doi.org/10.1137/110851833},
  doi       = {10.1137/110851833},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MoitraO12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MooreR12,
  author    = {Cristopher Moore and
               Alexander Russell},
  title     = {Approximating the Permanent via Nonabelian Determinants},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {332--355},
  year      = {2012},
  url       = {https://doi.org/10.1137/100806709},
  doi       = {10.1137/100806709},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MooreR12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorS12,
  author    = {Moni Naor and
               Gil Segev},
  title     = {Public-Key Cryptosystems Resilient to Key Leakage},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {772--814},
  year      = {2012},
  url       = {https://doi.org/10.1137/100813464},
  doi       = {10.1137/100813464},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NaorS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PitassiS12,
  author    = {Toniann Pitassi and
               Nathan Segerlind},
  title     = {Exponential Lower Bounds and Integrality Gaps for Tree-Like Lov{\'{a}}sz-Schrijver
               Procedures},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {128--159},
  year      = {2012},
  url       = {https://doi.org/10.1137/100816833},
  doi       = {10.1137/100816833},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PitassiS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RodittyZ12,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {670--683},
  year      = {2012},
  url       = {https://doi.org/10.1137/090776573},
  doi       = {10.1137/090776573},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RubinKS12,
  author    = {Natan Rubin and
               Haim Kaplan and
               Micha Sharir},
  title     = {Improved Bounds for Geometric Permutations},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {367--390},
  year      = {2012},
  url       = {https://doi.org/10.1137/110835918},
  doi       = {10.1137/110835918},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RubinKS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SarmaHKKNPPW12,
  author    = {Atish Das Sarma and
               Stephan Holzer and
               Liah Kor and
               Amos Korman and
               Danupon Nanongkai and
               Gopal Pandurangan and
               David Peleg and
               Roger Wattenhofer},
  title     = {Distributed Verification and Hardness of Distributed Approximation},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1235--1265},
  year      = {2012},
  url       = {https://doi.org/10.1137/11085178X},
  doi       = {10.1137/11085178X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SarmaHKKNPPW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaxenaS12,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits:
               The Field Doesn't Matter},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1285--1298},
  year      = {2012},
  url       = {https://doi.org/10.1137/10848232},
  doi       = {10.1137/10848232},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SaxenaS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov12,
  author    = {Alexander A. Sherstov},
  title     = {Strong Direct Product Theorems for Quantum Communication and Query
               Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1122--1165},
  year      = {2012},
  url       = {https://doi.org/10.1137/110842661},
  doi       = {10.1137/110842661},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sherstov12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SnirY12,
  author    = {Sagi Snir and
               Raphael Yuster},
  title     = {Reconstructing Approximate Phylogenetic Trees from Quartet Samples},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1466--1480},
  year      = {2012},
  url       = {https://doi.org/10.1137/11086964X},
  doi       = {10.1137/11086964X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SnirY12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StefankovicVV12,
  author    = {Daniel Stefankovic and
               Santosh S. Vempala and
               Eric Vigoda},
  title     = {A Deterministic Polynomial-Time Approximation Scheme for Counting
               Knapsack Solutions},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {356--366},
  year      = {2012},
  url       = {https://doi.org/10.1137/11083976X},
  doi       = {10.1137/11083976X},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/StefankovicVV12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Svensson12,
  author    = {Ola Svensson},
  title     = {Santa Claus Schedules Jobs on Unrelated Machines},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1318--1341},
  year      = {2012},
  url       = {https://doi.org/10.1137/110851201},
  doi       = {10.1137/110851201},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Svensson12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SwamyS12,
  author    = {Chaitanya Swamy and
               David B. Shmoys},
  title     = {Sampling-Based Approximation Algorithms for Multistage Stochastic
               Optimization},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {975--1004},
  year      = {2012},
  url       = {https://doi.org/10.1137/100789269},
  doi       = {10.1137/100789269},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SwamyS12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ThorupZ12,
  author    = {Mikkel Thorup and
               Yin Zhang},
  title     = {Tabulation-Based 5-Independent Hashing with Applications to Linear
               Probing and Second Moment Estimation},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {2},
  pages     = {293--331},
  year      = {2012},
  url       = {https://doi.org/10.1137/100800774},
  doi       = {10.1137/100800774},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ThorupZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Trevisan12,
  author    = {Luca Trevisan},
  title     = {Max Cut and the Smallest Eigenvalue},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1769--1786},
  year      = {2012},
  url       = {https://doi.org/10.1137/090773714},
  doi       = {10.1137/090773714},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Trevisan12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Viola12,
  author    = {Emanuele Viola},
  title     = {The Complexity of Distributions},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {1},
  pages     = {191--218},
  year      = {2012},
  url       = {https://doi.org/10.1137/100814998},
  doi       = {10.1137/100814998},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Viola12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Viola12a,
  author    = {Emanuele Viola},
  title     = {Bit-Probe Lower Bounds for Succinct Data Structures},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {6},
  pages     = {1593--1604},
  year      = {2012},
  url       = {https://doi.org/10.1137/090766619},
  doi       = {10.1137/090766619},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Viola12a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YoshidaYI12,
  author    = {Yuichi Yoshida and
               Masaki Yamamoto and
               Hiro Ito},
  title     = {Improved Constant-Time Approximation Algorithms for Maximum Matchings
               and Other Optimization Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {4},
  pages     = {1074--1093},
  year      = {2012},
  url       = {https://doi.org/10.1137/110828691},
  doi       = {10.1137/110828691},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/YoshidaYI12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AaronsonEMRV11,
  author    = {Scott Aaronson and
               Jeff Erickson and
               Mohammad Mahdian and
               R. Ravi and
               Emanuele Viola},
  title     = {Special Section on Foundations of Computer Science},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {770},
  year      = {2011},
  url       = {http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i3/p770\_s1},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AaronsonEMRV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AckermannGMRV11,
  author    = {Heiner Ackermann and
               Paul W. Goldberg and
               Vahab S. Mirrokni and
               Heiko R{\"{o}}glin and
               Berthold V{\"{o}}cking},
  title     = {Uncoordinated Two-Sided Matching Markets},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {92--106},
  year      = {2011},
  url       = {https://doi.org/10.1137/090753498},
  doi       = {10.1137/090753498},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AckermannGMRV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AilonC11,
  author    = {Nir Ailon and
               Moses Charikar},
  title     = {Fitting Tree Metrics: Hierarchical Clustering and Phylogeny},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1275--1291},
  year      = {2011},
  url       = {https://doi.org/10.1137/100806886},
  doi       = {10.1137/100806886},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AilonC11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AilonCCLMS11,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Kenneth L. Clarkson and
               Ding Liu and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-Improving Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {350--375},
  year      = {2011},
  url       = {https://doi.org/10.1137/090766437},
  doi       = {10.1137/090766437},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AilonCCLMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlandDGMS11,
  author    = {Sebastian Aland and
               Dominic Dumrauf and
               Martin Gairing and
               Burkhard Monien and
               Florian Schoppmann},
  title     = {Exact Price of Anarchy for Polynomial Congestion Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1211--1233},
  year      = {2011},
  url       = {https://doi.org/10.1137/090748986},
  doi       = {10.1137/090748986},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlandDGMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmbuhlMS11,
  author    = {Christoph Amb{\"{u}}hl and
               Monaldo Mastrolilli and
               Ola Svensson},
  title     = {Inapproximability Results for Maximum Edge Biclique, Minimum Linear
               Arrangement, and Sparsest Cut},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {567--596},
  year      = {2011},
  url       = {https://doi.org/10.1137/080729256},
  doi       = {10.1137/080729256},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AmbuhlMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnshelevichK11,
  author    = {Elliot Anshelevich and
               Adriana Karagiozova},
  title     = {Terminal Backup, 3D Matching, and Covering Cubic Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {678--708},
  year      = {2011},
  url       = {https://doi.org/10.1137/090752699},
  doi       = {10.1137/090752699},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AnshelevichK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArcherBHK11,
  author    = {Aaron Archer and
               MohammadHossein Bateni and
               MohammadTaghi Hajiaghayi and
               Howard J. Karloff},
  title     = {Improved Approximation Algorithms for Prize-Collecting Steiner Tree
               and {TSP}},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {309--332},
  year      = {2011},
  url       = {https://doi.org/10.1137/090771429},
  doi       = {10.1137/090771429},
  timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArcherBHK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AustrinH11,
  author    = {Per Austrin and
               Johan H{\aa}stad},
  title     = {Randomly Supported Independence and Resistance},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {1--27},
  year      = {2011},
  url       = {https://doi.org/10.1137/100783534},
  doi       = {10.1137/100783534},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AustrinH11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-AroyaT11,
  author    = {Avraham Ben{-}Aroya and
               Amnon Ta{-}Shma},
  title     = {A Combinatorial Construction of Almost-Ramanujan Graphs Using the
               Zig-Zag Product},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {267--290},
  year      = {2011},
  url       = {https://doi.org/10.1137/080732651},
  doi       = {10.1137/080732651},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-AroyaT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodirskyFKV11,
  author    = {Manuel Bodirsky and
               {\'{E}}ric Fusy and
               Mihyun Kang and
               Stefan Vigerske},
  title     = {Boltzmann Samplers, P{\'{o}}lya Theory, and Cycle Pointing},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {721--769},
  year      = {2011},
  url       = {https://doi.org/10.1137/100790082},
  doi       = {10.1137/100790082},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BodirskyFKV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BriestK11,
  author    = {Patrick Briest and
               Piotr Krysta},
  title     = {Buying Cheap Is Expensive: Approximability of Combinatorial Pricing
               Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1554--1586},
  year      = {2011},
  url       = {https://doi.org/10.1137/090752353},
  doi       = {10.1137/090752353},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BriestK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BriestKV11,
  author    = {Patrick Briest and
               Piotr Krysta and
               Berthold V{\"{o}}cking},
  title     = {Approximation Techniques for Utilitarian Mechanism Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1587--1622},
  year      = {2011},
  url       = {https://doi.org/10.1137/090772988},
  doi       = {10.1137/090772988},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BriestKV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BurgisserLMW11,
  author    = {Peter B{\"{u}}rgisser and
               J. M. Landsberg and
               Laurent Manivel and
               Jerzy Weyman},
  title     = {An Overview of Mathematical Issues Arising in the Geometric Complexity
               Theory Approach to VP{\(\not =\)}VNP},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1179--1209},
  year      = {2011},
  url       = {https://doi.org/10.1137/090765328},
  doi       = {10.1137/090765328},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BurgisserLMW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CachinKS11,
  author    = {Christian Cachin and
               Idit Keidar and
               Alexander Shraer},
  title     = {Fail-Aware Untrusted Storage},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {493--533},
  year      = {2011},
  url       = {https://doi.org/10.1137/090751062},
  doi       = {10.1137/090751062},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CachinKS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiLX11,
  author    = {Jin{-}yi Cai and
               Pinyan Lu and
               Mingji Xia},
  title     = {Computational Complexity of Holant Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1101--1132},
  year      = {2011},
  url       = {https://doi.org/10.1137/100814585},
  doi       = {10.1137/100814585},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CaiLX11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuCPV11,
  author    = {Gruia C{\u{a}}linescu and
               Chandra Chekuri and
               Martin P{\'{a}}l and
               Jan Vondr{\'{a}}k},
  title     = {Maximizing a Monotone Submodular Function Subject to a Matroid Constraint},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1740--1766},
  year      = {2011},
  url       = {https://doi.org/10.1137/080733991},
  doi       = {10.1137/080733991},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CalinescuCPV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanFLY11,
  author    = {Yuk Hei Chan and
               Wai Shing Fung and
               Lap Chi Lau and
               Chun Kong Yung},
  title     = {Degree Bounded Network Design with Metric Costs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {953--980},
  year      = {2011},
  url       = {https://doi.org/10.1137/090746495},
  doi       = {10.1137/090746495},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanFLY11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanPR11,
  author    = {Timothy M. Chan and
               Mihai Patrascu and
               Liam Roditty},
  title     = {Dynamic Connectivity: Connecting to Networks and Geometry},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {333--349},
  year      = {2011},
  url       = {https://doi.org/10.1137/090751670},
  doi       = {10.1137/090751670},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanPR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChawlaDG11,
  author    = {Shuchi Chawla and
               Cynthia Dwork and
               Venkatesan Guruswami},
  title     = {Special Section on the Fortieth Annual {ACM} Symposium On Theory Of
               Computing {(STOC} 2008)},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1738},
  year      = {2011},
  url       = {http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i6/p1738\_s1},
  timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChawlaDG11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenGV11,
  author    = {Ning Chen and
               Arpita Ghosh and
               Sergei Vassilvitskii},
  title     = {Optimal Envy-Free Pricing with Metric Substitutability},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {623--645},
  year      = {2011},
  url       = {https://doi.org/10.1137/080740970},
  doi       = {10.1137/080740970},
  timestamp = {Fri, 24 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenGV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenDKLT11,
  author    = {Edith Cohen and
               Nick G. Duffield and
               Haim Kaplan and
               Carsten Lund and
               Mikkel Thorup},
  title     = {Efficient Stream Sampling for Variance-Optimal Estimation of Subset
               Sums},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1402--1431},
  year      = {2011},
  url       = {https://doi.org/10.1137/10079817X},
  doi       = {10.1137/10079817X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenDKLT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisKMRV11,
  author    = {Constantinos Daskalakis and
               Richard M. Karp and
               Elchanan Mossel and
               Samantha Riesenfeld and
               Elad Verbin},
  title     = {Sorting and Selection in Posets},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {597--622},
  year      = {2011},
  url       = {https://doi.org/10.1137/070697720},
  doi       = {10.1137/070697720},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DaskalakisKMRV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DeyHK11,
  author    = {Tamal K. Dey and
               Anil N. Hirani and
               Bala Krishnamoorthy},
  title     = {Optimal Homologous Cycles, Total Unimodularity, and Linear Programming},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1026--1044},
  year      = {2011},
  url       = {https://doi.org/10.1137/100800245},
  doi       = {10.1137/100800245},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DeyHK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DhangwatnotaiDDR11,
  author    = {Peerapong Dhangwatnotai and
               Shahar Dobzinski and
               Shaddin Dughmi and
               Tim Roughgarden},
  title     = {Truthful Approximation Schemes for Single-Parameter Agents},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {915--933},
  year      = {2011},
  url       = {https://doi.org/10.1137/080744992},
  doi       = {10.1137/080744992},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DhangwatnotaiDDR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirGY11,
  author    = {Zeev Dvir and
               Parikshit Gopalan and
               Sergey Yekhanin},
  title     = {Matching Vector Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1154--1178},
  year      = {2011},
  url       = {https://doi.org/10.1137/100804322},
  doi       = {10.1137/100804322},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DvirGY11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirW11,
  author    = {Zeev Dvir and
               Avi Wigderson},
  title     = {Kakeya Sets, New Mergers, and Old Extractors},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {778--792},
  year      = {2011},
  url       = {https://doi.org/10.1137/090748731},
  doi       = {10.1137/090748731},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DvirW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeMV11,
  author    = {Uriel Feige and
               Vahab S. Mirrokni and
               Jan Vondr{\'{a}}k},
  title     = {Maximizing Non-monotone Submodular Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1133--1153},
  year      = {2011},
  url       = {https://doi.org/10.1137/090779346},
  doi       = {10.1137/090779346},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeigeMV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FernsPP11,
  author    = {Norm Ferns and
               Prakash Panangaden and
               Doina Precup},
  title     = {Bisimulation Metrics for Continuous Markov Decision Processes},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1662--1714},
  year      = {2011},
  url       = {https://doi.org/10.1137/10080484X},
  doi       = {10.1137/10080484X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FernsPP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerH11,
  author    = {Johannes Fischer and
               Volker Heun},
  title     = {Space-Efficient Preprocessing Schemes for Range Minimum Queries on
               Static Arrays},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {465--492},
  year      = {2011},
  url       = {https://doi.org/10.1137/090779759},
  doi       = {10.1137/090779759},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerH11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriedgutKKN11,
  author    = {Ehud Friedgut and
               Gil Kalai and
               Nathan Keller and
               Noam Nisan},
  title     = {A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three
               Alternatives},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {934--952},
  year      = {2011},
  url       = {https://doi.org/10.1137/090756740},
  doi       = {10.1137/090756740},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriedgutKKN11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeMM11,
  author    = {Alan M. Frieze and
               P{\'{a}}ll Melsted and
               Michael Mitzenmacher},
  title     = {An Analysis of Random-Walk Cuckoo Hashing},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {291--308},
  year      = {2011},
  url       = {https://doi.org/10.1137/090770928},
  doi       = {10.1137/090770928},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriezeMM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GafniGP11,
  author    = {Eli Gafni and
               Rachid Guerraoui and
               Bastian Pochon},
  title     = {The Complexity of Early Deciding Set Agreement},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {63--78},
  year      = {2011},
  url       = {https://doi.org/10.1137/050640746},
  doi       = {10.1137/050640746},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GafniGP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GimenezGM11,
  author    = {Omer Gim{\'{e}}nez and
               Guillem Godoy and
               Sebastian Maneth},
  title     = {Deciding Regularity of the Set of Instances of a Set of Terms with
               Regular Constraints is EXPTIME-Complete},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {446--464},
  year      = {2011},
  url       = {https://doi.org/10.1137/090777669},
  doi       = {10.1137/090777669},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GimenezGM11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichR11,
  author    = {Oded Goldreich and
               Dana Ron},
  title     = {Algorithmic Aspects of Property Testing in the Dense Graphs Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {376--445},
  year      = {2011},
  url       = {https://doi.org/10.1137/090749621},
  doi       = {10.1137/090749621},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldreichR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichR11a,
  author    = {Oded Goldreich and
               Dana Ron},
  title     = {On Proximity-Oblivious Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {534--566},
  year      = {2011},
  url       = {https://doi.org/10.1137/100789646},
  doi       = {10.1137/100789646},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldreichR11a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanGR11,
  author    = {Parikshit Gopalan and
               Venkatesan Guruswami and
               Prasad Raghavendra},
  title     = {List Decoding Tensor Products and Interleaved Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1432--1462},
  year      = {2011},
  url       = {https://doi.org/10.1137/090778274},
  doi       = {10.1137/090778274},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GopalanGR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanOSSW11,
  author    = {Parikshit Gopalan and
               Ryan O'Donnell and
               Rocco A. Servedio and
               Amir Shpilka and
               Karl Wimmer},
  title     = {Testing Fourier Dimensionality and Sparsity},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1075--1100},
  year      = {2011},
  url       = {https://doi.org/10.1137/100785429},
  doi       = {10.1137/100785429},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GopalanOSSW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaPRS11,
  author    = {Anupam Gupta and
               Martin P{\'{a}}l and
               R. Ravi and
               Amitabh Sinha},
  title     = {Sampling and Cost-Sharing: Approximation Algorithms for Stochastic
               Optimization Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1361--1401},
  year      = {2011},
  url       = {https://doi.org/10.1137/080732250},
  doi       = {10.1137/080732250},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuptaPRS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiHMRC11,
  author    = {Venkatesan Guruswami and
               Johan H{\aa}stad and
               Rajsekar Manokaran and
               Prasad Raghavendra and
               Moses Charikar},
  title     = {Beating the Random Ordering Is Hard: Every Ordering {CSP} Is Approximation
               Resistant},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {878--914},
  year      = {2011},
  url       = {https://doi.org/10.1137/090756144},
  doi       = {10.1137/090756144},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuruswamiHMRC11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaeuplerST11,
  author    = {Bernhard Haeupler and
               Siddhartha Sen and
               Robert Endre Tarjan},
  title     = {Rank-Pairing Heaps},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1463--1485},
  year      = {2011},
  url       = {https://doi.org/10.1137/100785351},
  doi       = {10.1137/100785351},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaeuplerST11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerHR11,
  author    = {Iftach Haitner and
               Danny Harnik and
               Omer Reingold},
  title     = {On the Power of the Randomized Iterate},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1486--1528},
  year      = {2011},
  url       = {https://doi.org/10.1137/080721820},
  doi       = {10.1137/080721820},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerHR11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerIKLP11,
  author    = {Iftach Haitner and
               Yuval Ishai and
               Eyal Kushilevitz and
               Yehuda Lindell and
               Erez Petrank},
  title     = {Black-Box Constructions of Protocols for Secure Computation},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {225--266},
  year      = {2011},
  url       = {https://doi.org/10.1137/100790537},
  doi       = {10.1137/100790537},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerIKLP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HazanK11,
  author    = {Elad Hazan and
               Robert Krauthgamer},
  title     = {How Hard Is It to Approximate the Best Nash Equilibrium?},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {79--91},
  year      = {2011},
  url       = {https://doi.org/10.1137/090766991},
  doi       = {10.1137/090766991},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HazanK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IshaiKKLP11,
  author    = {Yuval Ishai and
               Jonathan Katz and
               Eyal Kushilevitz and
               Yehuda Lindell and
               Erez Petrank},
  title     = {On Achieving the "Best of Both Worlds" in Secure Multiparty Computation},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {122--141},
  year      = {2011},
  url       = {https://doi.org/10.1137/100783224},
  doi       = {10.1137/100783224},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IshaiKKLP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JiangMP11,
  author    = {Tao Jiang and
               Zevi Miller and
               Dan Pritikin},
  title     = {Near Optimal Bounds for Steiner Trees in the Hypercube},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1340--1360},
  year      = {2011},
  url       = {https://doi.org/10.1137/100797473},
  doi       = {10.1137/100797473},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JiangMP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaleS11,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {An Expansion Tester for Bounded Degree Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {709--720},
  year      = {2011},
  url       = {https://doi.org/10.1137/100802980},
  doi       = {10.1137/100802980},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaleS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanKMS11,
  author    = {Haim Kaplan and
               Matthew J. Katz and
               Gila Morgenstern and
               Micha Sharir},
  title     = {Optimal Cover of Points by Disks in a Simple Polygon},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1647--1661},
  year      = {2011},
  url       = {https://doi.org/10.1137/100808459},
  doi       = {10.1137/100808459},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaplanKMS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KasiviswanathanLNRS11,
  author    = {Shiva Prasad Kasiviswanathan and
               Homin K. Lee and
               Kobbi Nissim and
               Sofya Raskhodnikova and
               Adam D. Smith},
  title     = {What Can We Learn Privately?},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {793--826},
  year      = {2011},
  url       = {https://doi.org/10.1137/090756090},
  doi       = {10.1137/090756090},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KasiviswanathanLNRS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KedlayaU11,
  author    = {Kiran S. Kedlaya and
               Christopher Umans},
  title     = {Fast Polynomial Factorization and Modular Composition},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1767--1802},
  year      = {2011},
  url       = {https://doi.org/10.1137/08073408X},
  doi       = {10.1137/08073408X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KedlayaU11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KempeKMTV11,
  author    = {Julia Kempe and
               Hirotada Kobayashi and
               Keiji Matsumoto and
               Ben Toner and
               Thomas Vidick},
  title     = {Entangled Games Are Hard to Approximate},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {848--877},
  year      = {2011},
  url       = {https://doi.org/10.1137/090751293},
  doi       = {10.1137/090751293},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KempeKMTV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KingK11,
  author    = {James King and
               Erik Krohn},
  title     = {Terrain Guarding is NP-Hard},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1316--1339},
  year      = {2011},
  url       = {https://doi.org/10.1137/100791506},
  doi       = {10.1137/100791506},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KingK11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoblerKLV11,
  author    = {Johannes K{\"{o}}bler and
               Sebastian Kuhnert and
               Bastian Laubner and
               Oleg Verbitsky},
  title     = {Interval Graphs: Canonical Representations in Logspace},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1292--1315},
  year      = {2011},
  url       = {https://doi.org/10.1137/10080395X},
  doi       = {10.1137/10080395X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KoblerKLV11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LevinSZ11,
  author    = {Hagay Levin and
               Michael Schapira and
               Aviv Zohar},
  title     = {Interdomain Routing and Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1892--1912},
  year      = {2011},
  url       = {https://doi.org/10.1137/080734017},
  doi       = {10.1137/080734017},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LevinSZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MagniezNRS11,
  author    = {Fr{\'{e}}d{\'{e}}ric Magniez and
               Ashwin Nayak and
               J{\'{e}}r{\'{e}}mie Roland and
               Miklos Santha},
  title     = {Search via Quantum Walk},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {142--164},
  year      = {2011},
  url       = {https://doi.org/10.1137/090745854},
  doi       = {10.1137/090745854},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MagniezNRS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MertziosSZ11,
  author    = {George B. Mertzios and
               Ignasi Sau and
               Shmuel Zaks},
  title     = {The Recognition of Tolerance and Bounded Tolerance Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1234--1257},
  year      = {2011},
  url       = {https://doi.org/10.1137/090780328},
  doi       = {10.1137/090780328},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MertziosSZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MironovNS11,
  author    = {Ilya Mironov and
               Moni Naor and
               Gil Segev},
  title     = {Sketching in Adversarial Environments},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1845--1870},
  year      = {2011},
  url       = {https://doi.org/10.1137/080733772},
  doi       = {10.1137/080733772},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MironovNS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NiyogiSW11,
  author    = {Partha Niyogi and
               Stephen Smale and
               Shmuel Weinberger},
  title     = {A Topological View of Unsupervised Learning from Noisy Data},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {646--663},
  year      = {2011},
  url       = {https://doi.org/10.1137/090762932},
  doi       = {10.1137/090762932},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NiyogiSW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ODonnellS11,
  author    = {Ryan O'Donnell and
               Rocco A. Servedio},
  title     = {The Chow Parameters Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {165--199},
  year      = {2011},
  url       = {https://doi.org/10.1137/090756466},
  doi       = {10.1137/090756466},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ODonnellS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PassTW11,
  author    = {Rafael Pass and
               Wei{-}Lung Dustin Tseng and
               Douglas Wikstr{\"{o}}m},
  title     = {On the Composition of Public-Coin Zero-Knowledge Protocols},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1529--1553},
  year      = {2011},
  url       = {https://doi.org/10.1137/100811465},
  doi       = {10.1137/100811465},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PassTW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Patrascu11,
  author    = {Mihai Patrascu},
  title     = {Unifying the Landscape of Cell-Probe Lower Bounds},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {827--847},
  year      = {2011},
  url       = {https://doi.org/10.1137/09075336X},
  doi       = {10.1137/09075336X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Patrascu11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PeikertW11,
  author    = {Chris Peikert and
               Brent Waters},
  title     = {Lossy Trapdoor Functions and Their Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1803--1844},
  year      = {2011},
  url       = {https://doi.org/10.1137/080733954},
  doi       = {10.1137/080733954},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PeikertW11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rao11,
  author    = {Anup Rao},
  title     = {Parallel Repetition in Projection Games and a Concentration Bound},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1871--1891},
  year      = {2011},
  url       = {https://doi.org/10.1137/080734042},
  doi       = {10.1137/080734042},
  timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Rao11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Raz11,
  author    = {Ran Raz},
  title     = {A Counterexample to Strong Parallel Repetition},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {771--777},
  year      = {2011},
  url       = {https://doi.org/10.1137/090747270},
  doi       = {10.1137/090747270},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Raz11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaxenaS11,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {An Almost Optimal Rank Bound for Depth-3 Identities},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {200--224},
  year      = {2011},
  url       = {https://doi.org/10.1137/090770679},
  doi       = {10.1137/090770679},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SaxenaS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Shalev-ShwartzSS11,
  author    = {Shai Shalev{-}Shwartz and
               Ohad Shamir and
               Karthik Sridharan},
  title     = {Learning Kernel-Based Halfspaces with the 0-1 Loss},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1623--1646},
  year      = {2011},
  url       = {https://doi.org/10.1137/100806126},
  doi       = {10.1137/100806126},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Shalev-ShwartzSS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShaoWPL11,
  author    = {Cheng Shao and
               Jennifer L. Welch and
               Evelyn Pierce and
               Hyunyoung Lee},
  title     = {Multiwriter Consistency Conditions for Shared Memory Registers},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {28--62},
  year      = {2011},
  url       = {https://doi.org/10.1137/07071158X},
  doi       = {10.1137/07071158X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ShaoWPL11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SharirS11,
  author    = {Micha Sharir and
               Hayim Shaul},
  title     = {Semialgebraic Range Reporting and Emptiness Searching with Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {1045--1074},
  year      = {2011},
  url       = {https://doi.org/10.1137/090765092},
  doi       = {10.1137/090765092},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SharirS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov11,
  author    = {Alexander A. Sherstov},
  title     = {The Pattern Matrix Method},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1969--2000},
  year      = {2011},
  url       = {https://doi.org/10.1137/080733644},
  doi       = {10.1137/080733644},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sherstov11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SpielmanS11,
  author    = {Daniel A. Spielman and
               Nikhil Srivastava},
  title     = {Graph Sparsification by Effective Resistances},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1913--1926},
  year      = {2011},
  url       = {https://doi.org/10.1137/080734029},
  doi       = {10.1137/080734029},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SpielmanS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SpielmanT11,
  author    = {Daniel A. Spielman and
               Shang{-}Hua Teng},
  title     = {Spectral Sparsification of Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {4},
  pages     = {981--1025},
  year      = {2011},
  url       = {https://doi.org/10.1137/08074489X},
  doi       = {10.1137/08074489X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SpielmanT11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Svensson11,
  author    = {Ola Svensson},
  title     = {Hardness of Precedence Constrained Scheduling on Identical Machines},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {5},
  pages     = {1258--1274},
  year      = {2011},
  url       = {https://doi.org/10.1137/100810502},
  doi       = {10.1137/100810502},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Svensson11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SvitkinaF11,
  author    = {Zoya Svitkina and
               Lisa Fleischer},
  title     = {Submodular Approximation: Sampling-based Algorithms and Lower Bounds},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1715--1737},
  year      = {2011},
  url       = {https://doi.org/10.1137/100783352},
  doi       = {10.1137/100783352},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SvitkinaF11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ta-Shma11,
  author    = {Amnon Ta{-}Shma},
  title     = {Short Seed Extractors against Quantum Storage},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {664--677},
  year      = {2011},
  url       = {https://doi.org/10.1137/09076787X},
  doi       = {10.1137/09076787X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ta-Shma11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Urquhart11,
  author    = {Alasdair Urquhart},
  title     = {A Near-Optimal Separation of Regular and General Resolution},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {107--121},
  year      = {2011},
  url       = {https://doi.org/10.1137/090772897},
  doi       = {10.1137/090772897},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Urquhart11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Valiant11,
  author    = {Paul Valiant},
  title     = {Testing Symmetric Properties of Distributions},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {6},
  pages     = {1927--1968},
  year      = {2011},
  url       = {https://doi.org/10.1137/080734066},
  doi       = {10.1137/080734066},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Valiant11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonCHKRS10,
  author    = {Noga Alon and
               Amin Coja{-}Oghlan and
               Hi{\^{e}}p H{\`{a}}n and
               Mihyun Kang and
               Vojtech R{\"{o}}dl and
               Mathias Schacht},
  title     = {Quasi-Randomness and Algorithmic Regularity for Graphs with General
               Degree Distributions},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2336--2362},
  year      = {2010},
  url       = {https://doi.org/10.1137/070709529},
  doi       = {10.1137/070709529},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonCHKRS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmbainisCRSZ10,
  author    = {Andris Ambainis and
               Andrew M. Childs and
               Ben Reichardt and
               Robert Spalek and
               Shengyu Zhang},
  title     = {Any {AND-OR} Formula of Size {N} Can Be Evaluated in Time N\({}^{\mbox{1/2+o(1)}}\)
               on a Quantum Computer},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2513--2530},
  year      = {2010},
  url       = {https://doi.org/10.1137/080712167},
  doi       = {10.1137/080712167},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AmbainisCRSZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndoniK10,
  author    = {Alexandr Andoni and
               Robert Krauthgamer},
  title     = {The Computational Hardness of Estimating Edit Distance},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2398--2429},
  year      = {2010},
  url       = {https://doi.org/10.1137/080716530},
  doi       = {10.1137/080716530},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndoniK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AradL10,
  author    = {Itai Arad and
               Zeph Landau},
  title     = {Quantum Computation and the Evaluation of Tensor Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3089--3121},
  year      = {2010},
  url       = {https://doi.org/10.1137/080739379},
  doi       = {10.1137/080739379},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AradL10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AronovES10,
  author    = {Boris Aronov and
               Esther Ezra and
               Micha Sharir},
  title     = {Small-Size {\textdollar}{\textbackslash}eps{\textdollar}-Nets for
               Axis-Parallel Rectangles and Boxes},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3248--3282},
  year      = {2010},
  url       = {https://doi.org/10.1137/090762968},
  doi       = {10.1137/090762968},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AronovES10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AronovS10,
  author    = {Boris Aronov and
               Micha Sharir},
  title     = {Approximate Halfspace Range Counting},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2704--2725},
  year      = {2010},
  url       = {https://doi.org/10.1137/080736600},
  doi       = {10.1137/080736600},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AronovS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AroraHK10,
  author    = {Sanjeev Arora and
               Elad Hazan and
               Satyen Kale},
  title     = {O(sqrt(log(n)) Approximation to {SPARSEST} {CUT} in {\~{O}}(n\({}^{\mbox{2}}\))
               Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1748--1771},
  year      = {2010},
  url       = {https://doi.org/10.1137/080731049},
  doi       = {10.1137/080731049},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AroraHK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AsadpourS10,
  author    = {Arash Asadpour and
               Amin Saberi},
  title     = {An Approximation Algorithm for Max-Min Fair Allocation of Indivisible
               Goods},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2970--2989},
  year      = {2010},
  url       = {https://doi.org/10.1137/080723491},
  doi       = {10.1137/080723491},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AsadpourS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaH10,
  author    = {Hagit Attiya and
               Keren Censor{-}Hillel},
  title     = {Lower Bounds for Randomized Consensus under a Weak Adversary},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3885--3904},
  year      = {2010},
  url       = {https://doi.org/10.1137/090751906},
  doi       = {10.1137/090751906},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AttiyaH10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Austrin10,
  author    = {Per Austrin},
  title     = {Towards Sharp Inapproximability for Any 2-CSP},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2430--2463},
  year      = {2010},
  url       = {https://doi.org/10.1137/070711670},
  doi       = {10.1137/070711670},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Austrin10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalP10,
  author    = {Nikhil Bansal and
               Kirk Pruhs},
  title     = {Server Scheduling to Balance Priorities, Fairness, and Average Quality
               of Service},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3311--3335},
  year      = {2010},
  url       = {https://doi.org/10.1137/090772228},
  doi       = {10.1137/090772228},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaK10,
  author    = {Surender Baswana and
               Telikepalli Kavitha},
  title     = {Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected
               Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2865--2896},
  year      = {2010},
  url       = {https://doi.org/10.1137/080737174},
  doi       = {10.1137/080737174},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BaswanaK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonGKSV10,
  author    = {Eli Ben{-}Sasson and
               Venkatesan Guruswami and
               Tali Kaufman and
               Madhu Sudan and
               Michael Viderman},
  title     = {Locally Testable Codes Require Redundant Testers},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3230--3247},
  year      = {2010},
  url       = {https://doi.org/10.1137/090779875},
  doi       = {10.1137/090779875},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-SassonGKSV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodirskyC10,
  author    = {Manuel Bodirsky and
               Hubie Chen},
  title     = {Quantified Equality Constraints},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3682--3699},
  year      = {2010},
  url       = {https://doi.org/10.1137/080725209},
  doi       = {10.1137/080725209},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BodirskyC10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BogdanovV10,
  author    = {Andrej Bogdanov and
               Emanuele Viola},
  title     = {Pseudorandom Bits for Polynomials},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2464--2486},
  year      = {2010},
  url       = {https://doi.org/10.1137/070712109},
  doi       = {10.1137/070712109},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BogdanovV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorosEM10,
  author    = {Endre Boros and
               Khaled M. Elbassioni and
               Kazuhisa Makino},
  title     = {Left-to-Right Multiplication for Monotone Boolean Dualization},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3424--3439},
  year      = {2010},
  url       = {https://doi.org/10.1137/080734881},
  doi       = {10.1137/080734881},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BorosEM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BravermanO10,
  author    = {Vladimir Braverman and
               Rafail Ostrovsky},
  title     = {Effective Computations on Sliding Windows},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2113--2131},
  year      = {2010},
  url       = {https://doi.org/10.1137/090749281},
  doi       = {10.1137/090749281},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BravermanO10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ByrkaA10,
  author    = {Jaroslaw Byrka and
               Karen Aardal},
  title     = {An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated
               Facility Location Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2212--2231},
  year      = {2010},
  url       = {https://doi.org/10.1137/070708901},
  doi       = {10.1137/070708901},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ByrkaA10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CardinalFJJM10,
  author    = {Jean Cardinal and
               Samuel Fiorini and
               Gwena{\"{e}}l Joret and
               Rapha{\"{e}}l M. Jungers and
               J. Ian Munro},
  title     = {An Efficient Algorithm for Partial Order Production},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2927--2940},
  year      = {2010},
  url       = {https://doi.org/10.1137/090759860},
  doi       = {10.1137/090759860},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CardinalFJJM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartiR10,
  author    = {Amit Chakrabarti and
               Oded Regev},
  title     = {An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest
               Neighbor Searching},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1919--1940},
  year      = {2010},
  url       = {https://doi.org/10.1137/080729955},
  doi       = {10.1137/080729955},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartiR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartyG10,
  author    = {Deeparnab Chakrabarty and
               Gagan Goel},
  title     = {On the Approximability of Budgeted Allocations and Improved Lower
               Bounds for Submodular Welfare Maximization and {GAP}},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2189--2211},
  year      = {2010},
  url       = {https://doi.org/10.1137/080735503},
  doi       = {10.1137/080735503},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChakrabartyG10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chan10,
  author    = {Timothy M. Chan},
  title     = {More Algorithms for All-Pairs Shortest Paths in Weighted Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {2075--2089},
  year      = {2010},
  url       = {https://doi.org/10.1137/08071990X},
  doi       = {10.1137/08071990X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chan10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarMM10,
  author    = {Moses Charikar and
               Konstantin Makarychev and
               Yury Makarychev},
  title     = {Local Global Tradeoffs in Metric Embeddings},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2487--2512},
  year      = {2010},
  url       = {https://doi.org/10.1137/070712080},
  doi       = {10.1137/070712080},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CharikarMM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChechikLPR10,
  author    = {Shiri Chechik and
               Michael Langberg and
               David Peleg and
               Liam Roditty},
  title     = {Fault Tolerant Spanners for General Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3403--3423},
  year      = {2010},
  url       = {https://doi.org/10.1137/090758039},
  doi       = {10.1137/090758039},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChechikLPR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriHKS10,
  author    = {Chandra Chekuri and
               Mohammad Taghi Hajiaghayi and
               Guy Kortsarz and
               Mohammad R. Salavatipour},
  title     = {Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1772--1798},
  year      = {2010},
  url       = {https://doi.org/10.1137/090750317},
  doi       = {10.1137/090750317},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChekuriHKS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenRV10,
  author    = {Ho{-}Lin Chen and
               Tim Roughgarden and
               Gregory Valiant},
  title     = {Designing Network Protocols for Good Equilibria},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1799--1832},
  year      = {2010},
  url       = {https://doi.org/10.1137/08072721X},
  doi       = {10.1137/08072721X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenRV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengNVW10,
  author    = {Siu{-}Wing Cheng and
               Hyeon{-}Suk Na and
               Antoine Vigneron and
               Yajun Wang},
  title     = {Querying Approximate Shortest Paths in Anisotropic Regions},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1888--1918},
  year      = {2010},
  url       = {https://doi.org/10.1137/080742166},
  doi       = {10.1137/080742166},
  timestamp = {Wed, 18 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChengNVW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChierichettiV10,
  author    = {Flavio Chierichetti and
               Andrea Vattani},
  title     = {The Local Nature of List Colorings for Graphs of High Girth},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2232--2250},
  year      = {2010},
  url       = {https://doi.org/10.1137/080732109},
  doi       = {10.1137/080732109},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChierichettiV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenKM10,
  author    = {Edith Cohen and
               Haim Kaplan and
               Tova Milo},
  title     = {Labeling Dynamic {XML} Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {2048--2074},
  year      = {2010},
  url       = {https://doi.org/10.1137/070687633},
  doi       = {10.1137/070687633},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenKM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Coja-Oghlan10,
  author    = {Amin Coja{-}Oghlan},
  title     = {A Better Algorithm for Random k-SAT},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2823--2864},
  year      = {2010},
  url       = {https://doi.org/10.1137/09076516X},
  doi       = {10.1137/09076516X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Coja-Oghlan10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CryanDR10,
  author    = {Mary Cryan and
               Martin E. Dyer and
               Dana Randall},
  title     = {Approximately Counting Integral Flows and Cell-Bounded Contingency
               Tables},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2683--2703},
  year      = {2010},
  url       = {https://doi.org/10.1137/060650544},
  doi       = {10.1137/060650544},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CryanDR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajKV10,
  author    = {Artur Czumaj and
               Piotr Krysta and
               Berthold V{\"{o}}cking},
  title     = {Selfish Traffic Allocation for Server Farms},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1957--1987},
  year      = {2010},
  url       = {https://doi.org/10.1137/070693862},
  doi       = {10.1137/070693862},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CzumajKV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasGJSV10,
  author    = {Ilias Diakonikolas and
               Parikshit Gopalan and
               Ragesh Jaiswal and
               Rocco A. Servedio and
               Emanuele Viola},
  title     = {Bounded Independence Fools Halfspaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3441--3462},
  year      = {2010},
  url       = {https://doi.org/10.1137/100783030},
  doi       = {10.1137/100783030},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DiakonikolasGJSV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Doty10,
  author    = {David Doty},
  title     = {Randomized Self-Assembly for Exact Shapes},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3521--3552},
  year      = {2010},
  url       = {https://doi.org/10.1137/090779152},
  doi       = {10.1137/090779152},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Doty10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Duris10,
  author    = {David Duris},
  title     = {Extension Preservation Theorems on Classes of Acyclic Finite Structures},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3670--3681},
  year      = {2010},
  url       = {https://doi.org/10.1137/080744463},
  doi       = {10.1137/080744463},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Duris10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DuttaGLV10,
  author    = {Partha Dutta and
               Rachid Guerraoui and
               Ron R. Levy and
               Marko Vukolic},
  title     = {Fast Access to Distributed Atomic Memory},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3752--3783},
  year      = {2010},
  url       = {https://doi.org/10.1137/090757010},
  doi       = {10.1137/090757010},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DuttaGLV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGS10,
  author    = {David Eppstein and
               Michael T. Goodrich and
               Darren Strash},
  title     = {Linear-Time Algorithms for Geometric Graphs with Sublinearly Many
               Edge Crossings},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3814--3829},
  year      = {2010},
  url       = {https://doi.org/10.1137/090759112},
  doi       = {10.1137/090759112},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EppsteinGS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EsparzaKL10,
  author    = {Javier Esparza and
               Stefan Kiefer and
               Michael Luttenberger},
  title     = {Computing the Least Fixed Point of Positive Polynomial Systems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2282--2335},
  year      = {2010},
  url       = {https://doi.org/10.1137/090749591},
  doi       = {10.1137/090749591},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EsparzaKL10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiY10,
  author    = {Kousha Etessami and
               Mihalis Yannakakis},
  title     = {On the Complexity of Nash Equilibria and Other Fixed Points},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2531--2597},
  year      = {2010},
  url       = {https://doi.org/10.1137/080720826},
  doi       = {10.1137/080720826},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EtessamiY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerMR10,
  author    = {Eldar Fischer and
               Fr{\'{e}}d{\'{e}}ric Magniez and
               Michel de Rougemont},
  title     = {Approximate Satisfiability and Equivalence},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2251--2281},
  year      = {2010},
  url       = {https://doi.org/10.1137/070703776},
  doi       = {10.1137/070703776},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerMR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerMS10,
  author    = {Eldar Fischer and
               Arie Matsliah and
               Asaf Shapira},
  title     = {Approximate Hypergraph Partitioning and Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3155--3185},
  year      = {2010},
  url       = {https://doi.org/10.1137/080717584},
  doi       = {10.1137/080717584},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerMS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerRV10,
  author    = {Simon Fischer and
               Harald R{\"{a}}cke and
               Berthold V{\"{o}}cking},
  title     = {Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3700--3735},
  year      = {2010},
  url       = {https://doi.org/10.1137/090746720},
  doi       = {10.1137/090746720},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerRV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleischerKLS10,
  author    = {Lisa Fleischer and
               Jochen K{\"{o}}nemann and
               Stefano Leonardi and
               Guido Sch{\"{a}}fer},
  title     = {Strict Cost Sharing Schemes for Steiner Forest},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3616--3632},
  year      = {2010},
  url       = {https://doi.org/10.1137/090767108},
  doi       = {10.1137/090767108},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FleischerKLS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominGLS10,
  author    = {Fedor V. Fomin and
               Petr A. Golovach and
               Daniel Lokshtanov and
               Saket Saurabh},
  title     = {Intractability of Clique-Width Parameterizations},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1941--1956},
  year      = {2010},
  url       = {https://doi.org/10.1137/080742270},
  doi       = {10.1137/080742270},
  timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FominGLS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalG10,
  author    = {Anna G{\'{a}}l and
               Parikshit Gopalan},
  title     = {Lower Bounds on Streaming Algorithms for Approximating the Length
               of the Longest Increasing Subsequence},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3463--3479},
  year      = {2010},
  url       = {https://doi.org/10.1137/090770801},
  doi       = {10.1137/090770801},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GalG10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeorgiouMPT10,
  author    = {Konstantinos Georgiou and
               Avner Magen and
               Toniann Pitassi and
               Iannis Tourlakis},
  title     = {Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lov[a-acute]sz--Schrijver
               Hierarchy},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3553--3570},
  year      = {2010},
  url       = {https://doi.org/10.1137/080721479},
  doi       = {10.1137/080721479},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GeorgiouMPT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolabHW10,
  author    = {Wojciech M. Golab and
               Danny Hendler and
               Philipp Woelfel},
  title     = {An {O(1)} RMRs Leader Election Algorithm},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2726--2760},
  year      = {2010},
  url       = {https://doi.org/10.1137/070686445},
  doi       = {10.1137/070686445},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GolabHW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergGJT10,
  author    = {Leslie Ann Goldberg and
               Martin Grohe and
               Mark Jerrum and
               Marc Thurley},
  title     = {A Complexity Dichotomy for Partition Functions with Mixed Signs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3336--3402},
  year      = {2010},
  url       = {https://doi.org/10.1137/090757496},
  doi       = {10.1137/090757496},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldbergGJT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichGN10,
  author    = {Oded Goldreich and
               Shafi Goldwasser and
               Asaf Nussboim},
  title     = {On the Implementation of Huge Random Objects},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2761--2822},
  year      = {2010},
  url       = {https://doi.org/10.1137/080722771},
  doi       = {10.1137/080722771},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoldreichGN10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKS10,
  author    = {Parikshit Gopalan and
               Subhash Khot and
               Rishi Saket},
  title     = {Hardness of Reconstructing Multivariate Polynomials over Finite Fields},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2598--2621},
  year      = {2010},
  url       = {https://doi.org/10.1137/070705258},
  doi       = {10.1137/070705258},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GopalanKS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GurevichK10,
  author    = {Maxim Gurevich and
               Idit Keidar},
  title     = {Correctness of Gossip-Based Membership under Message Loss},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3830--3859},
  year      = {2010},
  url       = {https://doi.org/10.1137/090769752},
  doi       = {10.1137/090769752},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GurevichK10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HarnikN10,
  author    = {Danny Harnik and
               Moni Naor},
  title     = {On the Compressibility of \emph{NP} Instances and Cryptographic Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1667--1713},
  year      = {2010},
  url       = {https://doi.org/10.1137/060668092},
  doi       = {10.1137/060668092},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HarnikN10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HertelP10,
  author    = {Philipp Hertel and
               Toniann Pitassi},
  title     = {The PSPACE-Completeness of Black-White Pebbling},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2622--2682},
  year      = {2010},
  url       = {https://doi.org/10.1137/080713513},
  doi       = {10.1137/080713513},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HertelP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hierons10,
  author    = {Robert M. Hierons},
  title     = {Reaching and Distinguishing States of Distributed Systems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3480--3500},
  year      = {2010},
  url       = {https://doi.org/10.1137/090771296},
  doi       = {10.1137/090771296},
  timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Hierons10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IdziakMMVW10,
  author    = {Pawel M. Idziak and
               Petar Markovic and
               Ralph McKenzie and
               Matthew Valeriote and
               Ross Willard},
  title     = {Tractability and Learnability Arising from Algebras with Few Subpowers},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3023--3037},
  year      = {2010},
  url       = {https://doi.org/10.1137/090775646},
  doi       = {10.1137/090775646},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IdziakMMVW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoJKW10,
  author    = {Russell Impagliazzo and
               Ragesh Jaiswal and
               Valentine Kabanets and
               Avi Wigderson},
  title     = {Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1637--1665},
  year      = {2010},
  url       = {https://doi.org/10.1137/080734030},
  doi       = {10.1137/080734030},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoJKW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IvanyosKS10,
  author    = {G{\'{a}}bor Ivanyos and
               Marek Karpinski and
               Nitin Saxena},
  title     = {Deterministic Polynomial Time Algorithms for Matrix Completion Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3736--3751},
  year      = {2010},
  url       = {https://doi.org/10.1137/090781231},
  doi       = {10.1137/090781231},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IvanyosKS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenT10,
  author    = {Klaus Jansen and
               Ralf Th{\"{o}}le},
  title     = {Approximation Algorithms for Scheduling Parallel Jobs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3571--3615},
  year      = {2010},
  url       = {https://doi.org/10.1137/080736491},
  doi       = {10.1137/080736491},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JansenT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KanjPX10,
  author    = {Iyad A. Kanj and
               Ljubomir Perkovic and
               Ge Xia},
  title     = {On Spanners and Lightweight Spanners of Geometric Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2132--2161},
  year      = {2010},
  url       = {https://doi.org/10.1137/080737708},
  doi       = {10.1137/080737708},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KanjPX10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanRS10,
  author    = {Haim Kaplan and
               Natan Rubin and
               Micha Sharir},
  title     = {Line Transversals of Convex Polyhedra in R\({}^{\mbox{3}}\)},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3283--3310},
  year      = {2010},
  url       = {https://doi.org/10.1137/080744694},
  doi       = {10.1137/080744694},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaplanRS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaufmanLX10,
  author    = {Tali Kaufman and
               Simon Litsyn and
               Ning Xie},
  title     = {Breaking the Epsilon-Soundness Bound of the Linearity Test over {GF(2)}},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1988--2003},
  year      = {2010},
  url       = {https://doi.org/10.1137/080715548},
  doi       = {10.1137/080715548},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaufmanLX10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KawachiY10,
  author    = {Akinori Kawachi and
               Tomoyuki Yamakami},
  title     = {Quantum Hardcore Functions by Complexity-Theoretical Quantum List
               Decoding},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2941--2969},
  year      = {2010},
  url       = {https://doi.org/10.1137/080716840},
  doi       = {10.1137/080716840},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KawachiY10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KempeRT10,
  author    = {Julia Kempe and
               Oded Regev and
               Ben Toner},
  title     = {Unique Games with Entangled Provers Are Easy},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3207--3229},
  year      = {2010},
  url       = {https://doi.org/10.1137/090772885},
  doi       = {10.1137/090772885},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KempeRT10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirschmerV10,
  author    = {Markus Kirschmer and
               John Voight},
  title     = {Algorithmic Enumeration of Ideal Classes for Quaternion Orders},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1714--1747},
  year      = {2010},
  url       = {https://doi.org/10.1137/080734467},
  doi       = {10.1137/080734467},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KirschmerV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KreveldLM10,
  author    = {Marc J. van Kreveld and
               Maarten L{\"{o}}ffler and
               Joseph S. B. Mitchell},
  title     = {Preprocessing Imprecise Points and Splitting Triangulations},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2990--3000},
  year      = {2010},
  url       = {https://doi.org/10.1137/090753620},
  doi       = {10.1137/090753620},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KreveldLM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KushilevitzLR10,
  author    = {Eyal Kushilevitz and
               Yehuda Lindell and
               Tal Rabin},
  title     = {Information-Theoretically Secure Protocols and Security under Composition},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {2090--2112},
  year      = {2010},
  url       = {https://doi.org/10.1137/090755886},
  doi       = {10.1137/090755886},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KushilevitzLR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeU10,
  author    = {James R. Lee and
               Christopher Umans},
  title     = {Special Section On Foundations of Computer Science},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2397},
  year      = {2010},
  url       = {https://doi.org/10.1137/SMJCAT000039000006002397000001},
  doi       = {10.1137/SMJCAT000039000006002397000001},
  timestamp = {Mon, 13 Mar 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LeeU10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LinNRW10,
  author    = {Guolong Lin and
               Chandrashekhar Nagarajan and
               Rajmohan Rajaraman and
               David P. Williamson},
  title     = {A General Approach for Incremental Approximation and Hierarchical
               Clustering},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3633--3669},
  year      = {2010},
  url       = {https://doi.org/10.1137/070698257},
  doi       = {10.1137/070698257},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LinNRW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LipmanS10,
  author    = {Julia Lipman and
               Quentin F. Stout},
  title     = {Analysis of Delays Caused by Local Synchronization},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3860--3884},
  year      = {2010},
  url       = {https://doi.org/10.1137/080723090},
  doi       = {10.1137/080723090},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LipmanS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Marco10,
  author    = {Gianluca De Marco},
  title     = {Distributed Broadcast in Unknown Radio Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2162--2175},
  year      = {2010},
  url       = {https://doi.org/10.1137/080733826},
  doi       = {10.1137/080733826},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Marco10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MatulefORS10,
  author    = {Kevin Matulef and
               Ryan O'Donnell and
               Ronitt Rubinfeld and
               Rocco A. Servedio},
  title     = {Testing Halfspaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {2004--2047},
  year      = {2010},
  url       = {https://doi.org/10.1137/070707890},
  doi       = {10.1137/070707890},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MatulefORS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McKenzieTV10,
  author    = {Pierre McKenzie and
               Michael Thomas and
               Heribert Vollmer},
  title     = {Extensional Uniformity for Boolean Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3186--3206},
  year      = {2010},
  url       = {https://doi.org/10.1137/080741811},
  doi       = {10.1137/080741811},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/McKenzieTV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mestre10,
  author    = {Juli{\'{a}}n Mestre},
  title     = {Adaptive Local Ratio},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3038--3057},
  year      = {2010},
  url       = {https://doi.org/10.1137/080731712},
  doi       = {10.1137/080731712},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Mestre10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MooreRS10,
  author    = {Cristopher Moore and
               Alexander Russell and
               Piotr Sniady},
  title     = {On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2377--2396},
  year      = {2010},
  url       = {https://doi.org/10.1137/080724101},
  doi       = {10.1137/080724101},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MooreRS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MosselR10,
  author    = {Elchanan Mossel and
               S{\'{e}}bastien Roch},
  title     = {Submodularity of Influence in Social Networks: From Local to Global},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2176--2188},
  year      = {2010},
  url       = {https://doi.org/10.1137/080714452},
  doi       = {10.1137/080714452},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MosselR10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Nutov10,
  author    = {Zeev Nutov},
  title     = {Approximating Steiner Networks with Node-Weights},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3001--3022},
  year      = {2010},
  url       = {https://doi.org/10.1137/080729645},
  doi       = {10.1137/080729645},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Nutov10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RabaniS10,
  author    = {Yuval Rabani and
               Amir Shpilka},
  title     = {Explicit Construction of a Small Epsilon-Net for Linear Threshold
               Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3501--3520},
  year      = {2010},
  url       = {https://doi.org/10.1137/090764190},
  doi       = {10.1137/090764190},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RabaniS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RaoZ10,
  author    = {Satish Rao and
               Shuheng Zhou},
  title     = {Edge Disjoint Paths in Moderately Connected Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1856--1887},
  year      = {2010},
  url       = {https://doi.org/10.1137/080715093},
  doi       = {10.1137/080715093},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RaoZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RazborovS10,
  author    = {Alexander A. Razborov and
               Alexander A. Sherstov},
  title     = {The Sign-Rank of AC\({}^{\mbox{0}}\)},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {5},
  pages     = {1833--1855},
  year      = {2010},
  url       = {https://doi.org/10.1137/080744037},
  doi       = {10.1137/080744037},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RazborovS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Roditty10,
  author    = {Liam Roditty},
  title     = {On the k Shortest Simple Paths Problem in Weighted Directed Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {6},
  pages     = {2363--2376},
  year      = {2010},
  url       = {https://doi.org/10.1137/080730950},
  doi       = {10.1137/080730950},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Roditty10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenS10,
  author    = {Alon Rosen and
               Gil Segev},
  title     = {Chosen-Ciphertext Security via Correlated Products},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3058--3088},
  year      = {2010},
  url       = {https://doi.org/10.1137/100782929},
  doi       = {10.1137/100782929},
  timestamp = {Sun, 16 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RosenS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaksS10,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Local Monotonicity Reconstruction},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2897--2926},
  year      = {2010},
  url       = {https://doi.org/10.1137/080728561},
  doi       = {10.1137/080728561},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SaksS10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShaltielV10,
  author    = {Ronen Shaltiel and
               Emanuele Viola},
  title     = {Hardness Amplification Proofs Require Majority},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {3122--3154},
  year      = {2010},
  url       = {https://doi.org/10.1137/080735096},
  doi       = {10.1137/080735096},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ShaltielV10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VerdiereE10,
  author    = {{\'{E}}ric Colin de Verdi{\`{e}}re and
               Jeff Erickson},
  title     = {Tightening Nonsimple Paths and Cycles on Surfaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {8},
  pages     = {3784--3813},
  year      = {2010},
  url       = {https://doi.org/10.1137/090761653},
  doi       = {10.1137/090761653},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/VerdiereE10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AaronsonGKMMS09,
  author    = {Scott Aaronson and
               Sudipto Guha and
               Jon M. Kleinberg and
               Frank McSherry and
               Dieter van Melkebeek and
               Amit Sahai},
  title     = {Special Issue On The Thirty-Eighth Annual {ACM} Symposium On Theory
               Of Computing {(STOC} 2006)},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {vii},
  year      = {2009},
  url       = {https://doi.org/10.1137/SMJCAT000039000001000vii000001},
  doi       = {10.1137/SMJCAT000039000001000vii000001},
  timestamp = {Mon, 13 Mar 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AaronsonGKMMS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbamBS09,
  author    = {Mohammad Ali Abam and
               Mark de Berg and
               Bettina Speckmann},
  title     = {Kinetic kd-Trees and Longest-Side kd-Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1219--1232},
  year      = {2009},
  url       = {https://doi.org/10.1137/070710731},
  doi       = {10.1137/070710731},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbamBS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AchlioptasR09,
  author    = {Dimitris Achlioptas and
               Federico Ricci{-}Tersenghi},
  title     = {Random Formulas Have Frozen Variables},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {260--280},
  year      = {2009},
  url       = {https://doi.org/10.1137/070680382},
  doi       = {10.1137/070680382},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AchlioptasR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AdlemanKKRS09,
  author    = {Leonard M. Adleman and
               Jarkko Kari and
               Lila Kari and
               Dustin Reishus and
               Petr Sos{\'{\i}}k},
  title     = {The Undecidability of the Infinite Ribbon Problem: Implications for
               Computing by Self-Assembly},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2356--2381},
  year      = {2009},
  url       = {https://doi.org/10.1137/080723971},
  doi       = {10.1137/080723971},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AdlemanKKRS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AilonC09,
  author    = {Nir Ailon and
               Bernard Chazelle},
  title     = {The Fast Johnson--Lindenstrauss Transform and Approximate Nearest
               Neighbors},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {302--322},
  year      = {2009},
  url       = {https://doi.org/10.1137/060673096},
  doi       = {10.1137/060673096},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AilonC09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Albers09,
  author    = {Susanne Albers},
  title     = {On the Value of Coordination in Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2273--2302},
  year      = {2009},
  url       = {https://doi.org/10.1137/070701376},
  doi       = {10.1137/070701376},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Albers09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AldousBL09,
  author    = {David J. Aldous and
               Charles Bordenave and
               Marc Lelarge},
  title     = {Dynamic Programming Optimization over Random Data: The Scaling Exponent
               for Near-Optimal Solutions},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2382--2410},
  year      = {2009},
  url       = {https://doi.org/10.1137/070709037},
  doi       = {10.1137/070709037},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AldousBL09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderBKM09,
  author    = {Eric Allender and
               Peter B{\"{u}}rgisser and
               Johan Kjeldgaard{-}Pedersen and
               Peter Bro Miltersen},
  title     = {On the Complexity of Numerical Analysis},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1987--2006},
  year      = {2009},
  url       = {https://doi.org/10.1137/070697926},
  doi       = {10.1137/070697926},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AllenderBKM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderKS09,
  author    = {Eric Allender and
               Vladlen Koltun and
               Maxim Sviridenko},
  title     = {Special Section On The Thirty-Ninth Annual {ACM} Symposium On Theory
               Of Computing {(STOC} 2007)},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {978},
  year      = {2009},
  url       = {https://doi.org/10.1137/SMJCAT000039000003000978000001},
  doi       = {10.1137/SMJCAT000039000003000978000001},
  timestamp = {Mon, 13 Mar 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AllenderKS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonAABN09,
  author    = {Noga Alon and
               Baruch Awerbuch and
               Yossi Azar and
               Niv Buchbinder and
               Joseph Naor},
  title     = {The Online Set Cover Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {361--370},
  year      = {2009},
  url       = {https://doi.org/10.1137/060661946},
  doi       = {10.1137/060661946},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonAABN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonFNS09,
  author    = {Noga Alon and
               Eldar Fischer and
               Ilan Newman and
               Asaf Shapira},
  title     = {A Combinatorial Characterization of the Testable Graph Properties:
               It's All About Regularity},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {143--167},
  year      = {2009},
  url       = {https://doi.org/10.1137/060667177},
  doi       = {10.1137/060667177},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonFNS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmirHKLP09,
  author    = {Amihood Amir and
               Tzvika Hartman and
               Oren Kapah and
               Avivit Levy and
               Ely Porat},
  title     = {On the Cost of Interchange Rearrangement in Strings},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1444--1461},
  year      = {2009},
  url       = {https://doi.org/10.1137/080712969},
  doi       = {10.1137/080712969},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AmirHKLP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndrewNR09,
  author    = {Matthew Andrew and
               Ashwin Nayak and
               Rajmohan Rajaraman},
  title     = {Special Section on Foundations of Computer Science},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {545},
  year      = {2009},
  url       = {https://doi.org/10.1137/SMJCAT000039000002000545000001},
  doi       = {10.1137/SMJCAT000039000002000545000001},
  timestamp = {Mon, 13 Mar 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndrewNR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArthurV09,
  author    = {David Arthur and
               Sergei Vassilvitskii},
  title     = {Worst-Case and Smoothed Analysis of the {ICP} Algorithm, with an Application
               to the k-Means Method},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {766--782},
  year      = {2009},
  url       = {https://doi.org/10.1137/070683921},
  doi       = {10.1137/070683921},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArthurV09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AwerbuchK09,
  author    = {Baruch Awerbuch and
               Rohit Khandekar},
  title     = {Stateless Distributed Gradient Descent for Positive Linear Programs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2468--2486},
  year      = {2009},
  url       = {https://doi.org/10.1137/080717651},
  doi       = {10.1137/080717651},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AwerbuchK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalCS09,
  author    = {Nikhil Bansal and
               Alberto Caprara and
               Maxim Sviridenko},
  title     = {A New Approximation Method for Set Covering Problems, with Applications
               to Multidimensional Bin Packing},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1256--1278},
  year      = {2009},
  url       = {https://doi.org/10.1137/080736831},
  doi       = {10.1137/080736831},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalCS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalKN09,
  author    = {Nikhil Bansal and
               Rohit Khandekar and
               Viswanath Nagarajan},
  title     = {Additive Guarantees for Degree-Bounded Directed Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1413--1431},
  year      = {2009},
  url       = {https://doi.org/10.1137/080734340},
  doi       = {10.1137/080734340},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalKN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalPS09,
  author    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {Speed Scaling for Weighted Flow Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1294--1308},
  year      = {2009},
  url       = {https://doi.org/10.1137/08072125X},
  doi       = {10.1137/08072125X},
  timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalPS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoK09,
  author    = {Libor Barto and
               Marcin Kozik},
  title     = {Congruence Distributivity Implies Bounded Width},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1531--1542},
  year      = {2009},
  url       = {https://doi.org/10.1137/080743238},
  doi       = {10.1137/080743238},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BartoK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartoKN09,
  author    = {Libor Barto and
               Marcin Kozik and
               Todd Niven},
  title     = {The {CSP} Dichotomy Holds for Digraphs with No Sources and No Sinks
               {(A} Positive Answer to a Conjecture of Bang-Jensen and Hell)},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1782--1802},
  year      = {2009},
  url       = {https://doi.org/10.1137/070708093},
  doi       = {10.1137/070708093},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BartoKN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bazzi09,
  author    = {Louay M. J. Bazzi},
  title     = {Polylogarithmic Independence Can Fool {DNF} Formulas},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2220--2272},
  year      = {2009},
  url       = {https://doi.org/10.1137/070691954},
  doi       = {10.1137/070691954},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Bazzi09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BjorklundHK09,
  author    = {Andreas Bj{\"{o}}rklund and
               Thore Husfeldt and
               Mikko Koivisto},
  title     = {Set Partitioning via Inclusion-Exclusion},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {546--563},
  year      = {2009},
  url       = {https://doi.org/10.1137/070683933},
  doi       = {10.1137/070683933},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BjorklundHK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumrosenN09,
  author    = {Liad Blumrosen and
               Noam Nisan},
  title     = {On the Computational Power of Demand Queries},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1372--1391},
  year      = {2009},
  url       = {https://doi.org/10.1137/050641181},
  doi       = {10.1137/050641181},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BlumrosenN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseCCMMS09,
  author    = {Prosenjit Bose and
               Paz Carmi and
               Mathieu Couture and
               Anil Maheshwari and
               Pat Morin and
               Michiel H. M. Smid},
  title     = {Spanners of Complete k-Partite Geometric Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1803--1820},
  year      = {2009},
  url       = {https://doi.org/10.1137/070707130},
  doi       = {10.1137/070707130},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BoseCCMMS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BravyiT09,
  author    = {Sergey Bravyi and
               Barbara M. Terhal},
  title     = {Complexity of Stoquastic Frustration-Free Hamiltonians},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1462--1485},
  year      = {2009},
  url       = {https://doi.org/10.1137/08072689X},
  doi       = {10.1137/08072689X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BravyiT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BroderKKMUV09,
  author    = {Andrei Z. Broder and
               Adam Kirsch and
               Ravi Kumar and
               Michael Mitzenmacher and
               Eli Upfal and
               Sergei Vassilvitskii},
  title     = {The Hiring Problem and Lake Wobegon Strategies},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1233--1255},
  year      = {2009},
  url       = {https://doi.org/10.1137/07070629X},
  doi       = {10.1137/07070629X},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BroderKKMUV09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanCCFK09,
  author    = {Mee Yee Chan and
               Wun{-}Tat Chan and
               Francis Y. L. Chin and
               Stanley P. Y. Fung and
               Ming{-}Yang Kao},
  title     = {Linear-Time Haplotype Inference on Pedigrees without Recombinations
               and Mating Loops},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2179--2197},
  year      = {2009},
  url       = {https://doi.org/10.1137/080680990},
  doi       = {10.1137/080680990},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanCCFK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanDGKS09,
  author    = {T.{-}H. Hubert Chan and
               Kedar Dhamdhere and
               Anupam Gupta and
               Jon M. Kleinberg and
               Aleksandrs Slivkins},
  title     = {Metric Embeddings with Relaxed Guarantees},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2303--2329},
  year      = {2009},
  url       = {https://doi.org/10.1137/060670511},
  doi       = {10.1137/060670511},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanDGKS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanP09,
  author    = {Timothy M. Chan and
               Mihai Patrascu},
  title     = {Transdichotomous Results in Computational Geometry, {I:} Point Location
               in Sublogarithmic Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {703--729},
  year      = {2009},
  url       = {https://doi.org/10.1137/07068669X},
  doi       = {10.1137/07068669X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangK09,
  author    = {Kevin L. Chang and
               Ravi Kannan},
  title     = {Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {783--812},
  year      = {2009},
  url       = {https://doi.org/10.1137/060678890},
  doi       = {10.1137/060678890},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChangK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS09,
  author    = {Chandra Chekuri and
               Sanjeev Khanna and
               F. Bruce Shepherd},
  title     = {Edge-Disjoint Paths in Planar Graphs with Constant Congestion},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {281--301},
  year      = {2009},
  url       = {https://doi.org/10.1137/060674442},
  doi       = {10.1137/060674442},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChekuriKS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chen09,
  author    = {Ke Chen},
  title     = {On Coresets for k-Median and k-Means Clustering in Metric and Euclidean
               Spaces and Their Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {923--947},
  year      = {2009},
  url       = {https://doi.org/10.1137/070699007},
  doi       = {10.1137/070699007},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chen09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CormodeTX09,
  author    = {Graham Cormode and
               Srikanta Tirthapura and
               Bojian Xu},
  title     = {Time-decaying Sketches for Robust Aggregation of Sensor Data},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1309--1339},
  year      = {2009},
  url       = {https://doi.org/10.1137/08071795X},
  doi       = {10.1137/08071795X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CormodeTX09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajL09,
  author    = {Artur Czumaj and
               Andrzej Lingas},
  title     = {Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix
               Multiplication},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {431--444},
  year      = {2009},
  url       = {https://doi.org/10.1137/070695149},
  doi       = {10.1137/070695149},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CzumajL09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajS09,
  author    = {Artur Czumaj and
               Christian Sohler},
  title     = {Estimating the Weight of Metric Minimum Spanning Trees in Sublinear
               Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {904--922},
  year      = {2009},
  url       = {https://doi.org/10.1137/060672121},
  doi       = {10.1137/060672121},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CzumajS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajSS09,
  author    = {Artur Czumaj and
               Asaf Shapira and
               Christian Sohler},
  title     = {Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2499--2510},
  year      = {2009},
  url       = {https://doi.org/10.1137/070681831},
  doi       = {10.1137/070681831},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CzumajSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DasguptaDHKM09,
  author    = {Anirban Dasgupta and
               Petros Drineas and
               Boulos Harb and
               Ravi Kumar and
               Michael W. Mahoney},
  title     = {Sampling Algorithms and Coresets for {\textdollar}{\textbackslash}ell\({}_{\mbox{p}}\)
               Regression},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {2060--2078},
  year      = {2009},
  url       = {https://doi.org/10.1137/070696507},
  doi       = {10.1137/070696507},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DasguptaDHKM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisGP09,
  author    = {Constantinos Daskalakis and
               Paul W. Goldberg and
               Christos H. Papadimitriou},
  title     = {The Complexity of Computing a Nash Equilibrium},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {195--259},
  year      = {2009},
  url       = {https://doi.org/10.1137/070699652},
  doi       = {10.1137/070699652},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DaskalakisGP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeKM09,
  author    = {Luc Devroye and
               James King and
               Colin McDiarmid},
  title     = {Random Hyperplane Search Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2411--2425},
  year      = {2009},
  url       = {https://doi.org/10.1137/060678609},
  doi       = {10.1137/060678609},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DevroyeKM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasY09,
  author    = {Ilias Diakonikolas and
               Mihalis Yannakakis},
  title     = {Small Approximate Pareto Sets for Biobjective Shortest Paths and Other
               Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1340--1371},
  year      = {2009},
  url       = {https://doi.org/10.1137/080724514},
  doi       = {10.1137/080724514},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DiakonikolasY09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurMR09,
  author    = {Irit Dinur and
               Elchanan Mossel and
               Oded Regev},
  title     = {Conditional Hardness for Approximate Coloring},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {843--873},
  year      = {2009},
  url       = {https://doi.org/10.1137/07068062X},
  doi       = {10.1137/07068062X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DinurMR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirSY09,
  author    = {Zeev Dvir and
               Amir Shpilka and
               Amir Yehudayoff},
  title     = {Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1279--1293},
  year      = {2009},
  url       = {https://doi.org/10.1137/080735850},
  doi       = {10.1137/080735850},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DvirSY09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGJ09,
  author    = {Martin E. Dyer and
               Leslie Ann Goldberg and
               Mark Jerrum},
  title     = {The Complexity of Weighted Boolean {\#}CSP},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1970--1986},
  year      = {2009},
  url       = {https://doi.org/10.1137/070690201},
  doi       = {10.1137/070690201},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DyerGJ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Feige09,
  author    = {Uriel Feige},
  title     = {On Maximizing Welfare When Utility Functions Are Subadditive},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {122--142},
  year      = {2009},
  url       = {https://doi.org/10.1137/070680977},
  doi       = {10.1137/070680977},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Feige09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanGKP09,
  author    = {Vitaly Feldman and
               Parikshit Gopalan and
               Subhash Khot and
               Ashok Kumar Ponnuswami},
  title     = {On Agnostic Learning of Parities, Monomials, and Halfspaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {606--645},
  year      = {2009},
  url       = {https://doi.org/10.1137/070684914},
  doi       = {10.1137/070684914},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanGKP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Furer09,
  author    = {Martin F{\"{u}}rer},
  title     = {Faster Integer Multiplication},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {979--1005},
  year      = {2009},
  url       = {https://doi.org/10.1137/070711761},
  doi       = {10.1137/070711761},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Furer09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GavinskyKRW09,
  author    = {Dmitry Gavinsky and
               Julia Kempe and
               Oded Regev and
               Ronald de Wolf},
  title     = {Bounded-Error Quantum State Identification and Exponential Separations
               in Communication Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {1--24},
  year      = {2009},
  url       = {https://doi.org/10.1137/060665798},
  doi       = {10.1137/060665798},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GavinskyKRW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeladeMN09,
  author    = {Wouter Gelade and
               Wim Martens and
               Frank Neven},
  title     = {Optimizing Schema Languages for {XML:} Numerical Constraints and Interleaving},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {2021--2043},
  year      = {2009},
  url       = {https://doi.org/10.1137/070697367},
  doi       = {10.1137/070697367},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GeladeMN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKMP09,
  author    = {Parikshit Gopalan and
               Phokion G. Kolaitis and
               Elitza N. Maneva and
               Christos H. Papadimitriou},
  title     = {The Connectivity of Boolean Satisfiability: Computational and Structural
               Dichotomies},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2330--2355},
  year      = {2009},
  url       = {https://doi.org/10.1137/07070440X},
  doi       = {10.1137/07070440X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GopalanKMP09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuhaM09,
  author    = {Sudipto Guha and
               Andrew McGregor},
  title     = {Stream Order and Order Statistics: Quantile Estimation in Random-Order
               Streams},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {2044--2059},
  year      = {2009},
  url       = {https://doi.org/10.1137/07069328X},
  doi       = {10.1137/07069328X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuhaM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuhaMM09,
  author    = {Sudipto Guha and
               Adam Meyerson and
               Kamesh Munagala},
  title     = {A Constant Factor Approximation for the Single Sink Edge Installation
               Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2426--2442},
  year      = {2009},
  url       = {https://doi.org/10.1137/050643635},
  doi       = {10.1137/050643635},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuhaMM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuruswamiR09,
  author    = {Venkatesan Guruswami and
               Prasad Raghavendra},
  title     = {Hardness of Learning Halfspaces with Noise},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {742--765},
  year      = {2009},
  url       = {https://doi.org/10.1137/070685798},
  doi       = {10.1137/070685798},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GuruswamiR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerNORV09,
  author    = {Iftach Haitner and
               Minh{-}Huyen Nguyen and
               Shien Jin Ong and
               Omer Reingold and
               Salil P. Vadhan},
  title     = {Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments
               from Any One-Way Function},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1153--1218},
  year      = {2009},
  url       = {https://doi.org/10.1137/080725404},
  doi       = {10.1137/080725404},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaitnerNORV09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Harvey09,
  author    = {Nicholas J. A. Harvey},
  title     = {Algebraic Algorithms for Matching and Matroid Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {679--702},
  year      = {2009},
  url       = {https://doi.org/10.1137/070684008},
  doi       = {10.1137/070684008},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Harvey09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HonSS09,
  author    = {Wing{-}Kai Hon and
               Kunihiko Sadakane and
               Wing{-}Kin Sung},
  title     = {Breaking a Time-and-Space Barrier in Constructing Full-Text Indices},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2162--2178},
  year      = {2009},
  url       = {https://doi.org/10.1137/070685373},
  doi       = {10.1137/070685373},
  timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HonSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImpagliazzoJK09,
  author    = {Russell Impagliazzo and
               Ragesh Jaiswal and
               Valentine Kabanets},
  title     = {Approximate List-Decoding of Direct Product Codes and Uniform Hardness
               Amplification},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {564--605},
  year      = {2009},
  url       = {https://doi.org/10.1137/070683994},
  doi       = {10.1137/070683994},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ImpagliazzoJK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IshaiKOS09,
  author    = {Yuval Ishai and
               Eyal Kushilevitz and
               Rafail Ostrovsky and
               Amit Sahai},
  title     = {Zero-Knowledge Proofs from Secure Multiparty Computation},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1121--1152},
  year      = {2009},
  url       = {https://doi.org/10.1137/080725398},
  doi       = {10.1137/080725398},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/IshaiKOS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Jansen09,
  author    = {Klaus Jansen},
  title     = {Parameterized Approximation Scheme for the Multiple Knapsack Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1392--1412},
  year      = {2009},
  url       = {https://doi.org/10.1137/080731207},
  doi       = {10.1137/080731207},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Jansen09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KakadeKL09,
  author    = {Sham M. Kakade and
               Adam Tauman Kalai and
               Katrina Ligett},
  title     = {Playing Games with Approximation Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1088--1106},
  year      = {2009},
  url       = {https://doi.org/10.1137/070701704},
  doi       = {10.1137/070701704},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KakadeKL09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarloffKMR09,
  author    = {Howard J. Karloff and
               Subhash Khot and
               Aranyak Mehta and
               Yuval Rabani},
  title     = {On Earthmover Distance, Metric Labeling, and 0-Extension},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {371--387},
  year      = {2009},
  url       = {https://doi.org/10.1137/070685671},
  doi       = {10.1137/070685671},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KarloffKMR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KedlayaY09,
  author    = {Kiran S. Kedlaya and
               Sergey Yekhanin},
  title     = {Locally Decodable Codes from Nice Subsets of Finite Fields and Prime
               Factors of Mersenne Numbers},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1952--1969},
  year      = {2009},
  url       = {https://doi.org/10.1137/070696519},
  doi       = {10.1137/070696519},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KedlayaY09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KenyonRS09,
  author    = {Claire Kenyon and
               Yuval Rabani and
               Alistair Sinclair},
  title     = {Low Distortion Maps Between Point Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1617--1636},
  year      = {2009},
  url       = {https://doi.org/10.1137/080712921},
  doi       = {10.1137/080712921},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KenyonRS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirschMW09,
  author    = {Adam Kirsch and
               Michael Mitzenmacher and
               Udi Wieder},
  title     = {More Robust Hashing: Cuckoo Hashing with a Stash},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1543--1561},
  year      = {2009},
  url       = {https://doi.org/10.1137/080728743},
  doi       = {10.1137/080728743},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KirschMW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoenigMMT09,
  author    = {Sven Koenig and
               Joseph S. B. Mitchell and
               Apurva Mudgal and
               Craig A. Tovey},
  title     = {A Near-Tight Approximation Algorithm for the Robot Localization Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {461--490},
  year      = {2009},
  url       = {https://doi.org/10.1137/070682885},
  doi       = {10.1137/070682885},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KoenigMMT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kozik09,
  author    = {Marcin Kozik},
  title     = {A 2EXPTIME Complete Varietal Membership Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2443--2467},
  year      = {2009},
  url       = {https://doi.org/10.1137/070680801},
  doi       = {10.1137/070680801},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Kozik09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KrauthgamerR09,
  author    = {Robert Krauthgamer and
               Yuval Rabani},
  title     = {Improved Lower Bounds for Embeddings intoL\({}_{\mbox{1}}\){\textdollar}},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2487--2498},
  year      = {2009},
  url       = {https://doi.org/10.1137/060660126},
  doi       = {10.1137/060660126},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KrauthgamerR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LauNSS09,
  author    = {Lap Chi Lau and
               Joseph Naor and
               Mohammad R. Salavatipour and
               Mohit Singh},
  title     = {Survivable Network Design with Degree or Order Constraints},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1062--1087},
  year      = {2009},
  url       = {https://doi.org/10.1137/070700620},
  doi       = {10.1137/070700620},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LauNSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LotkerPR09,
  author    = {Zvi Lotker and
               Boaz Patt{-}Shamir and
               Adi Ros{\'{e}}n},
  title     = {Distributed Approximate Matching},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {445--460},
  year      = {2009},
  url       = {https://doi.org/10.1137/080714403},
  doi       = {10.1137/080714403},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LotkerPR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MaS09,
  author    = {Bin Ma and
               Xiaoming Sun},
  title     = {More Efficient Algorithms for Closest String and Substring Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1432--1443},
  year      = {2009},
  url       = {https://doi.org/10.1137/080739069},
  doi       = {10.1137/080739069},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MaS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MalettiGHK09,
  author    = {Andreas Maletti and
               Jonathan Graehl and
               Mark Hopkins and
               Kevin Knight},
  title     = {The Power of Extended Top-Down Tree Transducers},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {410--430},
  year      = {2009},
  url       = {https://doi.org/10.1137/070699160},
  doi       = {10.1137/070699160},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MalettiGHK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MartensNS09,
  author    = {Wim Martens and
               Frank Neven and
               Thomas Schwentick},
  title     = {Complexity of Decision Problems for {XML} Schemas and Chain Regular
               Expressions},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1486--1530},
  year      = {2009},
  url       = {https://doi.org/10.1137/080743457},
  doi       = {10.1137/080743457},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MartensNS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Meir09,
  author    = {Or Meir},
  title     = {Combinatorial Construction of Locally Testable Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {491--544},
  year      = {2009},
  url       = {https://doi.org/10.1137/080729967},
  doi       = {10.1137/080729967},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Meir09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NguyenS09,
  author    = {Phong Q. Nguyen and
               Damien Stehl{\'{e}}},
  title     = {An {LLL} Algorithm with Quadratic Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {874--903},
  year      = {2009},
  url       = {https://doi.org/10.1137/070705702},
  doi       = {10.1137/070705702},
  timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NguyenS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Nordstrom09,
  author    = {Jakob Nordstr{\"{o}}m},
  title     = {Narrow Proofs May Be Spacious: Separating Space and Width in Resolution},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {59--121},
  year      = {2009},
  url       = {https://doi.org/10.1137/060668250},
  doi       = {10.1137/060668250},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Nordstrom09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PaghPR09,
  author    = {Anna Pagh and
               Rasmus Pagh and
               Milan Ruzic},
  title     = {Linear Probing with Constant Independence},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1107--1120},
  year      = {2009},
  url       = {https://doi.org/10.1137/070702278},
  doi       = {10.1137/070702278},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PaghPR09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ParkHNS09,
  author    = {GaHyun Park and
               Hsien{-}Kuei Hwang and
               Pierre Nicod{\`{e}}me and
               Wojciech Szpankowski},
  title     = {Profiles of Tries},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1821--1880},
  year      = {2009},
  url       = {https://doi.org/10.1137/070685531},
  doi       = {10.1137/070685531},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ParkHNS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatrascuT09,
  author    = {Mihai Patrascu and
               Mikkel Thorup},
  title     = {Higher Lower Bounds for Near-Neighbor and Further Rich Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {730--741},
  year      = {2009},
  url       = {https://doi.org/10.1137/070684859},
  doi       = {10.1137/070684859},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PatrascuT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rao09,
  author    = {Anup Rao},
  title     = {Extractors for a Constant Number of Polynomially Small Min-Entropy
               Independent Sources},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {168--194},
  year      = {2009},
  url       = {https://doi.org/10.1137/060671218},
  doi       = {10.1137/060671218},
  timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Rao09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RaskhodnikovaRSS09,
  author    = {Sofya Raskhodnikova and
               Dana Ron and
               Amir Shpilka and
               Adam D. Smith},
  title     = {Strong Lower Bounds for Approximating Distribution Support Size and
               the Distinct Elements Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {813--842},
  year      = {2009},
  url       = {https://doi.org/10.1137/070701649},
  doi       = {10.1137/070701649},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RaskhodnikovaRSS09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RegevT09,
  author    = {Oded Regev and
               Ben Toner},
  title     = {Simulating Quantum Correlations with Finite Communication},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1562--1580},
  year      = {2009},
  url       = {https://doi.org/10.1137/080723909},
  doi       = {10.1137/080723909},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RegevT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SamorodnitskyT09,
  author    = {Alex Samorodnitsky and
               Luca Trevisan},
  title     = {Gowers Uniformity, Influence of Variables, and PCPs},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {323--360},
  year      = {2009},
  url       = {https://doi.org/10.1137/070681612},
  doi       = {10.1137/070681612},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SamorodnitskyT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Santhanam09,
  author    = {Rahul Santhanam},
  title     = {Circuit Lower Bounds for Merlin--Arthur Classes},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1038--1061},
  year      = {2009},
  url       = {https://doi.org/10.1137/070702680},
  doi       = {10.1137/070702680},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Santhanam09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchmidWK09,
  author    = {Ulrich Schmid and
               Bettina Weiss and
               Idit Keidar},
  title     = {Impossibility Results and Lower Bounds for Consensus under Link Failures},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1912--1951},
  year      = {2009},
  url       = {https://doi.org/10.1137/S009753970443999X},
  doi       = {10.1137/S009753970443999X},
  timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SchmidWK09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchulmanW09,
  author    = {Rebecca Schulman and
               Erik Winfree},
  title     = {Programmable Control of Nucleation for Algorithmic Self-Assembly},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {4},
  pages     = {1581--1616},
  year      = {2009},
  url       = {https://doi.org/10.1137/070680266},
  doi       = {10.1137/070680266},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SchulmanW09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Semaev09,
  author    = {Igor A. Semaev},
  title     = {Sparse Algebraic Equations over Finite Fields},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {388--409},
  year      = {2009},
  url       = {https://doi.org/10.1137/070700371},
  doi       = {10.1137/070700371},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Semaev09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShaltielU09,
  author    = {Ronen Shaltiel and
               Christopher Umans},
  title     = {Low-End Uniform Hardness versus Randomness Tradeoffs for {AM}},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {1006--1037},
  year      = {2009},
  url       = {https://doi.org/10.1137/070698348},
  doi       = {10.1137/070698348},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ShaltielU09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sherstov09,
  author    = {Alexander A. Sherstov},
  title     = {SeparatingAC\({}^{\mbox{0}}\) from Depth-2 Majority Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2113--2129},
  year      = {2009},
  url       = {https://doi.org/10.1137/08071421X},
  doi       = {10.1137/08071421X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Sherstov09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Shpilka09,
  author    = {Amir Shpilka},
  title     = {Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication
               Gates},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2130--2161},
  year      = {2009},
  url       = {https://doi.org/10.1137/070694879},
  doi       = {10.1137/070694879},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Shpilka09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SpakowskiT09,
  author    = {Holger Spakowski and
               Rahul Tripathi},
  title     = {Hierarchical Unambiguity},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {2079--2112},
  year      = {2009},
  url       = {https://doi.org/10.1137/07068196X},
  doi       = {10.1137/07068196X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SpakowskiT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StracciaOD09,
  author    = {Umberto Straccia and
               Manuel Ojeda{-}Aciego and
               Carlos Viegas Dam{\'{a}}sio},
  title     = {On Fixed-Points of Multivalued Functions on Complete Lattices and
               Their Application to Generalized Logic Programs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1881--1911},
  year      = {2009},
  url       = {https://doi.org/10.1137/070695976},
  doi       = {10.1137/070695976},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/StracciaOD09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vershynin09,
  author    = {Roman Vershynin},
  title     = {Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity
               of the Simplex Method},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {2},
  pages     = {646--678},
  year      = {2009},
  url       = {https://doi.org/10.1137/070683386},
  doi       = {10.1137/070683386},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Vershynin09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VillangerHPT09,
  author    = {Yngve Villanger and
               Pinar Heggernes and
               Christophe Paul and
               Jan Arne Telle},
  title     = {Interval Completion Is Fixed Parameter Tractable},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {2007--2020},
  year      = {2009},
  url       = {https://doi.org/10.1137/070710913},
  doi       = {10.1137/070710913},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/VillangerHPT09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Watrous09,
  author    = {John Watrous},
  title     = {Zero-Knowledge against Quantum Attacks},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {1},
  pages     = {25--58},
  year      = {2009},
  url       = {https://doi.org/10.1137/060670997},
  doi       = {10.1137/060670997},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Watrous09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/XiaoLXJ09,
  author    = {Jing Xiao and
               Lan Liu and
               Lirong Xia and
               Tao Jiang},
  title     = {Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes
               on a Pedigree Based on Fast Elimination of Redundant Linear Equations},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {6},
  pages     = {2198--2219},
  year      = {2009},
  url       = {https://doi.org/10.1137/070687591},
  doi       = {10.1137/070687591},
  timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/XiaoLXJ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zhang09,
  author    = {Shengyu Zhang},
  title     = {Tight Bounds for Randomized and Quantum Local Search},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {3},
  pages     = {948--977},
  year      = {2009},
  url       = {https://doi.org/10.1137/06066775X},
  doi       = {10.1137/06066775X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Zhang09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovB08,
  author    = {Dorit Aharonov and
               Michael Ben{-}Or},
  title     = {Fault-Tolerant Quantum Computation with Constant Error Rate},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1207--1282},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539799359385},
  doi       = {10.1137/S0097539799359385},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AharonovB08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlekhnovichR08,
  author    = {Michael Alekhnovich and
               Alexander A. Razborov},
  title     = {Resolution Is Not Automatizable Unless {W[P]} Is Tractable},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1347--1363},
  year      = {2008},
  url       = {https://doi.org/10.1137/06066850X},
  doi       = {10.1137/06066850X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlekhnovichR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderHMPS08,
  author    = {Eric Allender and
               Lisa Hellerstein and
               Paul McCabe and
               Toniann Pitassi and
               Michael E. Saks},
  title     = {Minimizing Disjunctive Normal Form Formulas and AC\({}^{\mbox{0}}\)
               Circuits Given a Truth Table},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {63--84},
  year      = {2008},
  url       = {https://doi.org/10.1137/060664537},
  doi       = {10.1137/060664537},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AllenderHMPS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonS08,
  author    = {Noga Alon and
               Asaf Shapira},
  title     = {A Characterization of the (Natural) Graph Properties Testable with
               One-Sided Error},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1703--1727},
  year      = {2008},
  url       = {https://doi.org/10.1137/06064888X},
  doi       = {10.1137/06064888X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonS08a,
  author    = {Noga Alon and
               Asaf Shapira},
  title     = {Every Monotone Graph Property Is Testable},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {505--522},
  year      = {2008},
  url       = {https://doi.org/10.1137/050633445},
  doi       = {10.1137/050633445},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonS08a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnshelevichDKTWR08,
  author    = {Elliot Anshelevich and
               Anirban Dasgupta and
               Jon M. Kleinberg and
               {\'{E}}va Tardos and
               Tom Wexler and
               Tim Roughgarden},
  title     = {The Price of Stability for Network Design with Fair Cost Allocation},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1602--1623},
  year      = {2008},
  url       = {https://doi.org/10.1137/070680096},
  doi       = {10.1137/070680096},
  timestamp = {Sat, 30 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AnshelevichDKTWR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnshelevichKK08,
  author    = {Elliot Anshelevich and
               David Kempe and
               Jon M. Kleinberg},
  title     = {Stability of Load Balancing Algorithms in Dynamic Adversarial Systems},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1656--1673},
  year      = {2008},
  url       = {https://doi.org/10.1137/050639272},
  doi       = {10.1137/050639272},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AnshelevichKK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArcherLW08,
  author    = {Aaron Archer and
               Asaf Levin and
               David P. Williamson},
  title     = {A Faster, Better Approximation Algorithm for the Minimum Latency Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1472--1498},
  year      = {2008},
  url       = {https://doi.org/10.1137/07068151X},
  doi       = {10.1137/07068151X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArcherLW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArenasFL08,
  author    = {Marcelo Arenas and
               Wenfei Fan and
               Leonid Libkin},
  title     = {On the Complexity of Verifying Consistency of {XML} Specifications},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {841--880},
  year      = {2008},
  url       = {https://doi.org/10.1137/050646895},
  doi       = {10.1137/050646895},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArenasFL08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AronovH08,
  author    = {Boris Aronov and
               Sariel Har{-}Peled},
  title     = {On Approximating the Depth and Related Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {899--921},
  year      = {2008},
  url       = {https://doi.org/10.1137/060669474},
  doi       = {10.1137/060669474},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AronovH08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasDG08,
  author    = {Albert Atserias and
               Anuj Dawar and
               Martin Grohe},
  title     = {Preservation under Extensions on Well-Behaved Finite Structures},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1364--1381},
  year      = {2008},
  url       = {https://doi.org/10.1137/060658709},
  doi       = {10.1137/060658709},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AtseriasDG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaH08,
  author    = {Hagit Attiya and
               David Hay},
  title     = {Randomization Does Not Reduce the Average Delay in Parallel Packet
               Switches},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1613--1636},
  year      = {2008},
  url       = {https://doi.org/10.1137/050648250},
  doi       = {10.1137/050648250},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AttiyaH08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AugustineIS08,
  author    = {John Augustine and
               Sandy Irani and
               Chaitanya Swamy},
  title     = {Optimal Power-Down Strategies},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1499--1516},
  year      = {2008},
  url       = {https://doi.org/10.1137/05063787X},
  doi       = {10.1137/05063787X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AugustineIS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaevRS08,
  author    = {Ivan D. Baev and
               Rajmohan Rajaraman and
               Chaitanya Swamy},
  title     = {Approximation Algorithms for Data Placement Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1411--1429},
  year      = {2008},
  url       = {https://doi.org/10.1137/080715421},
  doi       = {10.1137/080715421},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BaevRS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaloghBGR08,
  author    = {J{\'{a}}nos Balogh and
               J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
               G{\'{a}}bor Galambos and
               Gerhard Reinelt},
  title     = {Lower Bound for the Online Bin Packing Problem with Restricted Repacking},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {398--410},
  year      = {2008},
  url       = {https://doi.org/10.1137/050647049},
  doi       = {10.1137/050647049},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BaloghBGR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalCS08,
  author    = {Nikhil Bansal and
               Don Coppersmith and
               Maxim Sviridenko},
  title     = {Improved Approximation Algorithms for Broadcast Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1157--1174},
  year      = {2008},
  url       = {https://doi.org/10.1137/060674417},
  doi       = {10.1137/060674417},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BansalCS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bar-YossefJK08,
  author    = {Ziv Bar{-}Yossef and
               T. S. Jayram and
               Iordanis Kerenidis},
  title     = {Exponential Separation of Quantum and Classical One-Way Communication
               Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {366--384},
  year      = {2008},
  url       = {https://doi.org/10.1137/060651835},
  doi       = {10.1137/060651835},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Bar-YossefJK08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakG08,
  author    = {Boaz Barak and
               Oded Goldreich},
  title     = {Universal Arguments and their Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1661--1694},
  year      = {2008},
  url       = {https://doi.org/10.1137/070709244},
  doi       = {10.1137/070709244},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarakG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeimelCNW08,
  author    = {Amos Beimel and
               Paz Carmi and
               Kobbi Nissim and
               Enav Weinreb},
  title     = {Private Approximation of Search Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1728--1760},
  year      = {2008},
  url       = {https://doi.org/10.1137/060671899},
  doi       = {10.1137/060671899},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeimelCNW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-SassonS08,
  author    = {Eli Ben{-}Sasson and
               Madhu Sudan},
  title     = {Short PCPs with Polylog Query Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {551--607},
  year      = {2008},
  url       = {https://doi.org/10.1137/050646445},
  doi       = {10.1137/050646445},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-SassonS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergG08,
  author    = {Mark de Berg and
               Chris Gray},
  title     = {Vertical Ray Shooting and Computing Depth Orders for Fat Objects},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {257--275},
  year      = {2008},
  url       = {https://doi.org/10.1137/060672261},
  doi       = {10.1137/060672261},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BergG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BezakovaSVV08,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Daniel Stefankovic and
               Vijay V. Vazirani and
               Eric Vigoda},
  title     = {Accelerating Simulated Annealing for the Permanent and Combinatorial
               Counting Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1429--1454},
  year      = {2008},
  url       = {https://doi.org/10.1137/050644033},
  doi       = {10.1137/050644033},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BezakovaSVV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BojanczykC08,
  author    = {Mikolaj Bojanczyk and
               Thomas Colcombet},
  title     = {Tree-Walking Automata Do Not Recognize All Regular Languages},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {658--701},
  year      = {2008},
  url       = {https://doi.org/10.1137/050645427},
  doi       = {10.1137/050645427},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BojanczykC08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Brattka08,
  author    = {Vasco Brattka},
  title     = {Plottable Real Number Functions and the Computable Graph Theorem},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {303--328},
  year      = {2008},
  url       = {https://doi.org/10.1137/060658023},
  doi       = {10.1137/060658023},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Brattka08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumGKRTW08,
  author    = {Adam L. Buchsbaum and
               Loukas Georgiadis and
               Haim Kaplan and
               Anne Rogers and
               Robert Endre Tarjan and
               Jeffery R. Westbrook},
  title     = {Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1533--1573},
  year      = {2008},
  url       = {https://doi.org/10.1137/070693217},
  doi       = {10.1137/070693217},
  timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BuchsbaumGKRTW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFNR08,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Ilan Newman and
               Hein R{\"{o}}hrig},
  title     = {Quantum Property Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1387--1400},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539704442416},
  doi       = {10.1137/S0097539704442416},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BuhrmanFNR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanLL08,
  author    = {Ho{-}Leung Chan and
               Tak Wah Lam and
               Kin{-}Shing Liu},
  title     = {Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines
               for Flow Time Scheduling},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1595--1612},
  year      = {2008},
  url       = {https://doi.org/10.1137/060653445},
  doi       = {10.1137/060653445},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChanLL08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chen08,
  author    = {Hubie Chen},
  title     = {The Complexity of Quantified Constraint Satisfaction: Collapsibility,
               Sink Algebras, and the Three-Element Case},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1674--1701},
  year      = {2008},
  url       = {https://doi.org/10.1137/060668572},
  doi       = {10.1137/060668572},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Chen08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenH08,
  author    = {Ke Chen and
               Sariel Har{-}Peled},
  title     = {The Euclidean Orienteering Problem Revisited},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {385--397},
  year      = {2008},
  url       = {https://doi.org/10.1137/060667839},
  doi       = {10.1137/060667839},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenH08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengNVW08,
  author    = {Siu{-}Wing Cheng and
               Hyeon{-}Suk Na and
               Antoine Vigneron and
               Yajun Wang},
  title     = {Approximate Shortest Paths in Anisotropic Regions},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {802--824},
  year      = {2008},
  url       = {https://doi.org/10.1137/06067777X},
  doi       = {10.1137/06067777X},
  timestamp = {Wed, 18 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChengNVW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenP08,
  author    = {Reuven Cohen and
               David Peleg},
  title     = {Convergence of Autonomous Mobile Robots with Inaccurate Sensors and
               Movements},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {276--302},
  year      = {2008},
  url       = {https://doi.org/10.1137/060665257},
  doi       = {10.1137/060665257},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DamgardFSS08,
  author    = {Ivan Damg{\aa}rd and
               Serge Fehr and
               Louis Salvail and
               Christian Schaffner},
  title     = {Cryptography in the Bounded-Quantum-Storage Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1865--1890},
  year      = {2008},
  url       = {https://doi.org/10.1137/060651343},
  doi       = {10.1137/060651343},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DamgardFSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DekelSS08,
  author    = {Ofer Dekel and
               Shai Shalev{-}Shwartz and
               Yoram Singer},
  title     = {The Forgetron: {A} Kernel-Based Perceptron on a Budget},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1342--1372},
  year      = {2008},
  url       = {https://doi.org/10.1137/060666998},
  doi       = {10.1137/060666998},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DekelSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DemaineFHS08,
  author    = {Erik D. Demaine and
               Uriel Feige and
               MohammadTaghi Hajiaghayi and
               Mohammad R. Salavatipour},
  title     = {Combination Can Be Hard: Approximability of the Unique Coverage Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1464--1483},
  year      = {2008},
  url       = {https://doi.org/10.1137/060656048},
  doi       = {10.1137/060656048},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DemaineFHS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DemetrescuTCR08,
  author    = {Camil Demetrescu and
               Mikkel Thorup and
               Rezaul Alam Chowdhury and
               Vijaya Ramachandran},
  title     = {Oracles for Distances Avoiding a Failed Node or Link},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1299--1318},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539705429847},
  doi       = {10.1137/S0097539705429847},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DemetrescuTCR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurT08,
  author    = {Irit Dinur and
               {\'{E}}va Tardos},
  title     = {Special Issue on Foundations of Computer Science},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  year      = {2008},
  timestamp = {Fri, 20 Jun 2008 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DinurT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DodisORS08,
  author    = {Yevgeniy Dodis and
               Rafail Ostrovsky and
               Leonid Reyzin and
               Adam D. Smith},
  title     = {Fuzzy Extractors: How to Generate Strong Keys from Biometrics and
               Other Noisy Data},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {97--139},
  year      = {2008},
  url       = {https://doi.org/10.1137/060651380},
  doi       = {10.1137/060651380},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DodisORS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinEST08,
  author    = {Michael Elkin and
               Yuval Emek and
               Daniel A. Spielman and
               Shang{-}Hua Teng},
  title     = {Lower-Stretch Spanning Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {608--628},
  year      = {2008},
  url       = {https://doi.org/10.1137/050641661},
  doi       = {10.1137/050641661},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ElkinEST08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EmekP08,
  author    = {Yuval Emek and
               David Peleg},
  title     = {Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1761--1781},
  year      = {2008},
  url       = {https://doi.org/10.1137/060666202},
  doi       = {10.1137/060666202},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EmekP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EpsteinL08,
  author    = {Leah Epstein and
               Asaf Levin},
  title     = {An {APTAS} for Generalized Cost Variable-Sized Bin Packing},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {411--428},
  year      = {2008},
  url       = {https://doi.org/10.1137/060670328},
  doi       = {10.1137/060670328},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EpsteinL08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FarshiGG08,
  author    = {Mohammad Farshi and
               Panos Giannopoulos and
               Joachim Gudmundsson},
  title     = {Improving the Stretch Factor of a Geometric Network by Edge Augmentation},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {226--240},
  year      = {2008},
  url       = {https://doi.org/10.1137/050635675},
  doi       = {10.1137/050635675},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FarshiGG08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeHL08,
  author    = {Uriel Feige and
               MohammadTaghi Hajiaghayi and
               James R. Lee},
  title     = {Improved Approximation Algorithms for Minimum Weight Vertex Separators},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {629--657},
  year      = {2008},
  url       = {https://doi.org/10.1137/05064299X},
  doi       = {10.1137/05064299X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeigeHL08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigenbaumKMSZ08,
  author    = {Joan Feigenbaum and
               Sampath Kannan and
               Andrew McGregor and
               Siddharth Suri and
               Jian Zhang},
  title     = {Graph Distances in the Data-Stream Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1709--1727},
  year      = {2008},
  url       = {https://doi.org/10.1137/070683155},
  doi       = {10.1137/070683155},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeigenbaumKMSZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanOS08,
  author    = {Jon Feldman and
               Ryan O'Donnell and
               Rocco A. Servedio},
  title     = {Learning Mixtures of Product Distributions over Discrete Domains},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1536--1564},
  year      = {2008},
  url       = {https://doi.org/10.1137/060670705},
  doi       = {10.1137/060670705},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FeldmanOS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerM08,
  author    = {Eldar Fischer and
               Arie Matsliah},
  title     = {Testing Graph Isomorphism},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {207--225},
  year      = {2008},
  url       = {https://doi.org/10.1137/070680795},
  doi       = {10.1137/070680795},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleischerKKLT08,
  author    = {Rudolf Fleischer and
               Thomas Kamphans and
               Rolf Klein and
               Elmar Langetepe and
               Gerhard Trippen},
  title     = {Competitive Online Approximation of the Optimal Search Ratio},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {881--898},
  year      = {2008},
  url       = {https://doi.org/10.1137/060662204},
  doi       = {10.1137/060662204},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FleischerKKLT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominKTV08,
  author    = {Fedor V. Fomin and
               Dieter Kratsch and
               Ioan Todinca and
               Yngve Villanger},
  title     = {Exact Algorithms for Treewidth and Minimum Fill-In},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1058--1079},
  year      = {2008},
  url       = {https://doi.org/10.1137/050643350},
  doi       = {10.1137/050643350},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FominKTV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GavinskyKKRW08,
  author    = {Dmitry Gavinsky and
               Julia Kempe and
               Iordanis Kerenidis and
               Ran Raz and
               Ronald de Wolf},
  title     = {Exponential Separation for One-Way Quantum Communication Complexity,
               with Applications to Cryptography},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {5},
  pages     = {1695--1708},
  year      = {2008},
  url       = {https://doi.org/10.1137/070706550},
  doi       = {10.1137/070706550},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GavinskyKKRW08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GilHSZ08,
  author    = {{\`{A}}ngel J. Gil and
               Miki Hermann and
               Gernot Salzer and
               Bruno Zanuttini},
  title     = {Efficient Algorithms for Description Problems over Finite Totally
               Ordered Domains},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {922--945},
  year      = {2008},
  url       = {https://doi.org/10.1137/050635900},
  doi       = {10.1137/050635900},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GilHSZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserPSZ08,
  author    = {Christian Gla{\ss}er and
               Aduri Pavan and
               Alan L. Selman and
               Liyu Zhang},
  title     = {Splitting NP-Complete Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1517--1535},
  year      = {2008},
  url       = {https://doi.org/10.1137/060673886},
  doi       = {10.1137/060673886},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GlasserPSZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Goldberg08,
  author    = {Andrew V. Goldberg},
  title     = {A Practical Shortest Path Algorithm with Linear Expected Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1637--1655},
  year      = {2008},
  url       = {https://doi.org/10.1137/070698774},
  doi       = {10.1137/070698774},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Goldberg08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gopalan08,
  author    = {Parikshit Gopalan},
  title     = {Query-Efficient Algorithms for Polynomial Interpolation over Composites},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1033--1057},
  year      = {2008},
  url       = {https://doi.org/10.1137/060661259},
  doi       = {10.1137/060661259},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Gopalan08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoyalKS08,
  author    = {Navin Goyal and
               Guy Kindler and
               Michael E. Saks},
  title     = {Lower Bounds for the Noisy Broadcast Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1806--1841},
  year      = {2008},
  url       = {https://doi.org/10.1137/060654864},
  doi       = {10.1137/060654864},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GoyalKS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniKPS08,
  author    = {Fabrizio Grandoni and
               Jochen K{\"{o}}nemann and
               Alessandro Panconesi and
               Mauro Sozio},
  title     = {A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex
               Cover},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {825--840},
  year      = {2008},
  url       = {https://doi.org/10.1137/06065310X},
  doi       = {10.1137/06065310X},
  timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GrandoniKPS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Halman08,
  author    = {Nir Halman},
  title     = {On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type
               Theorems and the Discrete LP-Type Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {1--45},
  year      = {2008},
  url       = {https://doi.org/10.1137/060656309},
  doi       = {10.1137/060656309},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Halman08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HariharanKM08,
  author    = {Ramesh Hariharan and
               Telikepalli Kavitha and
               Kurt Mehlhorn},
  title     = {Faster Algorithms for Minimum Cycle Basis in Directed Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1430--1447},
  year      = {2008},
  url       = {https://doi.org/10.1137/060670730},
  doi       = {10.1137/060670730},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HariharanKM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaxellNR08,
  author    = {Penny E. Haxell and
               Brendan Nagle and
               Vojtech R{\"{o}}dl},
  title     = {An Algorithmic Version of the Hypergraph Regularity Method},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1728--1776},
  year      = {2008},
  url       = {https://doi.org/10.1137/060652385},
  doi       = {10.1137/060652385},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HaxellNR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HlinenyO08,
  author    = {Petr Hlinen{\'{y}} and
               Sang{-}il Oum},
  title     = {Finding Branch-Decompositions and Rank-Decompositions},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1012--1032},
  year      = {2008},
  url       = {https://doi.org/10.1137/070685920},
  doi       = {10.1137/070685920},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HlinenyO08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JainS08,
  author    = {Sanjay Jain and
               Frank Stephan},
  title     = {Mitotic Classes in Inductive Inference},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1283--1299},
  year      = {2008},
  url       = {https://doi.org/10.1137/070700577},
  doi       = {10.1137/070700577},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JainS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JainV08,
  author    = {Kamal Jain and
               Vijay V. Vazirani},
  title     = {Equitable Cost Allocations via Primal--Dual-Type Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {241--256},
  year      = {2008},
  url       = {https://doi.org/10.1137/060658448},
  doi       = {10.1137/060658448},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JainV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JonssonKN08,
  author    = {Peter Jonsson and
               Fredrik Kuivinen and
               Gustav Nordh},
  title     = {{MAX} {ONES} Generalized to Larger Domains},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {329--365},
  year      = {2008},
  url       = {https://doi.org/10.1137/060669231},
  doi       = {10.1137/060669231},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JonssonKN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JurdzinskiPZ08,
  author    = {Marcin Jurdzinski and
               Mike Paterson and
               Uri Zwick},
  title     = {A Deterministic Subexponential Algorithm for Solving Parity Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1519--1532},
  year      = {2008},
  url       = {https://doi.org/10.1137/070686652},
  doi       = {10.1137/070686652},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JurdzinskiPZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KalaiKMS08,
  author    = {Adam Tauman Kalai and
               Adam R. Klivans and
               Yishay Mansour and
               Rocco A. Servedio},
  title     = {Agnostically Learning Halfspaces},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1777--1805},
  year      = {2008},
  url       = {https://doi.org/10.1137/060649057},
  doi       = {10.1137/060649057},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KalaiKMS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanSV08,
  author    = {Ravindran Kannan and
               Hadi Salmasian and
               Santosh S. Vempala},
  title     = {The Spectral Method for General Mixture Models},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1141--1156},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539704445925},
  doi       = {10.1137/S0097539704445925},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KannanSV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanRSV08,
  author    = {Haim Kaplan and
               Natan Rubin and
               Micha Sharir and
               Elad Verbin},
  title     = {Efficient Colored Orthogonal Range Counting},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {982--1011},
  year      = {2008},
  url       = {https://doi.org/10.1137/070684483},
  doi       = {10.1137/070684483},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaplanRSV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhotN08,
  author    = {Subhash Khot and
               Assaf Naor},
  title     = {Linear Equations Modulo 2 and the L\({}_{\mbox{1}}\) Diameter of Convex
               Bodies},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1448--1463},
  year      = {2008},
  url       = {https://doi.org/10.1137/070691140},
  doi       = {10.1137/070691140},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KhotN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KijimaM08,
  author    = {Shuji Kijima and
               Tomomi Matsui},
  title     = {Approximation Algorithm and Perfect Sampler for Closed Jackson Networks
               with Single Servers},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1484--1503},
  year      = {2008},
  url       = {https://doi.org/10.1137/06064980X},
  doi       = {10.1137/06064980X},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KijimaM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Klein08,
  author    = {Philip N. Klein},
  title     = {A Linear-Time Approximation Scheme for {TSP} in Undirected Planar
               Graphs with Edge-Weights},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1926--1952},
  year      = {2008},
  url       = {https://doi.org/10.1137/060649562},
  doi       = {10.1137/060649562},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Klein08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KleinbergSS08,
  author    = {Jon M. Kleinberg and
               Mark Sandler and
               Aleksandrs Slivkins},
  title     = {Network Failure Detection and Graph Connectivity},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1330--1346},
  year      = {2008},
  url       = {https://doi.org/10.1137/070697793},
  doi       = {10.1137/070697793},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KleinbergSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannLSZ08,
  author    = {Jochen K{\"{o}}nemann and
               Stefano Leonardi and
               Guido Sch{\"{a}}fer and
               Stefan H. M. van Zwam},
  title     = {A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest
               Game},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1319--1341},
  year      = {2008},
  url       = {https://doi.org/10.1137/050646408},
  doi       = {10.1137/050646408},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KonemannLSZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LaplanteM08,
  author    = {Sophie Laplante and
               Fr{\'{e}}d{\'{e}}ric Magniez},
  title     = {Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov
               Arguments},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {46--62},
  year      = {2008},
  url       = {https://doi.org/10.1137/050639090},
  doi       = {10.1137/050639090},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LaplanteM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LevySV08,
  author    = {Jordi Levy and
               Manfred Schmidt{-}Schau{\ss} and
               Mateu Villaret},
  title     = {The Complexity of Monadic Second-Order Unification},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1113--1140},
  year      = {2008},
  url       = {https://doi.org/10.1137/050645403},
  doi       = {10.1137/050645403},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LevySV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LutzM08,
  author    = {Jack H. Lutz and
               Elvira Mayordomo},
  title     = {Dimensions of Points in Self-Similar Fractals},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1080--1112},
  year      = {2008},
  url       = {https://doi.org/10.1137/070684689},
  doi       = {10.1137/070684689},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/LutzM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MaheshwariZ08,
  author    = {Anil Maheshwari and
               Norbert Zeh},
  title     = {I/O-Efficient Planar Separators},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {767--801},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539705446925},
  doi       = {10.1137/S0097539705446925},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MaheshwariZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Manthey08,
  author    = {Bodo Manthey},
  title     = {On Approximating Restricted Cycle Covers},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {181--206},
  year      = {2008},
  url       = {https://doi.org/10.1137/060676003},
  doi       = {10.1137/060676003},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Manthey08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MarkovS08,
  author    = {Igor L. Markov and
               Yaoyun Shi},
  title     = {Simulating Quantum Computation by Contracting Tensor Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {963--981},
  year      = {2008},
  url       = {https://doi.org/10.1137/050644756},
  doi       = {10.1137/050644756},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MarkovS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Marx08,
  author    = {D{\'{a}}niel Marx},
  title     = {Closest Substring Problems with Small Distances},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1382--1410},
  year      = {2008},
  url       = {https://doi.org/10.1137/060673898},
  doi       = {10.1137/060673898},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Marx08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MeyersonMP08,
  author    = {Adam Meyerson and
               Kamesh Munagala and
               Serge A. Plotkin},
  title     = {Cost-Distance: Two Metric Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1648--1659},
  year      = {2008},
  url       = {https://doi.org/10.1137/050629665},
  doi       = {10.1137/050629665},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MeyersonMP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MooreRS08,
  author    = {Cristopher Moore and
               Alexander Russell and
               Leonard J. Schulman},
  title     = {The Symmetric Group Defies Strong Fourier Sampling},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1842--1864},
  year      = {2008},
  url       = {https://doi.org/10.1137/050644896},
  doi       = {10.1137/050644896},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MooreRS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Morris08,
  author    = {Ben Morris},
  title     = {The Mixing Time of the Thorp Shuffle},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {484--504},
  year      = {2008},
  url       = {https://doi.org/10.1137/050636231},
  doi       = {10.1137/050636231},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Morris08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MoshkovitzR08,
  author    = {Dana Moshkovitz and
               Ran Raz},
  title     = {Sub-Constant Error Low Degree Test of Almost-Linear Size},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {140--180},
  year      = {2008},
  url       = {https://doi.org/10.1137/060656838},
  doi       = {10.1137/060656838},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MoshkovitzR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MostefaouiRRT08,
  author    = {Achour Most{\'{e}}faoui and
               Sergio Rajsbaum and
               Michel Raynal and
               Corentin Travers},
  title     = {The Combined Power of Conditions and Information on Failures to Solve
               Asynchronous Set Agreement},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1574--1601},
  year      = {2008},
  url       = {https://doi.org/10.1137/050645580},
  doi       = {10.1137/050645580},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MostefaouiRRT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MulmuleyS08,
  author    = {Ketan Mulmuley and
               Milind A. Sohoni},
  title     = {Geometric Complexity Theory {II:} Towards Explicit Obstructions for
               Embeddings among Class Varieties},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {1175--1206},
  year      = {2008},
  url       = {https://doi.org/10.1137/080718115},
  doi       = {10.1137/080718115},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/MulmuleyS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NguyenSHSMZ08,
  author    = {C. Thach Nguyen and
               Jian Shen and
               Minmei Hou and
               Li Sheng and
               Webb Miller and
               Louxin Zhang},
  title     = {Approximating the Spanning Star Forest Problem and Its Application
               to Genomic Sequence Alignment},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {946--962},
  year      = {2008},
  url       = {https://doi.org/10.1137/070682150},
  doi       = {10.1137/070682150},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NguyenSHSMZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NickersonS08,
  author    = {Bradford G. Nickerson and
               Qingxiu Shi},
  title     = {On k-d Range Search with Patricia Tries},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1373--1386},
  year      = {2008},
  url       = {https://doi.org/10.1137/060653780},
  doi       = {10.1137/060653780},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/NickersonS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PaghP08,
  author    = {Anna Pagh and
               Rasmus Pagh},
  title     = {Uniform Hashing in Constant Time and Optimal Space},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {85--96},
  year      = {2008},
  url       = {https://doi.org/10.1137/060658400},
  doi       = {10.1137/060658400},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PaghP08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PassR08,
  author    = {Rafael Pass and
               Alon Rosen},
  title     = {Concurrent Nonmalleable Commitments},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {6},
  pages     = {1891--1925},
  year      = {2008},
  url       = {https://doi.org/10.1137/060661880},
  doi       = {10.1137/060661880},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PassR08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PassR08a,
  author    = {Rafael Pass and
               Alon Rosen},
  title     = {New and Improved Constructions of Nonmalleable Cryptographic Protocols},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {702--752},
  year      = {2008},
  url       = {https://doi.org/10.1137/060671553},
  doi       = {10.1137/060671553},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/PassR08a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RazSY08,
  author    = {Ran Raz and
               Amir Shpilka and
               Amir Yehudayoff},
  title     = {A Lower Bound for the Size of Syntactically Multilinear Arithmetic
               Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1624--1647},
  year      = {2008},
  url       = {https://doi.org/10.1137/070707932},
  doi       = {10.1137/070707932},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RazSY08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RodittyZ08,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Improved Dynamic Reachability Algorithms for Directed Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1455--1471},
  year      = {2008},
  url       = {https://doi.org/10.1137/060650271},
  doi       = {10.1137/060650271},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RubinS08,
  author    = {Karl Rubin and
               Alice Silverberg},
  title     = {Compression in Finite Fields and Torus-Based Cryptography},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1401--1428},
  year      = {2008},
  url       = {https://doi.org/10.1137/060676155},
  doi       = {10.1137/060676155},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RubinS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SanghviV08,
  author    = {Saurabh Sanghvi and
               Salil P. Vadhan},
  title     = {The Round Complexity of Two-Party Random Selection},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {523--550},
  year      = {2008},
  url       = {https://doi.org/10.1137/050641715},
  doi       = {10.1137/050641715},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SanghviV08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SantisCPY08,
  author    = {Alfredo De Santis and
               Giovanni Di Crescenzo and
               Giuseppe Persiano and
               Moti Yung},
  title     = {On Monotone Formula Composition of Perfect Zero-Knowledge Languages},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1300--1329},
  year      = {2008},
  url       = {https://doi.org/10.1137/S0097539798346123},
  doi       = {10.1137/S0097539798346123},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/SantisCPY08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShiZ08,
  author    = {Yaoyun Shi and
               Yufan Zhu},
  title     = {Tensor Norms and the Classical Communication Complexity of Nonlocal
               Quantum Measurement},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {3},
  pages     = {753--766},
  year      = {2008},
  url       = {https://doi.org/10.1137/050644768},
  doi       = {10.1137/050644768},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ShiZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Toth08,
  author    = {Csaba D. T{\'{o}}th},
  title     = {Binary Space Partitions for Axis-Aligned Fat Rectangles},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {1},
  pages     = {429--447},
  year      = {2008},
  url       = {https://doi.org/10.1137/06065934X},
  doi       = {10.1137/06065934X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Toth08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Trifonov08,
  author    = {Vladimir Trifonov},
  title     = {An O(logn loglogn) Space Algorithm for Undirected st-Connectivity},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {2},
  pages     = {449--483},
  year      = {2008},
  url       = {https://doi.org/10.1137/050642381},
  doi       = {10.1137/050642381},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Trifonov08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Valiant08,
  author    = {Leslie G. Valiant},
  title     = {Holographic Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1565--1594},
  year      = {2008},
  url       = {https://doi.org/10.1137/070682575},
  doi       = {10.1137/070682575},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Valiant08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WangLL08,
  author    = {Lusheng Wang and
               Yu Lin and
               Xiaowen Liu},
  title     = {Approximation Algorithms for Biclustering Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1504--1518},
  year      = {2008},
  url       = {https://doi.org/10.1137/060664112},
  doi       = {10.1137/060664112},
  timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/WangLL08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbrahamIKM07,
  author    = {David J. Abraham and
               Robert W. Irving and
               Telikepalli Kavitha and
               Kurt Mehlhorn},
  title     = {Popular Matchings},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1030--1045},
  year      = {2007},
  url       = {https://doi.org/10.1137/06067328X},
  doi       = {10.1137/06067328X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AbrahamIKM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AchlioptasK07,
  author    = {Dimitris Achlioptas and
               Vladlen Koltun},
  title     = {Special Section on Foundations of Computer Science},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {165},
  year      = {2007},
  timestamp = {Sat, 02 Jun 2007 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AchlioptasK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovDKLLR07,
  author    = {Dorit Aharonov and
               Wim van Dam and
               Julia Kempe and
               Zeph Landau and
               Seth Lloyd and
               Oded Regev},
  title     = {Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {166--194},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447323},
  doi       = {10.1137/S0097539705447323},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AharonovDKLLR07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovT07,
  author    = {Dorit Aharonov and
               Amnon Ta{-}Shma},
  title     = {Adiabatic Quantum State Generation},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {47--82},
  year      = {2007},
  url       = {https://doi.org/10.1137/060648829},
  doi       = {10.1137/060648829},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AharonovT07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AielloL07,
  author    = {William Aiello and
               Frank Thomson Leighton},
  title     = {Hamming Codes, Hypercube Embeddings, and Fault Tolerance},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {783--803},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539798332464},
  doi       = {10.1137/S0097539798332464},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AielloL07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlekhnovichB07,
  author    = {Mikhail Alekhnovich and
               Eli Ben{-}Sasson},
  title     = {Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1248--1263},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704440107},
  doi       = {10.1137/S0097539704440107},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlekhnovichB07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlekseyevP07,
  author    = {Max A. Alekseyev and
               Pavel A. Pevzner},
  title     = {Whole Genome Duplications and Contracted Breakpoint Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1748--1763},
  year      = {2007},
  url       = {https://doi.org/10.1137/05064727X},
  doi       = {10.1137/05064727X},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlekseyevP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonFN07,
  author    = {Noga Alon and
               Eldar Fischer and
               Ilan Newman},
  title     = {Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {959--976},
  year      = {2007},
  url       = {https://doi.org/10.1137/050627915},
  doi       = {10.1137/050627915},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AlonFN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ambainis07,
  author    = {Andris Ambainis},
  title     = {Quantum Walk Algorithm for Element Distinctness},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {210--239},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447311},
  doi       = {10.1137/S0097539705447311},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ambainis07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndrewsZ07,
  author    = {Matthew Andrews and
               Lisa Zhang},
  title     = {Hardness of the Undirected Congestion Minimization Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {112--131},
  year      = {2007},
  url       = {https://doi.org/10.1137/050636899},
  doi       = {10.1137/050636899},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AndrewsZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArgeBDHM07,
  author    = {Lars Arge and
               Michael A. Bender and
               Erik D. Demaine and
               Bryan Holland{-}Minkley and
               J. Ian Munro},
  title     = {An Optimal Cache-Oblivious Priority Queue and Its Application to Graph
               Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1672--1695},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539703428324},
  doi       = {10.1137/S0097539703428324},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ArgeBDHM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AryaMMW07,
  author    = {Sunil Arya and
               Theocharis Malamatos and
               David M. Mount and
               Ka Chun Wong},
  title     = {Optimal Expected-Case Planar Point Location},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {584--610},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446724},
  doi       = {10.1137/S0097539704446724},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AryaMMW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AsanoMT07,
  author    = {Tetsuo Asano and
               Jir{\'{\i}} Matousek and
               Takeshi Tokuyama},
  title     = {Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1182--1198},
  year      = {2007},
  url       = {https://doi.org/10.1137/06067095X},
  doi       = {10.1137/06067095X},
  timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AsanoMT07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AthreyaHLM07,
  author    = {Krishna B. Athreya and
               John M. Hitchcock and
               Jack H. Lutz and
               Elvira Mayordomo},
  title     = {Effective Strong Dimension in Algorithmic Information and Computational
               Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {671--705},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539703446912},
  doi       = {10.1137/S0097539703446912},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AthreyaHLM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AwerbuchHKL07,
  author    = {Baruch Awerbuch and
               Mohammad Taghi Hajiaghayi and
               Robert Kleinberg and
               Tom Leighton},
  title     = {Localized Client-Server Load Balancing without Global Information},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1259--1279},
  year      = {2007},
  url       = {https://doi.org/10.1137/S009753970444661X},
  doi       = {10.1137/S009753970444661X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/AwerbuchHKL07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakOV07,
  author    = {Boaz Barak and
               Shien Jin Ong and
               Salil P. Vadhan},
  title     = {Derandomization in Cryptography},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {380--400},
  year      = {2007},
  url       = {https://doi.org/10.1137/050641958},
  doi       = {10.1137/050641958},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BarakOV07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeamePS07,
  author    = {Paul Beame and
               Toniann Pitassi and
               Nathan Segerlind},
  title     = {Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow
               from Multiparty Communication Complexity},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {845--869},
  year      = {2007},
  url       = {https://doi.org/10.1137/060654645},
  doi       = {10.1137/060654645},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BeamePS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-MosheKM07,
  author    = {Boaz Ben{-}Moshe and
               Matthew J. Katz and
               Joseph S. B. Mitchell},
  title     = {A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain
               Guarding},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1631--1647},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446384},
  doi       = {10.1137/S0097539704446384},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Ben-MosheKM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BerenbrinkFGGHM07,
  author    = {Petra Berenbrink and
               Tom Friedetzky and
               Leslie Ann Goldberg and
               Paul W. Goldberg and
               Zengjian Hu and
               Russell A. Martin},
  title     = {Distributed Selfish Load Balancing},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1163--1181},
  year      = {2007},
  url       = {https://doi.org/10.1137/060660345},
  doi       = {10.1137/060660345},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BerenbrinkFGGHM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumCKLMM07,
  author    = {Avrim Blum and
               Shuchi Chawla and
               David R. Karger and
               Terran Lane and
               Adam Meyerson and
               Maria Minkoff},
  title     = {Approximation Algorithms for Orienteering and Discounted-Reward {TSP}},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {653--670},
  year      = {2007},
  url       = {https://doi.org/10.1137/050645464},
  doi       = {10.1137/050645464},
  timestamp = {Sun, 17 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BlumCKLMM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonehCHK07,
  author    = {Dan Boneh and
               Ran Canetti and
               Shai Halevi and
               Jonathan Katz},
  title     = {Chosen-Ciphertext Security from Identity-Based Encryption},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1301--1328},
  year      = {2007},
  url       = {https://doi.org/10.1137/S009753970544713X},
  doi       = {10.1137/S009753970544713X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BonehCHK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BostanGS07,
  author    = {Alin Bostan and
               Pierrick Gaudry and
               {\'{E}}ric Schost},
  title     = {Linear Recurrences with Polynomial Coefficients and Application to
               Integer Factorization and Cartier-Manin Operator},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1777--1806},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704443793},
  doi       = {10.1137/S0097539704443793},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BostanGS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BradfordK07,
  author    = {Phillip G. Bradford and
               Michael N. Katehakis},
  title     = {A Probabilistic Study on Combinatorial Expanders and Hashing},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {83--111},
  year      = {2007},
  url       = {https://doi.org/10.1137/S009753970444630X},
  doi       = {10.1137/S009753970444630X},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BradfordK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BronnimannDDEGGLNW07,
  author    = {Herv{\'{e}} Br{\"{o}}nnimann and
               Olivier Devillers and
               Vida Dujmovic and
               Hazel Everett and
               Marc Glisse and
               Xavier Goaoc and
               Sylvain Lazard and
               Hyeon{-}Suk Na and
               Sue Whitesides},
  title     = {Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional
               Convex Polyhedra},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {522--551},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447116},
  doi       = {10.1137/S0097539705447116},
  timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BronnimannDDEGGLNW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuschMM07,
  author    = {Costas Busch and
               Malik Magdon{-}Ismail and
               Marios Mavronicolas},
  title     = {Universal Bufferless Packet Switching},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1139--1162},
  year      = {2007},
  url       = {https://doi.org/10.1137/050642095},
  doi       = {10.1137/050642095},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/BuschMM07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangC07,
  author    = {Guey{-}Yun Chang and
               Gen{-}Huey Chen},
  title     = {(t, k)-Diagnosability of Multiprocessor Systems with Applications
               to Grids and Tori},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1280--1298},
  year      = {2007},
  url       = {https://doi.org/10.1137/06065043X},
  doi       = {10.1137/06065043X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChangC07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenFKLMMPSSWW07,
  author    = {Ke Chen and
               Amos Fiat and
               Haim Kaplan and
               Meital Levy and
               Jir{\'{\i}} Matousek and
               Elchanan Mossel and
               J{\'{a}}nos Pach and
               Micha Sharir and
               Shakhar Smorodinsky and
               Uli Wagner and
               Emo Welzl},
  title     = {Online Conflict-Free Coloring for Intervals},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1342--1359},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446682},
  doi       = {10.1137/S0097539704446682},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenFKLMMPSSWW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenFKX07,
  author    = {Jianer Chen and
               Henning Fernau and
               Iyad A. Kanj and
               Ge Xia},
  title     = {Parametric Duality and Kernelization: Lower Bounds and Upper Bounds
               on Kernel Size},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1077--1106},
  year      = {2007},
  url       = {https://doi.org/10.1137/050646354},
  doi       = {10.1137/050646354},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenFKX07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenG07,
  author    = {Yijia Chen and
               Martin Grohe},
  title     = {An Isomorphism Between Subexponential and Parameterized Complexity
               Theory},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1228--1258},
  year      = {2007},
  url       = {https://doi.org/10.1137/070687153},
  doi       = {10.1137/070687153},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenG07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenHZ07,
  author    = {Xujin Chen and
               Xiaodong Hu and
               Wenan Zang},
  title     = {A Min-Max Theorem on Tournaments},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {923--937},
  year      = {2007},
  url       = {https://doi.org/10.1137/060649987},
  doi       = {10.1137/060649987},
  timestamp = {Tue, 10 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChenHZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengDRR07,
  author    = {Siu{-}Wing Cheng and
               Tamal K. Dey and
               Edgar A. Ramos and
               Tathagata Ray},
  title     = {Sampling and Meshing a Surface with Guaranteed Topology and Geometry},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1199--1227},
  year      = {2007},
  url       = {https://doi.org/10.1137/060665889},
  doi       = {10.1137/060665889},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChengDRR07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengW07,
  author    = {Qi Cheng and
               Daqing Wan},
  title     = {On the List and Bounded Distance Decodability of Reed-Solomon Codes},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {195--209},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447335},
  doi       = {10.1137/S0097539705447335},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChengW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChienS07,
  author    = {Steve Chien and
               Alistair Sinclair},
  title     = {Algebras with Polynomial Identities and Computing the Determinant},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {252--266},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447359},
  doi       = {10.1137/S0097539705447359},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChienS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChrobakGK07,
  author    = {Marek Chrobak and
               Leszek Gasieniec and
               Dariusz R. Kowalski},
  title     = {The Wake-Up Problem in MultiHop Radio Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1453--1471},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704442726},
  doi       = {10.1137/S0097539704442726},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChrobakGK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChrobakJST07,
  author    = {Marek Chrobak and
               Wojciech Jawor and
               Jir{\'{\i}} Sgall and
               Tom{\'{a}}s Tich{\'{y}}},
  title     = {Online Scheduling of Equal-Length Jobs: Randomization and Restarts
               Help},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1709--1728},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446608},
  doi       = {10.1137/S0097539704446608},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChrobakJST07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChuzhoyN07,
  author    = {Julia Chuzhoy and
               Joseph Naor},
  title     = {The Hardness of Metric Labeling},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1376--1386},
  year      = {2007},
  url       = {https://doi.org/10.1137/06065430X},
  doi       = {10.1137/06065430X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ChuzhoyN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CorreaG07,
  author    = {Jos{\'{e}} R. Correa and
               Michel X. Goemans},
  title     = {Improved Bounds on Nonblocking 3-Stage Clos Networks},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {870--894},
  year      = {2007},
  url       = {https://doi.org/10.1137/060656413},
  doi       = {10.1137/060656413},
  timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CorreaG07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DamMMS07,
  author    = {Wim van Dam and
               Fr{\'{e}}d{\'{e}}ric Magniez and
               Michele Mosca and
               Miklos Santha},
  title     = {Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {611--629},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539702404377},
  doi       = {10.1137/S0097539702404377},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DamMMS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DavidovitchDR07,
  author    = {Lior Davidovitch and
               Shlomi Dolev and
               Sergio Rajsbaum},
  title     = {Stability of Multivalued Continuous Consensus},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1057--1076},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446335},
  doi       = {10.1137/S0097539704446335},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DavidovitchDR07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DemaineHIP07,
  author    = {Erik D. Demaine and
               Dion Harmon and
               John Iacono and
               Mihai Patrascu},
  title     = {Dynamic Optimality - Almost},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {240--251},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447347},
  doi       = {10.1137/S0097539705447347},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DemaineHIP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DuttaGP07,
  author    = {Partha Dutta and
               Rachid Guerraoui and
               Bastian Pochon},
  title     = {The Time-Complexity of Local Decision in Distributed Agreement},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {722--756},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446220},
  doi       = {10.1137/S0097539704446220},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DuttaGP07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirS07,
  author    = {Zeev Dvir and
               Amir Shpilka},
  title     = {Locally Decodable Codes with Two Queries and Polynomial Identity Testing
               for Depth 3 Circuits},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1404--1434},
  year      = {2007},
  url       = {https://doi.org/10.1137/05063605X},
  doi       = {10.1137/05063605X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DvirS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkN07,
  author    = {Cynthia Dwork and
               Moni Naor},
  title     = {Zaps and Their Applications},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1513--1543},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539703426817},
  doi       = {10.1137/S0097539703426817},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DworkN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EisenbrandGOS07,
  author    = {Friedrich Eisenbrand and
               Fabrizio Grandoni and
               Gianpaolo Oriolo and
               Martin Skutella},
  title     = {New Approaches for Virtual Private Network Design},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {3},
  pages     = {706--721},
  year      = {2007},
  url       = {https://doi.org/10.1137/060654827},
  doi       = {10.1137/060654827},
  timestamp = {Mon, 11 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EisenbrandGOS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGH07,
  author    = {David Eppstein and
               Michael T. Goodrich and
               Daniel S. Hirschberg},
  title     = {Improved Combinatorial Group Testing Algorithms for Real-World Problem
               Sizes},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1360--1375},
  year      = {2007},
  url       = {https://doi.org/10.1137/050631847},
  doi       = {10.1137/050631847},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/EppsteinGH07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerN07,
  author    = {Eldar Fischer and
               Ilan Newman},
  title     = {Testing versus Estimation of Graph Properties},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {482--501},
  year      = {2007},
  url       = {https://doi.org/10.1137/060652324},
  doi       = {10.1137/060652324},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FischerN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleischerS07,
  author    = {Lisa Fleischer and
               Martin Skutella},
  title     = {Quickest Flows Over Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1600--1630},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539703427215},
  doi       = {10.1137/S0097539703427215},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FleischerS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeS07,
  author    = {Alan M. Frieze and
               Gregory B. Sorkin},
  title     = {The Probabilistic Relationship Between the Assignment and Asymmetric
               Traveling Salesman Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1435--1452},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539701391518},
  doi       = {10.1137/S0097539701391518},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FriezeS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FuW07,
  author    = {Bin Fu and
               Wei Wang},
  title     = {Geometric Separators and Their Applications to Protein Folding in
               the HP-Model},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1014--1029},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704440727},
  doi       = {10.1137/S0097539704440727},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/FuW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow07,
  author    = {Harold N. Gabow},
  title     = {Finding Paths and Cycles of Superpolylogarithmic Length},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1648--1671},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704445366},
  doi       = {10.1137/S0097539704445366},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Gabow07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargK07,
  author    = {Naveen Garg and
               Jochen K{\"{o}}nemann},
  title     = {Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional
               Packing Problems},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {630--652},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704446232},
  doi       = {10.1137/S0097539704446232},
  timestamp = {Wed, 14 Feb 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GargK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GurevichS07,
  author    = {Yuri Gurevich and
               Paul E. Schupp},
  title     = {Membership Problem for the Modular Group},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {2},
  pages     = {425--459},
  year      = {2007},
  url       = {https://doi.org/10.1137/050643295},
  doi       = {10.1137/050643295},
  timestamp = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/GurevichS07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HalevyK07,
  author    = {Shirley Halevy and
               Eyal Kushilevitz},
  title     = {Distribution-Free Property-Testing},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {4},
  pages     = {1107--1138},
  year      = {2007},
  url       = {https://doi.org/10.1137/050645804},
  doi       = {10.1137/050645804},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HalevyK07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HalperinKKSW07,
  author    = {Eran Halperin and
               Guy Kortsarz and
               Robert Krauthgamer and
               Aravind Srinivasan and
               Nan Wang},
  title     = {Integrality Ratio for Group Steiner Trees and Directed Steiner Trees},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1494--1511},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539704445718},
  doi       = {10.1137/S0097539704445718},
  timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HalperinKKSW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HararySV07,
  author    = {Frank Harary and
               Wolfgang Slany and
               Oleg Verbitsky},
  title     = {On the Computational Complexity of the Forcing Chromatic Number},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {1--19},
  year      = {2007},
  url       = {https://doi.org/10.1137/050641594},
  doi       = {10.1137/050641594},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HararySV07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHKW07,
  author    = {Lane A. Hemaspaandra and
               Christopher M. Homan and
               Sven Kosub and
               Klaus W. Wagner},
  title     = {The Complexity of Computing the Size of an Interval},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1264--1300},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447013},
  doi       = {10.1137/S0097539705447013},
  timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHKW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hitchcock07,
  author    = {John M. Hitchcock},
  title     = {Online Learning and Resource-Bounded Dimension: Winnow Yields New
               Lower Bounds for Hard Sets},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {6},
  pages     = {1696--1708},
  year      = {2007},
  url       = {https://doi.org/10.1137/050647517},
  doi       = {10.1137/050647517},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Hitchcock07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Jain07,
  author    = {Kamal Jain},
  title     = {A Polynomial Time Algorithm for Computing an Arrow-Debreu Market Equilibrium
               for Linear Utilities},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {1},
  pages     = {303--318},
  year      = {2007},
  url       = {https://doi.org/10.1137/S0097539705447384},
  doi       = {10.1137/S0097539705447384},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Jain07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KamidoiYN07,
  author    = {Yoko Kamidoi and
               Noriyoshi Yoshida and
               Hiroshi Nagamochi},
  title     = {A Deterministic Algorithm for Finding All Minimum k-Way Cuts},
  journal   = {{SIAM} J. Comput.},
  volume    = {36},
  number    = {5},
  pages     = {1329--1341},
  year      = {2007},
  url       = {https://doi.org/10.1137/050631616},
  doi       = {10.1137/050631616},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KamidoiYN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics