default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp18.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AbrahamsonAGHK89,
author = {Karl R. Abrahamson and
Andrew Adler and
Rachel Gelbart and
Lisa Higham and
David G. Kirkpatrick},
title = {The Bit Complexity of Randomized Leader Election on a Ring},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {12--29},
year = {1989},
url = {https://doi.org/10.1137/0218002},
doi = {10.1137/0218002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbrahamsonAGHK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhujaOT89,
author = {Ravindra K. Ahuja and
James B. Orlin and
Robert Endre Tarjan},
title = {Improved Time Bounds for the Maximum Flow Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {939--954},
year = {1989},
url = {https://doi.org/10.1137/0218065},
doi = {10.1137/0218065},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AhujaOT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonA89,
author = {Noga Alon and
Yossi Azar},
title = {Finding an Approximate Maximum},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {258--267},
year = {1989},
url = {https://doi.org/10.1137/0218017},
doi = {10.1137/0218017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonA89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnilyH89,
author = {Shoshana Anily and
Refael Hassin},
title = {Ranking the Best Binary Trees},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {882--892},
year = {1989},
url = {https://doi.org/10.1137/0218060},
doi = {10.1137/0218060},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnilyH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtallahCG89,
author = {Mikhail J. Atallah and
Richard Cole and
Michael T. Goodrich},
title = {Cascading Divide-and-Conquer: {A} Technique for Designing Parallel
Algorithms},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {499--532},
year = {1989},
url = {https://doi.org/10.1137/0218035},
doi = {10.1137/0218035},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AtallahCG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bar-NoyBKLW89,
author = {Amotz Bar{-}Noy and
Allan Borodin and
Mauricio Karchmer and
Nathan Linial and
Michael Werman},
title = {Bounds on Universal Sequences},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {268--277},
year = {1989},
url = {https://doi.org/10.1137/0218018},
doi = {10.1137/0218018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bar-NoyBKLW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarahonaT89,
author = {Francisco Barahona and
{\'{E}}va Tardos},
title = {Note on Weintraub's Minimum-Cost Circulation Algorithm},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {579--583},
year = {1989},
url = {https://doi.org/10.1137/0218039},
doi = {10.1137/0218039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BarahonaT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bennett89,
author = {Charles H. Bennett},
title = {Time/Space Trade-Offs for Reversible Computation},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {766--776},
year = {1989},
url = {https://doi.org/10.1137/0218053},
doi = {10.1137/0218053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bennett89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BernsteinJR89,
author = {David Bernstein and
Jeffrey M. Jaffe and
Michael Rodeh},
title = {Scheduling Arithmetic and Load Operations in Parallel with No Spilling},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1098--1127},
year = {1989},
url = {https://doi.org/10.1137/0218074},
doi = {10.1137/0218074},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BernsteinJR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BilardiN89,
author = {Gianfranco Bilardi and
Alexandru Nicolau},
title = {Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory
Machines},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {216--228},
year = {1989},
url = {https://doi.org/10.1137/0218014},
doi = {10.1137/0218014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BilardiN89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinCDRT89,
author = {Allan Borodin and
Stephen A. Cook and
Patrick W. Dymond and
Walter L. Ruzzo and
Martin Tompa},
title = {Two Applications of Inductive Counting for Complementation Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {559--578},
year = {1989},
url = {https://doi.org/10.1137/0218038},
doi = {10.1137/0218038},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinCDRT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinCDRT89a,
author = {Allan Borodin and
Stephen A. Cook and
Patrick W. Dymond and
Walter L. Ruzzo and
Martin Tompa},
title = {Erratum: Two Applications of Inductive Counting for Complementation
Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1283},
year = {1989},
url = {https://doi.org/10.1137/0218084},
doi = {10.1137/0218084},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinCDRT89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrownFP89,
author = {Cynthia A. Brown and
Larry Finkelstein and
Paul Walton Purdom Jr.},
title = {A New Base Change Algorithm for Permutation Groups},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {1037--1047},
year = {1989},
url = {https://doi.org/10.1137/0218070},
doi = {10.1137/0218070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrownFP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bshouty89,
author = {Nader H. Bshouty},
title = {A Lower Bound for Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {759--765},
year = {1989},
url = {https://doi.org/10.1137/0218052},
doi = {10.1137/0218052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bshouty89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BugraraPP89,
author = {Khaled M. Bugrara and
Youfang Pan and
Paul Walton Purdom Jr.},
title = {Exponential Average Time for the Pure Literal Rule},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {409--418},
year = {1989},
url = {https://doi.org/10.1137/0218028},
doi = {10.1137/0218028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BugraraPP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiGHHSWW89,
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 {II:} Applications},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {95--111},
year = {1989},
url = {https://doi.org/10.1137/0218007},
doi = {10.1137/0218007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CaiGHHSWW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chan89,
author = {Edward P. F. Chan},
title = {A Design Theory for Solving the Anomalies Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {429--448},
year = {1989},
url = {https://doi.org/10.1137/0218030},
doi = {10.1137/0218030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chan89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenS89,
author = {Ming{-}Syan Chen and
Kang G. Shin},
title = {On Relaxed Squashed Embedding of Graphs into a Hypercube},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1226--1244},
year = {1989},
url = {https://doi.org/10.1137/0218081},
doi = {10.1137/0218081},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheriyanM89,
author = {Joseph Cheriyan and
S. N. Maheshwari},
title = {Analysis of Preflow Push Algorithms for Maximum Network Flow},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1057--1086},
year = {1989},
url = {https://doi.org/10.1137/0218072},
doi = {10.1137/0218072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CheriyanM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cherry89,
author = {Guy W. Cherry},
title = {An Analysis of the Rational Exponential Integral},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {893--905},
year = {1989},
url = {https://doi.org/10.1137/0218061},
doi = {10.1137/0218061},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cherry89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Clausen89,
author = {Michael Clausen},
title = {Fast Fourier Transforms for Metabelian Groups},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {584--593},
year = {1989},
url = {https://doi.org/10.1137/0218040},
doi = {10.1137/0218040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Clausen89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoanDDS89,
author = {Brian A. Coan and
Danny Dolev and
Cynthia Dwork and
Larry J. Stockmeyer},
title = {The Distributed Firing Squad Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {990--1012},
year = {1989},
url = {https://doi.org/10.1137/0218068},
doi = {10.1137/0218068},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoanDDS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanL89,
author = {Edward G. Coffman Jr. and
J. C. Lagarias},
title = {Algorithms for Packing Squares: {A} Probabilistic Analysis},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {166--185},
year = {1989},
url = {https://doi.org/10.1137/0218011},
doi = {10.1137/0218011},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeSSS89,
author = {Richard Cole and
Jeffrey S. Salowe and
William L. Steiger and
Endre Szemer{\'{e}}di},
title = {An Optimal-Time Algorithm for Slope Selection},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {792--810},
year = {1989},
url = {https://doi.org/10.1137/0218055},
doi = {10.1137/0218055},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeSSS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CulikPY89,
author = {Karel Cul{\'{\i}}k II and
Jan K. Pachl and
Sheng Yu},
title = {On the Limit Sets of Cellular Automata},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {831--842},
year = {1989},
url = {https://doi.org/10.1137/0218057},
doi = {10.1137/0218057},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CulikPY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Doberkat89,
author = {Ernst{-}Erich Doberkat},
title = {Topological Completeness in an Ideal Model for Polymorphic Types},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {977--989},
year = {1989},
url = {https://doi.org/10.1137/0218067},
doi = {10.1137/0218067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Doberkat89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Eberly89,
author = {Wayne Eberly},
title = {Very Fast Parallel Polynomial Arithmetic},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {955--976},
year = {1989},
url = {https://doi.org/10.1137/0218066},
doi = {10.1137/0218066},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Eberly89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonJ89,
author = {Greg N. Frederickson and
Ravi Janardan},
title = {Efficient Message Routing in Planar Networks},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {843--857},
year = {1989},
url = {https://doi.org/10.1137/0218058},
doi = {10.1137/0218058},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonJ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonS89,
author = {Greg N. Frederickson and
Mandayam A. Srinivas},
title = {Algorithms and Data Structures for an Expanded Family of Matroid Intersection
Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {112--138},
year = {1989},
url = {https://doi.org/10.1137/0218008},
doi = {10.1137/0218008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FurstK89,
author = {Merrick L. Furst and
Ravi Kannan},
title = {Succinct Certificates for Almost All Subset Sum Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {550--558},
year = {1989},
url = {https://doi.org/10.1137/0218037},
doi = {10.1137/0218037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FurstK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowT89,
author = {Harold N. Gabow and
Robert Endre Tarjan},
title = {Faster Scaling Algorithms for Network Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {1013--1036},
year = {1989},
url = {https://doi.org/10.1137/0218069},
doi = {10.1137/0218069},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GabowT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilHY89,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
title = {Minimum-Knowledge Interactive Proofs for Decision Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {711--739},
year = {1989},
url = {https://doi.org/10.1137/0218049},
doi = {10.1137/0218049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilHY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalloGT89,
author = {Giorgio Gallo and
Michael D. Grigoriadis and
Robert Endre Tarjan},
title = {A Fast Parametric Maximum Flow Algorithm and Applications},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {30--55},
year = {1989},
url = {https://doi.org/10.1137/0218003},
doi = {10.1137/0218003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalloGT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergS89,
author = {Mark K. Goldberg and
Thomas H. Spencer},
title = {A New Parallel Algorithm for the Maximal Independent Set Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {419--427},
year = {1989},
url = {https://doi.org/10.1137/0218029},
doi = {10.1137/0218029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldwasserMR89,
author = {Shafi Goldwasser and
Silvio Micali and
Charles Rackoff},
title = {The Knowledge Complexity of Interactive Proof Systems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {186--208},
year = {1989},
url = {https://doi.org/10.1137/0218012},
doi = {10.1137/0218012},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldwasserMR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HagerupCD89,
author = {Torben Hagerup and
Marek Chrobak and
Krzysztof Diks},
title = {Optimal Parallel 5-Colouring of Planar Graphs},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {288--300},
year = {1989},
url = {https://doi.org/10.1137/0218020},
doi = {10.1137/0218020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HagerupCD89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HastadJLS89,
author = {Johan H{\aa}stad and
Bettina Just and
J. C. Lagarias and
Claus{-}Peter Schnorr},
title = {Polynomial Time Algorithms for Finding Integer Relations among Real
Numbers},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {859--881},
year = {1989},
url = {https://doi.org/10.1137/0218059},
doi = {10.1137/0218059},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HastadJLS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Humenik89,
author = {Keith E. Humenik},
title = {Ratio Estimators are Maximum-Likelihood Estimators for Non-Context-Free
Grammars},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {1048--1055},
year = {1989},
url = {https://doi.org/10.1137/0218071},
doi = {10.1137/0218071},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Humenik89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HwangCAL89,
author = {Jing{-}Jang Hwang and
Yuan{-}Chieh Chow and
Frank D. Anger and
Chung{-}Yee Lee},
title = {Scheduling Precedence Graphs in Systems with Interprocessor Communication
Times},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {244--257},
year = {1989},
url = {https://doi.org/10.1137/0218016},
doi = {10.1137/0218016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HwangCAL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Iliopoulos89,
author = {Costas S. Iliopoulos},
title = {Worst-Case Complexity Bounds on Algorithms for Computing the Canonical
Structure of Finite Abelian Groups and the Hermite and Smith Normal
Forms of an Integer Matrix},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {658--669},
year = {1989},
url = {https://doi.org/10.1137/0218045},
doi = {10.1137/0218045},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Iliopoulos89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Iliopoulos89a,
author = {Costas S. Iliopoulos},
title = {Worst-Case Complexity Bounds on Algorithms for Computing the Canonical
Structure of Infinite Abelian Groups and Solving Systems of Linear
Diophantine Equations},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {670--678},
year = {1989},
url = {https://doi.org/10.1137/0218046},
doi = {10.1137/0218046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Iliopoulos89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Immerman89,
author = {Neil Immerman},
title = {Expressibility and Parallel Complexity},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {625--638},
year = {1989},
url = {https://doi.org/10.1137/0218043},
doi = {10.1137/0218043},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Immerman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Iwama89,
author = {Kazuo Iwama},
title = {{CNF} Satisfiability Test by Counting and Polynomial Average Time},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {385--391},
year = {1989},
url = {https://doi.org/10.1137/0218026},
doi = {10.1137/0218026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Iwama89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JacquetS89,
author = {Philippe Jacquet and
Wojciech Szpankowski},
title = {Ultimate Characterizations of the Burst Response of an Interval Searching
Algorithm: {A} Study of a Functional Equation},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {777--791},
year = {1989},
url = {https://doi.org/10.1137/0218054},
doi = {10.1137/0218054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JacquetS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JerrumS89,
author = {Mark Jerrum and
Alistair Sinclair},
title = {Approximating the Permanent},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1149--1178},
year = {1989},
url = {https://doi.org/10.1137/0218077},
doi = {10.1137/0218077},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/JerrumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ko89,
author = {Ker{-}I Ko},
title = {Relativized Polynomial Time Hierarchies Having Exactly {K} Levels},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {392--408},
year = {1989},
url = {https://doi.org/10.1137/0218027},
doi = {10.1137/0218027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ko89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KorteM89,
author = {Norbert Korte and
Rolf H. M{\"{o}}hring},
title = {An Incremental Linear-Time Algorithm for Recognizing Interval Graphs},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {68--81},
year = {1989},
url = {https://doi.org/10.1137/0218005},
doi = {10.1137/0218005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KorteM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LabahnC89,
author = {George Labahn and
Stanley Cabay},
title = {Matrix Pad{\'{e}} Fractions and Their Computation},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {639--657},
year = {1989},
url = {https://doi.org/10.1137/0218044},
doi = {10.1137/0218044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LabahnC89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ladner89,
author = {Richard E. Ladner},
title = {Polynomial Space Counting Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1087--1097},
year = {1989},
url = {https://doi.org/10.1137/0218073},
doi = {10.1137/0218073},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Ladner89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Larmore89,
author = {Lawrence L. Larmore},
title = {Minimum Delay Codes},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {82--94},
year = {1989},
url = {https://doi.org/10.1137/0218006},
doi = {10.1137/0218006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Larmore89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeungY89,
author = {Joseph Y.{-}T. Leung and
Gilbert H. Young},
title = {Minimizing Schedule Length Subject to Minimum Flow Time},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {314--326},
year = {1989},
url = {https://doi.org/10.1137/0218022},
doi = {10.1137/0218022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeungY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Li89,
author = {Shuo{-}Yen Robert Li},
title = {Dynamic Programming by Exchangeability},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {463--472},
year = {1989},
url = {https://doi.org/10.1137/0218032},
doi = {10.1137/0218032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Li89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiR89,
author = {Zhiyuan Li and
Edward M. Reingold},
title = {Solution of a Divide-and-Conquer Maximin Recurrence},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1188--1200},
year = {1989},
url = {https://doi.org/10.1137/0218079},
doi = {10.1137/0218079},
timestamp = {Wed, 20 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LiR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lickteig89,
author = {Thomas Lickteig},
title = {A Lower Bound on the Complexity of Division in Finite Extension Fields
and Inversion in Quadratic Alternative Algebras},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {209--215},
year = {1989},
url = {https://doi.org/10.1137/0218013},
doi = {10.1137/0218013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lickteig89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MelenT89,
author = {Riccardo Melen and
Jonathan S. Turner},
title = {Nonblocking Multirate Networks},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {301--313},
year = {1989},
url = {https://doi.org/10.1137/0218021},
doi = {10.1137/0218021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MelenT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorNS89,
author = {Joseph Naor and
Moni Naor and
Alejandro A. Sch{\"{a}}ffer},
title = {Fast Parallel Algorithms for Chordal Graphs},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {327--349},
year = {1989},
url = {https://doi.org/10.1137/0218023},
doi = {10.1137/0218023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NaorNS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Norton89,
author = {Graham H. Norton},
title = {Precise Analyses of the Right- and Left-Shift Greatest Common Divisor
Algorithms for GF(q)[x]},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {608--624},
year = {1989},
url = {https://doi.org/10.1137/0218042},
doi = {10.1137/0218042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Norton89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ordman89,
author = {Edward T. Ordman},
title = {Minimal Threshold Separators and Memory Requirements for Synchronization},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {152--165},
year = {1989},
url = {https://doi.org/10.1137/0218010},
doi = {10.1137/0218010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ordman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PelegU89,
author = {David Peleg and
Eli Upfal},
title = {The Token Distribution Problem},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {229--243},
year = {1989},
url = {https://doi.org/10.1137/0218015},
doi = {10.1137/0218015},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PelegU89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PelegU89a,
author = {David Peleg and
Jeffrey D. Ullman},
title = {An Optimal Synchronizer for the Hypercube},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {740--747},
year = {1989},
url = {https://doi.org/10.1137/0218050},
doi = {10.1137/0218050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PelegU89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PreparataT89,
author = {Franco P. Preparata and
Roberto Tamassia},
title = {Fully Dynamic Point Location in a Monotone Subdivision},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {811--830},
year = {1989},
url = {https://doi.org/10.1137/0218056},
doi = {10.1137/0218056},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PreparataT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RajasekaranR89,
author = {Sanguthevar Rajasekaran and
John H. Reif},
title = {Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {594--607},
year = {1989},
url = {https://doi.org/10.1137/0218041},
doi = {10.1137/0218041},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RajasekaranR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rappaport89,
author = {David Rappaport},
title = {Computing Simple Circuits from a Set of Line Segments is NP-Complete},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1128--1139},
year = {1989},
url = {https://doi.org/10.1137/0218075},
doi = {10.1137/0218075},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rappaport89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RavikumarI89,
author = {Bala Ravikumar and
Oscar H. Ibarra},
title = {Relating the Type of Ambiguity of Finite Automata to the Succinctness
of Their Representation},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1263--1282},
year = {1989},
url = {https://doi.org/10.1137/0218083},
doi = {10.1137/0218083},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RavikumarI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Renegar89,
author = {James Renegar},
title = {On the Worst-Case Arithmetic Complexity of Approximating Zeros of
Systems of Polynomials},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {350--370},
year = {1989},
url = {https://doi.org/10.1137/0218024},
doi = {10.1137/0218024},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Renegar89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RheeT89,
author = {Wansoo T. Rhee and
Michel Talagrand},
title = {Optimal Bin Packing with Items of Random Sizes {II}},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {139--151},
year = {1989},
url = {https://doi.org/10.1137/0218009},
doi = {10.1137/0218009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RheeT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RheeT89a,
author = {Wansoo T. Rhee and
Michel Talagrand},
title = {Optimal Bin Packing with Items of Random Sizes {III}},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {473--486},
year = {1989},
url = {https://doi.org/10.1137/0218033},
doi = {10.1137/0218033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RheeT89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RheeT89b,
author = {Wansoo T. Rhee and
Michel Talagrand},
title = {Optimal Bin Covering with Items of Random Size},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {487--498},
year = {1989},
url = {https://doi.org/10.1137/0218034},
doi = {10.1137/0218034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RheeT89b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RheeT89c,
author = {Wansoo T. Rhee and
Michel Talagrand},
title = {The Complete Convergence of Best Fit Decreasing},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {909--918},
year = {1989},
url = {https://doi.org/10.1137/0218063},
doi = {10.1137/0218063},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RheeT89c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RheeT89d,
author = {Wansoo T. Rhee and
Michel Talagrand},
title = {The Complete Convergence of First Fit Decreasing},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {919--938},
year = {1989},
url = {https://doi.org/10.1137/0218064},
doi = {10.1137/0218064},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RheeT89d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchimmlerS89,
author = {Manfred Schimmler and
Christoph Starke},
title = {A Correction Network for N-Sorters},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1179--1187},
year = {1989},
url = {https://doi.org/10.1137/0218078},
doi = {10.1137/0218078},
timestamp = {Fri, 05 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/SchimmlerS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SimonsW89,
author = {Barbara B. Simons and
Manfred K. Warmuth},
title = {A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {690--710},
year = {1989},
url = {https://doi.org/10.1137/0218048},
doi = {10.1137/0218048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SimonsW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SteeleS89,
author = {J. Michael Steele and
Timothy Law Snyder},
title = {Worst-Case Growth Rates of Some Classical Problems of Combinatorial
Optimization},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {278--287},
year = {1989},
url = {https://doi.org/10.1137/0218019},
doi = {10.1137/0218019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SteeleS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TangW89,
author = {Shouwen Tang and
Osamu Watanabe},
title = {On Tally Relativizations of BP-Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {449--462},
year = {1989},
url = {https://doi.org/10.1137/0218031},
doi = {10.1137/0218031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TangW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vaidya89,
author = {Pravin M. Vaidya},
title = {Space-Time Trade-Offs for Orthogonal Range Queries},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {748--758},
year = {1989},
url = {https://doi.org/10.1137/0218051},
doi = {10.1137/0218051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vaidya89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vaidya89a,
author = {Pravin M. Vaidya},
title = {Geometry Helps in Matching},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1201--1225},
year = {1989},
url = {https://doi.org/10.1137/0218080},
doi = {10.1137/0218080},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vaidya89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VaziraniV89,
author = {Umesh V. Vazirani and
Vijay V. Vazirani},
title = {The Two-Processor Scheduling Problem is in Random {NC}},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1140--1148},
year = {1989},
url = {https://doi.org/10.1137/0218076},
doi = {10.1137/0218076},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VaziraniV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VenkateswaranT89,
author = {H. Venkateswaran and
Martin Tompa},
title = {A New Pebble Game That Characterizes Parallel Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {533--549},
year = {1989},
url = {https://doi.org/10.1137/0218036},
doi = {10.1137/0218036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VenkateswaranT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VermaR89,
author = {Rakesh M. Verma and
Steven W. Reyner},
title = {An Analysis of a Good Algorithm for the Subtree Problem, Corrected},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {5},
pages = {906--908},
year = {1989},
url = {https://doi.org/10.1137/0218062},
doi = {10.1137/0218062},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VermaR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WestbrookT89,
author = {Jeffery R. Westbrook and
Robert Endre Tarjan},
title = {Amortized Analysis of Algorithms for Set Union with Backtracking},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {1--11},
year = {1989},
url = {https://doi.org/10.1137/0218001},
doi = {10.1137/0218001},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WestbrookT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wilber89,
author = {Robert E. Wilber},
title = {Lower Bounds for Accessing Binary Search Trees with Rotations},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {1},
pages = {56--67},
year = {1989},
url = {https://doi.org/10.1137/0218004},
doi = {10.1137/0218004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wilber89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao89,
author = {Andrew Chi{-}Chih Yao},
title = {On the Complexity of Partial Order Productions},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {679--689},
year = {1989},
url = {https://doi.org/10.1137/0218047},
doi = {10.1137/0218047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yao89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YaoDEP89,
author = {F. Frances Yao and
David P. Dobkin and
Herbert Edelsbrunner and
Mike Paterson},
title = {Partitioning Space for Range Queries},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {2},
pages = {371--384},
year = {1989},
url = {https://doi.org/10.1137/0218025},
doi = {10.1137/0218025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YaoDEP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ZhangS89,
author = {Kaizhong Zhang and
Dennis E. Shasha},
title = {Simple Fast Algorithms for the Editing Distance Between Trees and
Related Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1245--1262},
year = {1989},
url = {https://doi.org/10.1137/0218082},
doi = {10.1137/0218082},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ZhangS89.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.
retrieved on 2024-12-19 21:32 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
