Search dblp for Publications

export results for "toc:db/journals/siamcomp/siamcomp33.bht:"

 download as .bib file

@article{DBLP:journals/siamcomp/AlonBKRS04,
  author       = {Noga Alon and
                  Richard Beigel and
                  Simon Kasif and
                  Steven Rudich and
                  Benny Sudakov},
  title        = {Learning a Hidden Matching},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {487--501},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702420139},
  doi          = {10.1137/S0097539702420139},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AlonBKRS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmanoM04,
  author       = {Kazuyuki Amano and
                  Akira Maruoka},
  title        = {The Potential of the Approximation Method},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {433--447},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970138445X},
  doi          = {10.1137/S009753970138445X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AmanoM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndrewsZ04,
  author       = {Matthew Andrews and
                  Lisa Zhang},
  title        = {The Effects of Temporary Sessions on Network Performance},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {659--673},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702417225},
  doi          = {10.1137/S0097539702417225},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AndrewsZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AryaGKMMP04,
  author       = {Vijay Arya and
                  Naveen Garg and
                  Rohit Khandekar and
                  Adam Meyerson and
                  Kamesh Munagala and
                  Vinayaka Pandit},
  title        = {Local Search Heuristics for k-Median and Facility Location Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {544--562},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702416402},
  doi          = {10.1137/S0097539702416402},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AryaGKMMP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bar-NoyL04,
  author       = {Amotz Bar{-}Noy and
                  Richard E. Ladner},
  title        = {Efficient Algorithms for Optimal Stream Merging for Media-on-Demand},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1011--1034},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701389245},
  doi          = {10.1137/S0097539701389245},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Bar-NoyL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakL04,
  author       = {Boaz Barak and
                  Yehuda Lindell},
  title        = {Strict Polynomial-Time in Simulation and Extraction},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {738--818},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703427975},
  doi          = {10.1137/S0097539703427975},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BarakL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartalBR04,
  author       = {Yair Bartal and
                  John W. Byers and
                  Danny Raz},
  title        = {Fast, Distributed Approximation Algorithms for Positive Linear Programming
                  with Applications to Flow Control},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1261--1279},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539700379383},
  doi          = {10.1137/S0097539700379383},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BartalBR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BiskupPSB04,
  author       = {Joachim Biskup and
                  Jan Paredaens and
                  Thomas Schwentick and
                  Jan Van den Bussche},
  title        = {Solving Equations in the Relational Algebra},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1052--1066},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701390859},
  doi          = {10.1137/S0097539701390859},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BiskupPSB04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoseM04,
  author       = {Prosenjit Bose and
                  Pat Morin},
  title        = {Online Routing in Triangulations},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {937--951},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539700369387},
  doi          = {10.1137/S0097539700369387},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BoseM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumKKRT04,
  author       = {Adam L. Buchsbaum and
                  Howard J. Karloff and
                  Claire Kenyon and
                  Nick Reingold and
                  Mikkel Thorup},
  title        = {{OPT} Versus {LOAD} in Dynamic Storage Allocation},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {632--646},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703423941},
  doi          = {10.1137/S0097539703423941},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuchsbaumKKRT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiW04,
  author       = {Jin{-}yi Cai and
                  Osamu Watanabe},
  title        = {On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {984--1009},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703422716},
  doi          = {10.1137/S0097539703422716},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CaiW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarCFM04,
  author       = {Moses Charikar and
                  Chandra Chekuri and
                  Tom{\'{a}}s Feder and
                  Rajeev Motwani},
  title        = {Incremental Clustering and Dynamic Information Retrieval},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1417--1440},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702418498},
  doi          = {10.1137/S0097539702418498},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CharikarCFM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK04,
  author       = {Chandra Chekuri and
                  Sanjeev Khanna},
  title        = {On Multidimensional Packing Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {837--851},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539799356265},
  doi          = {10.1137/S0097539799356265},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChekuriK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenLWZ04,
  author       = {William Y. C. Chen and
                  Xueliang Li and
                  Chao Wang and
                  Xiaoyan Zhang},
  title        = {The Minimum All-Ones Problem for Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {379--392},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703421620},
  doi          = {10.1137/S0097539703421620},
  timestamp    = {Tue, 28 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChenLWZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenS04,
  author       = {Xiao Chen and
                  Jian Shen},
  title        = {On the Frame--Stewart Conjecture about the Towers of Hanoi},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {584--589},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703431019},
  doi          = {10.1137/S0097539703431019},
  timestamp    = {Fri, 01 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChenS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenXY04,
  author       = {Guantao Chen and
                  Jun Xu and
                  Xingxing Yu},
  title        = {Circumference of Graphs with Bounded Degree},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1136--1170},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703436473},
  doi          = {10.1137/S0097539703436473},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChenXY04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeMV04,
  author       = {Luc Devroye and
                  Pat Morin and
                  Alfredo Viola},
  title        = {On Worst-Case Robin Hood Hashing},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {923--936},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702403372},
  doi          = {10.1137/S0097539702403372},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DevroyeMV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeN04,
  author       = {Luc Devroye and
                  Ralph Neininger},
  title        = {Distances and Finger Search in Random Binary Search Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {647--658},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703424521},
  doi          = {10.1137/S0097539703424521},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DevroyeN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DosaH04,
  author       = {Gy{\"{o}}rgy D{\'{o}}sa and
                  Yong He},
  title        = {Better Online Algorithms for Scheduling with Machine Cost},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1035--1051},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970343395X},
  doi          = {10.1137/S009753970343395X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DosaH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinP04,
  author       = {Michael Elkin and
                  David Peleg},
  title        = {(1+epsilon, beta)-Spanner Constructions for General Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {608--631},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701393384},
  doi          = {10.1137/S0097539701393384},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ElkinP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeLS04,
  author       = {Uriel Feige and
                  Michael Langberg and
                  Gideon Schechtman},
  title        = {Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1338--1368},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703431391},
  doi          = {10.1137/S0097539703431391},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FeigeLS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FlumG04,
  author       = {J{\"{o}}rg Flum and
                  Martin Grohe},
  title        = {The Parameterized Complexity of Counting Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {892--922},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703427203},
  doi          = {10.1137/S0097539703427203},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FlumG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserSSZ04,
  author       = {Christian Gla{\ss}er and
                  Alan L. Selman and
                  Samik Sengupta and
                  Liyu Zhang},
  title        = {Disjoint NP-Pairs},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1369--1416},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703425848},
  doi          = {10.1137/S0097539703425848},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GlasserSSZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJKP04,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum and
                  Sampath Kannan and
                  Mike Paterson},
  title        = {A bound on the capacity of backoff and acknowledgment-based protocols},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {313--331},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539700381851},
  doi          = {10.1137/S0097539700381851},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldbergJKP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergKP04,
  author       = {Leslie Ann Goldberg and
                  Steven Kelk and
                  Mike Paterson},
  title        = {The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {416--432},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702408363},
  doi          = {10.1137/S0097539702408363},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldbergKP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GottlobP04,
  author       = {Georg Gottlob and
                  Reinhard Pichler},
  title        = {Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus
                  Clique-Width},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {351--378},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701396807},
  doi          = {10.1137/S0097539701396807},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GottlobP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HalpernMV04,
  author       = {Joseph Y. Halpern and
                  Ron van der Meyden and
                  Moshe Y. Vardi},
  title        = {Complete Axiomatizations for Reasoning about Knowledge and Time},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {674--703},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539797320906},
  doi          = {10.1137/S0097539797320906},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HalpernMV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-PeledW04,
  author       = {Sariel Har{-}Peled and
                  Yusu Wang},
  title        = {Shape Fitting with Outliers},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {269--285},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703427963},
  doi          = {10.1137/S0097539703427963},
  timestamp    = {Mon, 02 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Har-PeledW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HassinL04,
  author       = {Refael Hassin and
                  Asaf Levin},
  title        = {An efficient polynomial time approximation scheme for the constrained
                  minimum spanning tree problem using matroid intersection},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {261--268},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703426775},
  doi          = {10.1137/S0097539703426775},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HassinL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Havlicek04,
  author       = {John Havlicek},
  title        = {A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol
                  Complexes},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1215--1222},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539798337224},
  doi          = {10.1137/S0097539798337224},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Havlicek04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHN04,
  author       = {Lane A. Hemaspaandra and
                  Harald Hempel and
                  Arfst Nickelsen},
  title        = {Algebraic Properties for Selector Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1309--1337},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703427550},
  doi          = {10.1137/S0097539703427550},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HonkalaL04,
  author       = {Iiro S. Honkala and
                  Tero Laihonen},
  title        = {On identifying codes in the triangular and square grids},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {304--312},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703433110},
  doi          = {10.1137/S0097539703433110},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HonkalaL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IckingKLSS04,
  author       = {Christian Icking and
                  Rolf Klein and
                  Elmar Langetepe and
                  Sven Schuierer and
                  Ines Semrau},
  title        = {An Optimal Competitive Strategy for Walking in Streets},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {462--486},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702419352},
  doi          = {10.1137/S0097539702419352},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/IckingKLSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaufmanKR04,
  author       = {Tali Kaufman and
                  Michael Krivelevich and
                  Dana Ron},
  title        = {Tight Bounds for Testing Bipartiteness in General Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1441--1483},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703436424},
  doi          = {10.1137/S0097539703436424},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KaufmanKR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KesselmanLMPSS04,
  author       = {Alexander Kesselman and
                  Zvi Lotker and
                  Yishay Mansour and
                  Boaz Patt{-}Shamir and
                  Baruch Schieber and
                  Maxim Sviridenko},
  title        = {Buffer Overflow Management in QoS Switches},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {563--583},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701399666},
  doi          = {10.1137/S0097539701399666},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KesselmanLMPSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhullerKW04,
  author       = {Samir Khuller and
                  Yoo Ah Kim and
                  Yung{-}Chun (Justin) Wan},
  title        = {Algorithms for Data Migration with Cloning},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {448--461},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970342585X},
  doi          = {10.1137/S009753970342585X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KhullerKW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KortsarzKL04,
  author       = {Guy Kortsarz and
                  Robert Krauthgamer and
                  James R. Lee},
  title        = {Hardness of Approximation for Vertex-Connectivity Network Design Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {704--720},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702416736},
  doi          = {10.1137/S0097539702416736},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KortsarzKL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KowalskiP04,
  author       = {Dariusz R. Kowalski and
                  Andrzej Pelc},
  title        = {Time of Deterministic Broadcasting in Radio Networks with Local Knowledge},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {870--891},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702419339},
  doi          = {10.1137/S0097539702419339},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KowalskiP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LoeraO04,
  author       = {Jes{\'{u}}s A. De Loera and
                  Shmuel Onn},
  title        = {The Complexity of Three-Way Statistical Tables},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {819--836},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702403803},
  doi          = {10.1137/S0097539702403803},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LoeraO04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LotkerPR04,
  author       = {Zvi Lotker and
                  Boaz Patt{-}Shamir and
                  Adi Ros{\'{e}}n},
  title        = {New stability results for adversarial queuing},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {286--303},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702413306},
  doi          = {10.1137/S0097539702413306},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LotkerPR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McKenzieVW04,
  author       = {Pierre McKenzie and
                  Heribert Vollmer and
                  Klaus W. Wagner},
  title        = {Arithmetic Circuits and Polynomial Replacement Systems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1513--1531},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970139207X},
  doi          = {10.1137/S009753970139207X},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/McKenzieVW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MohringSS04,
  author       = {Rolf H. M{\"{o}}hring and
                  Martin Skutella and
                  Frederik Stork},
  title        = {Scheduling with {AND/OR} Precedence Constraints},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {393--415},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970037727X},
  doi          = {10.1137/S009753970037727X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MohringSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Molloy04,
  author       = {Michael Molloy},
  title        = {The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum
                  Degree},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {721--737},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702401786},
  doi          = {10.1137/S0097539702401786},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Molloy04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/OrlinPS04,
  author       = {James B. Orlin and
                  Abraham P. Punnen and
                  Andreas S. Schulz},
  title        = {Approximate Local Search in Combinatorial Optimization},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1201--1214},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703431007},
  doi          = {10.1137/S0097539703431007},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/OrlinPS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PanW04,
  author       = {Victor Y. Pan and
                  Xinmao Wang},
  title        = {On Rational Number Reconstruction and Approximation},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {502--503},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703437181},
  doi          = {10.1137/S0097539703437181},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PanW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PeerPSS04,
  author       = {Itsik Pe'er and
                  Tal Pupko and
                  Ron Shamir and
                  Roded Sharan},
  title        = {Incomplete Directed Perfect Phylogeny},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {590--607},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702406510},
  doi          = {10.1137/S0097539702406510},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PeerPSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Piotrow04,
  author       = {Marek Piotr{\'{o}}w},
  title        = {Depth Optimal Sorting Networks Resistant to k Passive Faults},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1484--1512},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539799354308},
  doi          = {10.1137/S0097539799354308},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Piotrow04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PurdomGG04,
  author       = {Paul W. Purdom and
                  Dirk Van Gucht and
                  Dennis P. Groth},
  title        = {Average-Case Performance of the Apriori Algorithm},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1223--1260},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703422881},
  doi          = {10.1137/S0097539703422881},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PurdomGG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Regev04,
  author       = {Oded Regev},
  title        = {Quantum Computation and Lattice Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {738--760},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703440678},
  doi          = {10.1137/S0097539703440678},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Regev04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Roughgarden04,
  author       = {Tim Roughgarden},
  title        = {Stackelberg Scheduling Strategies},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {332--350},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701397059},
  doi          = {10.1137/S0097539701397059},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Roughgarden04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schachinger04,
  author       = {Werner Schachinger},
  title        = {Distributional Results for Costs of Partial Match Queries in Asymmetric
                  K-Dimensional Tries},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {952--983},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703425873},
  doi          = {10.1137/S0097539703425873},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Schachinger04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schwiegelshohn04,
  author       = {Uwe Schwiegelshohn},
  title        = {Preemptive Weighted Completion Time Scheduling of Parallel Jobs},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {6},
  pages        = {1280--1308},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753979731501X},
  doi          = {10.1137/S009753979731501X},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Schwiegelshohn04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SegerlindBI04,
  author       = {Nathan Segerlind and
                  Samuel R. Buss and
                  Russell Impagliazzo},
  title        = {A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF
                  Resolution},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1171--1200},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703428555},
  doi          = {10.1137/S0097539703428555},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SegerlindBI04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ServedioG04,
  author       = {Rocco A. Servedio and
                  Steven J. Gortler},
  title        = {Equivalences and Separations Between Quantum and Classical Learnability},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1067--1092},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539704412910},
  doi          = {10.1137/S0097539704412910},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ServedioG04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Siegel04,
  author       = {Alan Siegel},
  title        = {On Universal Classes of Extremely Random Constant-Time Hash Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {3},
  pages        = {505--543},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701386216},
  doi          = {10.1137/S0097539701386216},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Siegel04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Tonder04,
  author       = {Andr{\'{e}} van Tonder},
  title        = {A Lambda Calculus for Quantum Computation},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1109--1135},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703432165},
  doi          = {10.1137/S0097539703432165},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Tonder04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Toran04,
  author       = {Jacobo Tor{\'{a}}n},
  title        = {On the Hardness of Graph Isomorphism},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {5},
  pages        = {1093--1108},
  year         = {2004},
  url          = {https://doi.org/10.1137/S009753970241096X},
  doi          = {10.1137/S009753970241096X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Toran04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vikas04,
  author       = {Narayan Vikas},
  title        = {Compaction, Retraction, and Constraint Satisfaction},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {761--782},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539701397801},
  doi          = {10.1137/S0097539701397801},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Vikas04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vinodchandran04,
  author       = {N. V. Vinodchandran},
  title        = {Counting Complexity of Solvable Black-Box Group Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {4},
  pages        = {852--869},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539703420651},
  doi          = {10.1137/S0097539703420651},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Vinodchandran04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BabaiGKL03,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Anna G{\'{a}}l and
                  Peter G. Kimmel and
                  Satyanarayana V. Lokam},
  title        = {Communication Complexity of Simultaneous Messages},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {137--166},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539700375944},
  doi          = {10.1137/S0097539700375944},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BabaiGKL03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BurgisserC03,
  author       = {Peter B{\"{u}}rgisser and
                  Felipe Cucker},
  title        = {Counting Complexity Classes for Numeric Computations {I:} Semilinear
                  Sets},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {227--260},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539702415950},
  doi          = {10.1137/S0097539702415950},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BurgisserC03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChengD03,
  author       = {Siu{-}Wing Cheng and
                  Tamal K. Dey},
  title        = {Quality Meshing with Weighted Delaunay Refinement},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {69--93},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539703418808},
  doi          = {10.1137/S0097539703418808},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChengD03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChudakS03,
  author       = {Fabi{\'{a}}n A. Chudak and
                  David B. Shmoys},
  title        = {Improved Approximation Algorithms for the Uncapacitated Facility Location
                  Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {1--25},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539703405754},
  doi          = {10.1137/S0097539703405754},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChudakS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH03a,
  author       = {Richard Cole and
                  Ramesh Hariharan},
  title        = {Faster Suffix Tree Construction with Missing Suffix Links},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {26--42},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539701424465},
  doi          = {10.1137/S0097539701424465},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ColeH03a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CramerS03,
  author       = {Ronald Cramer and
                  Victor Shoup},
  title        = {Design and Analysis of Practical Public-Key Encryption Schemes Secure
                  against Adaptive Chosen Ciphertext Attack},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {167--226},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539702403773},
  doi          = {10.1137/S0097539702403773},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CramerS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EvenLRS03,
  author       = {Guy Even and
                  Zvi Lotker and
                  Dana Ron and
                  Shakhar Smorodinsky},
  title        = {Conflict-Free Colorings of Simple Geometric Regions with Applications
                  to Frequency Assignment in Cellular Networks},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {94--136},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539702431840},
  doi          = {10.1137/S0097539702431840},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/EvenLRS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HromkovicS03,
  author       = {Juraj Hromkovic and
                  Georg Schnitger},
  title        = {Nondeterministic Communication with a Limited Number of Advice Bits},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {1},
  pages        = {43--68},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0097539702414622},
  doi          = {10.1137/S0097539702414622},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HromkovicS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics