Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/siamcomp/AlexiCGS88,
  author       = {Werner Alexi and
                  Benny Chor and
                  Oded Goldreich and
                  Claus{-}Peter Schnorr},
  title        = {{RSA} and Rabin Functions: Certain Parts are as Hard as the Whole},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {194--209},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217013},
  doi          = {10.1137/0217013},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AlexiCGS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AllenderR88,
  author       = {Eric Allender and
                  Roy S. Rubinstein},
  title        = {P-Printable Sets},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1193--1202},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217075},
  doi          = {10.1137/0217075},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AllenderR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonA88,
  author       = {Noga Alon and
                  Yossi Azar},
  title        = {The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting
                  Algorithms},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1178--1192},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217074},
  doi          = {10.1137/0217074},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AlonA88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtallahK88,
  author       = {Mikhail J. Atallah and
                  S. Rao Kosaraju},
  title        = {Efficient Solutions to Some Transportation Problems with Applications
                  to Minimizing Robot Arm Travel},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {849--869},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217053},
  doi          = {10.1137/0217053},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AtallahK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AvisL88,
  author       = {David Avis and
                  C. W. Lai},
  title        = {The Probabilistic Analysis of a Heuristic for the Assignment Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {732--741},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217047},
  doi          = {10.1137/0217047},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AvisL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bach88,
  author       = {Eric Bach},
  title        = {How to Generate Factored Random Numbers},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {179--193},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217012},
  doi          = {10.1137/0217012},
  timestamp    = {Wed, 01 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Bach88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-OrFKT88,
  author       = {Michael Ben{-}Or and
                  Ephraim Feig and
                  Dexter Kozen and
                  Prasoon Tiwari},
  title        = {A Fast Parallel Algorithm for Determining all Roots of a Polynomial
                  with Real Roots},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1081--1092},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217069},
  doi          = {10.1137/0217069},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Ben-OrFKT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BennettBR88,
  author       = {Charles H. Bennett and
                  Gilles Brassard and
                  Jean{-}Marc Robert},
  title        = {Privacy Amplification by Public Discussion},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {210--229},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217014},
  doi          = {10.1137/0217014},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BennettBR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergstraKO88,
  author       = {Jan A. Bergstra and
                  Jan Willem Klop and
                  Ernst{-}R{\"{u}}diger Olderog},
  title        = {Readies and Failures in the Algebra of Communicating Processes},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1134--1177},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217073},
  doi          = {10.1137/0217073},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BergstraKO88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BienstockM88,
  author       = {Daniel Bienstock and
                  Clyde L. Monma},
  title        = {On the Complexity of Covering Vertices by Faces in a Planar Graph},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {53--76},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217004},
  doi          = {10.1137/0217004},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BienstockM88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BloomE88,
  author       = {Stephen L. Bloom and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Varieties of Iteration Theories},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {939--966},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217059},
  doi          = {10.1137/0217059},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BloomE88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BollobasB88,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Graham R. Brightwell},
  title        = {Transitive Orientations of Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1119--1133},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217072},
  doi          = {10.1137/0217072},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BollobasB88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BookK88,
  author       = {Ronald V. Book and
                  Ker{-}I Ko},
  title        = {On Sets Truth-Table Reducible to Sparse Sets},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {903--919},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217056},
  doi          = {10.1137/0217056},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BookK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BookORW88,
  author       = {Ronald V. Book and
                  Pekka Orponen and
                  David A. Russo and
                  Osamu Watanabe},
  title        = {Lowness Properties of Sets in the Exponential-Time Hierarchy},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {504--516},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217030},
  doi          = {10.1137/0217030},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BookORW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiGHHSWW88,
  author       = {Jin{-}yi Cai and
                  Thomas Gundermann and
                  Juris Hartmanis and
                  Lane A. Hemachandra and
                  Vivian Sewelson and
                  Klaus W. Wagner and
                  Gerd Wechsung},
  title        = {The Boolean Hierarchy {I:} Structural Properties},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1232--1252},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217078},
  doi          = {10.1137/0217078},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CaiGHHSWW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chazelle88,
  author       = {Bernard Chazelle},
  title        = {A Functional Approach to Data Structures and Its Use in Multidimensional
                  Searching},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {427--462},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217026},
  doi          = {10.1137/0217026},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Chazelle88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChorG88,
  author       = {Benny Chor and
                  Oded Goldreich},
  title        = {Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication
                  Complexity},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {230--261},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217015},
  doi          = {10.1137/0217015},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ChorG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Clarkson88,
  author       = {Kenneth L. Clarkson},
  title        = {A Randomized Algorithm for Closest-Point Queries},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {830--847},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217052},
  doi          = {10.1137/0217052},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Clarkson88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cole88,
  author       = {Richard Cole},
  title        = {Parallel Merge Sort},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {770--785},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217049},
  doi          = {10.1137/0217049},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Cole88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeV88,
  author       = {Richard Cole and
                  Uzi Vishkin},
  title        = {Approximate Parallel Scheduling. Part {I:} The Basic Technique with
                  Applications to Optimal Parallel List Ranking in Logarithmic Time},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {128--142},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217009},
  doi          = {10.1137/0217009},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ColeV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DAtriM88,
  author       = {Alessandro D'Atri and
                  Marina Moscarini},
  title        = {Distance-Hereditary Graphs, Steiner Trees, and Connected Domination},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {521--538},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217032},
  doi          = {10.1137/0217032},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DAtriM88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DershowitzMT88,
  author       = {Nachum Dershowitz and
                  Leo Marcus and
                  Andrzej Tarlecki},
  title        = {Existence, Uniqueness, and Construction of Rewrite Systems},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {629--639},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217039},
  doi          = {10.1137/0217039},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DershowitzMT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkKS88,
  author       = {Cynthia Dwork and
                  Paris C. Kanellakis and
                  Larry J. Stockmeyer},
  title        = {Parallel Algorithms for Term Matching},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {711--731},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217046},
  doi          = {10.1137/0217046},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DworkKS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkPPU88,
  author       = {Cynthia Dwork and
                  David Peleg and
                  Nicholas Pippenger and
                  Eli Upfal},
  title        = {Fault Tolerance in Networks of Bounded Degree},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {975--988},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217061},
  doi          = {10.1137/0217061},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DworkPPU88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerF88,
  author       = {Martin E. Dyer and
                  Alan M. Frieze},
  title        = {On the Complexity of Computing the Volume of a Polyhedron},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {967--974},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217060},
  doi          = {10.1137/0217060},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/DyerF88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdelsbrunnerS88,
  author       = {Herbert Edelsbrunner and
                  Steven Skiena},
  title        = {Probing Convex Polygons with X-Rays},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {870--882},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217054},
  doi          = {10.1137/0217054},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/EdelsbrunnerS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaigleT88,
  author       = {Ulrich Faigle and
                  Gy{\"{o}}rgy Tur{\'{a}}n},
  title        = {Sorting and Recognition Problems for Ordered Sets},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {100--113},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217007},
  doi          = {10.1137/0217007},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FaigleT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichRW88,
  author       = {Faith E. Fich and
                  Prabhakar Ragde and
                  Avi Wigderson},
  title        = {Relations Between Concurrent-Write Models of Parallel Computation},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {606--627},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217037},
  doi          = {10.1137/0217037},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FichRW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriesenK88,
  author       = {Donald K. Friesen and
                  Frederick S. Kuhl},
  title        = {Analysis of a Hybrid Algorithm for Packing Unequal Bins},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {23--40},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217002},
  doi          = {10.1137/0217002},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FriesenK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeHKLS88,
  author       = {Alan M. Frieze and
                  Johan H{\aa}stad and
                  Ravi Kannan and
                  J. C. Lagarias and
                  Adi Shamir},
  title        = {Reconstructing Truncated Integer Variables Satisfying Linear Congruences},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {262--280},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217016},
  doi          = {10.1137/0217016},
  timestamp    = {Tue, 23 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FriezeHKLS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fushimi88,
  author       = {Masanori Fushimi},
  title        = {Designing a Uniform Random Number Generator Whose Subsequences are
                  k-Distributed},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {89--99},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217006},
  doi          = {10.1137/0217006},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Fushimi88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow88,
  author       = {Harold N. Gabow},
  title        = {Scheduling {UET} Systems on Two Uniform Processors and Length Two
                  Pipelines},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {810--829},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217051},
  doi          = {10.1137/0217051},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Gabow88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldwasserMR88,
  author       = {Shafi Goldwasser and
                  Silvio Micali and
                  Ronald L. Rivest},
  title        = {A Digital Signature Scheme Secure Against Adaptive Chosen-Message
                  Attacks},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {281--308},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217017},
  doi          = {10.1137/0217017},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldwasserMR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Grandjean88,
  author       = {Etienne Grandjean},
  title        = {A Natural NP-Complete Problem with a Nontrivial Lower Nound},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {786--809},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217050},
  doi          = {10.1137/0217050},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Grandjean88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrollmannS88,
  author       = {Joachim Grollmann and
                  Alan L. Selman},
  title        = {Complexity Measures for Public-Key Cryptosystems},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {309--335},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217018},
  doi          = {10.1137/0217018},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GrollmannS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gusfield88,
  author       = {Dan Gusfield},
  title        = {A Graph Theoretic Approach to Statistical Data Security},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {552--571},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217034},
  doi          = {10.1137/0217034},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Gusfield88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gusfield88a,
  author       = {Dan Gusfield},
  title        = {The Structure of the Stable Roommate Problem: Efficient Representation
                  and Enumeration of All Stable Assignments},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {742--769},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217048},
  doi          = {10.1137/0217048},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Gusfield88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hastad88,
  author       = {Johan H{\aa}stad},
  title        = {Solving Simultaneous Modular Equations of Low Degree},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {336--341},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217019},
  doi          = {10.1137/0217019},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Hastad88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HeY88,
  author       = {Xin He and
                  Yaacov Yesha},
  title        = {A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning
                  Trees in Planar Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {486--491},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217028},
  doi          = {10.1137/0217028},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HeY88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hennessy88,
  author       = {Matthew Hennessy},
  title        = {Axiomatising Finite Concurrent Processes},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {997--1017},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217063},
  doi          = {10.1137/0217063},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Hennessy88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HochbaumS88,
  author       = {Dorit S. Hochbaum and
                  David B. Shmoys},
  title        = {A Polynomial Approximation Scheme for Scheduling on Uniform Processors:
                  Using the Dual Approximation Approach},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {539--551},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217033},
  doi          = {10.1137/0217033},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HochbaumS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Immerman88,
  author       = {Neil Immerman},
  title        = {Nondeterministic Space is Closed Under Complementation},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {935--938},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217058},
  doi          = {10.1137/0217058},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Immerman88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/John88,
  author       = {John W. John},
  title        = {A New Lower Bound for the Set-Partitioning Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {640--647},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217040},
  doi          = {10.1137/0217040},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/John88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kadin88,
  author       = {Jim Kadin},
  title        = {The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1263--1282},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217080},
  doi          = {10.1137/0217080},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Kadin88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarpMR88,
  author       = {Richard M. Karp and
                  Rajeev Motwani and
                  Prabhakar Raghavan},
  title        = {Deferred Data Structuring},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {883--902},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217055},
  doi          = {10.1137/0217055},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KarpMR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KatajainenLP88,
  author       = {Jyrki Katajainen and
                  Jan van Leeuwen and
                  Martti Penttonen},
  title        = {Fast Simulation of Turing Machines by Random Access Machines},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {77--88},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217005},
  doi          = {10.1137/0217005},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KatajainenLP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KleinR88,
  author       = {Philip N. Klein and
                  John H. Reif},
  title        = {Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write
                  {P-RAM}},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {463--485},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217027},
  doi          = {10.1137/0217027},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KleinR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Knight88,
  author       = {William J. Knight},
  title        = {Search in an Ordered Array Having Variable Probe Cost},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1203--1214},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217076},
  doi          = {10.1137/0217076},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Knight88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KongMR88,
  author       = {T. Yung Kong and
                  David M. Mount and
                  A. W. Roscoe},
  title        = {The Decomposition of a Rectangle into Rectangles of Minimal Perimeter},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1215--1231},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217077},
  doi          = {10.1137/0217077},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KongMR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KuceraT88,
  author       = {Ludek Kucera and
                  Vera Trnkov{\'{a}}},
  title        = {Isomorphism Testing of Unary Algebras},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {673--686},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217043},
  doi          = {10.1137/0217043},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KuceraT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LagariasR88,
  author       = {J. C. Lagarias and
                  James A. Reeds},
  title        = {Unique Extrapolation of Polynomial Recurrences},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {342--362},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217020},
  doi          = {10.1137/0217020},
  timestamp    = {Tue, 23 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LagariasR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LengauerW88,
  author       = {Thomas Lengauer and
                  Egon Wanke},
  title        = {Efficient Solution of Connectivity Problems on Hierarchically Defined
                  Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1063--1080},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217068},
  doi          = {10.1137/0217068},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LengauerW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Long88,
  author       = {Timothy J. Long},
  title        = {Erratum: On Restricting the Size of Oracles Compared with Restricting
                  Access to Oracles},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {628},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217038},
  doi          = {10.1137/0217038},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Long88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LongW88,
  author       = {Douglas L. Long and
                  Avi Wigderson},
  title        = {The Discrete Logarithm Hides O(log n) Bits},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {363--372},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217021},
  doi          = {10.1137/0217021},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LongW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LubyR88,
  author       = {Michael Luby and
                  Charles Rackoff},
  title        = {How to Construct Pseudorandom Permutations from Pseudorandom Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {373--386},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217022},
  doi          = {10.1137/0217022},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LubyR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MasudaN88,
  author       = {Sumio Masuda and
                  Kazuo Nakajima},
  title        = {An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc
                  Graph},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {41--52},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217003},
  doi          = {10.1137/0217003},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MasudaN88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McDiarmid88,
  author       = {Colin McDiarmid},
  title        = {Average-Case Lower Bounds for Searching},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {1044--1060},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217066},
  doi          = {10.1137/0217066},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/McDiarmid88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MehlhornNA88,
  author       = {Kurt Mehlhorn and
                  Stefan N{\"{a}}her and
                  Helmut Alt},
  title        = {A Lower Bound on the Complexity of the Union-Split-Find Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1093--1102},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217070},
  doi          = {10.1137/0217070},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MehlhornNA88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MicaliRS88,
  author       = {Silvio Micali and
                  Charles Rackoff and
                  Bob Sloan},
  title        = {The Notion of Security for Probabilistic Cryptosystems},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {412--426},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217025},
  doi          = {10.1137/0217025},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MicaliRS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Miller88,
  author       = {Zevi Miller},
  title        = {A Linear Algorithm for Topological Bandwidth in Degree-Three Trees},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {1018--1035},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217064},
  doi          = {10.1137/0217064},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Miller88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MillerRK88,
  author       = {Gary L. Miller and
                  Vijaya Ramachandran and
                  Erich L. Kaltofen},
  title        = {Efficient Parallel Evaluation of Straight-Line Code and Arithmetic
                  Circuits},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {687--695},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217044},
  doi          = {10.1137/0217044},
  timestamp    = {Mon, 03 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MillerRK88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MorrisW88,
  author       = {Robert J. T. Morris and
                  Wing Shing Wong},
  title        = {A Short-Term Neural Network Memory},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1103--1118},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217071},
  doi          = {10.1137/0217071},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MorrisW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Nicol88,
  author       = {David M. Nicol},
  title        = {Expected Performance of m-Solution Backtracking},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {114--127},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217008},
  doi          = {10.1137/0217008},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Nicol88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PittelY88,
  author       = {Boris G. Pittel and
                  Jenn{-}Hwa Yu},
  title        = {On Search Times for Early-Insertion Coalesced Hashing},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {492--503},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217029},
  doi          = {10.1137/0217029},
  timestamp    = {Fri, 26 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PittelY88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PomeranceST88,
  author       = {Carl Pomerance and
                  Jeffrey W. Smith and
                  Randy Tuler},
  title        = {A Pipeline Architecture for Factoring Large Integers with the Quadratic
                  Sieve Algorithm},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {387--403},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217023},
  doi          = {10.1137/0217023},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PomeranceST88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Provan88,
  author       = {J. Scott Provan},
  title        = {An Approximation Scheme for Finding Steiner Trees with Obstacles},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {920--934},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217057},
  doi          = {10.1137/0217057},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Provan88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RaviL88,
  author       = {S. S. Ravi and
                  Errol L. Lloyd},
  title        = {The Complexity of Near-Optimal Programmable Logic Array Folding},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {696--710},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217045},
  doi          = {10.1137/0217045},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/RaviL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifT88,
  author       = {John H. Reif and
                  J. D. Tygar},
  title        = {Efficient Parallel Pseudorandom Number Generation},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {2},
  pages        = {404--411},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217024},
  doi          = {10.1137/0217024},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ReifT88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sagiv88,
  author       = {Yehoshua Sagiv},
  title        = {On Bounded Database Schemes and Bounded Horn-Clause Programs},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {1--22},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217001},
  doi          = {10.1137/0217001},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Sagiv88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schaback88,
  author       = {Robert Schaback},
  title        = {On the Expected Sublinearity of the Boyer-Moore Algorithm},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {648--658},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217041},
  doi          = {10.1137/0217041},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Schaback88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchieberV88,
  author       = {Baruch Schieber and
                  Uzi Vishkin},
  title        = {On Finding Lowest Common Ancestors: Simplification and Parallelization},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {6},
  pages        = {1253--1262},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217079},
  doi          = {10.1137/0217079},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SchieberV88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Selman88,
  author       = {Alan L. Selman},
  title        = {Natural Self-Reducible Sets},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {989--996},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217062},
  doi          = {10.1137/0217062},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Selman88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SiegelD88,
  author       = {Alan Siegel and
                  Danny Dolev},
  title        = {Some Geometry for General River Routing},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {583--605},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217036},
  doi          = {10.1137/0217036},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/SiegelD88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanW88,
  author       = {Robert Endre Tarjan and
                  Christopher J. Van Wyk},
  title        = {An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {1},
  pages        = {143--178},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217010},
  doi          = {10.1137/0217010},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/TarjanW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanW88a,
  author       = {Robert Endre Tarjan and
                  Christopher J. Van Wyk},
  title        = {Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple
                  Polygon},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {1061},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217067},
  doi          = {10.1137/0217067},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/TarjanW88a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vaidya88,
  author       = {Pravin M. Vaidya},
  title        = {Minimum Spanning Trees in k-Dimensional Space},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {572--582},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217035},
  doi          = {10.1137/0217035},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Vaidya88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vitanyi88,
  author       = {Paul M. B. Vit{\'{a}}nyi},
  title        = {Locality, Communication, and Interconnect Length in Multicomputers},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {4},
  pages        = {659--672},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217042},
  doi          = {10.1137/0217042},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Vitanyi88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao88,
  author       = {Andrew Chi{-}Chih Yao},
  title        = {Monotone Bipartite Graph Properties are Evasive},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {3},
  pages        = {517--520},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217031},
  doi          = {10.1137/0217031},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Yao88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zellini88,
  author       = {Paolo Zellini},
  title        = {Optimal Bounds for Solving Tridiagonal Systems with Preconditioning},
  journal      = {{SIAM} J. Comput.},
  volume       = {17},
  number       = {5},
  pages        = {1036--1043},
  year         = {1988},
  url          = {https://doi.org/10.1137/0217065},
  doi          = {10.1137/0217065},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/Zellini88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics