Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp16.bht:"
@article{DBLP:journals/siamcomp/Abrahamson87, author = {Karl R. Abrahamson}, title = {Generalized String Matching}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1039--1051}, year = {1987}, url = {https://doi.org/10.1137/0216067}, doi = {10.1137/0216067}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Abrahamson87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AltHMP87, author = {Helmut Alt and Torben Hagerup and Kurt Mehlhorn and Franco P. Preparata}, title = {Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {808--835}, year = {1987}, url = {https://doi.org/10.1137/0216053}, doi = {10.1137/0216053}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AltHMP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Asano87, author = {Takao Asano}, title = {An Application of Duality to Edge-Deletion Problems}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {312--331}, year = {1987}, url = {https://doi.org/10.1137/0216024}, doi = {10.1137/0216024}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Asano87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Aurenhammer87, author = {Franz Aurenhammer}, title = {Power Diagrams: Properties, Algorithms and Applications}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {78--96}, year = {1987}, url = {https://doi.org/10.1137/0216006}, doi = {10.1137/0216006}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Aurenhammer87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AzarV87, author = {Yossi Azar and Uzi Vishkin}, title = {Tight Comparison Bounds on the Complexity of Parallel Sorting}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {458--464}, year = {1987}, url = {https://doi.org/10.1137/0216032}, doi = {10.1137/0216032}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AzarV87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BeckerH87, author = {Bernd Becker and G{\"{u}}nter Hotz}, title = {On the Optimal Layout of Planar Graphs with Fixed Boundary}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {946--972}, year = {1987}, url = {https://doi.org/10.1137/0216061}, doi = {10.1137/0216061}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BeckerH87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BiniC87, author = {Dario Bini and Milvio Capovani}, title = {Tensor Rank and Border Rank of Band Toeplitz Matrices}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {252--258}, year = {1987}, url = {https://doi.org/10.1137/0216021}, doi = {10.1137/0216021}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BiniC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BorodinFHUW87, author = {Allan Borodin and Faith E. Fich and Friedhelm Meyer auf der Heide and Eli Upfal and Avi Wigderson}, title = {A Time-Space Tradeoff for Element Distinctness}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {97--99}, year = {1987}, url = {https://doi.org/10.1137/0216007}, doi = {10.1137/0216007}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BorodinFHUW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CaiM87, author = {Jin{-}yi Cai and Gabriele E. Meyer}, title = {Graph Minimal Uncolorability is DP-Complete}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {259--277}, year = {1987}, url = {https://doi.org/10.1137/0216022}, doi = {10.1137/0216022}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CaiM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChanM87, author = {Edward P. F. Chan and Alberto O. Mendelzon}, title = {Independent and Separable Database Schemes}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {841--851}, year = {1987}, url = {https://doi.org/10.1137/0216055}, doi = {10.1137/0216055}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChanM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ChoiH87, author = {Hyeong{-}Ah Choi and S. Louis Hakimi}, title = {Scheduling File Transfers for Trees and Odd Cycles}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {162--168}, year = {1987}, url = {https://doi.org/10.1137/0216013}, doi = {10.1137/0216013}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ChoiH87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ColeSY87, author = {Richard Cole and Micha Sharir and Chee{-}Keng Yap}, title = {On k-Hulls and Related Problems}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {61--77}, year = {1987}, url = {https://doi.org/10.1137/0216005}, doi = {10.1137/0216005}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/ColeSY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CourcoubetisRS87, author = {Costas Courcoubetis and Martin I. Reiman and Burton Simon}, title = {Stability of a Queueing System with Concurrent Service and Locking}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {169--178}, year = {1987}, url = {https://doi.org/10.1137/0216014}, doi = {10.1137/0216014}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CourcoubetisRS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/CulikK87, author = {Karel Cul{\'{\i}}k II and Juhani Karhum{\"{a}}ki}, title = {The Equivalence Problem for Single-Valued Two-Way Transducers (on {NPDT0L} Languages) is Decidable}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {221--230}, year = {1987}, url = {https://doi.org/10.1137/0216018}, doi = {10.1137/0216018}, timestamp = {Wed, 24 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/CulikK87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Fogelman-SoulieW87, author = {Fran{\c{c}}oise Fogelman{-}Souli{\'{e}} and G{\'{e}}rard Weisbuch}, title = {Random Iterations of Threshold Networks and Associative Memory}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {203--220}, year = {1987}, url = {https://doi.org/10.1137/0216017}, doi = {10.1137/0216017}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Fogelman-SoulieW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Frederickson87, author = {Greg N. Frederickson}, title = {Fast Algorithms for Shortest Paths in Planar Graphs, with Applications}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1004--1022}, year = {1987}, url = {https://doi.org/10.1137/0216064}, doi = {10.1137/0216064}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Frederickson87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Friesen87, author = {Donald K. Friesen}, title = {Tighter Bounds for {LPT} Scheduling on Uniform Processors}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {554--560}, year = {1987}, url = {https://doi.org/10.1137/0216037}, doi = {10.1137/0216037}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Friesen87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Frieze87, author = {Alan M. Frieze}, title = {On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1052--1072}, year = {1987}, url = {https://doi.org/10.1137/0216068}, doi = {10.1137/0216068}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Frieze87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Gasarch87, author = {William I. Gasarch}, title = {Oracles for Deterministic versus Alternating Classes}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {613--627}, year = {1987}, url = {https://doi.org/10.1137/0216042}, doi = {10.1137/0216042}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Gasarch87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Gathen87, author = {Joachim von zur Gathen}, title = {Computing Powers in Parallel}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {930--945}, year = {1987}, url = {https://doi.org/10.1137/0216060}, doi = {10.1137/0216060}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Gathen87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GonzalezL87, author = {Teofilo F. Gonzalez and Sing{-}Ling Lee}, title = {A 1.6 Approximation Algorithm for Routing Multiterminal Nets}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {669--704}, year = {1987}, url = {https://doi.org/10.1137/0216046}, doi = {10.1137/0216046}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GonzalezL87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GuessarianM87, author = {Ir{\`{e}}ne Guessarian and Jos{\'{e}} Meseguer}, title = {On the Axiomatization of "If-Then-Else"}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {332--357}, year = {1987}, url = {https://doi.org/10.1137/0216025}, doi = {10.1137/0216025}, timestamp = {Wed, 20 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GuessarianM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GurevichS87, author = {Yuri Gurevich and Saharon Shelah}, title = {Expected Computation Time for Hamiltonian Path Problem}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {486--502}, year = {1987}, url = {https://doi.org/10.1137/0216034}, doi = {10.1137/0216034}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GurevichS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Gusfield87, author = {Dan Gusfield}, title = {Three Fast Algorithms for Four Problems in Stable Marriage}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {111--128}, year = {1987}, url = {https://doi.org/10.1137/0216010}, doi = {10.1137/0216010}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Gusfield87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Gusfield87a, author = {Dan Gusfield}, title = {Optimal Mixed Graph Augmentation}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {599--612}, year = {1987}, url = {https://doi.org/10.1137/0216041}, doi = {10.1137/0216041}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Gusfield87a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GusfieldMF87, author = {Dan Gusfield and Charles U. Martel and David Fern{\'{a}}ndez{-}Baca}, title = {Fast Algorithms for Bipartite Network Flow}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {237--251}, year = {1987}, url = {https://doi.org/10.1137/0216020}, doi = {10.1137/0216020}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GusfieldMF87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HeideW87, author = {Friedhelm Meyer auf der Heide and Avi Wigderson}, title = {The Complexity of Parallel Sorting}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {100--107}, year = {1987}, url = {https://doi.org/10.1137/0216008}, doi = {10.1137/0216008}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HeideW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HelmboldM87, author = {David P. Helmbold and Ernst W. Mayr}, title = {Two Processor Scheduling is in {NC}}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {747--759}, year = {1987}, url = {https://doi.org/10.1137/0216050}, doi = {10.1137/0216050}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HelmboldM87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HirschbergL87, author = {Daniel S. Hirschberg and Lawrence L. Larmore}, title = {The Least Weight Subsequence Problem}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {628--638}, year = {1987}, url = {https://doi.org/10.1137/0216043}, doi = {10.1137/0216043}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HirschbergL87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HofriK87, author = {Micha Hofri and Alan G. Konheim}, title = {Padded Lists Revisited}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1073--1114}, year = {1987}, url = {https://doi.org/10.1137/0216069}, doi = {10.1137/0216069}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HofriK87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HofriR87, author = {Micha Hofri and Keith W. Ross}, title = {On the Optimal Control of Two Queues with Server Setup Times and its Analysis}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {399--420}, year = {1987}, url = {https://doi.org/10.1137/0216029}, doi = {10.1137/0216029}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HofriR87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Horton87, author = {Joseph Douglas Horton}, title = {A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {358--366}, year = {1987}, url = {https://doi.org/10.1137/0216026}, doi = {10.1137/0216026}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Horton87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HuW87, author = {T. C. Hu and Michelle L. Wachs}, title = {Binary Search on a Tape}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {573--590}, year = {1987}, url = {https://doi.org/10.1137/0216039}, doi = {10.1137/0216039}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HuW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HuangY87, author = {Wenqui Huang and Xiangdong Yu}, title = {A {DNF} without Regular Shortest Consensus Path}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {836--840}, year = {1987}, url = {https://doi.org/10.1137/0216054}, doi = {10.1137/0216054}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HuangY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HuntRB87, author = {Harry B. Hunt III and Daniel J. Rosenkrantz and Peter A. Bloniarz}, title = {On the Computational Complexity of Algebra on Lattices}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {129--148}, year = {1987}, url = {https://doi.org/10.1137/0216011}, doi = {10.1137/0216011}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HuntRB87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HuntS87, author = {Harry B. Hunt III and Richard Edwin Stearns}, title = {Nonlinear Algebra and Optimization on Rings are "Hard"}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {910--929}, year = {1987}, url = {https://doi.org/10.1137/0216059}, doi = {10.1137/0216059}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HuntS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/IbarraJ87, author = {Oscar H. Ibarra and Tao Jiang}, title = {On One-Way Cellular Arrays}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1135--1154}, year = {1987}, url = {https://doi.org/10.1137/0216072}, doi = {10.1137/0216072}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/IbarraJ87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/IbarraP87, author = {Oscar H. Ibarra and Michael A. Palis}, title = {On Efficient Simulations of Systolic Arrays of Random-Access Machines}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {367--377}, year = {1987}, url = {https://doi.org/10.1137/0216027}, doi = {10.1137/0216027}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/IbarraP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Immerman87, author = {Neil Immerman}, title = {Languages that Capture Complexity Classes}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {760--778}, year = {1987}, url = {https://doi.org/10.1137/0216051}, doi = {10.1137/0216051}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Immerman87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Jones87, author = {Douglas W. Jones}, title = {A Note on Bottom-Up Skew Heaps}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {108--110}, year = {1987}, url = {https://doi.org/10.1137/0216009}, doi = {10.1137/0216009}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Jones87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KannanMR87, author = {Ravindran Kannan and Gary L. Miller and Larry Rudolph}, title = {Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {7--16}, year = {1987}, url = {https://doi.org/10.1137/0216002}, doi = {10.1137/0216002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KannanMR87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KnesslMST87, author = {Charles Knessl and B. J. Matkowsky and Zeev Schuss and Charles Tier}, title = {Asymptotic Expansions for a Closed Multiple Access System}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {378--398}, year = {1987}, url = {https://doi.org/10.1137/0216028}, doi = {10.1137/0216028}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KnesslMST87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KorachMZ87, author = {Ephraim Korach and Shlomo Moran and Shmuel Zaks}, title = {The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {231--236}, year = {1987}, url = {https://doi.org/10.1137/0216019}, doi = {10.1137/0216019}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KorachMZ87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Kurtz87, author = {Stuart A. Kurtz}, title = {A Note on Randomized Polynomial Time}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {852--853}, year = {1987}, url = {https://doi.org/10.1137/0216056}, doi = {10.1137/0216056}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Kurtz87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Larmore87, author = {Lawrence L. Larmore}, title = {Height Restricted Optimal Binary Trees}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1115--1123}, year = {1987}, url = {https://doi.org/10.1137/0216070}, doi = {10.1137/0216070}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Larmore87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Lenstra87, author = {Arjen K. Lenstra}, title = {Factoring Multivariate Polynomials over Algebraic Number Fields}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {591--598}, year = {1987}, url = {https://doi.org/10.1137/0216040}, doi = {10.1137/0216040}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Lenstra87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Lickteig87, author = {Thomas Lickteig}, title = {The Computational Complexity of Division in Quadratic Extension Fields}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {2}, pages = {278--311}, year = {1987}, url = {https://doi.org/10.1137/0216023}, doi = {10.1137/0216023}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Lickteig87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Lubiw87, author = {Anna Lubiw}, title = {Doubly Lexical Orderings of Matrices}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {854--879}, year = {1987}, url = {https://doi.org/10.1137/0216057}, doi = {10.1137/0216057}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Lubiw87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MaassS87, author = {Wolfgang Maass and Amir Schorr}, title = {Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {195--202}, year = {1987}, url = {https://doi.org/10.1137/0216016}, doi = {10.1137/0216016}, timestamp = {Wed, 30 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MaassS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/McKenzieC87, author = {Pierre McKenzie and Stephen A. Cook}, title = {The Parallel Complexity of Abelian Permutation Group Problems}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {880--909}, year = {1987}, url = {https://doi.org/10.1137/0216058}, doi = {10.1137/0216058}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/McKenzieC87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MeklerN87, author = {Alan H. Mekler and Evelyn Nelson}, title = {Equational Bases for If-Then-Else}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {465--485}, year = {1987}, url = {https://doi.org/10.1137/0216033}, doi = {10.1137/0216033}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MeklerN87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MillerS87, author = {Russ Miller and Quentin F. Stout}, title = {Data Movement Techniques for the Pyramid Computer}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {38--60}, year = {1987}, url = {https://doi.org/10.1137/0216004}, doi = {10.1137/0216004}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MillerS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MitchellMP87, author = {Joseph S. B. Mitchell and David M. Mount and Christos H. Papadimitriou}, title = {The Discrete Geodesic Problem}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {647--668}, year = {1987}, url = {https://doi.org/10.1137/0216045}, doi = {10.1137/0216045}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MitchellMP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MoffatT87, author = {Alistair Moffat and Tadao Takaoka}, title = {An All Pairs Shortest Path Algorithm with Expected Time O(n{\({^2}\)} log n)}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1023--1031}, year = {1987}, url = {https://doi.org/10.1137/0216065}, doi = {10.1137/0216065}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/MoffatT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MorrisonSW87, author = {John A. Morrison and Larry A. Shepp and Christopher J. Van Wyk}, title = {A Queueing Analysis of Hashing with Lazy Deletion}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1155--1164}, year = {1987}, url = {https://doi.org/10.1137/0216073}, doi = {10.1137/0216073}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/MorrisonSW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/MossesP87, author = {Peter D. Mosses and Gordon D. Plotkin}, title = {On Proving Limiting Completeness}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {179--194}, year = {1987}, url = {https://doi.org/10.1137/0216015}, doi = {10.1137/0216015}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/MossesP87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Murgolo87, author = {Frank D. Murgolo}, title = {An Efficient Approximation Scheme for Variable-Sized Bin Packing}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {149--161}, year = {1987}, url = {https://doi.org/10.1137/0216012}, doi = {10.1137/0216012}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Murgolo87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/OommenH87, author = {B. John Oommen and E. R. Hansen}, title = {List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {705--716}, year = {1987}, url = {https://doi.org/10.1137/0216047}, doi = {10.1137/0216047}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/OommenH87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PaigeT87, author = {Robert Paige and Robert Endre Tarjan}, title = {Three Partition Refinement Algorithms}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {973--989}, year = {1987}, url = {https://doi.org/10.1137/0216062}, doi = {10.1137/0216062}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/PaigeT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PapadimitriouT87, author = {Christos H. Papadimitriou and John N. Tsitsiklis}, title = {On Stochastic Scheduling with In-Tree Precedence Constraints}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {1--6}, year = {1987}, url = {https://doi.org/10.1137/0216001}, doi = {10.1137/0216001}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouT87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PapadimitriouU87, author = {Christos H. Papadimitriou and Jeffrey D. Ullman}, title = {A Communication-Time Tradeoff}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {639--646}, year = {1987}, url = {https://doi.org/10.1137/0216044}, doi = {10.1137/0216044}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouU87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/PapadimitriouY87, author = {Christos H. Papadimitriou and Mihalis Yannakakis}, title = {The Complexity of Reliable Concurrency Control}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {538--553}, year = {1987}, url = {https://doi.org/10.1137/0216036}, doi = {10.1137/0216036}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Pippenger87, author = {Nicholas Pippenger}, title = {Sorting and Selecting in Rounds}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1032--1038}, year = {1987}, url = {https://doi.org/10.1137/0216066}, doi = {10.1137/0216066}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Pippenger87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/RosierY87, author = {Louis E. Rosier and Hsu{-}Chun Yen}, title = {Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {5}, pages = {779--807}, year = {1987}, url = {https://doi.org/10.1137/0216052}, doi = {10.1137/0216052}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/RosierY87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Scheinerman87, author = {Edward R. Scheinerman}, title = {Almost Sure Fault Tolerance in Random Graphs}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {1124--1134}, year = {1987}, url = {https://doi.org/10.1137/0216071}, doi = {10.1137/0216071}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Scheinerman87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Sharir87, author = {Micha Sharir}, title = {On Shortest Paths Amidst Convex Polyhedra}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {561--572}, year = {1987}, url = {https://doi.org/10.1137/0216038}, doi = {10.1137/0216038}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Sharir87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/ShmueliI87, author = {Oded Shmueli and Alon Itai}, title = {Complexity of Views: Tree and Cyclic Schemas}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {1}, pages = {17--37}, year = {1987}, url = {https://doi.org/10.1137/0216003}, doi = {10.1137/0216003}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/ShmueliI87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Tamassia87, author = {Roberto Tamassia}, title = {On Embedding a Graph in the Grid with the Minimum Number of Bends}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {421--444}, year = {1987}, url = {https://doi.org/10.1137/0216030}, doi = {10.1137/0216030}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Tamassia87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/TouegPS87, author = {Sam Toueg and Kenneth J. Perry and T. K. Srikanth}, title = {Fast Distributed Agreement}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {445--457}, year = {1987}, url = {https://doi.org/10.1137/0216031}, doi = {10.1137/0216031}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/TouegPS87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Vaishnavi87, author = {Vijay K. Vaishnavi}, title = {Weighted Leaf AVL-Trees}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {3}, pages = {503--537}, year = {1987}, url = {https://doi.org/10.1137/0216035}, doi = {10.1137/0216035}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Vaishnavi87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/WidmayerWW87, author = {Peter Widmayer and Ying{-}Fung Wu and C. K. Wong}, title = {On Some Distance Problems in Fixed Orientations}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {728--746}, year = {1987}, url = {https://doi.org/10.1137/0216049}, doi = {10.1137/0216049}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/WidmayerWW87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Wormald87, author = {Nicholas C. Wormald}, title = {Generating Random Unlabelled Graphs}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {4}, pages = {717--727}, year = {1987}, url = {https://doi.org/10.1137/0216048}, doi = {10.1137/0216048}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Wormald87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/YangHC87, author = {Mark Chao Kuen Yang and Jun Siung Huang and Yuan{-}Chieh Chow}, title = {Optimal Parallel Sorting Scheme by Order Statistics}, journal = {{SIAM} J. Comput.}, volume = {16}, number = {6}, pages = {990--1003}, year = {1987}, url = {https://doi.org/10.1137/0216063}, doi = {10.1137/0216063}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/YangHC87.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.