Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/siamcomp/MereghettiP00,
  author       = {Carlo Mereghetti and
                  Giovanni Pighizzini},
  title        = {Optimal Simulations between Unary Automata},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1976--1992},
  year         = {2001},
  url          = {https://doi.org/10.1137/S009753979935431X},
  doi          = {10.1137/S009753979935431X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MereghettiP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AgarwalW00,
  author       = {Pankaj K. Agarwal and
                  Hongyan Wang},
  title        = {Approximation Algorithms for Curvature-Constrained Shortest Paths},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1739--1772},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539796307790},
  doi          = {10.1137/S0097539796307790},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AgarwalW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AgrawalT00,
  author       = {Manindra Agrawal and
                  Thomas Thierauf},
  title        = {The Formula Isomorphism Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {990--1009},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798343647},
  doi          = {10.1137/S0097539798343647},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AgrawalT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AlonKNS00,
  author       = {Noga Alon and
                  Michael Krivelevich and
                  Ilan Newman and
                  Mario Szegedy},
  title        = {Regular Languages are Testable with a Constant Number of Queries},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1842--1862},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700366528},
  doi          = {10.1137/S0097539700366528},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AlonKNS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AnderssonHHP00,
  author       = {Arne Andersson and
                  Torben Hagerup and
                  Johan H{\aa}stad and
                  Ola Petersson},
  title        = {Tight Bounds for Searching a Sorted Array of Strings},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1552--1578},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797329889},
  doi          = {10.1137/S0097539797329889},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AnderssonHHP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AndrewsFHLZ00,
  author       = {Matthew Andrews and
                  Antonio Fern{\'{a}}ndez and
                  Mor Harchol{-}Balter and
                  Frank Thomson Leighton and
                  Lisa Zhang},
  title        = {General Dynamic Routing with Per-Packet Delay Guarantees of \emph{O}(Distance
                  + 1/Session Rate)},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1594--1623},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979935061X},
  doi          = {10.1137/S009753979935061X},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AndrewsFHLZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AngluinWZ00,
  author       = {Dana Angluin and
                  Jeffery R. Westbrook and
                  Wenhong Zhu},
  title        = {Robot Navigation with Distance Queries},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {110--144},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797330057},
  doi          = {10.1137/S0097539797330057},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AngluinWZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ArvindBL00,
  author       = {Vikraman Arvind and
                  Richard Beigel and
                  Antoni Lozano},
  title        = {The Complexity of Modular Graph Automorphism},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1299--1320},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799358227},
  doi          = {10.1137/S0097539799358227},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ArvindBL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Bar-NoyGNS00,
  author       = {Amotz Bar{-}Noy and
                  Sudipto Guha and
                  Joseph Naor and
                  Baruch Schieber},
  title        = {Message Multicasting in Heterogeneous Networks},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {347--358},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798347906},
  doi          = {10.1137/S0097539798347906},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Bar-NoyGNS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BarrettJM00,
  author       = {Christopher L. Barrett and
                  Riko Jacob and
                  Madhav V. Marathe},
  title        = {Formal-Language-Constrained Path Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {809--837},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798337716},
  doi          = {10.1137/S0097539798337716},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BarrettJM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BassinoBP00,
  author       = {Fr{\'{e}}d{\'{e}}rique Bassino and
                  Marie{-}Pierre B{\'{e}}al and
                  Dominique Perrin},
  title        = {A Finite State Version of the Kraft--McMillan Theorem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1211--1230},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798343908},
  doi          = {10.1137/S0097539798343908},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BassinoBP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BergmanS00,
  author       = {Clifford Bergman and
                  Giora Slutzki},
  title        = {Complexity of Some Problems Concerning Varieties and Quasi-Varieties
                  of Algebras},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {359--382},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798345944},
  doi          = {10.1137/S0097539798345944},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BergmanS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BerkmanPS00,
  author       = {Omer Berkman and
                  Michal Parnas and
                  Jir{\'{\i}} Sgall},
  title        = {Efficient Dynamic Traitor Tracing},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1802--1828},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700367984},
  doi          = {10.1137/S0097539700367984},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BerkmanPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Bertram-KretzbergHL00,
  author       = {Claudia Bertram{-}Kretzberg and
                  Thomas Hofmeister and
                  Hanno Lefmann},
  title        = {An Algorithm for Heilbronn's Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {383--390},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798348870},
  doi          = {10.1137/S0097539798348870},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Bertram-KretzbergHL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BlumKRS00,
  author       = {Avrim Blum and
                  Howard J. Karloff and
                  Yuval Rabani and
                  Michael E. Saks},
  title        = {A Decomposition Theorem for Task Systems and Bounds for Randomized
                  Server Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1624--1661},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799351882},
  doi          = {10.1137/S0097539799351882},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BlumKRS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BoissonnatDL00,
  author       = {Jean{-}Daniel Boissonnat and
                  Olivier Devillers and
                  Sylvain Lazard},
  title        = {Motion Planning of Legged Robots},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {218--246},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797326289},
  doi          = {10.1137/S0097539797326289},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BoissonnatDL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BonetEGJ00,
  author       = {Maria Luisa Bonet and
                  Juan Luis Esteban and
                  Nicola Galesi and
                  Jan Johannsen},
  title        = {On the Relative Complexity of Resolution Refinements and Cutting Planes
                  Proof Systems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1462--1484},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799352474},
  doi          = {10.1137/S0097539799352474},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BonetEGJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BorosGKM00,
  author       = {Endre Boros and
                  Vladimir Gurvich and
                  Leonid Khachiyan and
                  Kazuhisa Makino},
  title        = {Dual-Bounded Generating Problems: Partial and Multiple Transversals
                  of a Hypergraph},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {2036--2050},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700370072},
  doi          = {10.1137/S0097539700370072},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BorosGKM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BrandstadtDK00,
  author       = {Andreas Brandst{\"{a}}dt and
                  Feodor F. Dragan and
                  Ekkehard K{\"{o}}hler},
  title        = {Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free
                  Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1662--1677},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799357775},
  doi          = {10.1137/S0097539799357775},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BrandstadtDK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BrazilTW00,
  author       = {Marcus Brazil and
                  Doreen A. Thomas and
                  Jia F. Weng},
  title        = {Minimum Networks in Uniform Orientation Metrics},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1579--1593},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798347190},
  doi          = {10.1137/S0097539798347190},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BrazilTW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BuchsbaumGW00,
  author       = {Adam L. Buchsbaum and
                  Raffaele Giancarlo and
                  Jeffery R. Westbrook},
  title        = {On the Determinization of Weighted Finite Automata},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1502--1531},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798346676},
  doi          = {10.1137/S0097539798346676},
  timestamp    = {Mon, 08 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuchsbaumGW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BuhrmanCD00,
  author       = {Harry Buhrman and
                  Richard Cleve and
                  Wim van Dam},
  title        = {Quantum Entanglement and Communication Complexity},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1829--1841},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797324886},
  doi          = {10.1137/S0097539797324886},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuhrmanCD00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BuhrmanMRSS00,
  author       = {Harry Buhrman and
                  Dieter van Melkebeek and
                  Kenneth W. Regan and
                  D. Sivakumar and
                  Martin Strauss},
  title        = {A Generalization of Resource-Bounded Measure, with Application to
                  the {BPP} vs. {EXP} Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {576--601},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798343891},
  doi          = {10.1137/S0097539798343891},
  timestamp    = {Tue, 19 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuhrmanMRSS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BuhrmanT00,
  author       = {Harry Buhrman and
                  Leen Torenvliet},
  title        = {Randomness is Hard},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1485--1501},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799360148},
  doi          = {10.1137/S0097539799360148},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuhrmanT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Burgisser00,
  author       = {Peter B{\"{u}}rgisser},
  title        = {The Computational Complexity to Evaluate Representations of General
                  Linear Groups},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {1010--1022},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798367892},
  doi          = {10.1137/S0097539798367892},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Burgisser00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Burgisser00a,
  author       = {Peter B{\"{u}}rgisser},
  title        = {The Computational Complexity of Immanants},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {1023--1040},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798367880},
  doi          = {10.1137/S0097539798367880},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Burgisser00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/CaiDZ00,
  author       = {Mao{-}cheng Cai and
                  Xiaotie Deng and
                  Wenan Zang},
  title        = {An Approximation Algorithm for Feedback Vertex Sets in Tournaments},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1993--2007},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798338163},
  doi          = {10.1137/S0097539798338163},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CaiDZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Chan00,
  author       = {Timothy M. Chan},
  title        = {Random Sampling, Halfspace Range Reporting, and Construction of ({\textless}=
                  k)-Levels in Three Dimensions},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {561--575},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798349188},
  doi          = {10.1137/S0097539798349188},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Chan00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/CheriyanT00,
  author       = {Joseph Cheriyan and
                  Ramakrishna Thurimella},
  title        = {Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {528--560},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979833920X},
  doi          = {10.1137/S009753979833920X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CheriyanT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ChuL00,
  author       = {Chengbin Chu and
                  R{\'{e}}my La},
  title        = {Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance
                  Ratios for Four Approximation Algorithms},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {2069--2083},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979834669X},
  doi          = {10.1137/S009753979834669X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChuL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Cole00,
  author       = {Richard Cole},
  title        = {On the Dynamic Finger Conjecture for Splay Trees. Part {II:} The Proof},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {44--85},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979732699X},
  doi          = {10.1137/S009753979732699X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Cole00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ColeFHPT00,
  author       = {Richard Cole and
                  Martin Farach{-}Colton and
                  Ramesh Hariharan and
                  Teresa M. Przytycka and
                  Mikkel Thorup},
  title        = {An \emph{O}(\emph{n}log \emph{n}) Algorithm for the Maximum Agreement
                  Subtree Problem for Binary Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1385--1404},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539796313477},
  doi          = {10.1137/S0097539796313477},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ColeFHPT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ColeMSS00,
  author       = {Richard Cole and
                  Bud Mishra and
                  Jeanette P. Schmidt and
                  Alan Siegel},
  title        = {On the Dynamic Finger Conjecture for Splay Trees. Part {I:} Splay
                  Sorting log n-Block Sequences},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {1--43},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797326988},
  doi          = {10.1137/S0097539797326988},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ColeMSS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/CzygrinowR00,
  author       = {Andrzej Czygrinow and
                  Vojtech R{\"{o}}dl},
  title        = {An Algorithmic Regularity Lemma for Hypergraphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1041--1066},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799351729},
  doi          = {10.1137/S0097539799351729},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CzygrinowR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DengGBL00,
  author       = {Xiaotie Deng and
                  Nian Gu and
                  Tim Brecht and
                  KaiCheng Lu},
  title        = {Preemptive Scheduling of Parallel Jobs on Multiprocessors},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {145--160},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797315598},
  doi          = {10.1137/S0097539797315598},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DengGBL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DevroyeJZ00,
  author       = {Luc Devroye and
                  Jean Jabbour and
                  Carlos Zamora{-}Cura},
  title        = {Squarish \emph{k}-\emph{d} Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1678--1700},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799358926},
  doi          = {10.1137/S0097539799358926},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DevroyeJZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DinitzV00,
  author       = {Yefim Dinitz and
                  Alek Vainshtein},
  title        = {The General Structure of Edge-Connectivity of a Vertex Subset in a
                  Graph and its Incremental Maintenance. Odd Case},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {753--808},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797330045},
  doi          = {10.1137/S0097539797330045},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DinitzV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DolevDN00,
  author       = {Danny Dolev and
                  Cynthia Dwork and
                  Moni Naor},
  title        = {Nonmalleable Cryptography},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {391--437},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539795291562},
  doi          = {10.1137/S0097539795291562},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DolevDN00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DyerGGJM00,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Catherine S. Greenhill and
                  Mark Jerrum and
                  Michael Mitzenmacher},
  title        = {An Extension of Path Coupling and Its Application to the Glauber Dynamics
                  for Graph Colorings},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1962--1975},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700372708},
  doi          = {10.1137/S0097539700372708},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DyerGGJM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/DyerS00,
  author       = {Martin E. Dyer and
                  Sandeep Sen},
  title        = {Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications
                  to Linear Programming and Related Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1443--1461},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797325727},
  doi          = {10.1137/S0097539797325727},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DyerS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/EvenNZ00,
  author       = {Guy Even and
                  Joseph Naor and
                  Leonid Zosin},
  title        = {An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1231--1252},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798340047},
  doi          = {10.1137/S0097539798340047},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/EvenNZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/FeigeK00,
  author       = {Uriel Feige and
                  Joe Kilian},
  title        = {Two-Prover Protocols - Low Error at Affordable Rates},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {324--346},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797325375},
  doi          = {10.1137/S0097539797325375},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FeigeK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Frieze00,
  author       = {Alan M. Frieze},
  title        = {Edge-Disjoint Paths in Expander Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1790--1801},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700366103},
  doi          = {10.1137/S0097539700366103},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Frieze00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GabowJ00,
  author       = {Harold N. Gabow and
                  Tibor Jord{\'{a}}n},
  title        = {How to Make a Square Grid Framework with Cables Rigid},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {649--680},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798347189},
  doi          = {10.1137/S0097539798347189},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GabowJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GambosiPT00,
  author       = {Giorgio Gambosi and
                  Alberto Postiglione and
                  Maurizio Talamo},
  title        = {Algorithms for the Relaxed Online Bin-Packing Model},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1532--1551},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799180408},
  doi          = {10.1137/S0097539799180408},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GambosiPT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GaujalJM00,
  author       = {Bruno Gaujal and
                  Alain Jean{-}Marie and
                  Jean Mairesse},
  title        = {Computations of Uniform Recurrence Equations Using Minimal Memory
                  Size},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1701--1738},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539795290350},
  doi          = {10.1137/S0097539795290350},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GaujalJM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GreenhalghM00,
  author       = {David Greenhalgh and
                  Stephen Marshall},
  title        = {Convergence Criteria for Genetic Algorithms},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {269--282},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979732565X},
  doi          = {10.1137/S009753979732565X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GreenhalghM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/GrigniMP00,
  author       = {Michelangelo Grigni and
                  Vincent Mirelli and
                  Christos H. Papadimitriou},
  title        = {On the Difficulty of Designing Good Classifiers},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {318--323},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979630814X},
  doi          = {10.1137/S009753979630814X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GrigniMP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/HanOS00,
  author       = {Xiaoxu Han and
                  Suely Oliveira and
                  David E. Stewart},
  title        = {Finding Sets Covering a Point with Application to Mesh-Free Galerkin
                  Methods},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1368--1383},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799359361},
  doi          = {10.1137/S0097539799359361},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HanOS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Har-Peled00a,
  author       = {Sariel Har{-}Peled},
  title        = {Taking a Walk in a Planar Arrangement},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1341--1367},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799362627},
  doi          = {10.1137/S0097539799362627},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Har-Peled00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/HeKL00,
  author       = {Xin He and
                  Ming{-}Yang Kao and
                  Hsueh{-}I Lu},
  title        = {A Fast General Methodology for Information-Theoretically Optimal Encodings
                  of Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {838--846},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799359117},
  doi          = {10.1137/S0097539799359117},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HeKL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/HerzbergK00,
  author       = {Amir Herzberg and
                  Shay Kutten},
  title        = {Early Detection of Message Forwarding Faults},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1169--1196},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539796312745},
  doi          = {10.1137/S0097539796312745},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HerzbergK00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/JayantiTT00,
  author       = {Prasad Jayanti and
                  King Tan and
                  Sam Toueg},
  title        = {Time and Space Lower Bounds for Nonblocking Implementations},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {438--456},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797317299},
  doi          = {10.1137/S0097539797317299},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/JayantiTT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/JiangKL00,
  author       = {Tao Jiang and
                  Paul E. Kearney and
                  Ming Li},
  title        = {A Polynomial Time Approximation Scheme for Inferring Evolutionary
                  Trees from Quartet Topologies and Its Application},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1942--1961},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799361683},
  doi          = {10.1137/S0097539799361683},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/JiangKL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KaoLST00,
  author       = {Ming{-}Yang Kao and
                  Tak Wah Lam and
                  Wing{-}Kin Sung and
                  Hing{-}Fung Ting},
  title        = {Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {602--624},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797332275},
  doi          = {10.1137/S0097539797332275},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KaoLST00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KaplanOT00,
  author       = {Haim Kaplan and
                  Chris Okasaki and
                  Robert Endre Tarjan},
  title        = {Simple Confluently Persistent Catenable Lists},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {965--977},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798339430},
  doi          = {10.1137/S0097539798339430},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KaplanOT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KapoorM00,
  author       = {Sanjiv Kapoor and
                  S. N. Maheshwari},
  title        = {Efficiently Constructing the Visibility Graph of a Simple Polygon
                  with Obstacles},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {847--871},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539795253591},
  doi          = {10.1137/S0097539795253591},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KapoorM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KarlinPR00,
  author       = {Anna R. Karlin and
                  Steven J. Phillips and
                  Prabhakar Raghavan},
  title        = {Markov Paging},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {906--922},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539794268042},
  doi          = {10.1137/S0097539794268042},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KarlinPR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KhannaSTW00,
  author       = {Sanjeev Khanna and
                  Madhu Sudan and
                  Luca Trevisan and
                  David P. Williamson},
  title        = {The Approximability of Constraint Satisfaction Problems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1863--1920},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799349948},
  doi          = {10.1137/S0097539799349948},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KhannaSTW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KleinbergRT00,
  author       = {Jon M. Kleinberg and
                  Yuval Rabani and
                  {\'{E}}va Tardos},
  title        = {Allocating Bandwidth for Bursty Connections},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {191--217},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797329142},
  doi          = {10.1137/S0097539797329142},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KleinbergRT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KnesslS00,
  author       = {Charles Knessl and
                  Wojciech Szpankowski},
  title        = {Asymptotic Behavior of the Height in a Digital Search Tree and the
                  Longest Phrase of the Lempel-Ziv Scheme},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {923--964},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799356812},
  doi          = {10.1137/S0097539799356812},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KnesslS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KorenDA00,
  author       = {Gilad Koren and
                  Emanuel Dar and
                  Amihood Amir},
  title        = {The Power of Migration in Multiprocessor Scheduling of Real-Time Systems},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {511--527},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797326241},
  doi          = {10.1137/S0097539797326241},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KorenDA00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KoutsoupiasP00,
  author       = {Elias Koutsoupias and
                  Christos H. Papadimitriou},
  title        = {Beyond Competitive Analysis},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {300--317},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539796299540},
  doi          = {10.1137/S0097539796299540},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KoutsoupiasP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KushilevitzOR00,
  author       = {Eyal Kushilevitz and
                  Rafail Ostrovsky and
                  Yuval Rabani},
  title        = {Efficient Search for Approximate Nearest Neighbor in High Dimensional
                  Spaces},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {457--474},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798347177},
  doi          = {10.1137/S0097539798347177},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KushilevitzOR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/KuttenP00,
  author       = {Shay Kutten and
                  David Peleg},
  title        = {Tight Fault Locality},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {247--268},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797319109},
  doi          = {10.1137/S0097539797319109},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KuttenP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/LennerstadL00a,
  author       = {H{\aa}kan Lennerstad and
                  Lars Lundberg},
  title        = {Optimal Worst Case Formulas Comparing Cache Memory Associativity},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {872--905},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798349164},
  doi          = {10.1137/S0097539798349164},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LennerstadL00a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/LoH00,
  author       = {Wai{-}Kau Lo and
                  Vassos Hadzilacos},
  title        = {All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies
                  Are Not Robust},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {689--728},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798335766},
  doi          = {10.1137/S0097539798335766},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LoH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/LutzZ00,
  author       = {Jack H. Lutz and
                  Yong Zhao},
  title        = {The Density of Weakly Complete Problems under Adaptive Reductions},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1197--1210},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797321547},
  doi          = {10.1137/S0097539797321547},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LutzZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/MaLZ00,
  author       = {Bin Ma and
                  Ming Li and
                  Louxin Zhang},
  title        = {From Gene Trees to Species Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {729--752},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798343362},
  doi          = {10.1137/S0097539798343362},
  timestamp    = {Mon, 13 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MaLZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Meleis00,
  author       = {Waleed Meleis},
  title        = {Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1921--1941},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979834610X},
  doi          = {10.1137/S009753979834610X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Meleis00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Micali00,
  author       = {Silvio Micali},
  title        = {Computationally Sound Proofs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1253--1298},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539795284959},
  doi          = {10.1137/S0097539795284959},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Micali00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Micciancio00,
  author       = {Daniele Micciancio},
  title        = {The Shortest Vector in a Lattice is Hard to Approximate to within
                  Some Constant},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {2008--2035},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700373039},
  doi          = {10.1137/S0097539700373039},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Micciancio00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/MilidiuL00,
  author       = {Ruy Luiz Milidi{\'{u}} and
                  Eduardo Sany Laber},
  title        = {The {WARM-UP} Algorithm: {A} Lagrangian Construction of Length Restricted
                  Huffman Codes},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1405--1426},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979731981X},
  doi          = {10.1137/S009753979731981X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MilidiuL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/MirkowskaSST00,
  author       = {Grazyna Mirkowska and
                  Andrzej Salwicki and
                  Marian Srebrny and
                  Andrzej Tarlecki},
  title        = {First-Order Specifications of Programmable Data Types},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {2084--2096},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797322528},
  doi          = {10.1137/S0097539797322528},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MirkowskaSST00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/NarasimhanS00,
  author       = {Giri Narasimhan and
                  Michiel H. M. Smid},
  title        = {Approximating the Stretch Factor of Euclidean Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {3},
  pages        = {978--989},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799361671},
  doi          = {10.1137/S0097539799361671},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/NarasimhanS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/NatanzonSS00,
  author       = {Assaf Natanzon and
                  Ron Shamir and
                  Roded Sharan},
  title        = {A Polynomial Approximation Algorithm for the Minimum Fill-In Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1067--1079},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798336073},
  doi          = {10.1137/S0097539798336073},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/NatanzonSS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Pan00,
  author       = {Victor Y. Pan},
  title        = {Parallel Complexity of Computations with General and Toeplitz-Like
                  Matrices Filled with Integers and Extensions},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1080--1125},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797349959},
  doi          = {10.1137/S0097539797349959},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Pan00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/PelegR00,
  author       = {David Peleg and
                  Vitaly Rubinovich},
  title        = {A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight
                  Spanning Tree Construction},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {5},
  pages        = {1427--1442},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700369740},
  doi          = {10.1137/S0097539700369740},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PelegR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/PietracaprinaPS00,
  author       = {Andrea Pietracaprina and
                  Geppino Pucci and
                  Jop F. Sibeyn},
  title        = {Constructive, Deterministic Implementation of Shared Memory on Meshes},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {625--648},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979732712X},
  doi          = {10.1137/S009753979732712X},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PietracaprinaPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ReifW00,
  author       = {John H. Reif and
                  Hongyan Wang},
  title        = {Nonuniform Discretization for Kinodynamic Motion Planning and its
                  Applications},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {161--190},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798331975},
  doi          = {10.1137/S0097539798331975},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ReifW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Ruppert00,
  author       = {Eric Ruppert},
  title        = {Determining Consensus Numbers},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1156--1168},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797329439},
  doi          = {10.1137/S0097539797329439},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Ruppert00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ScheidelerV00,
  author       = {Christian Scheideler and
                  Berthold V{\"{o}}cking},
  title        = {From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
                  Protocols},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1126--1155},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799353431},
  doi          = {10.1137/S0097539799353431},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ScheidelerV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/ShahrokhiSSV00,
  author       = {Farhad Shahrokhi and
                  Ondrej S{\'{y}}kora and
                  L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
                  Imrich Vrto},
  title        = {On Bipartite Drawings and the Linear Arrangement Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1773--1789},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797331671},
  doi          = {10.1137/S0097539797331671},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ShahrokhiSSV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/SongT00,
  author       = {Nah{-}Oak Song and
                  Demosthenis Teneketzis},
  title        = {On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine
                  Minimization},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {681--687},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539797324643},
  doi          = {10.1137/S0097539797324643},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SongT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/SrinivasanT00,
  author       = {Aravind Srinivasan and
                  Chung{-}Piaw Teo},
  title        = {A Constant-Factor Approximation Algorithm for Packet Routing and Balancing
                  Local vs. Global Criteria},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {2051--2068},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798335596},
  doi          = {10.1137/S0097539798335596},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SrinivasanT00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Thorup00,
  author       = {Mikkel Thorup},
  title        = {On {RAM} Priority Queues},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {86--109},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539795288246},
  doi          = {10.1137/S0097539795288246},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Thorup00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Trevisan00,
  author       = {Luca Trevisan},
  title        = {When Hamming Meets Euclid: The Approximability of Geometric {TSP}
                  and Steiner Tree},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {475--485},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799352735},
  doi          = {10.1137/S0097539799352735},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Trevisan00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/VaradarajanA00,
  author       = {Kasturi R. Varadarajan and
                  Pankaj K. Agarwal},
  title        = {Approximating Shortest Paths on a Nonconvex Polyhedron},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {4},
  pages        = {1321--1340},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539799352759},
  doi          = {10.1137/S0097539799352759},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/VaradarajanA00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/Varghese00,
  author       = {George Varghese},
  title        = {Self-Stabilization by Counter Flushing},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {486--510},
  year         = {2000},
  url          = {https://doi.org/10.1137/S009753979732760X},
  doi          = {10.1137/S009753979732760X},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Varghese00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/WangJG00,
  author       = {Lusheng Wang and
                  Tao Jiang and
                  Dan Gusfield},
  title        = {A More Efficient Approximation Scheme for Tree Alignment},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {1},
  pages        = {283--299},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539796313507},
  doi          = {10.1137/S0097539796313507},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/WangJG00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.