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/siamcomp8.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AggarwalB79,
author = {Vijay B. Aggarwal and
James W. Burgmeier},
title = {A Round-Off Error Model with Applications to Arithmetic Expressions},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {60--72},
year = {1979},
url = {https://doi.org/10.1137/0208005},
doi = {10.1137/0208005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalB79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhoSU79,
author = {Alfred V. Aho and
Yehoshua Sagiv and
Jeffrey D. Ullman},
title = {Equivalences Among Relational Expressions},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {218--246},
year = {1979},
url = {https://doi.org/10.1137/0208017},
doi = {10.1137/0208017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AhoSU79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BagchiR79,
author = {A. Bagchi and
J. K. Roy},
title = {On V-Optimal Trees},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {524--541},
year = {1979},
url = {https://doi.org/10.1137/0208042},
doi = {10.1137/0208042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BagchiR79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bitner79,
author = {James R. Bitner},
title = {Heuristics That Dynamically Organize Data Structures},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {82--110},
year = {1979},
url = {https://doi.org/10.1137/0208007},
doi = {10.1137/0208007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bitner79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BitnerW79,
author = {James R. Bitner and
C. K. Wong},
title = {Optimal and Near-Optimal Scheduling Algorithms for Batched Processing
in Linear Storage},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {479--498},
year = {1979},
url = {https://doi.org/10.1137/0208039},
doi = {10.1137/0208039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BitnerW79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Book79,
author = {Ronald V. Book},
title = {Polynomial Space and Transitive Closure},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {434--439},
year = {1979},
url = {https://doi.org/10.1137/0208035},
doi = {10.1137/0208035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Book79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Brown79,
author = {Mark R. Brown},
title = {A Partial Analysis of Random Height-Balanced Trees},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {33--41},
year = {1979},
url = {https://doi.org/10.1137/0208003},
doi = {10.1137/0208003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Brown79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Carlson79,
author = {Carl R. Carlson},
title = {A Counterexample to Reingold's Pushdown Permuter Characterization
Theorem},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {199--201},
year = {1979},
url = {https://doi.org/10.1137/0208015},
doi = {10.1137/0208015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Carlson79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanL79,
author = {Edward G. Coffman Jr. and
Joseph Y.{-}T. Leung},
title = {Combinatorial Analysis of an Efficient Algorithm for Processor and
Storage Allocation},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {202--217},
year = {1979},
url = {https://doi.org/10.1137/0208016},
doi = {10.1137/0208016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanL79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Donahue79,
author = {James E. Donahue},
title = {On the Semantics of "Data Type"},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {546--560},
year = {1979},
url = {https://doi.org/10.1137/0208044},
doi = {10.1137/0208044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Donahue79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Epstein79,
author = {H. I. Epstein},
title = {A Natural Structure Theorem for Complex Fields},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {320--325},
year = {1979},
url = {https://doi.org/10.1137/0208024},
doi = {10.1137/0208024},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Epstein79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fortune79,
author = {Steven Fortune},
title = {A Note on Sparse Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {431--433},
year = {1979},
url = {https://doi.org/10.1137/0208034},
doi = {10.1137/0208034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fortune79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GonnetM79,
author = {Gaston H. Gonnet and
J. Ian Munro},
title = {Efficient Ordering of Hash Tables},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {463--478},
year = {1979},
url = {https://doi.org/10.1137/0208038},
doi = {10.1137/0208038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GonnetM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HagiharaITK79,
author = {Kenichi Hagihara and
Minoru Ito and
Kenichi Taniguchi and
Tadao Kasami},
title = {Decision Problems for Multivalued Dependencies in Relational Databases},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {247--264},
year = {1979},
url = {https://doi.org/10.1137/0208018},
doi = {10.1137/0208018},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HagiharaITK79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HarperS79,
author = {L. H. Harper and
John E. Savage},
title = {Lower Bounds on Synchronous Combinational Complexity},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {115--119},
year = {1979},
url = {https://doi.org/10.1137/0208009},
doi = {10.1137/0208009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HarperS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HehnerH79,
author = {Eric C. R. Hehner and
R. Nigel Horspool},
title = {A New Representation of the Rational Numbers for Fast Easy Arithmetic},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {124--134},
year = {1979},
url = {https://doi.org/10.1137/0208011},
doi = {10.1137/0208011},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HehnerH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HikitaN79,
author = {Teruo Hikita and
Akihiro Nozaki},
title = {Corrigenda: {A} Completeness Criterion for Spectra},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {656},
year = {1979},
url = {https://doi.org/10.1137/0208052},
doi = {10.1137/0208052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HikitaN79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hyafil79,
author = {Laurent Hyafil},
title = {On the Parallel Evaluation of Multivariate Polynomials},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {120--123},
year = {1979},
url = {https://doi.org/10.1137/0208010},
doi = {10.1137/0208010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hyafil79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ItaiS79,
author = {Alon Itai and
Yossi Shiloach},
title = {Maximum Flow in Planar Networks},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {135--150},
year = {1979},
url = {https://doi.org/10.1137/0208012},
doi = {10.1137/0208012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ItaiS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JaJa79,
author = {Joseph F. J{\'{a}}J{\'{a}}},
title = {Optimal Evaluation of Pairs of Bilinear Forms},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {443--462},
year = {1979},
url = {https://doi.org/10.1137/0208037},
doi = {10.1137/0208037},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JaJa79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanB79,
author = {Ravindran Kannan and
Achim Bachem},
title = {Polynomial Algorithms for Computing the Smith and Hermite Normal Forms
of an Integer Matrix},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {499--507},
year = {1979},
url = {https://doi.org/10.1137/0208040},
doi = {10.1137/0208040},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanB79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Karp79,
author = {Richard M. Karp},
title = {A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {561--573},
year = {1979},
url = {https://doi.org/10.1137/0208045},
doi = {10.1137/0208045},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Karp79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KasaiAI79,
author = {Takumi Kasai and
Akeo Adachi and
Shigeki Iwata},
title = {Classes of Pebble Games and Complete Problems},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {574--586},
year = {1979},
url = {https://doi.org/10.1137/0208046},
doi = {10.1137/0208046},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KasaiAI79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Klip79,
author = {Dorothea A. Klip},
title = {New Algorithms for Polynomial Multiplication},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {326--343},
year = {1979},
url = {https://doi.org/10.1137/0208025},
doi = {10.1137/0208025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Klip79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KrishnamoorthyD79,
author = {Mukkai S. Krishnamoorthy and
Narsingh Deo},
title = {Node-Deletion NP-Complete Problems},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {619--625},
year = {1979},
url = {https://doi.org/10.1137/0208049},
doi = {10.1137/0208049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KrishnamoorthyD79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Maier79,
author = {David Maier},
title = {An Efficient Method for Storing Ancestor Information in Trees},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {599--618},
year = {1979},
url = {https://doi.org/10.1137/0208048},
doi = {10.1137/0208048},
timestamp = {Sun, 05 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Maier79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McDiarmid79,
author = {Colin McDiarmid},
title = {Determining the Chromatic Number of a Graph},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {1--14},
year = {1979},
url = {https://doi.org/10.1137/0208001},
doi = {10.1137/0208001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/McDiarmid79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McKay79,
author = {John McKay},
title = {Some Remarks on Computing Galois Groups},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {344--347},
year = {1979},
url = {https://doi.org/10.1137/0208026},
doi = {10.1137/0208026},
timestamp = {Thu, 30 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/McKay79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mehlhorn79,
author = {Kurt Mehlhorn},
title = {Dynamic Binary Search},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {175--198},
year = {1979},
url = {https://doi.org/10.1137/0208014},
doi = {10.1137/0208014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mehlhorn79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MillerPRS79,
author = {Raymond E. Miller and
Nicholas Pippenger and
Arnold L. Rosenberg and
Lawrence Snyder},
title = {Optimal 2, 3-Trees},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {42--59},
year = {1979},
url = {https://doi.org/10.1137/0208004},
doi = {10.1137/0208004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MillerPRS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Opatrny79,
author = {Jaroslav Opatrny},
title = {Total Ordering Problem},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {111--114},
year = {1979},
url = {https://doi.org/10.1137/0208008},
doi = {10.1137/0208008},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Opatrny79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouY79,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Scheduling Interval-Ordered Tasks},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {405--409},
year = {1979},
url = {https://doi.org/10.1137/0208031},
doi = {10.1137/0208031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Preparata79,
author = {Franco P. Preparata},
title = {A Note on Locating a Set of Points in a Planar Subdivision},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {542--545},
year = {1979},
url = {https://doi.org/10.1137/0208043},
doi = {10.1137/0208043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Preparata79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Priese79,
author = {Lutz Priese},
title = {Towards a Precise Characterization of the Complexity of Universal
and Nonuniversal Turing Machines},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {508--523},
year = {1979},
url = {https://doi.org/10.1137/0208041},
doi = {10.1137/0208041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Priese79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ProbstA79,
author = {David K. Probst and
Vangalur S. Alagar},
title = {A Family of Algorithms for Powering Sparse Polynomials},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {626--644},
year = {1979},
url = {https://doi.org/10.1137/0208050},
doi = {10.1137/0208050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ProbstA79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RothsteinC79,
author = {Michael Rothstein and
Bob F. Caviness},
title = {A Structure Theorem for Exponential and Primitive Functions},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {357--367},
year = {1979},
url = {https://doi.org/10.1137/0208028},
doi = {10.1137/0208028},
timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RothsteinC79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SahniC79,
author = {Sartaj Sahni and
Yookun Cho},
title = {Nearly On Line Scheduling of a Uniform Processor System with Release
Times},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {275--285},
year = {1979},
url = {https://doi.org/10.1137/0208020},
doi = {10.1137/0208020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SahniC79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schnorr79,
author = {Claus{-}Peter Schnorr},
title = {Bottlenecks and Edge Connectivity in Unsymmetrical Networks},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {265--274},
year = {1979},
url = {https://doi.org/10.1137/0208019},
doi = {10.1137/0208019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Schnorr79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Shamir79,
author = {Adi Shamir},
title = {A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {645--655},
year = {1979},
url = {https://doi.org/10.1137/0208051},
doi = {10.1137/0208051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Shamir79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Shiloach79,
author = {Yossi Shiloach},
title = {A Minimum Linear Arrangement Algorithm for Undirected Trees},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {15--32},
year = {1979},
url = {https://doi.org/10.1137/0208002},
doi = {10.1137/0208002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Shiloach79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Shiloach79a,
author = {Yossi Shiloach},
title = {Multi-Terminal 0-1 Flow},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {422--430},
year = {1979},
url = {https://doi.org/10.1137/0208033},
doi = {10.1137/0208033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Shiloach79a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StockmeyerC79,
author = {Larry J. Stockmeyer and
Ashok K. Chandra},
title = {Provably Difficult Combinatorial Games},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {2},
pages = {151--174},
year = {1979},
url = {https://doi.org/10.1137/0208013},
doi = {10.1137/0208013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerC79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StockmeyerW79,
author = {Larry J. Stockmeyer and
C. K. Wong},
title = {On the Number of Comparisons to Find the Intersection of Two Relations},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {388--404},
year = {1979},
url = {https://doi.org/10.1137/0208030},
doi = {10.1137/0208030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerW79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Stoutemyer79,
author = {David R. Stoutemyer},
title = {Automatic Asymptotic and Big-O Calculations Via Computer Algebra},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {287--299},
year = {1979},
url = {https://doi.org/10.1137/0208021},
doi = {10.1137/0208021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Stoutemyer79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Valiant79,
author = {Leslie G. Valiant},
title = {The Complexity of Enumeration and Reliability Problems},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {410--421},
year = {1979},
url = {https://doi.org/10.1137/0208032},
doi = {10.1137/0208032},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Valiant79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Walkup79,
author = {David W. Walkup},
title = {On the Expected Value of a Random Assignment Problem},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {440--442},
year = {1979},
url = {https://doi.org/10.1137/0208036},
doi = {10.1137/0208036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Walkup79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WangT79,
author = {Paul S. Wang and
Barry M. Trager},
title = {New Algorithms for Polynomial Square-Free Decomposition Over the Integers},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {300--305},
year = {1979},
url = {https://doi.org/10.1137/0208022},
doi = {10.1137/0208022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WangT79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Weyuker79,
author = {Elaine J. Weyuker},
title = {Translatability and Decidability Questions for Restricted Classes
of Program Schemas},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {587--598},
year = {1979},
url = {https://doi.org/10.1137/0208047},
doi = {10.1137/0208047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Weyuker79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wirth79,
author = {Michael C. Wirth},
title = {Symbolic Vector and Dyadic Analysis},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {306--319},
year = {1979},
url = {https://doi.org/10.1137/0208023},
doi = {10.1137/0208023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wirth79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao79,
author = {Andrew Chi{-}Chih Yao},
title = {The Complexity of Pattern Matching for a Random String},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {368--387},
year = {1979},
url = {https://doi.org/10.1137/0208029},
doi = {10.1137/0208029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yao79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yun79,
author = {David Y. Y. Yun},
title = {Uniform Bounds for a Class of Algebraic Mappings},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {348--356},
year = {1979},
url = {https://doi.org/10.1137/0208027},
doi = {10.1137/0208027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yun79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ZaksR79,
author = {Shmuel Zaks and
D. Richards},
title = {Generating Trees and Other Combinatorial Objects Lexicographically},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {1},
pages = {73--81},
year = {1979},
url = {https://doi.org/10.1137/0208006},
doi = {10.1137/0208006},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ZaksR79.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-05-25 14:35 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:
