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/siamcomp19.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AgarwalS90,
author = {Pankaj K. Agarwal and
Micha Sharir},
title = {Red-Blue Intersection Detection Algorithms, with Applications to Motion
Planning and Collision Detection},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {297--321},
year = {1990},
url = {https://doi.org/10.1137/0219020},
doi = {10.1137/0219020},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalAK90,
author = {Alok Aggarwal and
Richard J. Anderson and
Ming{-}Yang Kao},
title = {Parallel Depth-First Search in General Directed Graphs},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {397--409},
year = {1990},
url = {https://doi.org/10.1137/0219025},
doi = {10.1137/0219025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalAK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonKW90,
author = {Noga Alon and
Mauricio Karchmer and
Avi Wigderson},
title = {Linear Circuits over {GF(2)}},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1064--1067},
year = {1990},
url = {https://doi.org/10.1137/0219074},
doi = {10.1137/0219074},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonKW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnnexsteinBR90,
author = {Fred S. Annexstein and
Marc Baumslag and
Arnold L. Rosenberg},
title = {Group Action Graphs and Parallel Architectures},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {544--569},
year = {1990},
url = {https://doi.org/10.1137/0219037},
doi = {10.1137/0219037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnnexsteinBR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ApostolicoALM90,
author = {Alberto Apostolico and
Mikhail J. Atallah and
Lawrence L. Larmore and
Scott McFaddin},
title = {Efficient Parallel Algorithms for String Editing and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {968--988},
year = {1990},
url = {https://doi.org/10.1137/0219066},
doi = {10.1137/0219066},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ApostolicoALM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Beigel90,
author = {Richard Beigel},
title = {Unbounded Searching Slgorithms},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {522--537},
year = {1990},
url = {https://doi.org/10.1137/0219035},
doi = {10.1137/0219035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Beigel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bienstock90,
author = {Daniel Bienstock},
title = {Linear-Time Test for Small Face Covers in Any Fixed Surface},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {907--911},
year = {1990},
url = {https://doi.org/10.1137/0219063},
doi = {10.1137/0219063},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bienstock90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BilardiP90,
author = {Gianfranco Bilardi and
Franco P. Preparata},
title = {Characterization of Associative Operations with Prefix Circuits of
Constant Depth and Linear Size},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {246--255},
year = {1990},
url = {https://doi.org/10.1137/0219016},
doi = {10.1137/0219016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BilardiP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreslauerG90,
author = {Dany Breslauer and
Zvi Galil},
title = {An Optimal O(log log n) Time Parallel String Matching Algorithm},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1051--1058},
year = {1990},
url = {https://doi.org/10.1137/0219072},
doi = {10.1137/0219072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BreslauerG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bshouty90,
author = {Nader H. Bshouty},
title = {Maximal Rank of m x n x (mn - k) Tensors},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {467--471},
year = {1990},
url = {https://doi.org/10.1137/0219031},
doi = {10.1137/0219031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bshouty90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyK90,
author = {Nader H. Bshouty and
Michael Kaminski},
title = {Multiplication of Polynomials over Finite Fields},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {452--456},
year = {1990},
url = {https://doi.org/10.1137/0219029},
doi = {10.1137/0219029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChinT90,
author = {Francis Y. L. Chin and
H. F. Ting},
title = {Improving the Time Complexity of Message-Optimal Distributed Algorithms
for Minimum-Weight Spanning Trees},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {612--626},
year = {1990},
url = {https://doi.org/10.1137/0219041},
doi = {10.1137/0219041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChinT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CypherSS90,
author = {Robert Cypher and
Jorge L. C. Sanz and
L. Snyder},
title = {The Hough Transform has {O(N)} Complexity on {N} x {N} Mesh Connected
Computers},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {805--820},
year = {1990},
url = {https://doi.org/10.1137/0219056},
doi = {10.1137/0219056},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CypherSS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeL90,
author = {Luc Devroye and
Louise Laforest},
title = {An Analysis of Random d-Dimensional Quad Trees},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {821--832},
year = {1990},
url = {https://doi.org/10.1137/0219057},
doi = {10.1137/0219057},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DevroyeL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dezani-CiancagliniV90,
author = {Mariangiola Dezani{-}Ciancaglini and
Betti Venneri},
title = {Partial Types and Intervals},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {644--568},
year = {1990},
url = {https://doi.org/10.1137/0219043},
doi = {10.1137/0219043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Dezani-CiancagliniV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dowling90,
author = {Michael L. Dowling},
title = {A Fast Parallel Horner Algorithm},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {133--142},
year = {1990},
url = {https://doi.org/10.1137/0219008},
doi = {10.1137/0219008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Dowling90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dube90,
author = {Thomas Dub{\'{e}}},
title = {The Structure of Polynomial Ideals and Gr{\"{o}}bner Bases},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {750--773},
year = {1990},
url = {https://doi.org/10.1137/0219053},
doi = {10.1137/0219053},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dube90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkS90,
author = {Cynthia Dwork and
Larry J. Stockmeyer},
title = {A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1011--1023},
year = {1990},
url = {https://doi.org/10.1137/0219069},
doi = {10.1137/0219069},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DworkS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkSS90,
author = {Cynthia Dwork and
David B. Shmoys and
Larry J. Stockmeyer},
title = {Flipping Persuasively in Constant Time},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {472--499},
year = {1990},
url = {https://doi.org/10.1137/0219032},
doi = {10.1137/0219032},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DworkSS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Eppstein90,
author = {David Eppstein},
title = {Reset Sequences for Monotonic Automata},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {500--510},
year = {1990},
url = {https://doi.org/10.1137/0219033},
doi = {10.1137/0219033},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichW90,
author = {Faith E. Fich and
Avi Wigderson},
title = {Toward Understanding Exclusive Read},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {718--727},
year = {1990},
url = {https://doi.org/10.1137/0219050},
doi = {10.1137/0219050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FloydK90,
author = {Robert W. Floyd and
Donald E. Knuth},
title = {Addition Machines},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {329--340},
year = {1990},
url = {https://doi.org/10.1137/0219022},
doi = {10.1137/0219022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FloydK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonJ90,
author = {Greg N. Frederickson and
Ravi Janardan},
title = {Space-Efficient Message Routing in c-Decomposable Networks},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {164--181},
year = {1990},
url = {https://doi.org/10.1137/0219011},
doi = {10.1137/0219011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonJ90a,
author = {Greg N. Frederickson and
Donald B. Johnson},
title = {Erratum: Generalized Selection and Ranking: Sorted Matrices},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {205--206},
year = {1990},
url = {https://doi.org/10.1137/0219013},
doi = {10.1137/0219013},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonJ90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Friedman90,
author = {Joel Friedman},
title = {A Density Theorem for Purely Iterative Zero Finding Methods},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {124--132},
year = {1990},
url = {https://doi.org/10.1137/0219007},
doi = {10.1137/0219007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Friedman90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Friedman90a,
author = {Joel Friedman},
title = {Random Polynomials and Approximate Zeros of Newton's Method},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1068--1099},
year = {1990},
url = {https://doi.org/10.1137/0219075},
doi = {10.1137/0219075},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Friedman90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeMR90,
author = {Alan M. Frieze and
Colin McDiarmid and
Bruce A. Reed},
title = {Greedy Matching on the Line},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {666--672},
year = {1990},
url = {https://doi.org/10.1137/0219045},
doi = {10.1137/0219045},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilP90,
author = {Zvi Galil and
Kunsoo Park},
title = {An Improved Algorithm for Approximate String Matching},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {989--999},
year = {1990},
url = {https://doi.org/10.1137/0219067},
doi = {10.1137/0219067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gradel90,
author = {Erich Gr{\"{a}}del},
title = {Domino Games and Complexity},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {787--804},
year = {1990},
url = {https://doi.org/10.1137/0219055},
doi = {10.1137/0219055},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gradel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Grandjean90,
author = {Etienne Grandjean},
title = {A Nontrivial Lower Bound for an {NP} Problem on Automata},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {438--451},
year = {1990},
url = {https://doi.org/10.1137/0219028},
doi = {10.1137/0219028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Grandjean90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrigorievKS90,
author = {Dima Grigoriev and
Marek Karpinski and
Michael F. Singer},
title = {Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation
over Finite Fields},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1059--1063},
year = {1990},
url = {https://doi.org/10.1137/0219073},
doi = {10.1137/0219073},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GrigorievKS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gusfield90,
author = {Dan Gusfield},
title = {Very Simple Methods for All Pairs Network Flow Analysis},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {143--155},
year = {1990},
url = {https://doi.org/10.1137/0219009},
doi = {10.1137/0219009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gusfield90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hagerup90,
author = {Torben Hagerup},
title = {Planar Depth-First Search in O(log n) Parallel Time},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {678--704},
year = {1990},
url = {https://doi.org/10.1137/0219047},
doi = {10.1137/0219047},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hagerup90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HentzelJ90,
author = {Irvin Roy Hentzel and
David Pokrass Jacobs},
title = {Complexity and Unsolvability Properties of Nilpotency},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {32--43},
year = {1990},
url = {https://doi.org/10.1137/0219002},
doi = {10.1137/0219002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HentzelJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hoover90,
author = {H. James Hoover},
title = {Feasible Real Functions and Arithmetic Circuits},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {182--204},
year = {1990},
url = {https://doi.org/10.1137/0219012},
doi = {10.1137/0219012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hoover90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuntS90,
author = {Harry B. Hunt III and
Richard Edwin Stearns},
title = {The Complexity of Very Simple Boolean Formulas with Applications},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {44--70},
year = {1990},
url = {https://doi.org/10.1137/0219003},
doi = {10.1137/0219003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuntS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IwanoS90,
author = {Kazuo Iwano and
Kenneth Steiglitz},
title = {A Semiring on Convex Polygons and Zero-Sum Cycle Problems},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {883--901},
year = {1990},
url = {https://doi.org/10.1137/0219061},
doi = {10.1137/0219061},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IwanoS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Jackson90,
author = {Bill Jackson},
title = {Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere
Zero 4-Flow},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {659--665},
year = {1990},
url = {https://doi.org/10.1137/0219044},
doi = {10.1137/0219044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Jackson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JohnstoneB90,
author = {John K. Johnstone and
Chandrajit L. Bajaj},
title = {Sorting Points Along an Algebraic Curve},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {925--967},
year = {1990},
url = {https://doi.org/10.1137/0219065},
doi = {10.1137/0219065},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JohnstoneB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JoverKLR90,
author = {Juan{-}Manuel Jover and
Thomas Kailath and
Hanoch Lev{-}Ari and
Sailesh K. Rao},
title = {On the Analysis of Synchronous Computing Systems},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {627--643},
year = {1990},
url = {https://doi.org/10.1137/0219042},
doi = {10.1137/0219042},
timestamp = {Fri, 20 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JoverKLR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Krentel90,
author = {Mark W. Krentel},
title = {On Finding and Verifying Locally Optimal Solutions},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {742--749},
year = {1990},
url = {https://doi.org/10.1137/0219052},
doi = {10.1137/0219052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Krentel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KutylowskiLL90,
author = {Miroslaw Kutylowski and
Maciej Liskiewicz and
Krzysztof Lorys},
title = {Reversal Complexity Classes for Alternating Turing Machines},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {207--221},
year = {1990},
url = {https://doi.org/10.1137/0219014},
doi = {10.1137/0219014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KutylowskiLL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LabahnCC90,
author = {George Labahn and
Dong{-}Koo Choi and
Stanley Cabay},
title = {The Inverses of Block Hankel and Block Toeplitz Matrices},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {98--123},
year = {1990},
url = {https://doi.org/10.1137/0219006},
doi = {10.1137/0219006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LabahnCC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeSW90,
author = {D. T. Lee and
Majid Sarrafzadeh and
Ying{-}Fung Wu},
title = {Minimum Cuts for Circular-Arc Graphs},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1041--1050},
year = {1990},
url = {https://doi.org/10.1137/0219071},
doi = {10.1137/0219071},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeeSW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LevinS90,
author = {Robert Y. Levin and
Alan T. Sherman},
title = {A Note on Bennett's Time-Space Tradeoff for Reversible Computation},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {673--677},
year = {1990},
url = {https://doi.org/10.1137/0219046},
doi = {10.1137/0219046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LevinS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiC90,
author = {Keqin Li and
Kam{-}Hoi Cheng},
title = {On Three-Dimensional Packing},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {847--867},
year = {1990},
url = {https://doi.org/10.1137/0219059},
doi = {10.1137/0219059},
timestamp = {Fri, 06 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiskiewiczL90,
author = {Maciej Liskiewicz and
Krzysztof Lorys},
title = {Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded
Ones},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {511--521},
year = {1990},
url = {https://doi.org/10.1137/0219034},
doi = {10.1137/0219034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiskiewiczL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lucas90,
author = {Joan M. Lucas},
title = {Postorder Disjoint Set Union is Linear},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {868--882},
year = {1990},
url = {https://doi.org/10.1137/0219060},
doi = {10.1137/0219060},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lucas90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LuekerMR90,
author = {George S. Lueker and
Nimrod Megiddo and
Vijaya Ramachandran},
title = {Linear Programming with Two Variables per Inequality in Poly-Log Time},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1000--1010},
year = {1990},
url = {https://doi.org/10.1137/0219068},
doi = {10.1137/0219068},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LuekerMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lutz90,
author = {Jack H. Lutz},
title = {Category and Measure in Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1100--1131},
year = {1990},
url = {https://doi.org/10.1137/0219076},
doi = {10.1137/0219076},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lutz90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MehlhornNR90,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Monika Rauch},
title = {On the Complexity of a Game Related to the Dictionary Problem},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {902--906},
year = {1990},
url = {https://doi.org/10.1137/0219062},
doi = {10.1137/0219062},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornNR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Molzan90,
author = {Burkhard Molzan},
title = {Expressibility and Nonuniform Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {411--423},
year = {1990},
url = {https://doi.org/10.1137/0219026},
doi = {10.1137/0219026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Molzan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mount90,
author = {David M. Mount},
title = {The Number of Shortest Paths on the Surface of a Polyhedron},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {593--611},
year = {1990},
url = {https://doi.org/10.1137/0219040},
doi = {10.1137/0219040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mount90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MunshiS90,
author = {Ashfaq A. Munshi and
Barbara Simons},
title = {Scheduling Sequential Loops on Parallel Processors},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {728--741},
year = {1990},
url = {https://doi.org/10.1137/0219051},
doi = {10.1137/0219051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MunshiS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Murota90,
author = {Kazuo Murota},
title = {Computing Puiseux-Series Solutions to Determinantal Equations via
Combinatorial Relaxation},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1132--1161},
year = {1990},
url = {https://doi.org/10.1137/0219077},
doi = {10.1137/0219077},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Murota90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NgH90,
author = {Cheng Ng and
Daniel S. Hirschberg},
title = {Lower Bounds for the Stable Marriage Problem and its Variants},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {71--77},
year = {1990},
url = {https://doi.org/10.1137/0219004},
doi = {10.1137/0219004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NgH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PalisSW90,
author = {Michael A. Palis and
Sunil M. Shende and
David S. L. Wei},
title = {An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {1--31},
year = {1990},
url = {https://doi.org/10.1137/0219001},
doi = {10.1137/0219001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PalisSW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouY90,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Towards an Architecture-Independent Analysis of Parallel Algorithms},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {322--328},
year = {1990},
url = {https://doi.org/10.1137/0219021},
doi = {10.1137/0219021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PelegU90,
author = {David Peleg and
Eli Upfal},
title = {A Time-Randomness Trade-Off for Oblivious Routing},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {256--266},
year = {1990},
url = {https://doi.org/10.1137/0219017},
doi = {10.1137/0219017},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PelegU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Plaisted90,
author = {David A. Plaisted},
title = {A Heuristic Algorithm for Small Separators in Arbitrary Graphs},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {267--280},
year = {1990},
url = {https://doi.org/10.1137/0219018},
doi = {10.1137/0219018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Plaisted90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifT90,
author = {John H. Reif and
Stephen R. Tate},
title = {Optimal Size Integer Division Circuits},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {912--924},
year = {1990},
url = {https://doi.org/10.1137/0219064},
doi = {10.1137/0219064},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReifT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rhee90,
author = {Wansoo T. Rhee},
title = {A Note on Optimal Bin Packing and Optimal Bin Covering with Items
of Random Size},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {705--710},
year = {1990},
url = {https://doi.org/10.1137/0219048},
doi = {10.1137/0219048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rhee90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rutten90,
author = {Jan J. M. M. Rutten},
title = {Semantic Correctness for a Parallel Object-Oriented Language},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {341--383},
year = {1990},
url = {https://doi.org/10.1137/0219023},
doi = {10.1137/0219023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rutten90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sakkalis90,
author = {Takis Sakkalis},
title = {The Euclidean Algorithm and the Degree of the Gauss Map},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {538--543},
year = {1990},
url = {https://doi.org/10.1137/0219036},
doi = {10.1137/0219036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sakkalis90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SanchisF90,
author = {Laura A. Sanchis and
Mark A. Fulk},
title = {On the Efficient Generation of Language Instances},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {281--296},
year = {1990},
url = {https://doi.org/10.1137/0219019},
doi = {10.1137/0219019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SanchisF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Scheinerman90,
author = {Edward R. Scheinerman},
title = {On the Expected Capacity of Binomial and Random Concentrators},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {156--163},
year = {1990},
url = {https://doi.org/10.1137/0219010},
doi = {10.1137/0219010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Scheinerman90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchmidtS90,
author = {Jeanette P. Schmidt and
Alan Siegel},
title = {The Spatial Complexity of Oblivious k-Probe Hash Functions},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {775--786},
year = {1990},
url = {https://doi.org/10.1137/0219054},
doi = {10.1137/0219054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SchmidtS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Seidl90,
author = {Helmut Seidl},
title = {Deciding Equivalence of Finite Tree Automata},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {424--437},
year = {1990},
url = {https://doi.org/10.1137/0219027},
doi = {10.1137/0219027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Seidl90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Stinson90,
author = {Douglas R. Stinson},
title = {Some Observations on Parallel Algorithms for Fast Exponentiation in
GF(2n)},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {711--717},
year = {1990},
url = {https://doi.org/10.1137/0219049},
doi = {10.1137/0219049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Stinson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SugiharaSY90,
author = {Kazuo Sugihara and
Ichiro Suzuki and
Masafumi Yamashita},
title = {The Searchlight Scheduling Problem},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1024--1040},
year = {1990},
url = {https://doi.org/10.1137/0219070},
doi = {10.1137/0219070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SugiharaSY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vaishnavi90,
author = {Vijay K. Vaishnavi},
title = {Erratum: Weighted Leaf AVL-Trees},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {591},
year = {1990},
url = {https://doi.org/10.1137/0219039},
doi = {10.1137/0219039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vaishnavi90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wagner90,
author = {Klaus W. Wagner},
title = {Bounded Query Classes},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {833--846},
year = {1990},
url = {https://doi.org/10.1137/0219058},
doi = {10.1137/0219058},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wagner90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WagnerC90,
author = {Alan Wagner and
Derek G. Corneil},
title = {Embedding Trees in a Hypercube is NP-Complete},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {570--590},
year = {1990},
url = {https://doi.org/10.1137/0219038},
doi = {10.1137/0219038},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WagnerC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Whitehead90,
author = {Jennifer Whitehead},
title = {The Complexity of File Transfer Scheduling with Forwarding},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {222--245},
year = {1990},
url = {https://doi.org/10.1137/0219015},
doi = {10.1137/0219015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Whitehead90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wilson90,
author = {Christopher B. Wilson},
title = {On the Decomposability of {NC} and {AC}},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {384--396},
year = {1990},
url = {https://doi.org/10.1137/0219024},
doi = {10.1137/0219024},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wilson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ye90,
author = {Yinyu Ye},
title = {A Class of Projective Transformations for Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {457--466},
year = {1990},
url = {https://doi.org/10.1137/0219030},
doi = {10.1137/0219030},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ye90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YokouchiH90,
author = {Hirofumi Yokouchi and
Teruo Hikita},
title = {A Rewriting System for Categorical Combinators with Multiple Arguments},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {1},
pages = {78--97},
year = {1990},
url = {https://doi.org/10.1137/0219005},
doi = {10.1137/0219005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YokouchiH90.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-20 03:55 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:
