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/siamcomp13.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AgarwalMS84,
author = {Sunita Agarwal and
A. K. Mittal and
Prabha Sharma},
title = {Constrained Optimum Communication Trees and Sensitivity Analysis},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {315--328},
year = {1984},
url = {https://doi.org/10.1137/0213022},
doi = {10.1137/0213022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalMS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArnonCM84,
author = {Dennis S. Arnon and
George E. Collins and
Scott McCallum},
title = {Cylindrical Algebraic Decomposition {I:} The Basic Algorithm},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {865--877},
year = {1984},
url = {https://doi.org/10.1137/0213054},
doi = {10.1137/0213054},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArnonCM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArnonCM84a,
author = {Dennis S. Arnon and
George E. Collins and
Scott McCallum},
title = {Cylindrical Algebraic Decomposition {II:} An Adjacency Algorithm for
the Plane},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {878--889},
year = {1984},
url = {https://doi.org/10.1137/0213055},
doi = {10.1137/0213055},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArnonCM84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BakerC84,
author = {Brenda S. Baker and
Edward G. Coffman Jr.},
title = {Insertion and Compaction Algorithms in Sequentially Allocated Storage},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {600--609},
year = {1984},
url = {https://doi.org/10.1137/0213037},
doi = {10.1137/0213037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BakerC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Barz84,
author = {Hans W. Barz},
title = {The Power of Synchronization Mechanisms},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {726--749},
year = {1984},
url = {https://doi.org/10.1137/0213046},
doi = {10.1137/0213046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Barz84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeeriV84,
author = {Catriel Beeri and
Moshe Y. Vardi},
title = {Formal Systems for Tuple and Equality Generating Dependencies},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {76--98},
year = {1984},
url = {https://doi.org/10.1137/0213006},
doi = {10.1137/0213006},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeeriV84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bini84,
author = {Dario Bini},
title = {Parallel Solution of Certain Toeplitz Linear Systems},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {268--276},
year = {1984},
url = {https://doi.org/10.1137/0213019},
doi = {10.1137/0213019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bini84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlassG84,
author = {Andreas Blass and
Yuri Gurevich},
title = {Equivalence Relations, Invariants, and Normal Forms},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {682--689},
year = {1984},
url = {https://doi.org/10.1137/0213042},
doi = {10.1137/0213042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlassG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumM84,
author = {Manuel Blum and
Silvio Micali},
title = {How to Generate Cryptographically Strong Sequences of Pseudo-Random
Bits},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {850--864},
year = {1984},
url = {https://doi.org/10.1137/0213053},
doi = {10.1137/0213053},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BookLS84,
author = {Ronald V. Book and
Timothy J. Long and
Alan L. Selman},
title = {Quantitative Relativizations of Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {461--487},
year = {1984},
url = {https://doi.org/10.1137/0213030},
doi = {10.1137/0213030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BookLS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bruin84,
author = {Arie de Bruin},
title = {On the Existence of Cook Semantics},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {1--13},
year = {1984},
url = {https://doi.org/10.1137/0213001},
doi = {10.1137/0213001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bruin84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cartwright84,
author = {Robert Cartwright},
title = {Recursive Programs as Definitions in First Order Logic},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {374--408},
year = {1984},
url = {https://doi.org/10.1137/0213026},
doi = {10.1137/0213026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cartwright84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandraSV84,
author = {Ashok K. Chandra and
Larry J. Stockmeyer and
Uzi Vishkin},
title = {Constant Depth Reducibility},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {423--439},
year = {1984},
url = {https://doi.org/10.1137/0213028},
doi = {10.1137/0213028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChandraSV84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chazelle84,
author = {Bernard Chazelle},
title = {Convex Partitions of Polyhedra: {A} Lower Bound and Worst-Case Optimal
Algorithm},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {488--507},
year = {1984},
url = {https://doi.org/10.1137/0213031},
doi = {10.1137/0213031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chazelle84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChiuBH84,
author = {Dah{-}Ming W. Chiu and
Philip A. Bernstein and
Yu{-}Chi Ho},
title = {Optimizing Chain Queries in a Distributed Database System},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {116--134},
year = {1984},
url = {https://doi.org/10.1137/0213009},
doi = {10.1137/0213009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChiuBH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CosmadakisP84,
author = {Stavros S. Cosmadakis and
Christos H. Papadimitriou},
title = {The Traveling Salesman Problem with Many Visits to Few Cities},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {99--108},
year = {1984},
url = {https://doi.org/10.1137/0213007},
doi = {10.1137/0213007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CosmadakisP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dobson84,
author = {Gregory Dobson},
title = {Scheduling Independent Tasks on Uniform Processors},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {705--716},
year = {1984},
url = {https://doi.org/10.1137/0213044},
doi = {10.1137/0213044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Dobson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DurisG84,
author = {Pavol Duris and
Zvi Galil},
title = {Two Tapes are Better than One for Nondeterministic Machines},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {219--227},
year = {1984},
url = {https://doi.org/10.1137/0213016},
doi = {10.1137/0213016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DurisG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dyer84,
author = {Martin E. Dyer},
title = {Linear Time Algorithms for Two- and Three-Variable Linear Programs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {31--45},
year = {1984},
url = {https://doi.org/10.1137/0213003},
doi = {10.1137/0213003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dyer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Frederickson84,
author = {Greg N. Frederickson},
title = {Self-Organizing Heuristics for Implicit Data Structures},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {277--291},
year = {1984},
url = {https://doi.org/10.1137/0213020},
doi = {10.1137/0213020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Frederickson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonJ84,
author = {Greg N. Frederickson and
Donald B. Johnson},
title = {Generalized Selection and Ranking: Sorted Matrices},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {14--30},
year = {1984},
url = {https://doi.org/10.1137/0213002},
doi = {10.1137/0213002},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonJ84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Friesen84,
author = {Donald K. Friesen},
title = {Tighter Bounds for the Multifit Processor Scheduling Algorithm},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {170--181},
year = {1984},
url = {https://doi.org/10.1137/0213013},
doi = {10.1137/0213013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Friesen84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gallier84,
author = {Jean H. Gallier},
title = {n-Rational Algebras I. Basic Properties and Free Algebras},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {750--775},
year = {1984},
url = {https://doi.org/10.1137/0213047},
doi = {10.1137/0213047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gallier84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gallier84a,
author = {Jean H. Gallier},
title = {n-Rational Algebras {II.} Varieties and Logic of Inequalities},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {776--794},
year = {1984},
url = {https://doi.org/10.1137/0213048},
doi = {10.1137/0213048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gallier84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gathen84,
author = {Joachim von zur Gathen},
title = {Parallel Algorithms for Algebraic Problems},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {802--824},
year = {1984},
url = {https://doi.org/10.1137/0213050},
doi = {10.1137/0213050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gathen84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Grandjean84,
author = {Etienne Grandjean},
title = {The Spectra of First-Order Sentences and Computational Complexity},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {356--373},
year = {1984},
url = {https://doi.org/10.1137/0213025},
doi = {10.1137/0213025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Grandjean84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HarelT84,
author = {Dov Harel and
Robert Endre Tarjan},
title = {Fast Algorithms for Finding Nearest Common Ancestors},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {338--355},
year = {1984},
url = {https://doi.org/10.1137/0213024},
doi = {10.1137/0213024},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HarelT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Heller84,
author = {Hans Heller},
title = {On Relativized Polynomial and Exponential Computations},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {717--725},
year = {1984},
url = {https://doi.org/10.1137/0213045},
doi = {10.1137/0213045},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Heller84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HeymanT84,
author = {Daniel P. Heyman and
Shalom Tsur},
title = {Disk Performance in a Transaction-Oriented System},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {669--681},
year = {1984},
url = {https://doi.org/10.1137/0213041},
doi = {10.1137/0213041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HeymanT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HopcroftJW84,
author = {John E. Hopcroft and
Deborah Joseph and
Sue Whitesides},
title = {Movement Problems for 2-Dimensional Linkages},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {610--629},
year = {1984},
url = {https://doi.org/10.1137/0213038},
doi = {10.1137/0213038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HopcroftJW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuS84,
author = {T. C. Hu and
M. T. Shing},
title = {Computation of Matrix Chain Products. Part {II}},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {228--251},
year = {1984},
url = {https://doi.org/10.1137/0213017},
doi = {10.1137/0213017},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HuS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JaJaKS84,
author = {Joseph F. J{\'{a}}J{\'{a}} and
Viktor K. Prasanna and
Janos Simon},
title = {Information Transfer under Different Sets of Protocols},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {840--849},
year = {1984},
url = {https://doi.org/10.1137/0213052},
doi = {10.1137/0213052},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JaJaKS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KeaneKM84,
author = {M. Keane and
Alan G. Konheim and
I. Meilijson},
title = {The Organ Pipe Permutation},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {531--540},
year = {1984},
url = {https://doi.org/10.1137/0213033},
doi = {10.1137/0213033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KeaneKM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Klawe84,
author = {Maria M. Klawe},
title = {Limitations on Explicit Constructions of Expanding Graphs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {156--166},
year = {1984},
url = {https://doi.org/10.1137/0213011},
doi = {10.1137/0213011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Klawe84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LadnerLS84,
author = {Richard E. Ladner and
Richard J. Lipton and
Larry J. Stockmeyer},
title = {Alternating Pushdown and Stack Automata},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {135--155},
year = {1984},
url = {https://doi.org/10.1137/0213010},
doi = {10.1137/0213010},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LadnerLS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LaiS84,
author = {Ten{-}Hwang Lai and
Sartaj Sahni},
title = {Preemptive Scheduling of a Multiprocessor System with Memories to
Minimize Maximum Lateness},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {690--704},
year = {1984},
url = {https://doi.org/10.1137/0213043},
doi = {10.1137/0213043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LaiS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeungVW84,
author = {Joseph Y.{-}T. Leung and
Oliver Vornberger and
James D. Witthoff},
title = {On Some Variants of the Bandwidth Minimization Problem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {650--667},
year = {1984},
url = {https://doi.org/10.1137/0213040},
doi = {10.1137/0213040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeungVW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Linial84,
author = {Nathan Linial},
title = {The Information-Theoretic Bound is Good for Merging},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {795--801},
year = {1984},
url = {https://doi.org/10.1137/0213049},
doi = {10.1137/0213049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Linial84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ManberT84,
author = {Udi Manber and
Martin Tompa},
title = {The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring
Problem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {109--115},
year = {1984},
url = {https://doi.org/10.1137/0213008},
doi = {10.1137/0213008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ManberT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mayr84,
author = {Ernst W. Mayr},
title = {An Algorithm for the General Petri Net Reachability Problem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {441--460},
year = {1984},
url = {https://doi.org/10.1137/0213029},
doi = {10.1137/0213029},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Mayr84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegiddoS84,
author = {Nimrod Megiddo and
Kenneth J. Supowit},
title = {On the Complexity of Some Common Geometric Location Problems},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {182--196},
year = {1984},
url = {https://doi.org/10.1137/0213014},
doi = {10.1137/0213014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MegiddoS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MelhemR84,
author = {Rami G. Melhem and
Werner C. Rheinboldt},
title = {A Mathematical Model for the Verification of Systolic Networks},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {541--565},
year = {1984},
url = {https://doi.org/10.1137/0213034},
doi = {10.1137/0213034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MelhemR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/OttmannPRSW84,
author = {Thomas Ottmann and
Douglas Stott Parker Jr. and
Arnold L. Rosenberg and
Hans{-}Werner Six and
Derick Wood},
title = {Minimal-Cost Brother Trees},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {197--217},
year = {1984},
url = {https://doi.org/10.1137/0213015},
doi = {10.1137/0213015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/OttmannPRSW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Pullman84,
author = {Norman J. Pullman},
title = {Clique Covering of Graphs {IV.} Algorithms},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {57--75},
year = {1984},
url = {https://doi.org/10.1137/0213005},
doi = {10.1137/0213005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Pullman84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ramanan84,
author = {Prakash V. Ramanan},
title = {Pushdown Permuter Characterization Theorem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {167--169},
year = {1984},
url = {https://doi.org/10.1137/0213012},
doi = {10.1137/0213012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ramanan84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reif84,
author = {John H. Reif},
title = {On Synchronous Parallel Computations with Independent Probabilistic
Choice},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {46--56},
year = {1984},
url = {https://doi.org/10.1137/0213004},
doi = {10.1137/0213004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Reif84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Robson84,
author = {J. M. Robson},
title = {N by {N} Checkers is Exptime Complete},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {252--267},
year = {1984},
url = {https://doi.org/10.1137/0213018},
doi = {10.1137/0213018},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Robson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RosenkrantzSL84,
author = {Daniel J. Rosenkrantz and
Richard Edwin Stearns and
Philip M. Lewis II},
title = {Consistency and Serializability in Concurrent Database Systems},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {508--530},
year = {1984},
url = {https://doi.org/10.1137/0213032},
doi = {10.1137/0213032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RosenkrantzSL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchoningB84,
author = {Uwe Sch{\"{o}}ning and
Ronald V. Book},
title = {Immunity, Relativizations, and Nondeterminism},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {329--337},
year = {1984},
url = {https://doi.org/10.1137/0213023},
doi = {10.1137/0213023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SchoningB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SharirPH84,
author = {Micha Sharir and
Amir Pnueli and
Sergiu Hart},
title = {Verification of Probabilistic Programs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {292--314},
year = {1984},
url = {https://doi.org/10.1137/0213021},
doi = {10.1137/0213021},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SharirPH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShermanPH84,
author = {Rivi Sherman and
Amir Pnueli and
David Harel},
title = {Is the Interesting Part of Process Logic Uninteresting? {A} Translation
from {PL} to {PDL}},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {4},
pages = {825--839},
year = {1984},
url = {https://doi.org/10.1137/0213051},
doi = {10.1137/0213051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShermanPH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StockmeyerV84,
author = {Larry J. Stockmeyer and
Uzi Vishkin},
title = {Simulation of Parallel Random Access Machines by Circuits},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {409--422},
year = {1984},
url = {https://doi.org/10.1137/0213027},
doi = {10.1137/0213027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StockmeyerV84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanY84,
author = {Robert Endre Tarjan and
Mihalis Yannakakis},
title = {Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity
of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {566--579},
year = {1984},
url = {https://doi.org/10.1137/0213035},
doi = {10.1137/0213035},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TouegB84,
author = {Sam Toueg and
{\"{O}}zalp Babaoglu},
title = {On the Optimum Checkpoint Selection Problem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {630--649},
year = {1984},
url = {https://doi.org/10.1137/0213039},
doi = {10.1137/0213039},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TouegB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TsinC84,
author = {Yung H. Tsin and
Francis Y. L. Chin},
title = {Efficient Parallel Algorithms for a Class of Graph Theoretic Problems},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {580--599},
year = {1984},
url = {https://doi.org/10.1137/0213036},
doi = {10.1137/0213036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TsinC84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-24 20:30 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:
