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/siamcomp6.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/Adolphson77,
author = {Donald L. Adolphson},
title = {Single Machine Job Sequencing with Precedence Constraints},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {40--54},
year = {1977},
url = {https://doi.org/10.1137/0206002},
doi = {10.1137/0206002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Adolphson77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AdolphsonT77,
author = {Donald L. Adolphson and
Glenn N. Thomas},
title = {A Linear Time Algorithm for a 2 {\texttimes} n Transportation Problem},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {481--486},
year = {1977},
url = {https://doi.org/10.1137/0206034},
doi = {10.1137/0206034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AdolphsonT77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AoshimaI77,
author = {K. Aoshima and
Masao Iri},
title = {Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar
Graph in Polynomial Time"},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {86--87},
year = {1977},
url = {https://doi.org/10.1137/0206007},
doi = {10.1137/0206007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AoshimaI77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AshcroftW77,
author = {Edward A. Ashcroft and
William W. Wadge},
title = {Erratum: Lucid - {A} Formal System for Writing and Proving Programs},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {200},
year = {1977},
timestamp = {Wed, 21 Nov 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AshcroftW77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Benson77,
author = {David B. Benson},
title = {Some Preservation Properties of Normal Form Grammars},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {381--402},
year = {1977},
url = {https://doi.org/10.1137/0206027},
doi = {10.1137/0206027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Benson77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BermanH77,
author = {Leonard Berman and
Juris Hartmanis},
title = {On Isomorphisms and Density of {NP} and Other Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {305--322},
year = {1977},
url = {https://doi.org/10.1137/0206023},
doi = {10.1137/0206023},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BermanH77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Borodin77,
author = {Allan Borodin},
title = {On Relating Time and Space to Size and Depth},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {733--744},
year = {1977},
url = {https://doi.org/10.1137/0206054},
doi = {10.1137/0206054},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Borodin77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CarsonL77,
author = {John S. Carson II and
Averill M. Law},
title = {A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {696--699},
year = {1977},
url = {https://doi.org/10.1137/0206050},
doi = {10.1137/0206050},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CarsonL77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chin77,
author = {Francis Y. L. Chin},
title = {The Partial Fraction Expansion Problem and Its Inverse},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {554--562},
year = {1977},
url = {https://doi.org/10.1137/0206040},
doi = {10.1137/0206040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chin77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chvatal77,
author = {Vasek Chv{\'{a}}tal},
title = {Determining the Stability Number of a Graph},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {643--662},
year = {1977},
url = {https://doi.org/10.1137/0206046},
doi = {10.1137/0206046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chvatal77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fabri77,
author = {Janet Fabri},
title = {Some Remarks on p-Way Merging},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {269--271},
year = {1977},
url = {https://doi.org/10.1137/0206019},
doi = {10.1137/0206019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fabri77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FinoA77,
author = {Bernard J. Fino and
V. Ralph Algazi},
title = {A Unified Treatment of Discrete Fast Unitary Transforms},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {700--717},
year = {1977},
url = {https://doi.org/10.1137/0206051},
doi = {10.1137/0206051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FinoA77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gabow77,
author = {Harold N. Gabow},
title = {Two Algorithms for Generating Weighted Spanning Trees in Order},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {139--150},
year = {1977},
url = {https://doi.org/10.1137/0206011},
doi = {10.1137/0206011},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Gabow77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Galil77,
author = {Zvi Galil},
title = {On Resolution with Clauses of Bounded Size},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {444--459},
year = {1977},
url = {https://doi.org/10.1137/0206031},
doi = {10.1137/0206031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Galil77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJ77,
author = {M. R. Garey and
David S. Johnson},
title = {Two-Processor Scheduling with Start-Times and Deadlines},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {416--426},
year = {1977},
url = {https://doi.org/10.1137/0206029},
doi = {10.1137/0206029},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GareyJ77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GarsiaW77,
author = {Adriano M. Garsia and
Michelle L. Wachs},
title = {A New Algorithm for Minimum Cost Binary Trees},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {622--642},
year = {1977},
url = {https://doi.org/10.1137/0206045},
doi = {10.1137/0206045},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GarsiaW77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gill77,
author = {John Gill},
title = {Computational Complexity of Probabilistic Turing Machines},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {675--695},
year = {1977},
url = {https://doi.org/10.1137/0206049},
doi = {10.1137/0206049},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gill77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GinsburgL77,
author = {Seymour Ginsburg and
Nancy A. Lynch},
title = {Derivation Complexity in Context-Free Grammar Forms},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {123--138},
year = {1977},
url = {https://doi.org/10.1137/0206010},
doi = {10.1137/0206010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GinsburgL77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GonzalezIS77,
author = {Teofilo F. Gonzalez and
Oscar H. Ibarra and
Sartaj Sahni},
title = {Bounds for {LPT} Schedules on Uniform Processors},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {155--166},
year = {1977},
url = {https://doi.org/10.1137/0206013},
doi = {10.1137/0206013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GonzalezIS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HendersonZ77,
author = {Peter B. Henderson and
Yechezkel Zalcstein},
title = {A Graph-Theoretic Characterization of the PV{\_}chunk Class of Synchronizing
Primitives},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {88--108},
year = {1977},
url = {https://doi.org/10.1137/0206008},
doi = {10.1137/0206008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HendersonZ77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HikitaN77,
author = {Teruo Hikita and
Akihiro Nozaki},
title = {A Completeness Criterion for Spectra},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {285--297},
year = {1977},
url = {https://doi.org/10.1137/0206021},
doi = {10.1137/0206021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HikitaN77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Igarashi77,
author = {Yoshihide Igarashi},
title = {The Tape Complexity of Some Classes of Szilard Languages},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {460--466},
year = {1977},
url = {https://doi.org/10.1137/0206032},
doi = {10.1137/0206032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Igarashi77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JoshiL77,
author = {Aravind K. Joshi and
Leon S. Levy},
title = {Constraints on Structural Descriptions: Local Transformations},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {272--284},
year = {1977},
url = {https://doi.org/10.1137/0206020},
doi = {10.1137/0206020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JoshiL77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KafuraS77,
author = {Dennis G. Kafura and
Vincent Y. Shen},
title = {Task Scheduling on a Multiprocessor System with Independent Memories},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {167--187},
year = {1977},
url = {https://doi.org/10.1137/0206014},
doi = {10.1137/0206014},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KafuraS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirkpatrickK77,
author = {David G. Kirkpatrick and
Zvi M. Kedem},
title = {Adequate Requirements for Rational Functions},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {188--199},
year = {1977},
url = {https://doi.org/10.1137/0206015},
doi = {10.1137/0206015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KirkpatrickK77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KnuthMP77,
author = {Donald E. Knuth and
James H. Morris Jr. and
Vaughan R. Pratt},
title = {Fast Pattern Matching in Strings},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {323--350},
year = {1977},
url = {https://doi.org/10.1137/0206024},
doi = {10.1137/0206024},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KnuthMP77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kou77,
author = {Lawrence T. Kou},
title = {Polynomial Complete Consecutive Information Retrieval Problems},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {67--75},
year = {1977},
url = {https://doi.org/10.1137/0206004},
doi = {10.1137/0206004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kou77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KunduM77,
author = {Sukhamay Kundu and
Jayadev Misra},
title = {A Linear Tree Partitioning Algorithm},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {151--154},
year = {1977},
url = {https://doi.org/10.1137/0206012},
doi = {10.1137/0206012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KunduM77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KungT77,
author = {H. T. Kung and
D. M. Tong},
title = {Fast Algorithms for Partial Fraction Decomposition},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {582--593},
year = {1977},
url = {https://doi.org/10.1137/0206042},
doi = {10.1137/0206042},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KungT77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ladner77,
author = {Richard E. Ladner},
title = {The Computational Complexity of Provability in Systems of Modal Propositional
Logic},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {467--480},
year = {1977},
url = {https://doi.org/10.1137/0206033},
doi = {10.1137/0206033},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Ladner77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LamS77,
author = {Shui Lam and
Ravi Sethi},
title = {Worst Case Analysis of Two Scheduling Algorithms},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {518--536},
year = {1977},
url = {https://doi.org/10.1137/0206037},
doi = {10.1137/0206037},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LamS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Larson77,
author = {Richard G. Larson},
title = {Minimizing Garbage Collection as a Function of Region Size},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {663--668},
year = {1977},
url = {https://doi.org/10.1137/0206047},
doi = {10.1137/0206047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Larson77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeP77,
author = {D. T. Lee and
Franco P. Preparata},
title = {Location of a Point in a Planar Subdivision and Its Applications},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {594--606},
year = {1977},
url = {https://doi.org/10.1137/0206043},
doi = {10.1137/0206043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeeP77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McCollP77,
author = {William F. McColl and
Mike Paterson},
title = {The Depth of All Boolean Functions},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {373--380},
year = {1977},
url = {https://doi.org/10.1137/0206026},
doi = {10.1137/0206026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/McCollP77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mehlhorn77,
author = {Kurt Mehlhorn},
title = {A Best Possible Bound for the Weighted Path Length of Binary Search
Trees},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {235--239},
year = {1977},
url = {https://doi.org/10.1137/0206017},
doi = {10.1137/0206017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mehlhorn77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Misra77,
author = {Jayadev Misra},
title = {Prospects and Limitations of Automatic Assertion Generation for Loop
Programs},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {718--729},
year = {1977},
url = {https://doi.org/10.1137/0206052},
doi = {10.1137/0206052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Misra77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MiyakawaYSH77,
author = {Masahiro Miyakawa and
Toshitsugu Yuba and
Yoshio Sugito and
Mamoru Hoshi},
title = {Optimum Sequence Trees},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {201--234},
year = {1977},
url = {https://doi.org/10.1137/0206016},
doi = {10.1137/0206016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MiyakawaYSH77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouS77,
author = {Christos H. Papadimitriou and
Kenneth Steiglitz},
title = {On the Complexity of Local Search for the Traveling Salesman Problem},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {76--83},
year = {1977},
url = {https://doi.org/10.1137/0206005},
doi = {10.1137/0206005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pardo77,
author = {Luis Trabb Pardo},
title = {Stable Sorting and Merging with Optimal Space and Time Bounds},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {351--372},
year = {1977},
url = {https://doi.org/10.1137/0206025},
doi = {10.1137/0206025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pardo77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Paul77,
author = {Wolfgang J. Paul},
title = {A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {427--443},
year = {1977},
url = {https://doi.org/10.1137/0206030},
doi = {10.1137/0206030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Paul77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pippenger77,
author = {Nicholas Pippenger},
title = {Superconcentrators},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {298--304},
year = {1977},
url = {https://doi.org/10.1137/0206022},
doi = {10.1137/0206022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pippenger77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reyner77,
author = {Steven W. Reyner},
title = {An Analysis of a Good Algorithm for the Subtree Problem},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {730--732},
year = {1977},
url = {https://doi.org/10.1137/0206053},
doi = {10.1137/0206053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Reyner77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rivest77,
author = {Ronald L. Rivest},
title = {On the Worst-Case Behavior of String-Searching Algorithms},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {669--674},
year = {1977},
url = {https://doi.org/10.1137/0206048},
doi = {10.1137/0206048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rivest77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenkrantzSL77,
author = {Daniel J. Rosenkrantz and
Richard Edwin Stearns and
Philip M. Lewis II},
title = {An Analysis of Several Heuristics for the Traveling Salesman Problem},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {563--581},
year = {1977},
url = {https://doi.org/10.1137/0206041},
doi = {10.1137/0206041},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/RosenkrantzSL77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenthalG77,
author = {Arnie Rosenthal and
Anita Goldner},
title = {Smallest Augmentations to Biconnect a Graph},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {55--66},
year = {1977},
url = {https://doi.org/10.1137/0206003},
doi = {10.1137/0206003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RosenthalG77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RuskeyH77,
author = {Frank Ruskey and
T. C. Hu},
title = {Generating Binary Trees Lexicographically},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {745--758},
year = {1977},
url = {https://doi.org/10.1137/0206055},
doi = {10.1137/0206055},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/RuskeyH77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Russell77,
author = {Bruce D. Russell},
title = {Implementation Correctness Involving a Language with goto Statements},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {403--415},
year = {1977},
url = {https://doi.org/10.1137/0206028},
doi = {10.1137/0206028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Russell77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Russell77a,
author = {David L. Russell},
title = {Internal Fragmentation in a Class of Buddy Systems},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {4},
pages = {607--621},
year = {1977},
url = {https://doi.org/10.1137/0206044},
doi = {10.1137/0206044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Russell77a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchmidtS77,
author = {Erik Meineche Schmidt and
Thomas G. Szymanski},
title = {Succinctness of Descriptions of Unambiguous Context-Free Languages},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {547--553},
year = {1977},
url = {https://doi.org/10.1137/0206039},
doi = {10.1137/0206039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SchmidtS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sedgewick77,
author = {Robert Sedgewick},
title = {Quicksort with Equal Keys},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {2},
pages = {240--268},
year = {1977},
url = {https://doi.org/10.1137/0206018},
doi = {10.1137/0206018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sedgewick77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Seiferas77,
author = {Joel I. Seiferas},
title = {Linear-Time Computation by Nondeterministic Multidimensional Iterative
Arrays},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {487--504},
year = {1977},
url = {https://doi.org/10.1137/0206035},
doi = {10.1137/0206035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Seiferas77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SolovayS77,
author = {Robert Solovay and
Volker Strassen},
title = {A Fast Monte-Carlo Test for Primality},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {84--85},
year = {1977},
url = {https://doi.org/10.1137/0206006},
doi = {10.1137/0206006},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/SolovayS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SzymanskiU77,
author = {Thomas G. Szymanski and
Jeffrey D. Ullman},
title = {Evaluating Relational Expressions with Dense and Sparse Arguments},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {109--122},
year = {1977},
url = {https://doi.org/10.1137/0206009},
doi = {10.1137/0206009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SzymanskiU77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanT77,
author = {Robert Endre Tarjan and
Anthony E. Trojanowski},
title = {Finding a Maximum Independent Set},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {537--546},
year = {1977},
url = {https://doi.org/10.1137/0206038},
doi = {10.1137/0206038},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanT77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TsukiyamaIAS77,
author = {Shuji Tsukiyama and
Mikio Ide and
Hiromu Ariyoshi and
Isao Shirakawa},
title = {A New Algorithm for Generating All the Maximal Independent Sets},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {505--517},
year = {1977},
url = {https://doi.org/10.1137/0206036},
doi = {10.1137/0206036},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/TsukiyamaIAS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zave77,
author = {Derek A. Zave},
title = {Optimal Polyphase Sorting},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {1},
pages = {1--39},
year = {1977},
url = {https://doi.org/10.1137/0206001},
doi = {10.1137/0206001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Zave77.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-07 02:36 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:
