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/siamcomp7.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/Baker78,
author = {Brenda S. Baker},
title = {Generalized Syntax Directed Translation, Tree Transducers, and Linear
Space},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {376--391},
year = {1978},
url = {https://doi.org/10.1137/0207030},
doi = {10.1137/0207030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Baker78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Baker78a,
author = {Theodore P. Baker},
title = {A Technique for Extending Rapid Exact-Match String Matching to Arrays
of More Than One Dimension},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {533--541},
year = {1978},
url = {https://doi.org/10.1137/0207043},
doi = {10.1137/0207043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Baker78a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Biskup78,
author = {Joachim Biskup},
title = {The Time Measure of One-Tape Turing Machines Does Not Have the Parallel
Computation Property},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {115--117},
year = {1978},
url = {https://doi.org/10.1137/0207008},
doi = {10.1137/0207008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Biskup78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BookN78,
author = {Ronald V. Book and
Maurice Nivat},
title = {Linear Languages and the Intersection Closures of Classes of Languages},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {167--177},
year = {1978},
url = {https://doi.org/10.1137/0207016},
doi = {10.1137/0207016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BookN78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Booth78,
author = {Kellogg S. Booth},
title = {Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are
Polynomially Equivalent Problems},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {273--279},
year = {1978},
url = {https://doi.org/10.1137/0207023},
doi = {10.1137/0207023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Booth78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrockettD78,
author = {Roger W. Brockett and
David P. Dobkin},
title = {Errata: On the Number of Multiplications Required for Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {238},
year = {1978},
url = {https://doi.org/10.1137/0207021},
doi = {10.1137/0207021},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrockettD78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Brown78,
author = {Mark R. Brown},
title = {Implementation and Analysis of Binomial Queue Algorithms},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {298--319},
year = {1978},
url = {https://doi.org/10.1137/0207026},
doi = {10.1137/0207026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Brown78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrunoD78,
author = {John L. Bruno and
Peter J. Downey},
title = {Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover
Costs},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {393--404},
year = {1978},
url = {https://doi.org/10.1137/0207031},
doi = {10.1137/0207031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BrunoD78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJ78,
author = {Edward G. Coffman Jr. and
M. R. Garey and
David S. Johnson},
title = {An Application of Bin-Packing to Multiprocessor Scheduling},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {1--17},
year = {1978},
url = {https://doi.org/10.1137/0207001},
doi = {10.1137/0207001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanGJ78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cook78,
author = {Stephen A. Cook},
title = {Soundness and Completeness of an Axiom System for Program Verification},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {70--90},
year = {1978},
url = {https://doi.org/10.1137/0207005},
doi = {10.1137/0207005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cook78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaginP78,
author = {Ronald Fagin and
Thomas G. Price},
title = {Efficient Calculation of Expected Miss Ratios in the Independent Reference
Model},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {288--297},
year = {1978},
url = {https://doi.org/10.1137/0207025},
doi = {10.1137/0207025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaginP78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonHK78,
author = {Greg N. Frederickson and
Matthew S. Hecht and
Chul E. Kim},
title = {Approximation Algorithms for Some Routing Problems},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {178--193},
year = {1978},
url = {https://doi.org/10.1137/0207017},
doi = {10.1137/0207017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonHK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fredman78,
author = {Michael L. Fredman},
title = {Observations on the Complexity of Generating Quasi-Gray Codes},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {134--146},
year = {1978},
url = {https://doi.org/10.1137/0207012},
doi = {10.1137/0207012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fredman78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowM78,
author = {Harold N. Gabow and
Eugene W. Myers},
title = {Finding All Spanning Trees of Directed and Undirected Graphs},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {280--287},
year = {1978},
url = {https://doi.org/10.1137/0207024},
doi = {10.1137/0207024},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GabowM78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gold78,
author = {E. Mark Gold},
title = {Deadlock Prediction: Easy and Difficult Cases},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {320--336},
year = {1978},
url = {https://doi.org/10.1137/0207027},
doi = {10.1137/0207027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gold78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuntR78,
author = {Harry B. Hunt III and
Daniel J. Rosenkrantz},
title = {Computational Parallels Between the Regular and Context-Free Languages},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {99--114},
year = {1978},
url = {https://doi.org/10.1137/0207007},
doi = {10.1137/0207007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuntR78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ibarra78,
author = {Oscar H. Ibarra},
title = {The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's
with Unary Input (Output) Alphabet and Applications},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {524--532},
year = {1978},
url = {https://doi.org/10.1137/0207042},
doi = {10.1137/0207042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ibarra78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ItaiR78,
author = {Alon Itai and
Michael Rodeh},
title = {Finding a Minimum Circuit in a Graph},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {413--423},
year = {1978},
url = {https://doi.org/10.1137/0207033},
doi = {10.1137/0207033},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ItaiR78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnsonM78,
author = {Donald B. Johnson and
Tetsuo Mizoguchi},
title = {Selecting the Kth element in {X} + {Y} and X{\_}1 + X{\_}2 + ... +
X{\_}m},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {147--153},
year = {1978},
url = {https://doi.org/10.1137/0207013},
doi = {10.1137/0207013},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JohnsonM78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonheimR78,
author = {Alan G. Konheim and
Martin Reiser},
title = {Finite Capacity Queuing Systems with Applications in Computer Modeling},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {210--229},
year = {1978},
url = {https://doi.org/10.1137/0207019},
doi = {10.1137/0207019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KonheimR78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lipton78,
author = {Richard J. Lipton},
title = {Polynomials with 0-1 Coefficients that Are Hard to Evaluate},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {61--69},
year = {1978},
url = {https://doi.org/10.1137/0207004},
doi = {10.1137/0207004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lipton78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LynchL78,
author = {Nancy A. Lynch and
Richard J. Lipton},
title = {On Structure Preserving Reductions},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {119--126},
year = {1978},
url = {https://doi.org/10.1137/0207010},
doi = {10.1137/0207010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LynchL78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MachteyWY78,
author = {Michael Machtey and
Karl Winklmann and
Paul Young},
title = {Simple G{\"{o}}del Numberings, Isomorphisms, and Programming
Properties},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {39--60},
year = {1978},
url = {https://doi.org/10.1137/0207003},
doi = {10.1137/0207003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MachteyWY78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MaurerSW78,
author = {Hermann A. Maurer and
Arto Salomaa and
Derick Wood},
title = {On Good {E0L} Forms},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {158--166},
year = {1978},
url = {https://doi.org/10.1137/0207015},
doi = {10.1137/0207015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MaurerSW78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegiddoT78,
author = {Nimrod Megiddo and
Arie Tamir},
title = {An {O(N} log {N)} Algorithm for a Class of Matching Problems},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {154--157},
year = {1978},
url = {https://doi.org/10.1137/0207014},
doi = {10.1137/0207014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MegiddoT78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pippenger78,
author = {Nicholas Pippenger},
title = {Generalized Connectors},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {510--514},
year = {1978},
url = {https://doi.org/10.1137/0207040},
doi = {10.1137/0207040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pippenger78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Plaisted78,
author = {David A. Plaisted},
title = {Some Polynomial and Integer Divisibility problems are NP-Hard},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {458--464},
year = {1978},
url = {https://doi.org/10.1137/0207036},
doi = {10.1137/0207036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Plaisted78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Probert78,
author = {Robert L. Probert},
title = {An Extension of Computational Duality to Sequences of Bilinear Computations},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {91--98},
year = {1978},
url = {https://doi.org/10.1137/0207006},
doi = {10.1137/0207006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Probert78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Purdom78,
author = {Paul Walton Purdom Jr.},
title = {Tree Size by Partial Backtracking},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {481--491},
year = {1978},
url = {https://doi.org/10.1137/0207038},
doi = {10.1137/0207038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Purdom78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReghbatiC78,
author = {Eshrat Reghbati and
Derek G. Corneil},
title = {Parallel Computations in Graph Theory},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {230--237},
year = {1978},
url = {https://doi.org/10.1137/0207020},
doi = {10.1137/0207020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReghbatiC78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenbergS78,
author = {Arnold L. Rosenberg and
Lawrence Snyder},
title = {Minimal-Comparison 2, 3-Trees},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {465--480},
year = {1978},
url = {https://doi.org/10.1137/0207037},
doi = {10.1137/0207037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RosenbergS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenkrantzH78,
author = {Daniel J. Rosenkrantz and
Harry B. Hunt III},
title = {Polynomial Algorithms for Deterministic Pushdown Automata},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {405--412},
year = {1978},
url = {https://doi.org/10.1137/0207032},
doi = {10.1137/0207032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RosenkrantzH78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ruskey78,
author = {Frank Ruskey},
title = {Generating t-ary Trees Lexicographically},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {424--439},
year = {1978},
url = {https://doi.org/10.1137/0207034},
doi = {10.1137/0207034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ruskey78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schnorr78,
author = {Claus{-}Peter Schnorr},
title = {An Algorithm for Transitive Closure with Linear Expected Time},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {127--133},
year = {1978},
url = {https://doi.org/10.1137/0207011},
doi = {10.1137/0207011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Schnorr78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sedgewick78,
author = {Robert Sedgewick},
title = {Data Movement in Odd-Even Merging},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {239--272},
year = {1978},
url = {https://doi.org/10.1137/0207022},
doi = {10.1137/0207022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sedgewick78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Selman78,
author = {Alan L. Selman},
title = {Polynomial Time Enumeration Reducibility},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {440--457},
year = {1978},
url = {https://doi.org/10.1137/0207035},
doi = {10.1137/0207035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Selman78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SolovayS78,
author = {Robert Solovay and
Volker Strassen},
title = {Erratum: {A} Fast Monte-Carlo Test for Primality},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {118},
year = {1978},
url = {https://doi.org/10.1137/0207009},
doi = {10.1137/0207009},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/SolovayS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Tanner78,
author = {Robert Michael Tanner},
title = {Minimean Merging and Sorting: An Algorithm},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {1},
pages = {18--38},
year = {1978},
url = {https://doi.org/10.1137/0207002},
doi = {10.1137/0207002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Tanner78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Trojanowski78,
author = {Anthony E. Trojanowski},
title = {Ranking and Listing Algorithms for k-ary Trees},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {492--509},
year = {1978},
url = {https://doi.org/10.1137/0207039},
doi = {10.1137/0207039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Trojanowski78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wadsworth78,
author = {Christopher P. Wadsworth},
title = {Approximate Reduction and Lambda Calculus Models},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {337--356},
year = {1978},
url = {https://doi.org/10.1137/0207028},
doi = {10.1137/0207028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wadsworth78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WagnerS78,
author = {Robert A. Wagner and
Joel I. Seiferas},
title = {Correcting Counter-Automaton-Recognizable Languages},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {3},
pages = {357--375},
year = {1978},
url = {https://doi.org/10.1137/0207029},
doi = {10.1137/0207029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WagnerS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wrathall78,
author = {Celia Wrathall},
title = {Rudimentary Predicates and Relative Computation},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {194--209},
year = {1978},
url = {https://doi.org/10.1137/0207018},
doi = {10.1137/0207018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wrathall78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao78,
author = {Andrew Chi{-}Chih Yao},
title = {On the Loop Switching Addressing Problem},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {4},
pages = {515--523},
year = {1978},
url = {https://doi.org/10.1137/0207041},
doi = {10.1137/0207041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yao78.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-24 14:17 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:
