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/siamcomp24.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AgrawalKR95,
author = {Ajit Agrawal and
Philip N. Klein and
R. Ravi},
title = {When Trees Collide: An Approximation Algorithm for the Generalized
Steiner Problem on Networks},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {440--456},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236237},
doi = {10.1137/S0097539792236237},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgrawalKR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonKPW95,
author = {Noga Alon and
Richard M. Karp and
David Peleg and
Douglas B. West},
title = {A Graph-Theoretic Game and Its Application to the k-Server Problem},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {78--100},
year = {1995},
url = {https://doi.org/10.1137/S0097539792224474},
doi = {10.1137/S0097539792224474},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonKPW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnderssonO95,
author = {Arne Andersson and
Thomas Ottmann},
title = {New Tight Bounds on Uniquely Represented Dictionaries},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1091--1101},
year = {1995},
url = {https://doi.org/10.1137/S0097539792241102},
doi = {10.1137/S0097539792241102},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnderssonO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Benczur95,
author = {Andr{\'{a}}s A. Bencz{\'{u}}r},
title = {Counterexamples for Directed and Node Capacitated Cut-Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {505--510},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236730},
doi = {10.1137/S0097539792236730},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Benczur95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BiniG95,
author = {Dario Bini and
Luca Gemignani},
title = {Fast Parallel Computation of the Polynomial Remainder Sequence Via
Bezout and Hankel Matrices},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {63--77},
year = {1995},
url = {https://doi.org/10.1137/S0097539791201903},
doi = {10.1137/S0097539791201903},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BiniG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlassG95,
author = {Andreas Blass and
Yuri Gurevich},
title = {Matrix Transformation Is Complete for the Average Case},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {3--29},
year = {1995},
url = {https://doi.org/10.1137/S0097539792232070},
doi = {10.1137/S0097539792232070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlassG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonetB95,
author = {Maria Luisa Bonet and
Samuel R. Buss},
title = {The Serial Transitive Closure Problem for Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {109--122},
year = {1995},
url = {https://doi.org/10.1137/S0097539792225303},
doi = {10.1137/S0097539792225303},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonetB95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyCE95,
author = {Nader H. Bshouty and
Richard Cleve and
Wayne Eberly},
title = {Size-Depth Tradeoffs for Algebraic Formulas},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {682--705},
year = {1995},
url = {https://doi.org/10.1137/S0097539792232586},
doi = {10.1137/S0097539792232586},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyCE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyHH95,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
title = {Learning Arithmetic Read-Once Formulas},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {706--735},
year = {1995},
url = {https://doi.org/10.1137/S009753979223664X},
doi = {10.1137/S009753979223664X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyHH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumST95,
author = {Adam L. Buchsbaum and
Rajamani Sundar and
Robert Endre Tarjan},
title = {Data-Structural Bootstrapping, Linear Path Compression, and Catenable
Heap-Ordered Double-Ended Queues},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1190--1206},
year = {1995},
url = {https://doi.org/10.1137/S0097539792242144},
doi = {10.1137/S0097539792242144},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuchsbaumST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHL95,
author = {Harry Buhrman and
Edith Hemaspaandra and
Luc Longpr{\'{e}}},
title = {{SPARSE} Reduces Conjunctively to {TALLY}},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {673--681},
year = {1995},
url = {https://doi.org/10.1137/0224044},
doi = {10.1137/0224044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChariRS95,
author = {Suresh Chari and
Pankaj Rohatgi and
Aravind Srinivasan},
title = {Randomness-Optimal Unique Element Isolation with Applications to Perfect
Matching and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1036--1050},
year = {1995},
url = {https://doi.org/10.1137/S0097539793250330},
doi = {10.1137/S0097539793250330},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChariRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CheriyanH95,
author = {Joseph Cheriyan and
Torben Hagerup},
title = {A Randomized Maximum-Flow Algorithm},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {203--226},
year = {1995},
url = {https://doi.org/10.1137/S0097539791221529},
doi = {10.1137/S0097539791221529},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CheriyanH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChorGK95,
author = {Benny Chor and
Mih{\'{a}}ly Ger{\'{e}}b{-}Graus and
Eyal Kushilevitz},
title = {Private Computations over the Integers},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {376--386},
year = {1995},
url = {https://doi.org/10.1137/S0097539791194999},
doi = {10.1137/S0097539791194999},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChorGK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChouK95,
author = {Arthur W. Chou and
Ker{-}I Ko},
title = {Computational Complexity of Two-Dimensional Regions},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {923--947},
year = {1995},
url = {https://doi.org/10.1137/S009753979325456X},
doi = {10.1137/S009753979325456X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChouK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CidonKMP95,
author = {Israel Cidon and
Shay Kutten and
Yishay Mansour and
David Peleg},
title = {Greedy Packet Scheduling},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {148--157},
year = {1995},
url = {https://doi.org/10.1137/S0097539791217695},
doi = {10.1137/S0097539791217695},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CidonKMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cohen95,
author = {Edith Cohen},
title = {Approximate Max-Flow on Small Depth Networks},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {579--597},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236717},
doi = {10.1137/S0097539792236717},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cohen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenBTT95,
author = {Robert F. Cohen and
Giuseppe Di Battista and
Roberto Tamassia and
Ioannis G. Tollis},
title = {Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar
ST-Digraphs},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {970--1001},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235724},
doi = {10.1137/S0097539792235724},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CohenBTT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeHPZ95,
author = {Richard Cole and
Ramesh Hariharan and
Mike Paterson and
Uri Zwick},
title = {Tighter Lower Bounds on the Exact Complexity of String Matching},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {30--45},
year = {1995},
url = {https://doi.org/10.1137/S0097539793245829},
doi = {10.1137/S0097539793245829},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeHPZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DelcherK95,
author = {Arthur L. Delcher and
S. Rao Kosaraju},
title = {An {NC} Algorithm for Evaluating Monotone Planar Circuits},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {369--375},
year = {1995},
url = {https://doi.org/10.1137/S0097539792226278},
doi = {10.1137/S0097539792226278},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DelcherK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeR95,
author = {Luc Devroye and
J. M. Robson},
title = {On the Generation of Random Binary Search Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1141--1156},
year = {1995},
url = {https://doi.org/10.1137/S0097539792224954},
doi = {10.1137/S0097539792224954},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DevroyeR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeR95a,
author = {Luc Devroye and
Bruce A. Reed},
title = {On the Variance of the Height of Random Binary Search Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1157--1162},
year = {1995},
url = {https://doi.org/10.1137/S0097539792237541},
doi = {10.1137/S0097539792237541},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DevroyeR95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DowneyF95,
author = {Rodney G. Downey and
Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {I:} Basic Results},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {873--921},
year = {1995},
url = {https://doi.org/10.1137/S0097539792228228},
doi = {10.1137/S0097539792228228},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DowneyF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DukeLR95,
author = {Richard A. Duke and
Hanno Lefmann and
Vojtech R{\"{o}}dl},
title = {A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs
in a Given Graph},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {598--620},
year = {1995},
url = {https://doi.org/10.1137/S0097539793247634},
doi = {10.1137/S0097539793247634},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DukeLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EiterG95,
author = {Thomas Eiter and
Georg Gottlob},
title = {Identifying the Minimal Transversals of a Hypergraph and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1278--1304},
year = {1995},
url = {https://doi.org/10.1137/S0097539793250299},
doi = {10.1137/S0097539793250299},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EiterG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EmirisC95,
author = {Ioannis Z. Emiris and
John F. Canny},
title = {A General Approach to Removing Degeneracies},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {650--664},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235918},
doi = {10.1137/S0097539792235918},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EmirisC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FederKNN95,
author = {Tom{\'{a}}s Feder and
Eyal Kushilevitz and
Moni Naor and
Noam Nisan},
title = {Amortized Communication Complexity},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {736--750},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235864},
doi = {10.1137/S0097539792235864},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FederKNN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichMP95,
author = {Faith E. Fich and
J. Ian Munro and
Patricio V. Poblete},
title = {Permuting in Place},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {266--278},
year = {1995},
url = {https://doi.org/10.1137/S0097539792238649},
doi = {10.1137/S0097539792238649},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichMP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeKR95,
author = {Alan M. Frieze and
Richard M. Karp and
Bruce A. Reed},
title = {When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman
Problem?},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {484--493},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235384},
doi = {10.1137/S0097539792235384},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeKR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fu95,
author = {Bin Fu},
title = {With Quasilinear Queries {EXP} Is Not Polynomial Time Turing Reducible
to Sparse Sets},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1082--1090},
year = {1995},
url = {https://doi.org/10.1137/S0097539792237188},
doi = {10.1137/S0097539792237188},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fu95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ganz95,
author = {J{\"{u}}rg Ganz},
title = {Evaluation of Polynomials Using the Structure of the Coefficients},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {473--483},
year = {1995},
url = {https://doi.org/10.1137/S0097539792225583},
doi = {10.1137/S0097539792225583},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ganz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gartner95,
author = {Bernd G{\"{a}}rtner},
title = {A Subexponential Algorithm for Abstract Optimization Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1018--1035},
year = {1995},
url = {https://doi.org/10.1137/S0097539793250287},
doi = {10.1137/S0097539793250287},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gartner95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Giancarlo95,
author = {Raffaele Giancarlo},
title = {A Generalization of the Suffix Tree to Square Matrices, with Applications},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {520--562},
year = {1995},
url = {https://doi.org/10.1137/S0097539792231982},
doi = {10.1137/S0097539792231982},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Giancarlo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Giesbrecht95,
author = {Mark Giesbrecht},
title = {Nearly Optimal Algorithms for Canonical Matrix Forms},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {948--969},
year = {1995},
url = {https://doi.org/10.1137/S0097539793252687},
doi = {10.1137/S0097539793252687},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Giesbrecht95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GilliesL95,
author = {Donald W. Gillies and
Jane W.{-}S. Liu},
title = {Scheduling Tasks with {AND/OR} Precedence Constraints},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {797--810},
year = {1995},
url = {https://doi.org/10.1137/S0097539791218664},
doi = {10.1137/S0097539791218664},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GilliesL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoemansW95,
author = {Michel X. Goemans and
David P. Williamson},
title = {A General Approximation Technique for Constrained Forest Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {296--317},
year = {1995},
url = {https://doi.org/10.1137/S0097539793242618},
doi = {10.1137/S0097539793242618},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoemansW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Goldberg95,
author = {Andrew V. Goldberg},
title = {Scaling Algorithms for the Shortest Paths Problem},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {494--504},
year = {1995},
url = {https://doi.org/10.1137/S0097539792231179},
doi = {10.1137/S0097539792231179},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Goldberg95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrigorievSY95,
author = {Dima Grigoriev and
Michael F. Singer and
Andrew Chi{-}Chih Yao},
title = {On Computing Algebraic Functions Using Logarithms and Exponentials},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {242--246},
year = {1995},
url = {https://doi.org/10.1137/S0097539793245015},
doi = {10.1137/S0097539793245015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GrigorievSY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HanKRT95,
author = {Xiaofeng Han and
Pierre Kelsen and
Vijaya Ramachandran and
Robert Endre Tarjan},
title = {Computing Minimal Spanning Subgraphs in Linear Time},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1332--1358},
year = {1995},
url = {https://doi.org/10.1137/S0097539791224509},
doi = {10.1137/S0097539791224509},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HanKRT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HanLL95,
author = {Ching{-}Chih Han and
Kwei{-}Jay Lin and
Jane W.{-}S. Liu},
title = {Scheduling Jobs with Temporal Distance Constraints},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1102--1121},
year = {1995},
url = {https://doi.org/10.1137/S0097539791218081},
doi = {10.1137/S0097539791218081},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HanLL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HeffernanM95,
author = {Paul J. Heffernan and
Joseph S. B. Mitchell},
title = {An Optimal Algorithm for Computing Visibility in the Plane},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {184--201},
year = {1995},
url = {https://doi.org/10.1137/S0097539791221505},
doi = {10.1137/S0097539791221505},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HeffernanM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraS95,
author = {Lane A. Hemaspaandra and
Riccardo Silvestri},
title = {Easily Checked Generalized Self-Reducibility},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {840--858},
year = {1995},
url = {https://doi.org/10.1137/S0097539792234901},
doi = {10.1137/S0097539792234901},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HoftingW95,
author = {Franz H{\"{o}}fting and
Egon Wanke},
title = {Minimum Cost Paths in Periodic Graphs},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1051--1067},
year = {1995},
url = {https://doi.org/10.1137/S0097539792234378},
doi = {10.1137/S0097539792234378},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HoftingW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hsu95,
author = {Wen{-}Lian Hsu},
title = {O(M*N) Algorithms for the Recognition and Isomorphism Problems on
Circular-Arc Graphs},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {411--439},
year = {1995},
url = {https://doi.org/10.1137/S0097539793260726},
doi = {10.1137/S0097539793260726},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hsu95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IbarraJTW95,
author = {Oscar H. Ibarra and
Tao Jiang and
Nicholas Q. Tr{\^{a}}n and
Hui Wang},
title = {New Decidability Results Concerning Two-Way Counter Machines},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {123--137},
year = {1995},
url = {https://doi.org/10.1137/S0097539792240625},
doi = {10.1137/S0097539792240625},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IbarraJTW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JiangL95,
author = {Tao Jiang and
Ming Li},
title = {On the Approximation of Shortest Common Supersequences and Longest
Common Subsequences},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1122--1139},
year = {1995},
url = {https://doi.org/10.1137/S009753979223842X},
doi = {10.1137/S009753979223842X},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JiangL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JuedesL95,
author = {David W. Juedes and
Jack H. Lutz},
title = {The Complexity and Distribution of Hard Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {279--295},
year = {1995},
url = {https://doi.org/10.1137/S0097539792238133},
doi = {10.1137/S0097539792238133},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JuedesL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kalorkoti95,
author = {K. Kalorkoti},
title = {On the Reuse of Additions in Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1305--1312},
year = {1995},
url = {https://doi.org/10.1137/S0097539793251761},
doi = {10.1137/S0097539793251761},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kalorkoti95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanW95,
author = {Sampath Kannan and
Tandy J. Warnow},
title = {Tree Reconstruction from Partial Orders},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {511--519},
year = {1995},
url = {https://doi.org/10.1137/S0097539793252195},
doi = {10.1137/S0097539793252195},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kao95,
author = {Ming{-}Yang Kao},
title = {Planar Strong Connectivity Helps in Parallel Depth-First Search},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {46--62},
year = {1995},
url = {https://doi.org/10.1137/S0097539792227077},
doi = {10.1137/S0097539792227077},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kao95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KapoorR95,
author = {Sanjiv Kapoor and
H. Ramesh},
title = {Algorithms for Enumerating All Spanning Trees of Undirected and Weighted
Graphs},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {247--265},
year = {1995},
url = {https://doi.org/10.1137/S009753979225030X},
doi = {10.1137/S009753979225030X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KapoorR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhullerRF95,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Approximating the Minimum Equivalent Digraph},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {859--872},
year = {1995},
url = {https://doi.org/10.1137/S0097539793256685},
doi = {10.1137/S0097539793256685},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhullerRF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KilpelainenM95,
author = {Pekka Kilpel{\"{a}}inen and
Heikki Mannila},
title = {Ordered and Unordered Tree Inclusion},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {340--356},
year = {1995},
url = {https://doi.org/10.1137/S0097539791218202},
doi = {10.1137/S0097539791218202},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KilpelainenM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KorenS95,
author = {Gilad Koren and
Dennis E. Shasha},
title = {Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor
Real-Time Systems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {318--339},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236882},
doi = {10.1137/S0097539792236882},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KorenS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LakshmanS95,
author = {Yagati N. Lakshman and
B. David Saunders},
title = {Sparse Polynomial Interpolation in Nonstandard Bases},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {387--397},
year = {1995},
url = {https://doi.org/10.1137/S0097539792237784},
doi = {10.1137/S0097539792237784},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LakshmanS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LarmoreP95,
author = {Lawrence L. Larmore and
Teresa M. Przytycka},
title = {Constructing Huffman Trees in Parallel},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1163--1169},
year = {1995},
url = {https://doi.org/10.1137/S0097539792233245},
doi = {10.1137/S0097539792233245},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LarmoreP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LennerstadL95,
author = {H{\aa}kan Lennerstad and
Lars Lundberg},
title = {An Optimal Execution Time Estimate of Static Versus Dynamic Allocation
in Multiprocessor Systems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {751--764},
year = {1995},
url = {https://doi.org/10.1137/S0097539792240571},
doi = {10.1137/S0097539792240571},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LennerstadL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiV95,
author = {Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {A New Approach to Formal Language Theory by Kolmogorov Complexity},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {398--410},
year = {1995},
url = {https://doi.org/10.1137/S009753979324485X},
doi = {10.1137/S009753979324485X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lutz95,
author = {Jack H. Lutz},
title = {Weakly Hard Problems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1170--1189},
year = {1995},
url = {https://doi.org/10.1137/S0097539793249700},
doi = {10.1137/S0097539793249700},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lutz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mansour95,
author = {Yishay Mansour},
title = {Randomized Interpolation and Approximation of Sparse Polynomials},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {357--368},
year = {1995},
url = {https://doi.org/10.1137/S0097539792239291},
doi = {10.1137/S0097539792239291},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mansour95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MejeanMR95,
author = {Henri{-}M. M{\'{e}}jean and
Henri Morel and
Gerard Reynaud},
title = {A Variational Method for Analysing Unit Clause Search},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {621--649},
year = {1995},
url = {https://doi.org/10.1137/S0097539792230484},
doi = {10.1137/S0097539792230484},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MejeanMR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MendelzonW95,
author = {Alberto O. Mendelzon and
Peter T. Wood},
title = {Finding Regular Simple Paths in Graph Databases},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1235--1258},
year = {1995},
url = {https://doi.org/10.1137/S009753979122370X},
doi = {10.1137/S009753979122370X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MendelzonW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MillerN95,
author = {Gary L. Miller and
Joseph Naor},
title = {Flow in Planar Graphs with Multiple Sources and Sinks},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1002--1017},
year = {1995},
url = {https://doi.org/10.1137/S0097539789162997},
doi = {10.1137/S0097539789162997},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MillerN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Murota95,
author = {Kazuo Murota},
title = {Computing the Degree of Determinants Via Combinatorial Relaxation},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {765--796},
year = {1995},
url = {https://doi.org/10.1137/S0097539791201897},
doi = {10.1137/S0097539791201897},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Murota95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorR95,
author = {Moni Naor and
Ron M. Roth},
title = {Optimal File Sharing in Distributed Networks},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {158--183},
year = {1995},
url = {https://doi.org/10.1137/S0097539792237462},
doi = {10.1137/S0097539792237462},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NaorR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorS95,
author = {Moni Naor and
Larry J. Stockmeyer},
title = {What Can be Computed Locally?},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1259--1277},
year = {1995},
url = {https://doi.org/10.1137/S0097539793254571},
doi = {10.1137/S0097539793254571},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/NaorS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Natarajan95,
author = {B. K. Natarajan},
title = {Sparse Approximate Solutions to Linear Systems},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {227--234},
year = {1995},
url = {https://doi.org/10.1137/S0097539792240406},
doi = {10.1137/S0097539792240406},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Natarajan95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ogihara95,
author = {Mitsunori Ogihara},
title = {Polynomial-Time Membership Comparable Sets},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {5},
pages = {1068--1081},
year = {1995},
url = {https://doi.org/10.1137/S0097539793258131},
doi = {10.1137/S0097539793258131},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Ogihara95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PanP95,
author = {Victor Y. Pan and
Franco P. Preparata},
title = {Work-Preserving Speed-Up of Parallel Matrix Computations},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {811--821},
year = {1995},
url = {https://doi.org/10.1137/0224051},
doi = {10.1137/0224051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PanP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Poljak95,
author = {Svatopluk Poljak},
title = {Integer Linear Programs and Local Search for Max-Cut},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {822--839},
year = {1995},
url = {https://doi.org/10.1137/S0097539793245350},
doi = {10.1137/S0097539793245350},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Poljak95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaranV95,
author = {Huzur Saran and
Vijay V. Vazirani},
title = {Finding k Cuts within Twice the Optimal},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {101--108},
year = {1995},
url = {https://doi.org/10.1137/S0097539792251730},
doi = {10.1137/S0097539792251730},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SaranV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SekarRR95,
author = {R. C. Sekar and
R. Ramesh and
I. V. Ramakrishnan},
title = {Adaptive Pattern Matching},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1207--1234},
year = {1995},
url = {https://doi.org/10.1137/S0097539793246252},
doi = {10.1137/S0097539793246252},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SekarRR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShmoysWW95,
author = {David B. Shmoys and
Joel Wein and
David P. Williamson},
title = {Scheduling Parallel Machines On-Line},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1313--1331},
year = {1995},
url = {https://doi.org/10.1137/S0097539793248317},
doi = {10.1137/S0097539793248317},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShmoysWW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SnyderS95,
author = {Timothy Law Snyder and
J. Michael Steele},
title = {A Priori Bounds on the Euclidean Traveling Salesman},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {665--671},
year = {1995},
url = {https://doi.org/10.1137/S0097539792226771},
doi = {10.1137/S0097539792226771},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SnyderS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TokuyamaN95,
author = {Takeshi Tokuyama and
Jun Nakano},
title = {Efficient Algorithms for the Hitchcock Transportation Problem},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {563--578},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236729},
doi = {10.1137/S0097539792236729},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TokuyamaN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WangL95,
author = {Qingzhou Wang and
Ernst L. Leiss},
title = {A Heuristic Scheduling of Independent Tasks with Bottleneck Resource
Constraints},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {2},
pages = {235--241},
year = {1995},
url = {https://doi.org/10.1137/S0097539793243314},
doi = {10.1137/S0097539793243314},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/WangL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YangLW95,
author = {Chung{-}Do Yang and
D. T. Lee and
C. K. Wong},
title = {Rectilinear Path Problems among Rectilinear Obstacles Revisited},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {457--472},
year = {1995},
url = {https://doi.org/10.1137/S0097539792229672},
doi = {10.1137/S0097539792229672},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YangLW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zhang95,
author = {Yanjun Zhang},
title = {On the Optimality of Randomized alpha-beta Search},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {138--147},
year = {1995},
url = {https://doi.org/10.1137/S009753979223037X},
doi = {10.1137/S009753979223037X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Zhang95.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 05:59 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:
