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/siamcomp12.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AtkinsonL83,
author = {M. D. Atkinson and
S. Lloyd},
title = {The Ranks of m * n * (mn-2) Tensors},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {611--615},
year = {1983},
url = {https://doi.org/10.1137/0212041},
doi = {10.1137/0212041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AtkinsonL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BakerS83,
author = {Brenda S. Baker and
Jerald S. Schwarz},
title = {Shelf Algorithms for Two-Dimensional Packing Problems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {508--525},
year = {1983},
url = {https://doi.org/10.1137/0212033},
doi = {10.1137/0212033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BakerS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergstraT83,
author = {Jan A. Bergstra and
John V. Tucker},
title = {Initial and Final Algebra Semantics for Data Type Specifications:
Two Characterization Theorems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {366--387},
year = {1983},
url = {https://doi.org/10.1137/0212024},
doi = {10.1137/0212024},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BergstraT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bloniarz83,
author = {Peter A. Bloniarz},
title = {A Shortest-Path Algorithm with Expected Time O(n\({}^{\mbox{2}}\)
log n log* n)},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {588--600},
year = {1983},
url = {https://doi.org/10.1137/0212039},
doi = {10.1137/0212039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bloniarz83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BloomT83,
author = {Stephen L. Bloom and
Ralph Tindell},
title = {Varieties of "if-then-else"},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {677--707},
year = {1983},
url = {https://doi.org/10.1137/0212047},
doi = {10.1137/0212047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BloomT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanI83,
author = {Tat{-}hung Chan and
Oscar H. Ibarra},
title = {On the Space and Time Complexity of Functions Computable by Simple
Programs},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {708--716},
year = {1983},
url = {https://doi.org/10.1137/0212048},
doi = {10.1137/0212048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanI83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenV83,
author = {Wen{-}Chin Chen and
Jeffrey Scott Vitter},
title = {Analysis of Early-Insertion Standard Coalesced Hashing},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {667--676},
year = {1983},
url = {https://doi.org/10.1137/0212046},
doi = {10.1137/0212046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenV83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChoffrutC83,
author = {Christian Choffrut and
Karel Cul{\'{\i}}k II},
title = {Properties of Finite and Pushdown Transducers},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {300--315},
year = {1983},
url = {https://doi.org/10.1137/0212019},
doi = {10.1137/0212019},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChoffrutC83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChoyW83,
author = {David M. Choy and
C. K. Wong},
title = {Construction of Optimal alpha-beta Leaf Trees with Applications to
Prefix Code and Information Retrieval},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {426--446},
year = {1983},
url = {https://doi.org/10.1137/0212028},
doi = {10.1137/0212028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChoyW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJ83,
author = {Edward G. Coffman Jr. and
M. R. Garey and
David S. Johnson},
title = {Dynamic Bin Packing},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {227--258},
year = {1983},
url = {https://doi.org/10.1137/0212014},
doi = {10.1137/0212014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanGJ83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cohn83,
author = {Avra Cohn},
title = {The Equivalence of Two Semantic Definitions: {A} Case Study in {LCF}},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {267--285},
year = {1983},
url = {https://doi.org/10.1137/0212016},
doi = {10.1137/0212016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cohn83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevS83,
author = {Danny Dolev and
H. Raymond Strong},
title = {Authenticated Algorithms for Byzantine Agreement},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {656--666},
year = {1983},
url = {https://doi.org/10.1137/0212045},
doi = {10.1137/0212045},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DolevS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaginMUY83,
author = {Ronald Fagin and
David Maier and
Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {Tools for Template Dependencies},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {36--59},
year = {1983},
url = {https://doi.org/10.1137/0212003},
doi = {10.1137/0212003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaginMUY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FennerL83,
author = {Trevor I. Fenner and
George Loizou},
title = {Tree Traversal Related Algorithms for Generating Integer Partitions},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {551--564},
year = {1983},
url = {https://doi.org/10.1137/0212036},
doi = {10.1137/0212036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FennerL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerT83,
author = {Patrick C. Fischer and
Don{-}Min Tsou},
title = {Whether a Set of Multivalued Dependencies Implies a Join Dependency
is NP-Hard},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {259--266},
year = {1983},
url = {https://doi.org/10.1137/0212015},
doi = {10.1137/0212015},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FischerT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleckL83,
author = {Arthur C. Fleck and
R. S. Limaye},
title = {Formal Semantics and Abstract Properties of String Pattern Operations
and Extended Formal Language Description Mechanisms},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {166--188},
year = {1983},
url = {https://doi.org/10.1137/0212011},
doi = {10.1137/0212011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FleckL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriesenL83,
author = {Donald K. Friesen and
Michael A. Langston},
title = {Bounds for Multifit Scheduling on Uniform Processors},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {60--70},
year = {1983},
url = {https://doi.org/10.1137/0212004},
doi = {10.1137/0212004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FriesenL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoodmanP83,
author = {Jacob E. Goodman and
Richard Pollack},
title = {Multidimensional Sorting},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {484--507},
year = {1983},
url = {https://doi.org/10.1137/0212032},
doi = {10.1137/0212032},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoodmanP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Groote83,
author = {Hans F. de Groote},
title = {Characterization of Division Algebras of Minimal Rank and the Structure
of Their Algorithm Varieties},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {101--117},
year = {1983},
url = {https://doi.org/10.1137/0212007},
doi = {10.1137/0212007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Groote83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gusfield83,
author = {Dan Gusfield},
title = {Simple Construction for Multi-Terminal Network Flow Synthesis},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {157--165},
year = {1983},
url = {https://doi.org/10.1137/0212010},
doi = {10.1137/0212010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gusfield83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuttagKM83,
author = {John V. Guttag and
Deepak Kapur and
David R. Musser},
title = {On Proving Uniform Termination and Restricted Termination of Rewriting
Systems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {189--214},
year = {1983},
url = {https://doi.org/10.1137/0212012},
doi = {10.1137/0212012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuttagKM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hambrusch83,
author = {Susanne E. Hambrusch},
title = {{VLSI} Algorithms for the Connected Component Problem},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {354--365},
year = {1983},
url = {https://doi.org/10.1137/0212023},
doi = {10.1137/0212023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hambrusch83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HickeyC83,
author = {Timothy J. Hickey and
Jacques Cohen},
title = {Uniform Random Generation of Strings in a Context-Free Language},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {645--655},
year = {1983},
url = {https://doi.org/10.1137/0212044},
doi = {10.1137/0212044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HickeyC83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IbarraM83,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Some Time-Space Tradeoff Results Concerning Single-Tape and Offline
TM's},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {388--394},
year = {1983},
url = {https://doi.org/10.1137/0212025},
doi = {10.1137/0212025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IbarraM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnsonK83,
author = {David S. Johnson and
Anthony C. Klug},
title = {Optimizing Conjunctive Queries that Contain Untyped Variables},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {616--640},
year = {1983},
url = {https://doi.org/10.1137/0212042},
doi = {10.1137/0212042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JohnsonK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaltofenMS83,
author = {Erich L. Kaltofen and
David R. Musser and
B. David Saunders},
title = {A Generalized Class of Polynomials that are Hard to Factor},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {473--483},
year = {1983},
url = {https://doi.org/10.1137/0212031},
doi = {10.1137/0212031},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaltofenMS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kirkpatrick83,
author = {David G. Kirkpatrick},
title = {Optimal Search in Planar Subdivisions},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {28--35},
year = {1983},
url = {https://doi.org/10.1137/0212002},
doi = {10.1137/0212002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Kirkpatrick83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirkpatrickH83,
author = {David G. Kirkpatrick and
Pavol Hell},
title = {On the Complexity of General Graph Factor Problems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {601--609},
year = {1983},
url = {https://doi.org/10.1137/0212040},
doi = {10.1137/0212040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KirkpatrickH83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lauer83,
author = {Markus Lauer},
title = {Generalized p-adic Constructions},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {395--410},
year = {1983},
url = {https://doi.org/10.1137/0212026},
doi = {10.1137/0212026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lauer83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeisersonP83,
author = {Charles E. Leiserson and
Ron Y. Pinter},
title = {Optimal Placement for River Routing},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {447--462},
year = {1983},
url = {https://doi.org/10.1137/0212029},
doi = {10.1137/0212029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeisersonP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LifschitzP83,
author = {Vladimir Lifschitz and
Boris G. Pittel},
title = {The Worst and the Most Probable Performance of a Class of Set-Covering
Algorithms},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {329--346},
year = {1983},
url = {https://doi.org/10.1137/0212021},
doi = {10.1137/0212021},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LifschitzP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Loos83,
author = {R{\"{u}}diger Loos},
title = {Computing Rational Zeros of Integral Polynomials by p-adic Expansion},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {286--293},
year = {1983},
url = {https://doi.org/10.1137/0212017},
doi = {10.1137/0212017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Loos83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Loui83,
author = {Michael C. Loui},
title = {Optimal Dynamic Embedding of Trees into Arrays},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {463--472},
year = {1983},
url = {https://doi.org/10.1137/0212030},
doi = {10.1137/0212030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Loui83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Megiddo83,
author = {Nimrod Megiddo},
title = {Towards a Genuinely Polynomial Algorithm for Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {347--353},
year = {1983},
url = {https://doi.org/10.1137/0212022},
doi = {10.1137/0212022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Megiddo83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Megiddo83a,
author = {Nimrod Megiddo},
title = {Linear-Time Algorithms for Linear Programming in R\({}^{\mbox{3}}\)
and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {759--776},
year = {1983},
url = {https://doi.org/10.1137/0212052},
doi = {10.1137/0212052},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Megiddo83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegiddoT83,
author = {Nimrod Megiddo and
Arie Tamir},
title = {New Results on the Complexity of p-Center Problems},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {751--758},
year = {1983},
url = {https://doi.org/10.1137/0212051},
doi = {10.1137/0212051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MegiddoT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MitraM83,
author = {Debasis Mitra and
John A. Morrison},
title = {Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor
of an Interactive System},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {789--802},
year = {1983},
url = {https://doi.org/10.1137/0212054},
doi = {10.1137/0212054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MitraM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Papadimitriou83,
author = {Christos H. Papadimitriou},
title = {Concurrency Control by Locking},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {215--226},
year = {1983},
url = {https://doi.org/10.1137/0212013},
doi = {10.1137/0212013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Papadimitriou83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Peterson83,
author = {Gerald E. Peterson},
title = {A Technique for Establishing Completeness Results in Theorem Proving
with Equality},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {82--100},
year = {1983},
url = {https://doi.org/10.1137/0212006},
doi = {10.1137/0212006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Peterson83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pfaltz83,
author = {John L. Pfaltz},
title = {Convex Clusters in a Discrete m-Dimensional Space},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {734--750},
year = {1983},
url = {https://doi.org/10.1137/0212050},
doi = {10.1137/0212050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pfaltz83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ProvanB83,
author = {J. Scott Provan and
Michael O. Ball},
title = {The Complexity of Counting Cuts and of Computing the Probability that
a Graph is Connected},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {777--788},
year = {1983},
url = {https://doi.org/10.1137/0212053},
doi = {10.1137/0212053},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ProvanB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PurdomB83,
author = {Paul Walton Purdom Jr. and
Cynthia A. Brown},
title = {An Analysis of Backtracking with Search Rearrangement},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {717--733},
year = {1983},
url = {https://doi.org/10.1137/0212049},
doi = {10.1137/0212049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PurdomB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reif83,
author = {John H. Reif},
title = {Minimum s-t Cut of a Planar Undirected Network in O(n log\({}^{\mbox{2}}\)(n))
Time},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {71--81},
year = {1983},
url = {https://doi.org/10.1137/0212005},
doi = {10.1137/0212005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Reif83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RowlandS83,
author = {John H. Rowland and
Leslie E. Shader},
title = {On the Selection of Test Data for Vector-Valued Recursive Subroutines},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {526--538},
year = {1983},
url = {https://doi.org/10.1137/0212034},
doi = {10.1137/0212034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RowlandS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sagiv83,
author = {Yehoshua Sagiv},
title = {Quadratic Algorithms for Minimizing Joins in Restricted Relational
Expressions},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {316--328},
year = {1983},
url = {https://doi.org/10.1137/0212020},
doi = {10.1137/0212020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sagiv83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SelmanMB83,
author = {Alan L. Selman and
Xu Mei{-}Rui and
Ronald V. Book},
title = {Positive Relativizations of Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {565--579},
year = {1983},
url = {https://doi.org/10.1137/0212037},
doi = {10.1137/0212037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SelmanMB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Simons83,
author = {Barbara Simons},
title = {Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release
Times and Deadlines},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {294--299},
year = {1983},
url = {https://doi.org/10.1137/0212018},
doi = {10.1137/0212018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Simons83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Strassen83,
author = {Volker Strassen},
title = {The Computational Complexity of Continued Fractions},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {1--27},
year = {1983},
url = {https://doi.org/10.1137/0212001},
doi = {10.1137/0212001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Strassen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SupowitR83,
author = {Kenneth J. Supowit and
Edward M. Reingold},
title = {Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {118--143},
year = {1983},
url = {https://doi.org/10.1137/0212008},
doi = {10.1137/0212008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SupowitR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SupowitRP83,
author = {Kenneth J. Supowit and
Edward M. Reingold and
David A. Plaisted},
title = {The Travelling Salesman Problem and Minimum Matching in the Unit Square},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {144--156},
year = {1983},
url = {https://doi.org/10.1137/0212009},
doi = {10.1137/0212009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SupowitRP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ukkonen83,
author = {Esko Ukkonen},
title = {Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {580--587},
year = {1983},
url = {https://doi.org/10.1137/0212038},
doi = {10.1137/0212038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ukkonen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ValiantSBR83,
author = {Leslie G. Valiant and
Sven Skyum and
S. Berkowitz and
Charles Rackoff},
title = {Fast Parallel Computation of Polynomials Using Few Processors},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {4},
pages = {641--644},
year = {1983},
url = {https://doi.org/10.1137/0212043},
doi = {10.1137/0212043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ValiantSBR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YamadaI83,
author = {Hisao Yamada and
Masatosi Imori},
title = {One Step Transformation of Periodic Sequences by Cellular Automata},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {539--550},
year = {1983},
url = {https://doi.org/10.1137/0212035},
doi = {10.1137/0212035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YamadaI83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yesha83,
author = {Yaacov Yesha},
title = {On Certain Polynomial-Time Truth-Table Reducibilities of Complete
Sets to Sparse Sets},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {3},
pages = {411--425},
year = {1983},
url = {https://doi.org/10.1137/0212027},
doi = {10.1137/0212027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yesha83.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 01: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:
