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/siamcomp29.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AdlerBK00,
author = {Micah Adler and
John W. Byers and
Richard M. Karp},
title = {Parallel Sorting with Limited Bandwidth},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1997--2015},
year = {2000},
url = {https://doi.org/10.1137/S0097539797315884},
doi = {10.1137/S0097539797315884},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AdlerBK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalGMV00,
author = {Pankaj K. Agarwal and
Edward F. Grove and
T. M. Murali and
Jeffrey Scott Vitter},
title = {Binary Space Partitions for Fat Rectangles},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1422--1448},
year = {2000},
url = {https://doi.org/10.1137/S0097539797320578},
doi = {10.1137/S0097539797320578},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalGMV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalKW00,
author = {Alok Aggarwal and
Jon M. Kleinberg and
David P. Williamson},
title = {Node-Disjoint Paths on the Mesh and a New Trade-Off in {VLSI} Layout},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1321--1333},
year = {2000},
url = {https://doi.org/10.1137/S0097539796312733},
doi = {10.1137/S0097539796312733},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalKW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AguileraCT00,
author = {Marcos Kawazoe Aguilera and
Wei Chen and
Sam Toueg},
title = {On Quiescent Reliable Communication},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {2040--2073},
year = {2000},
url = {https://doi.org/10.1137/S0097539798341296},
doi = {10.1137/S0097539798341296},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AguileraCT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlbersH00,
author = {Susanne Albers and
Monika Rauch Henzinger},
title = {Exploring Unknown Environments},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1164--1188},
year = {2000},
url = {https://doi.org/10.1137/S009753979732428X},
doi = {10.1137/S009753979732428X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlbersH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarveGV00,
author = {Rakesh D. Barve and
Edward F. Grove and
Jeffrey Scott Vitter},
title = {Application-Controlled Paging for a Shared Cache},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1290--1303},
year = {2000},
url = {https://doi.org/10.1137/S0097539797324278},
doi = {10.1137/S0097539797324278},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BarveGV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BenediktL00,
author = {Michael Benedikt and
Leonid Libkin},
title = {Safe Constraint Queries},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1652--1682},
year = {2000},
url = {https://doi.org/10.1137/S0097539798342484},
doi = {10.1137/S0097539798342484},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BenediktL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumC00,
author = {Avrim Blum and
Prasad Chalasani},
title = {An Online Algorithm for Improving Performance in Navigation},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1907--1938},
year = {2000},
url = {https://doi.org/10.1137/S0097539795290593},
doi = {10.1137/S0097539795290593},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoissonnatP00,
author = {Jean{-}Daniel Boissonnat and
Franco P. Preparata},
title = {Robust Plane Sweep for Intersecting Segments},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1401--1421},
year = {2000},
url = {https://doi.org/10.1137/S0097539797329373},
doi = {10.1137/S0097539797329373},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoissonnatP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonetPR00,
author = {Maria Luisa Bonet and
Toniann Pitassi and
Ran Raz},
title = {On Interpolation and Automatization for Frege Systems},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1939--1967},
year = {2000},
url = {https://doi.org/10.1137/S0097539798353230},
doi = {10.1137/S0097539798353230},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonetPR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoppanaN00,
author = {Ravi B. Boppana and
Babu O. Narayanan},
title = {Perfect-Information Leader Election with Optimal Resilience},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1304--1320},
year = {2000},
url = {https://doi.org/10.1137/S0097539796307182},
doi = {10.1137/S0097539796307182},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoppanaN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanFMT00,
author = {Harry Buhrman and
Lance Fortnow and
Dieter van Melkebeek and
Leen Torenvliet},
title = {Separating Complexity Classes Using Autoreducibility},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1497--1520},
year = {2000},
url = {https://doi.org/10.1137/S0097539798334736},
doi = {10.1137/S0097539798334736},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanFMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiLZ00,
author = {Jin{-}yi Cai and
Richard J. Lipton and
Yechezkel Zalcstein},
title = {The Complexity of the {A} {B} {C} Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1878--1888},
year = {2000},
url = {https://doi.org/10.1137/S0097539794276853},
doi = {10.1137/S0097539794276853},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CaiLZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanM00,
author = {Edward P. F. Chan and
Ron van der Meyden},
title = {Containment and Optimization of Object-Preserving Conjunctive Queries},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1371--1400},
year = {2000},
url = {https://doi.org/10.1137/S0097539794262446},
doi = {10.1137/S0097539794262446},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenK00,
author = {Zhi{-}Zhong Chen and
Ming{-}Yang Kao},
title = {Reducing Randomness via Irrational Numbers},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1247--1256},
year = {2000},
url = {https://doi.org/10.1137/S0097539798341600},
doi = {10.1137/S0097539798341600},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenKT00,
author = {Danny Z. Chen and
Kevin S. Klenk and
Hung{-}Yi Tu},
title = {Shortest Path Queries Among Weighted Obstacles in the Rectilinear
Plane},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1223--1246},
year = {2000},
url = {https://doi.org/10.1137/S0097539796307194},
doi = {10.1137/S0097539796307194},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajHS00,
author = {Artur Czumaj and
Friedhelm Meyer auf der Heide and
Volker Stemann},
title = {Contention Resolution in Hashing Based Shared Memory Simulations},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1703--1739},
year = {2000},
url = {https://doi.org/10.1137/S009753979529564X},
doi = {10.1137/S009753979529564X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CzumajHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DagumKLR00,
author = {Paul Dagum and
Richard M. Karp and
Michael Luby and
Sheldon M. Ross},
title = {An Optimal Algorithm for Monte Carlo Estimation},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1484--1496},
year = {2000},
url = {https://doi.org/10.1137/S0097539797315306},
doi = {10.1137/S0097539797315306},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DagumKLR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DorHZ00,
author = {Dorit Dor and
Shay Halperin and
Uri Zwick},
title = {All-Pairs Almost Shortest Paths},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1740--1759},
year = {2000},
url = {https://doi.org/10.1137/S0097539797327908},
doi = {10.1137/S0097539797327908},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DorHZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ErgunKS00,
author = {Funda Erg{\"{u}}n and
Ravi Kumar and
D. Sivakumar},
title = {Self-Testing without the Generator Bottleneck},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1630--1651},
year = {2000},
url = {https://doi.org/10.1137/S0097539796311168},
doi = {10.1137/S0097539796311168},
timestamp = {Mon, 08 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ErgunKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Erickson00,
author = {Jeff Erickson},
title = {Space-Time Tradeoffs for Emptiness Queries},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1968--1996},
year = {2000},
url = {https://doi.org/10.1137/S0097539798337212},
doi = {10.1137/S0097539798337212},
timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Erickson00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtzioniHJM00,
author = {Oren Etzioni and
Steve Hanks and
Tao Jiang and
Omid Madani},
title = {Optimal Information Gathering on the Internet with Time and Cost Constraints},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1596--1620},
year = {2000},
url = {https://doi.org/10.1137/S0097539797314465},
doi = {10.1137/S0097539797314465},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtzioniHJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GathenS00,
author = {Joachim von zur Gathen and
Igor E. Shparlinski},
title = {The {CREW} {PRAM} Complexity of Modular Inversion},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1839--1857},
year = {2000},
url = {https://doi.org/10.1137/S0097539797328070},
doi = {10.1137/S0097539797328070},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GathenS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichS00,
author = {Oded Goldreich and
Shmuel Safra},
title = {A Combinatorial Consistency Lemma with Application to Proving the
{PCP} Theorem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1132--1154},
year = {2000},
url = {https://doi.org/10.1137/S0097539797315744},
doi = {10.1137/S0097539797315744},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldreichS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrolmuszT00,
author = {Vince Grolmusz and
G{\'{a}}bor Tardos},
title = {Lower Bounds for (MOD\({}_{\mbox{p}}\)-MOD\({}_{\mbox{m}}\)) Circuits},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1209--1222},
year = {2000},
url = {https://doi.org/10.1137/S0097539798340850},
doi = {10.1137/S0097539798340850},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GrolmuszT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Har-Peled00,
author = {Sariel Har{-}Peled},
title = {Constructing Planar Cuttings in Theory and Practice},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {2016--2039},
year = {2000},
url = {https://doi.org/10.1137/S0097539799350232},
doi = {10.1137/S0097539799350232},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Har-Peled00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Henzinger00,
author = {Monika Rauch Henzinger},
title = {Improved Data Structures for Fully Dynamic Biconnectivity},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1761--1815},
year = {2000},
url = {https://doi.org/10.1137/S0097539794263907},
doi = {10.1137/S0097539794263907},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Henzinger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaoW00,
author = {Ming{-}Yang Kao and
Jie Wang},
title = {Linear-Time Approximation Algorithms for Computing Numerical Summation
with Provably Small Errors},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1568--1576},
year = {2000},
url = {https://doi.org/10.1137/S0097539798341594},
doi = {10.1137/S0097539798341594},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaoW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kapoor00,
author = {Sanjiv Kapoor},
title = {Dynamic Maintenance of Maxima of 2-d Point Sets},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1858--1877},
year = {2000},
url = {https://doi.org/10.1137/S0097539798348365},
doi = {10.1137/S0097539798348365},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kapoor00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhannaL00,
author = {Sanjeev Khanna and
Vincenzo Liberatore},
title = {On Broadcast Disk Paging},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1683--1702},
year = {2000},
url = {https://doi.org/10.1137/S0097539798341399},
doi = {10.1137/S0097539798341399},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KhannaL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KilianKMO00,
author = {Joe Kilian and
Eyal Kushilevitz and
Silvio Micali and
Rafail Ostrovsky},
title = {Reducibility and Completeness in Private Computations},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1189--1208},
year = {2000},
url = {https://doi.org/10.1137/S0097539797321742},
doi = {10.1137/S0097539797321742},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KilianKMO00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KimbrelK00,
author = {Tracy Kimbrel and
Anna R. Karlin},
title = {Near-Optimal Parallel Prefetching and Caching},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1051--1082},
year = {2000},
url = {https://doi.org/10.1137/S0097539797326976},
doi = {10.1137/S0097539797326976},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KimbrelK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LennerstadL00,
author = {H{\aa}kan Lennerstad and
Lars Lundberg},
title = {Optimal Combinatorial Functions Comparing Multiprocess Allocation
Performance in Multiprocessor Systems},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1816--1838},
year = {2000},
url = {https://doi.org/10.1137/S0097539799294398},
doi = {10.1137/S0097539799294398},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LennerstadL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LinFS00,
author = {Wei{-}Liang Lin and
Amir H. Farrahi and
Majid Sarrafzadeh},
title = {On the Power of Logic Resynthesis},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1257--1289},
year = {2000},
url = {https://doi.org/10.1137/S0097539796335480},
doi = {10.1137/S0097539796335480},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LinFS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MalkhiRW00,
author = {Dahlia Malkhi and
Michael K. Reiter and
Avishai Wool},
title = {The Load and Availability of Byzantine Quorum Systems},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1889--1906},
year = {2000},
url = {https://doi.org/10.1137/S0097539797325235},
doi = {10.1137/S0097539797325235},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MalkhiRW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MitchellV00,
author = {Scott A. Mitchell and
Stephen A. Vavasis},
title = {Quality Mesh Generation in Higher Dimensions},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1334--1370},
year = {2000},
url = {https://doi.org/10.1137/S0097539796314124},
doi = {10.1137/S0097539796314124},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MitchellV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PacholskiST00,
author = {Leszek Pacholski and
Wieslaw Szwast and
Lidia Tendera},
title = {Complexity Results for First-Order Two-Variable Logic with Counting},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1083--1117},
year = {2000},
url = {https://doi.org/10.1137/S0097539797323005},
doi = {10.1137/S0097539797323005},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PacholskiST00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Poutre00,
author = {Johannes A. La Poutr{\'{e}}},
title = {Maintenance of 2- and 3-Edge-Connected Components of Graphs {II}},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1521--1549},
year = {2000},
url = {https://doi.org/10.1137/S0097539793257770},
doi = {10.1137/S0097539793257770},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Poutre00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RajagopalanS00,
author = {Sridhar Rajagopalan and
Leonard J. Schulman},
title = {Verification of Identities},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1155--1163},
year = {2000},
url = {https://doi.org/10.1137/S0097539797325387},
doi = {10.1137/S0097539797325387},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/RajagopalanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReinhardtA00,
author = {Klaus Reinhardt and
Eric Allender},
title = {Making Nondeterminism Unambiguous},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1118--1131},
year = {2000},
url = {https://doi.org/10.1137/S0097539798339041},
doi = {10.1137/S0097539798339041},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ReinhardtA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaksZ00,
author = {Michael E. Saks and
Fotios Zaharoglou},
title = {Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1449--1483},
year = {2000},
url = {https://doi.org/10.1137/S0097539796307698},
doi = {10.1137/S0097539796307698},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/SaksZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SellenCY00,
author = {J{\"{u}}rgen Sellen and
Joonsoo Choi and
Chee{-}Keng Yap},
title = {Precision-Sensitive Euclidean Shortest Path in 3-Space},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1577--1595},
year = {2000},
url = {https://doi.org/10.1137/S0097539798340205},
doi = {10.1137/S0097539798340205},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SellenCY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StachoV00,
author = {Ladislav Stacho and
Imrich Vrto},
title = {Virtual Path Layouts in {ATM} Networks},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1621--1629},
year = {2000},
url = {https://doi.org/10.1137/S0097539796308151},
doi = {10.1137/S0097539796308151},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StachoV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TrevisanSSW00,
author = {Luca Trevisan and
Gregory B. Sorkin and
Madhu Sudan and
David P. Williamson},
title = {Gadgets, Approximation, and Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {2074--2097},
year = {2000},
url = {https://doi.org/10.1137/S0097539797328847},
doi = {10.1137/S0097539797328847},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TrevisanSSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VincentL00,
author = {Millist W. Vincent and
Mark Levene},
title = {Restructuring Partitioned Normal Form Relations without Information
Loss},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1550--1567},
year = {2000},
url = {https://doi.org/10.1137/S0097539797326319},
doi = {10.1137/S0097539797326319},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VincentL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Willard00,
author = {Dan E. Willard},
title = {Examining Computational Geometry, Van Emde Boas Trees, and Hashing
from the Perspective of the Fusion Tree},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {1030--1049},
year = {2000},
url = {https://doi.org/10.1137/S0097539797322425},
doi = {10.1137/S0097539797322425},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Willard00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalES99,
author = {Pankaj K. Agarwal and
Alon Efrat and
Micha Sharir},
title = {Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements
and Its Applications},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {912--953},
year = {1999},
url = {https://doi.org/10.1137/S0097539795295936},
doi = {10.1137/S0097539795295936},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalES99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalCKMS99,
author = {Alok Aggarwal and
Don Coppersmith and
Sanjeev Khanna and
Rajeev Motwani and
Baruch Schieber},
title = {The Angular-Metric Traveling Salesman Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {697--711},
year = {1999},
url = {https://doi.org/10.1137/S0097539796312721},
doi = {10.1137/S0097539796312721},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalCKMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Albers99,
author = {Susanne Albers},
title = {Better Bounds for Online Scheduling},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {459--473},
year = {1999},
url = {https://doi.org/10.1137/S0097539797324874},
doi = {10.1137/S0097539797324874},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Albers99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AndrewsLMZ99,
author = {Matthew Andrews and
Frank Thomson Leighton and
Panagiotis Takis Metaxas and
Lisa Zhang},
title = {Automatic Methods for Hiding Latency in Parallel and Distributed Computation},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {615--647},
year = {1999},
url = {https://doi.org/10.1137/S0097539797326502},
doi = {10.1137/S0097539797326502},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AndrewsLMZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnilyGL99,
author = {Shoshana Anily and
Michel Gendreau and
Gilbert Laporte},
title = {The Swapping Problem on a Line},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {327--335},
year = {1999},
url = {https://doi.org/10.1137/S0097539797323108},
doi = {10.1137/S0097539797323108},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnilyGL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArkinCMSY99,
author = {Esther M. Arkin and
Yi{-}Jen Chiang and
Joseph S. B. Mitchell and
Steven Skiena and
Tae{-}Cheon Yang},
title = {On the Maximum Scatter Traveling Salesperson Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {515--544},
year = {1999},
url = {https://doi.org/10.1137/S0097539797320281},
doi = {10.1137/S0097539797320281},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArkinCMSY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AzarBKU99,
author = {Yossi Azar and
Andrei Z. Broder and
Anna R. Karlin and
Eli Upfal},
title = {Balanced Allocations},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {180--200},
year = {1999},
url = {https://doi.org/10.1137/S0097539795288490},
doi = {10.1137/S0097539795288490},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AzarBKU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BellantoniN99,
author = {Stephen J. Bellantoni and
Karl{-}Heinz Niggl},
title = {Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {401--415},
year = {1999},
url = {https://doi.org/10.1137/S009753979528175X},
doi = {10.1137/S009753979528175X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BellantoniN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bertram-KretzbergL99,
author = {Claudia Bertram{-}Kretzberg and
Hanno Lefmann},
title = {The Algorithmic Aspects of Uncrowded Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {201--230},
year = {1999},
url = {https://doi.org/10.1137/S0097539797323716},
doi = {10.1137/S0097539797323716},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bertram-KretzbergL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BertschN99,
author = {Eberhard Bertsch and
Mark{-}Jan Nederhof},
title = {Regular Closure of Deterministic Languages},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {81--102},
year = {1999},
url = {https://doi.org/10.1137/S009753979528682X},
doi = {10.1137/S009753979528682X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BertschN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattGLL99,
author = {Sandeep N. Bhatt and
David S. Greenberg and
Frank Thomson Leighton and
Pangfeng Liu},
title = {Tight Bounds for On-Line Tree Embeddings},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {474--491},
year = {1999},
url = {https://doi.org/10.1137/S0097539796308710},
doi = {10.1137/S0097539796308710},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattGLL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoldiV99,
author = {Paolo Boldi and
Sebastiano Vigna},
title = {Complexity of Deciding Sense of Direction},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {779--789},
year = {1999},
url = {https://doi.org/10.1137/S0097539796310801},
doi = {10.1137/S0097539796310801},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoldiV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonetPWY99,
author = {Maria Luisa Bonet and
Cynthia A. Phillips and
Tandy J. Warnow and
Shibu Yooseph},
title = {Constructing Evolutionary Trees in the Presence of Polymorphic Characters},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {103--131},
year = {1999},
url = {https://doi.org/10.1137/S0097539796324636},
doi = {10.1137/S0097539796324636},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonetPWY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreutzmannL99,
author = {Josef M. Breutzmann and
Jack H. Lutz},
title = {Equivalence of Measures of Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {302--326},
year = {1999},
url = {https://doi.org/10.1137/S0097539796302269},
doi = {10.1137/S0097539796302269},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BreutzmannL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BruellGKP99,
author = {Steven C. Bruell and
Sukumar Ghosh and
Mehmet Hakan Karaata and
Sriram V. Pemmaraju},
title = {Self-Stabilizing Algorithms for Finding Centers and Medians of Trees},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {600--614},
year = {1999},
url = {https://doi.org/10.1137/S0097539798427156},
doi = {10.1137/S0097539798427156},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BruellGKP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BubleyDGJ99,
author = {Russ Bubley and
Martin E. Dyer and
Catherine S. Greenhill and
Mark Jerrum},
title = {On Approximately Counting Colorings of Small Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {387--400},
year = {1999},
url = {https://doi.org/10.1137/S0097539798338175},
doi = {10.1137/S0097539798338175},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BubleyDGJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanLTV99,
author = {Harry Buhrman and
Ming Li and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Kolmogorov Random Graphs and the Incompressibility Method},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {590--599},
year = {1999},
url = {https://doi.org/10.1137/S0097539797327805},
doi = {10.1137/S0097539797327805},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanLTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenT99,
author = {Weimin Chen and
Volker Turau},
title = {On Regular Tree Embeddings},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {288--301},
year = {1999},
url = {https://doi.org/10.1137/S0097539797324308},
doi = {10.1137/S0097539797324308},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChorN99,
author = {Benny Chor and
Lee{-}Bath Nelson},
title = {Solvability in Asynchronous Environments {II:} Finite Interactive
Tasks},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {351--377},
year = {1999},
url = {https://doi.org/10.1137/S0097539795294979},
doi = {10.1137/S0097539795294979},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChorN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DecaturGR99,
author = {Scott E. Decatur and
Oded Goldreich and
Dana Ron},
title = {Computational Sample Complexity},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {854--879},
year = {1999},
url = {https://doi.org/10.1137/S0097539797325648},
doi = {10.1137/S0097539797325648},
timestamp = {Wed, 15 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DecaturGR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevKKP99,
author = {Shlomi Dolev and
Evangelos Kranakis and
Danny Krizanc and
David Peleg},
title = {Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {804--833},
year = {1999},
url = {https://doi.org/10.1137/S0097539797316610},
doi = {10.1137/S0097539797316610},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DolevKKP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DowneyFVW99,
author = {Rodney G. Downey and
Michael R. Fellows and
Alexander Vardy and
Geoff Whittle},
title = {The Parametrized Complexity of Some Fundamental Problems in Coding
Theory},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {545--570},
year = {1999},
url = {https://doi.org/10.1137/S0097539797323571},
doi = {10.1137/S0097539797323571},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DowneyFVW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EmersonJ99,
author = {E. Allen Emerson and
Charanjit S. Jutla},
title = {The Complexity of Tree Automata and Logics of Programs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {132--158},
year = {1999},
url = {https://doi.org/10.1137/S0097539793304741},
doi = {10.1137/S0097539793304741},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EmersonJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EschenHSS99,
author = {Elaine M. Eschen and
Ryan Hayward and
Jeremy P. Spinrad and
R. Sritharan},
title = {Weakly Triangulated Comparability Graphs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {378--386},
year = {1999},
url = {https://doi.org/10.1137/S0097539797322334},
doi = {10.1137/S0097539797322334},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EschenHSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeLS99,
author = {Uriel Feige and
Dror Lapidot and
Adi Shamir},
title = {Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {1--28},
year = {1999},
url = {https://doi.org/10.1137/S0097539792230010},
doi = {10.1137/S0097539792230010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeigeLS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FiatN99,
author = {Amos Fiat and
Moni Naor},
title = {Rigorous Time/Space Trade-offs for Inverting Functions},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {790--803},
year = {1999},
url = {https://doi.org/10.1137/S0097539795280512},
doi = {10.1137/S0097539795280512},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FiatN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargSV99,
author = {Naveen Garg and
Huzur Saran and
Vijay V. Vazirani},
title = {Finding Separator Cuts in Planar Graphs within Twice the Optimal},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {159--179},
year = {1999},
url = {https://doi.org/10.1137/S0097539794271692},
doi = {10.1137/S0097539794271692},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GargSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GhoshLMMPRRTZ99,
author = {Bhaskar Ghosh and
Frank Thomson Leighton and
Bruce M. Maggs and
S. Muthukrishnan and
C. Greg Plaxton and
Rajmohan Rajaraman and
Andr{\'{e}}a W. Richa and
Robert Endre Tarjan and
David Zuckerman},
title = {Tight Analyses of Two Local Load Balancing Algorithms},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {29--64},
year = {1999},
url = {https://doi.org/10.1137/S0097539795292208},
doi = {10.1137/S0097539795292208},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GhoshLMMPRRTZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ99,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Randomly Sampling Molecules},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {834--853},
year = {1999},
url = {https://doi.org/10.1137/S0097539797318864},
doi = {10.1137/S0097539797318864},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Goodrich99,
author = {Michael T. Goodrich},
title = {Communication-Efficient Parallel Sorting},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {416--432},
year = {1999},
url = {https://doi.org/10.1137/S0097539795294141},
doi = {10.1137/S0097539795294141},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Goodrich99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HeC99,
author = {Xin He and
Zhi{-}Zhong Chen},
title = {An Algorithm for Shortest Paths in Bipartite Digraphs with Concave
Weight Matrices and its Applications},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {65--80},
year = {1999},
url = {https://doi.org/10.1137/S0097539797322255},
doi = {10.1137/S0097539797322255},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HeC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanST99,
author = {Haim Kaplan and
Ron Shamir and
Robert Endre Tarjan},
title = {A Faster and Simpler Algorithm for Sorting Signed Permutations by
Reversals},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {880--892},
year = {1999},
url = {https://doi.org/10.1137/S0097539798334207},
doi = {10.1137/S0097539798334207},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KaplanST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Karger99,
author = {David R. Karger},
title = {A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal
Network Reliability Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {492--514},
year = {1999},
url = {https://doi.org/10.1137/S0097539796298340},
doi = {10.1137/S0097539796298340},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Karger99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarkkainenU99,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Esko Ukkonen},
title = {Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {571--589},
year = {1999},
url = {https://doi.org/10.1137/S0097539794275872},
doi = {10.1137/S0097539794275872},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KarkkainenU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Karloff99,
author = {Howard J. Karloff},
title = {How Good is the Goemans-Williamson {MAX} {CUT} Algorithm?},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {336--350},
year = {1999},
url = {https://doi.org/10.1137/S0097539797321481},
doi = {10.1137/S0097539797321481},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Karloff99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KosarajuM99,
author = {S. Rao Kosaraju and
Giovanni Manzini},
title = {Compression of Low Entropy Strings with Lempel-Ziv Algorithms},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {893--911},
year = {1999},
url = {https://doi.org/10.1137/S0097539797331105},
doi = {10.1137/S0097539797331105},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KosarajuM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeightonM99,
author = {Frank Thomson Leighton and
Yuan Ma},
title = {Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks
with Destructive Faults},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {258--273},
year = {1999},
url = {https://doi.org/10.1137/S0097539796305298},
doi = {10.1137/S0097539796305298},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeightonM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeveneL99,
author = {Mark Levene and
George Loizou},
title = {Navigation in Hypertext Is Easy Only Sometimes},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {728--760},
year = {1999},
url = {https://doi.org/10.1137/S0097539795282730},
doi = {10.1137/S0097539795282730},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeveneL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Macarie99,
author = {Ioan I. Macarie},
title = {On the Structure of Logspace Probabilistic Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {987--1007},
year = {1999},
url = {https://doi.org/10.1137/S0097539796298339},
doi = {10.1137/S0097539796298339},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Macarie99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Marcinkowski99,
author = {Jerzy Marcinkowski},
title = {Achilles, Turtle, and Undecidable Boundedness Problems for Small {DATALOG}
Programs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {231--257},
year = {1999},
url = {https://doi.org/10.1137/S0097539797322140},
doi = {10.1137/S0097539797322140},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Marcinkowski99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MiyazawaW99,
author = {Fl{\'{a}}vio Keidi Miyazawa and
Yoshiko Wakabayashi},
title = {Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional
Packing Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {1008--1029},
year = {1999},
url = {https://doi.org/10.1137/S009753979631391X},
doi = {10.1137/S009753979631391X},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MiyazawaW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Natarajan99,
author = {Balas K. Natarajan},
title = {On Learning Functions from Noise-Free and Noisy Samples via Occam's
Razor},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {712--727},
year = {1999},
url = {https://doi.org/10.1137/S0097539794277111},
doi = {10.1137/S0097539794277111},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Natarajan99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Nedev99,
author = {Zhivko Prodanov Nedev},
title = {Finding an Even Simple Path in a Directed Planar Graph},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {685--695},
year = {1999},
url = {https://doi.org/10.1137/S0097539797330343},
doi = {10.1137/S0097539797330343},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Nedev99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rieger99,
author = {Joachim H. Rieger},
title = {Proximity in Arrangements of Algebraic Sets},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {433--458},
year = {1999},
url = {https://doi.org/10.1137/S0097539796300945},
doi = {10.1137/S0097539796300945},
timestamp = {Thu, 17 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rieger99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RuskeyS99,
author = {Frank Ruskey and
Joe Sawada},
title = {An Efficient Algorithm for Generating Necklaces with Fixed Density},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {671--684},
year = {1999},
url = {https://doi.org/10.1137/S0097539798344112},
doi = {10.1137/S0097539798344112},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RuskeyS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Srinivasan99,
author = {Aravind Srinivasan},
title = {Improved Approximation Guarantees for Packing and Covering Integer
Programs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {648--670},
year = {1999},
url = {https://doi.org/10.1137/S0097539796314240},
doi = {10.1137/S0097539796314240},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Srinivasan99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sweedyk99,
author = {Z. Sweedyk},
title = {A 2{\textonehalf}-Approximation Algorithm for Shortest Superstring},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {954--986},
year = {1999},
url = {https://doi.org/10.1137/S0097539796324661},
doi = {10.1137/S0097539796324661},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sweedyk99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Szkaliczki99,
author = {Tibor Szkaliczki},
title = {Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model
is NP-Complete},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {274--287},
year = {1999},
url = {https://doi.org/10.1137/S0097539796303123},
doi = {10.1137/S0097539796303123},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Szkaliczki99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WuLBCRT99,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
title = {A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {761--778},
year = {1999},
url = {https://doi.org/10.1137/S009753979732253X},
doi = {10.1137/S009753979732253X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/WuLBCRT99.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-06-19 23:44 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:
