Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp15.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/Ambos-Spies86,
author = {Klaus Ambos{-}Spies},
title = {An Inhomogeneity in the Structure of Karp Degrees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {958--963},
year = {1986},
url = {https://doi.org/10.1137/0215067},
doi = {10.1137/0215067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ambos-Spies86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ApostolicoG86,
author = {Alberto Apostolico and
Raffaele Giancarlo},
title = {The Boyer-Moore-Galil String Searching Strategies Revisited},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {98--105},
year = {1986},
url = {https://doi.org/10.1137/0215007},
doi = {10.1137/0215007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ApostolicoG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Arazi86,
author = {Benjamin Arazi},
title = {A Binary Search with a Parallel Recovery of the Bits},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {851--855},
year = {1986},
url = {https://doi.org/10.1137/0215060},
doi = {10.1137/0215060},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Arazi86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AusielloDS86,
author = {Giorgio Ausiello and
Alessandro D'Atri and
Domenico Sacc{\`{a}}},
title = {Minimal Representation of Directed Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {418--431},
year = {1986},
url = {https://doi.org/10.1137/0215029},
doi = {10.1137/0215029},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AusielloDS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BachMS86,
author = {Eric Bach and
Gary L. Miller and
Jeffrey O. Shallit},
title = {Sums of Divisors, Perfect Numbers and Factoring},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1143--1154},
year = {1986},
url = {https://doi.org/10.1137/0215083},
doi = {10.1137/0215083},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BachMS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Baker86,
author = {Brenda S. Baker},
title = {A Provably Good Algorithm for the Two Module Routing Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {162--188},
year = {1986},
url = {https://doi.org/10.1137/0215012},
doi = {10.1137/0215012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Baker86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalasY86,
author = {Egon Balas and
Chang Sung Yu},
title = {Finding a Maximum Clique in an Arbitrary Graph},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1054--1068},
year = {1986},
url = {https://doi.org/10.1137/0215075},
doi = {10.1137/0215075},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BalasY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BalcazarBS86,
author = {Jos{\'{e}} L. Balc{\'{a}}zar and
Ronald V. Book and
Uwe Sch{\"{o}}ning},
title = {Sparse Sets, Lowness and Highness},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {739--747},
year = {1986},
url = {https://doi.org/10.1137/0215053},
doi = {10.1137/0215053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BalcazarBS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameCH86,
author = {Paul Beame and
Stephen A. Cook and
H. James Hoover},
title = {Log Depth Circuits for Division and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {994--1003},
year = {1986},
url = {https://doi.org/10.1137/0215070},
doi = {10.1137/0215070},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeameCH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BermanBDOP86,
author = {Francine Berman and
Mary Ellen Bock and
Eric Dittert and
Michael J. O'Donnell and
Darrell Plank},
title = {Collections of Functions for Perfect Hashing},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {604--618},
year = {1986},
url = {https://doi.org/10.1137/0215044},
doi = {10.1137/0215044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BermanBDOP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Blum86,
author = {Norbert Blum},
title = {On the Single-Operation Worst-Case Time Complexity of the Disjoint
Set Union Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1021--1024},
year = {1986},
url = {https://doi.org/10.1137/0215072},
doi = {10.1137/0215072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Blum86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumBS86,
author = {Lenore Blum and
Manuel Blum and
Mike Shub},
title = {A Simple Unpredictable Pseudo-Random Number Generator},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {364--383},
year = {1986},
url = {https://doi.org/10.1137/0215025},
doi = {10.1137/0215025},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumBS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumS86,
author = {Lenore Blum and
Mike Shub},
title = {Evaluating Rational Functions: Infinite Precision is Finite Cost and
Tractable on Average},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {384--398},
year = {1986},
url = {https://doi.org/10.1137/0215026},
doi = {10.1137/0215026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinDFP86,
author = {Allan Borodin and
Danny Dolev and
Faith E. Fich and
Wolfgang J. Paul},
title = {Bounds for Width Two Branching Programs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {549--560},
year = {1986},
url = {https://doi.org/10.1137/0215040},
doi = {10.1137/0215040},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinDFP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrunoD86,
author = {John L. Bruno and
Peter J. Downey},
title = {Probabilistic Bounds on the Performance of List Scheduling},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {409--417},
year = {1986},
url = {https://doi.org/10.1137/0215028},
doi = {10.1137/0215028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrunoD86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CabayC86,
author = {Stanley Cabay and
Dong{-}Koo Choi},
title = {Algebraic Computations of Scaled Pad{\'{e}} Fractions},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {243--270},
year = {1986},
url = {https://doi.org/10.1137/0215018},
doi = {10.1137/0215018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CabayC86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChaoF86,
author = {Ming{-}Te Chao and
John V. Franco},
title = {Probabilistic Analysis of Two Heuristics for the 3-Satisfiability
Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1106--1118},
year = {1986},
url = {https://doi.org/10.1137/0215080},
doi = {10.1137/0215080},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChaoF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chazelle86,
author = {Bernard Chazelle},
title = {Filtering Search: {A} New Approach to Query-Answering},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {703--724},
year = {1986},
url = {https://doi.org/10.1137/0215051},
doi = {10.1137/0215051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chazelle86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChazelleDL86,
author = {Bernard Chazelle and
Robert L. (Scot) Drysdale III and
D. T. Lee},
title = {Computing the Largest Empty Rectangle},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {300--315},
year = {1986},
url = {https://doi.org/10.1137/0215022},
doi = {10.1137/0215022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChazelleDL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cherry86,
author = {Guy W. Cherry},
title = {Integration in Finite Terms with Special Functions: The Logarithmic
Integral},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {1--21},
year = {1986},
url = {https://doi.org/10.1137/0215001},
doi = {10.1137/0215001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cherry86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChinR86,
author = {Francis Y. L. Chin and
K. V. S. Ramarao},
title = {Optimal Termination Protocols for Network Partitioning},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {131--144},
year = {1986},
url = {https://doi.org/10.1137/0215010},
doi = {10.1137/0215010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChinR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CitriniCM86,
author = {Claudio Citrini and
Stefano Crespi{-}Reghizzi and
Dino Mandrioli},
title = {On Deterministic Multi-Pass Analysis},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {668--693},
year = {1986},
url = {https://doi.org/10.1137/0215049},
doi = {10.1137/0215049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CitriniCM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CookDR86,
author = {Stephen A. Cook and
Cynthia Dwork and
R{\"{u}}diger Reischuk},
title = {Upper and Lower Time Bounds for Parallel Random Access Machines without
Simultaneous Writes},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {87--97},
year = {1986},
url = {https://doi.org/10.1137/0215006},
doi = {10.1137/0215006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CookDR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoppersmithKP86,
author = {Don Coppersmith and
Maria M. Klawe and
Nicholas Pippenger},
title = {Alphabetic Minimax Trees of Degree at Most t},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {189--192},
year = {1986},
url = {https://doi.org/10.1137/0215013},
doi = {10.1137/0215013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoppersmithKP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cunningham86,
author = {William H. Cunningham},
title = {Improved Bounds for Matroid Partition and Intersection Algorithms},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {948--957},
year = {1986},
url = {https://doi.org/10.1137/0215066},
doi = {10.1137/0215066},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cunningham86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Davenport86,
author = {James H. Davenport},
title = {The Risch Differential Equation Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {903--918},
year = {1986},
url = {https://doi.org/10.1137/0215063},
doi = {10.1137/0215063},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Davenport86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dyer86,
author = {Martin E. Dyer},
title = {On a Multidimensional Search Technique and its Application to the
Euclidean One-Centre Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {725--738},
year = {1986},
url = {https://doi.org/10.1137/0215052},
doi = {10.1137/0215052},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dyer86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdelsbrunnerGS86,
author = {Herbert Edelsbrunner and
Leonidas J. Guibas and
Jorge Stolfi},
title = {Optimal Point Location in a Monotone Subdivision},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {317--340},
year = {1986},
url = {https://doi.org/10.1137/0215023},
doi = {10.1137/0215023},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EdelsbrunnerGS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdelsbrunnerOS86,
author = {Herbert Edelsbrunner and
Joseph O'Rourke and
Raimund Seidel},
title = {Constructing Arrangements of Lines and Hyperplanes with Applications},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {341--363},
year = {1986},
url = {https://doi.org/10.1137/0215024},
doi = {10.1137/0215024},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EdelsbrunnerOS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdelsbrunnerW86,
author = {Herbert Edelsbrunner and
Emo Welzl},
title = {Constructing Belts in Two-Dimensional Arrangements with Applications},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {271--284},
year = {1986},
url = {https://doi.org/10.1137/0215019},
doi = {10.1137/0215019},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EdelsbrunnerW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Engelfriet86,
author = {Joost Engelfriet},
title = {The complexity of Languages Generated by Attribute Grammars},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {70--86},
year = {1986},
url = {https://doi.org/10.1137/0215005},
doi = {10.1137/0215005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Engelfriet86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtzionL86,
author = {Tuvi Etzion and
Abraham Lempel},
title = {An Efficient Algorithm for Generating Linear Transformations in a
Shuffle-Exchange Network},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {216--221},
year = {1986},
url = {https://doi.org/10.1137/0215015},
doi = {10.1137/0215015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtzionL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaigleLST86,
author = {Ulrich Faigle and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Rainer Schrader and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Searching in Trees, Series-Parallel and Interval Orders},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1075--1084},
year = {1986},
url = {https://doi.org/10.1137/0215077},
doi = {10.1137/0215077},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaigleLST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigenbaumS86,
author = {Joan Feigenbaum and
Alejandro A. Sch{\"{a}}ffer},
title = {Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {619--627},
year = {1986},
url = {https://doi.org/10.1137/0215045},
doi = {10.1137/0215045},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FeigenbaumS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FlajoletP86,
author = {Philippe Flajolet and
Helmut Prodinger},
title = {Register Allocation for Unary-Binary Trees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {629--640},
year = {1986},
url = {https://doi.org/10.1137/0215046},
doi = {10.1137/0215046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FlajoletP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FlajoletS86,
author = {Philippe Flajolet and
Robert Sedgewick},
title = {Digital Search Trees Revisited},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {748--767},
year = {1986},
url = {https://doi.org/10.1137/0215054},
doi = {10.1137/0215054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FlajoletS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Friedman86,
author = {Joel Friedman},
title = {Constructing O(n log n) Size Monotone Formulae for the k-th Threshold
Function of n Boolean Variables},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {641--654},
year = {1986},
url = {https://doi.org/10.1137/0215047},
doi = {10.1137/0215047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Friedman86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriesenL86,
author = {Donald K. Friesen and
Michael A. Langston},
title = {Variable Sized Bin Packing},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {222--230},
year = {1986},
url = {https://doi.org/10.1137/0215016},
doi = {10.1137/0215016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FriesenL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Frieze86,
author = {Alan M. Frieze},
title = {On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {536--539},
year = {1986},
url = {https://doi.org/10.1137/0215038},
doi = {10.1137/0215038},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Frieze86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilMG86,
author = {Zvi Galil and
Silvio Micali and
Harold N. Gabow},
title = {An {O(EV} log {V)} Algorithm for Finding a Maximal Weighted Matching
in General Graphs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {120--130},
year = {1986},
url = {https://doi.org/10.1137/0215009},
doi = {10.1137/0215009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilMG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gathen86,
author = {Joachim von zur Gathen},
title = {Representations and Parallel Computations for Rational Functions},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {432--452},
year = {1986},
url = {https://doi.org/10.1137/0215030},
doi = {10.1137/0215030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gathen86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GaverJ86,
author = {Donald P. Gaver and
Patricia A. Jacobs},
title = {Processor-Shared Time-Sharing Models in Heavy Traffic},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1085--1100},
year = {1986},
url = {https://doi.org/10.1137/0215078},
doi = {10.1137/0215078},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GaverJ86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeskeG86,
author = {John G. Geske and
Joachim Grollmann},
title = {Relativizations of Unambiguous and Random Polynomial Time Classes},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {511--519},
year = {1986},
url = {https://doi.org/10.1137/0215035},
doi = {10.1137/0215035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GeskeG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GonnetM86,
author = {Gaston H. Gonnet and
J. Ian Munro},
title = {Heaps on Heaps},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {964--971},
year = {1986},
url = {https://doi.org/10.1137/0215068},
doi = {10.1137/0215068},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GonnetM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Heide86,
author = {Friedhelm Meyer auf der Heide},
title = {Efficient Simulations Among Several Models of Parallel Computers},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {106--119},
year = {1986},
url = {https://doi.org/10.1137/0215008},
doi = {10.1137/0215008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Heide86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HirschbergL86,
author = {Daniel S. Hirschberg and
Lawrence L. Larmore},
title = {Average Case Analysis of Marking Algorithms},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1069--1074},
year = {1986},
url = {https://doi.org/10.1137/0215076},
doi = {10.1137/0215076},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HirschbergL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HopcroftW86,
author = {John E. Hopcroft and
Gordon T. Wilfong},
title = {Reducing Multiple Object Motion Planning to Graph Searching},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {768--785},
year = {1986},
url = {https://doi.org/10.1137/0215055},
doi = {10.1137/0215055},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HopcroftW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hull86,
author = {Richard Hull},
title = {Relative Information Capacity of Simple Relational Database Schemata},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {856--886},
year = {1986},
url = {https://doi.org/10.1137/0215061},
doi = {10.1137/0215061},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Hull86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuntR86,
author = {Harry B. Hunt III and
Daniel J. Rosenkrantz},
title = {Recursion Schemes and Recursive Programs are Exponentially Hard to
Analyze},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {831--850},
year = {1986},
url = {https://doi.org/10.1137/0215059},
doi = {10.1137/0215059},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuntR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Huynh86,
author = {Dung T. Huynh},
title = {The Complexity of the Membership Problem for Two Subclasses of Polynomial
Ideals},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {581--594},
year = {1986},
url = {https://doi.org/10.1137/0215042},
doi = {10.1137/0215042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Huynh86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Huynh86a,
author = {Dung T. Huynh},
title = {Some Observations about the Randomness of Hard Problems},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1101--1105},
year = {1986},
url = {https://doi.org/10.1137/0215079},
doi = {10.1137/0215079},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Huynh86a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImaiA86,
author = {Hiroshi Imai and
Takao Asano},
title = {Efficient Algorithms for Geometric Graph Search Problems},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {478--494},
year = {1986},
url = {https://doi.org/10.1137/0215033},
doi = {10.1137/0215033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImaiA86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IrvingL86,
author = {Robert W. Irving and
Paul Leather},
title = {The Complexity of Counting Stable Marriages},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {655--667},
year = {1986},
url = {https://doi.org/10.1137/0215048},
doi = {10.1137/0215048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IrvingL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JaJaT86,
author = {Joseph F. J{\'{a}}J{\'{a}} and
Jean Takche},
title = {On the Validity of the Direct Sum Conjecture},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1004--1020},
year = {1986},
url = {https://doi.org/10.1137/0215071},
doi = {10.1137/0215071},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JaJaT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnsonM86,
author = {Rodney W. Johnson and
Aileen M. McLoughlin},
title = {Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {595--603},
year = {1986},
url = {https://doi.org/10.1137/0215043},
doi = {10.1137/0215043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JohnsonM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JouannaudK86,
author = {Jean{-}Pierre Jouannaud and
H{\'{e}}l{\`{e}}ne Kirchner},
title = {Completion of a Set of Rules Modulo a Set of Equations},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1155--1194},
year = {1986},
url = {https://doi.org/10.1137/0215084},
doi = {10.1137/0215084},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JouannaudK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KatzV86,
author = {Martin David Katz and
Dennis J. Volper},
title = {Data Structures for Retrieval on Square Grids},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {919--931},
year = {1986},
url = {https://doi.org/10.1137/0215064},
doi = {10.1137/0215064},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KatzV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KawaguchiK86,
author = {Tsuyoshi Kawaguchi and
Seiki Kyan},
title = {Worst Case Bound of an {LRF} Schedule for the Mean Weighted Flow-Time
Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1119--1129},
year = {1986},
url = {https://doi.org/10.1137/0215081},
doi = {10.1137/0215081},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KawaguchiK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kingston86,
author = {Jeffrey H. Kingston},
title = {Analysis of Henriksen's Algorithm for the Simulation Event Set},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {887--902},
year = {1986},
url = {https://doi.org/10.1137/0215062},
doi = {10.1137/0215062},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kingston86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirkpatrickS86,
author = {David G. Kirkpatrick and
Raimund Seidel},
title = {The Ultimate Planar Convex Hull Algorithm?},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {287--299},
year = {1986},
url = {https://doi.org/10.1137/0215021},
doi = {10.1137/0215021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KirkpatrickS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LangenhopW86,
author = {Carl Langenhop and
William E. Wright},
title = {Probabilities Related to Father-Son Distances in Binary Search Trees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {520--530},
year = {1986},
url = {https://doi.org/10.1137/0215036},
doi = {10.1137/0215036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LangenhopW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeightonR86,
author = {Frank Thomson Leighton and
Arnold L. Rosenberg},
title = {Three-Dimensional Circuit Layouts},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {793--813},
year = {1986},
url = {https://doi.org/10.1137/0215057},
doi = {10.1137/0215057},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeightonR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Levin86,
author = {Leonid A. Levin},
title = {Average Case Complete Problems},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {285--286},
year = {1986},
url = {https://doi.org/10.1137/0215020},
doi = {10.1137/0215020},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Levin86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Li86,
author = {Liwu Li},
title = {Ranking and Unranking of AVL-Trees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1025--1035},
year = {1986},
url = {https://doi.org/10.1137/0215073},
doi = {10.1137/0215073},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Li86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Luby86,
author = {Michael Luby},
title = {A Simple Parallel Algorithm for the Maximal Independent Set Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1036--1053},
year = {1986},
url = {https://doi.org/10.1137/0215074},
doi = {10.1137/0215074},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Luby86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Maass86,
author = {Wolfgang Maass},
title = {On the Complexity of Nonconvex Covering},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {453--467},
year = {1986},
url = {https://doi.org/10.1137/0215031},
doi = {10.1137/0215031},
timestamp = {Wed, 30 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Maass86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Manber86,
author = {Udi Manber},
title = {On Maintaining Dynamic Information in a Concurrent Environment},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {1130--1142},
year = {1986},
url = {https://doi.org/10.1137/0215082},
doi = {10.1137/0215082},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Manber86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MatsumotoNS86,
author = {Kazuhiko Matsumoto and
Takao Nishizeki and
Nobuji Saito},
title = {Planar Multicommodity Flows, Maximum Matchings and Negative Cycles},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {495--510},
year = {1986},
url = {https://doi.org/10.1137/0215034},
doi = {10.1137/0215034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MatsumotoNS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MehlhornT86,
author = {Kurt Mehlhorn and
Athanasios K. Tsakalidis},
title = {An Amortized Analysis of Insertions into AVL-Trees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {22--33},
year = {1986},
url = {https://doi.org/10.1137/0215002},
doi = {10.1137/0215002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ORourke86,
author = {Joseph O'Rourke},
title = {The Signature of a Plane Curve},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {34--51},
year = {1986},
url = {https://doi.org/10.1137/0215003},
doi = {10.1137/0215003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ORourke86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/OrponenRS86,
author = {Pekka Orponen and
David A. Russo and
Uwe Sch{\"{o}}ning},
title = {Optimal Approximations and Polynomially Levelable Sets},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {399--408},
year = {1986},
url = {https://doi.org/10.1137/0215027},
doi = {10.1137/0215027},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/OrponenRS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Otto86,
author = {Friedrich Otto},
title = {Church-Rosser Thue Systems that Present Free Monoids},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {786--792},
year = {1986},
url = {https://doi.org/10.1137/0215056},
doi = {10.1137/0215056},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Otto86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PangG86,
author = {King F. Pang and
Abbas El Gamal},
title = {Communication Complexity of Computing the Hamming Distance},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {932--947},
year = {1986},
url = {https://doi.org/10.1137/0215065},
doi = {10.1137/0215065},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PangG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Prill86,
author = {David Prill},
title = {On Approximations and Incidence in Cylindrical Algebraic Decompositions},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {4},
pages = {972--993},
year = {1986},
url = {https://doi.org/10.1137/0215069},
doi = {10.1137/0215069},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Prill86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Provan86,
author = {J. Scott Provan},
title = {The Complexity of Reliability Computations in Planar and Acyclic Graphs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {694--702},
year = {1986},
url = {https://doi.org/10.1137/0215050},
doi = {10.1137/0215050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Provan86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reif86,
author = {John H. Reif},
title = {Logarithmic Depth Circuits for Algebraic Functions},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {231--242},
year = {1986},
url = {https://doi.org/10.1137/0215017},
doi = {10.1137/0215017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Reif86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SharirS86,
author = {Micha Sharir and
Amir Schorr},
title = {On Shortest Paths in Polyhedral Spaces},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {193--215},
year = {1986},
url = {https://doi.org/10.1137/0215014},
doi = {10.1137/0215014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SharirS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShubS86,
author = {Mike Shub and
Steve Smale},
title = {Computational Complexity: On the Geometry of Polynomials and a Theory
of Cost: {II}},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {145--161},
year = {1986},
url = {https://doi.org/10.1137/0215011},
doi = {10.1137/0215011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShubS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SleatorT86,
author = {Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {Self-Adjusting Heaps},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {52--69},
year = {1986},
url = {https://doi.org/10.1137/0215004},
doi = {10.1137/0215004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SleatorT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Smith86,
author = {Justin R. Smith},
title = {Parallel Algorithms for Depth-First Searches I. Planar Graphs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {814--830},
year = {1986},
url = {https://doi.org/10.1137/0215058},
doi = {10.1137/0215058},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Smith86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Turner86,
author = {Jonathan S. Turner},
title = {On the Probable Performance of Heuristics for Bandwidth Minimization},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {561--580},
year = {1986},
url = {https://doi.org/10.1137/0215041},
doi = {10.1137/0215041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Turner86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Valiant86,
author = {Leslie G. Valiant},
title = {Negation is Powerless for Boolean Slice Functions},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {531--535},
year = {1986},
url = {https://doi.org/10.1137/0215037},
doi = {10.1137/0215037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Valiant86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Willard86,
author = {Dan E. Willard},
title = {Log-Logarithmic Selection Resolution Protocols in a Multiple Access
Channel},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {468--477},
year = {1986},
url = {https://doi.org/10.1137/0215032},
doi = {10.1137/0215032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Willard86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WrightROM86,
author = {Robert Alan Wright and
L. Bruce Richmond and
Andrew M. Odlyzko and
Brendan D. McKay},
title = {Constant Time Generation of Free Trees},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {2},
pages = {540--548},
year = {1986},
url = {https://doi.org/10.1137/0215039},
doi = {10.1137/0215039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WrightROM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-04-25 14:10 CEST 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:
