Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp38.bht:"
download as .bib file
@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 = {Thu, 14 Oct 2021 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/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/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/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 = {Sun, 22 Oct 2023 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/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/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 = {Wed, 18 Aug 2021 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/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 = {Mon, 26 Jun 2023 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, 14 Oct 2021 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/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/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/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 = {Sun, 25 Jul 2021 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/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/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/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, 30 Sep 2023 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/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/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/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 = {Mon, 26 Jun 2023 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/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/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 = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/XiaoLXJ09.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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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/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 = {Tue, 01 Jun 2021 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/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 = {Tue, 07 May 2024 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/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 = {Sun, 02 Oct 2022 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 = {Tue, 15 Feb 2022 00:00:00 +0100},
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 = {Tue, 14 Jun 2022 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/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 = {Fri, 09 Apr 2021 01:00:00 +0200},
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/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 = {Tue, 07 May 2024 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/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/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 = {Mon, 26 Oct 2020 00:00:00 +0100},
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 = {Sun, 02 Oct 2022 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/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, 30 Sep 2023 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 = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GilHSZ08.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/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, 03 Jan 2022 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/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/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/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 = {Tue, 12 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KleinbergSS08.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/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, 30 Sep 2023 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/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/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 = {Mon, 26 Jun 2023 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, 30 Sep 2023 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/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 = {Sun, 06 Aug 2023 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/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 = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WangLL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-27 12:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
