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/siamcomp27.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AgarwalBMS98,
author = {Pankaj K. Agarwal and
Mark de Berg and
Jir{\'{\i}} Matousek and
Otfried Schwarzkopf},
title = {Constructing Levels in Arrangements and Higher Order Voronoi Diagrams},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {654--667},
year = {1998},
url = {https://doi.org/10.1137/S0097539795281840},
doi = {10.1137/S0097539795281840},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalBMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalMS98,
author = {Pankaj K. Agarwal and
Jir{\'{\i}} Matousek and
Otfried Schwarzkopf},
title = {Computing Many Faces in Arrangements of Lines and Segments},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {491--505},
year = {1998},
url = {https://doi.org/10.1137/S009753979426616X},
doi = {10.1137/S009753979426616X},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalS98,
author = {Pankaj K. Agarwal and
Subhash Suri},
title = {Surface Approximation and Geometric Partitions},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1016--1035},
year = {1998},
url = {https://doi.org/10.1137/S0097539794269801},
doi = {10.1137/S0097539794269801},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AizensteinBKKPR98,
author = {Howard Aizenstein and
Avrim Blum and
Roni Khardon and
Eyal Kushilevitz and
Leonard Pitt and
Dan Roth},
title = {On Learning Read-k-Satisfy-j {DNF}},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1515--1530},
year = {1998},
url = {https://doi.org/10.1137/S0097539794274398},
doi = {10.1137/S0097539794274398},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AizensteinBKKPR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Albers98,
author = {Susanne Albers},
title = {Improved Randomized On-Line Algorithms for the List Update Problem},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {682--693},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277858},
doi = {10.1137/S0097539794277858},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Albers98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmirB98,
author = {Amihood Amir and
Gary Benson},
title = {Two-Dimensional Periodicity in Rectangular Arrays},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {90--106},
year = {1998},
url = {https://doi.org/10.1137/S0097539795298321},
doi = {10.1137/S0097539795298321},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AmirB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaCFW98,
author = {Hagit Attiya and
Soma Chaudhuri and
Roy Friedman and
Jennifer L. Welch},
title = {Shared Memory Consistency Conditions for Nonsequential Execution:
Definitions and Programming Strategies},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {65--89},
year = {1998},
url = {https://doi.org/10.1137/S0097539794278396},
doi = {10.1137/S0097539794278396},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AttiyaCFW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaF98,
author = {Hagit Attiya and
Roy Friedman},
title = {A Correctness Condition for High-Performance Multiprocessors},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1637--1670},
year = {1998},
url = {https://doi.org/10.1137/S0097539795289215},
doi = {10.1137/S0097539795289215},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AttiyaF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AttiyaR98,
author = {Hagit Attiya and
Ophir Rachman},
title = {Atomic Snapshots in O(n log n) Operations},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {319--340},
year = {1998},
url = {https://doi.org/10.1137/S0097539795279463},
doi = {10.1137/S0097539795279463},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AttiyaR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AumannR98,
author = {Yonatan Aumann and
Yuval Rabani},
title = {An \emph{O}(log \emph{k}) Approximate Min-Cut Max-Flow Theorem and
Approximation Algorithm},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {291--301},
year = {1998},
url = {https://doi.org/10.1137/S0097539794285983},
doi = {10.1137/S0097539794285983},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AumannR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bar-NoyMSS98,
author = {Amotz Bar{-}Noy and
Alain J. Mayer and
Baruch Schieber and
Madhu Sudan},
title = {Guaranteeing Fair Service to Persistent Dependent Tasks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1168--1189},
year = {1998},
url = {https://doi.org/10.1137/S0097539795282092},
doi = {10.1137/S0097539795282092},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bar-NoyMSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bar-YehudaGNR98,
author = {Reuven Bar{-}Yehuda and
Dan Geiger and
Joseph Naor and
Ron M. Roth},
title = {Approximation Algorithms for the Feedback Vertex Set Problem with
Applications to Constraint Satisfaction and Bayesian Inference},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {942--959},
year = {1998},
url = {https://doi.org/10.1137/S0097539796305109},
doi = {10.1137/S0097539796305109},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bar-YehudaGNR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarnesBRS98,
author = {Greg Barnes and
Jonathan F. Buss and
Walter L. Ruzzo and
Baruch Schieber},
title = {A Sublinear Space, Polynomial Time Algorithm for Directed \emph{s}-\emph{t}
Connectivity},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1273--1282},
year = {1998},
url = {https://doi.org/10.1137/S0097539793283151},
doi = {10.1137/S0097539793283151},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BarnesBRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarnesE98,
author = {Greg Barnes and
Jeff Edmonds},
title = {Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata
Models},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1190--1202},
year = {1998},
url = {https://doi.org/10.1137/S0097539795294402},
doi = {10.1137/S0097539795294402},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BarnesE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BattistaLV98,
author = {Giuseppe Di Battista and
Giuseppe Liotta and
Francesco Vargiu},
title = {Spirality and Optimal Orthogonal Drawings},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1764--1811},
year = {1998},
url = {https://doi.org/10.1137/S0097539794262847},
doi = {10.1137/S0097539794262847},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BattistaLV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BealsNT98,
author = {Robert Beals and
Tetsuro Nishino and
Keisuke Tanaka},
title = {On the Complexity of Negation-Limited Boolean Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1334--1347},
year = {1998},
url = {https://doi.org/10.1137/S0097539794275136},
doi = {10.1137/S0097539794275136},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BealsNT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeigelG98,
author = {Richard Beigel and
Judy Goldsmith},
title = {Downward Separation Fails Catastrophically for Limited Nondeterminism
Classes},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1420--1429},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277421},
doi = {10.1137/S0097539794277421},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeigelG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BellareGS98,
author = {Mihir Bellare and
Oded Goldreich and
Madhu Sudan},
title = {Free Bits, PCPs, and Nonapproximability-Towards Tight Results},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {804--915},
year = {1998},
url = {https://doi.org/10.1137/S0097539796302531},
doi = {10.1137/S0097539796302531},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BellareGS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BermondGRV98,
author = {Jean{-}Claude Bermond and
Luisa Gargano and
Adele A. Rescigno and
Ugo Vaccaro},
title = {Fast Gossiping by Short Messages},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {917--941},
year = {1998},
url = {https://doi.org/10.1137/S0097539795283619},
doi = {10.1137/S0097539795283619},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BermondGRV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BertolazziBMT98,
author = {Paola Bertolazzi and
Giuseppe Di Battista and
Carlo Mannino and
Roberto Tamassia},
title = {Optimal Upward Planarity Testing of Single-Source Digraphs},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {132--169},
year = {1998},
url = {https://doi.org/10.1137/S0097539794279626},
doi = {10.1137/S0097539794279626},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BertolazziBMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BiniP98,
author = {Dario Bini and
Victor Y. Pan},
title = {Computing Matrix Eigenvalues and Polynomial Zeros Where the Output
is Real},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1099--1115},
year = {1998},
url = {https://doi.org/10.1137/S0097539790182482},
doi = {10.1137/S0097539790182482},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BiniP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumofeL98,
author = {Robert D. Blumofe and
Charles E. Leiserson},
title = {Space-Efficient Scheduling of Multithreaded Computations},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {202--229},
year = {1998},
url = {https://doi.org/10.1137/S0097539793259471},
doi = {10.1137/S0097539793259471},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumofeL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodlaenderH98,
author = {Hans L. Bodlaender and
Torben Hagerup},
title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1725--1746},
year = {1998},
url = {https://doi.org/10.1137/S0097539795289859},
doi = {10.1137/S0097539795289859},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BodlaenderH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BradfordRS98,
author = {Phillip G. Bradford and
Gregory J. E. Rawlins and
Gregory E. Shannon},
title = {Efficient Matrix Chain Ordering in Polylog Time},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {466--490},
year = {1998},
url = {https://doi.org/10.1137/S0097539794270698},
doi = {10.1137/S0097539794270698},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BradfordRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Brady98,
author = {Martin L. Brady},
title = {A Fast Discrete Approximation Algorithm for the Radon Transform},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {107--119},
year = {1998},
url = {https://doi.org/10.1137/S0097539793256673},
doi = {10.1137/S0097539793256673},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Brady98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyC98,
author = {Nader H. Bshouty and
Richard Cleve},
title = {Interpolating Arithmetic Read-Once Formulas in Parallel},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {401--413},
year = {1998},
url = {https://doi.org/10.1137/S009753979528812X},
doi = {10.1137/S009753979528812X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanHT98,
author = {Harry Buhrman and
Albrecht Hoene and
Leen Torenvliet},
title = {Splittings, Robustness, and Structure of Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {637--653},
year = {1998},
url = {https://doi.org/10.1137/S0097539795279724},
doi = {10.1137/S0097539795279724},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanHT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BussY98,
author = {Samuel R. Buss and
Peter N. Yianilos},
title = {Linear and \emph{O}(\emph{n} log \emph{n}) Time Minimum-Cost Matching
Algorithms for Quasi-Convex Tours},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {170--201},
year = {1998},
url = {https://doi.org/10.1137/S0097539794267243},
doi = {10.1137/S0097539794267243},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BussY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiCH98,
author = {Liming Cai and
Jianer Chen and
Johan H{\aa}stad},
title = {Circuit Bottom Fan-In and Computational Power},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {341--355},
year = {1998},
url = {https://doi.org/10.1137/S0097539795282432},
doi = {10.1137/S0097539795282432},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CaiCH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CanettiI98,
author = {Ran Canetti and
Sandy Irani},
title = {Bounding the Power of Preemption in Randomized Scheduling},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {993--1015},
year = {1998},
url = {https://doi.org/10.1137/S0097539795283292},
doi = {10.1137/S0097539795283292},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CanettiI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chang98,
author = {Maw{-}Shang Chang},
title = {Efficient Algorithms for the Domination Problems on Interval and Circular-Arc
Graphs},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1671--1694},
year = {1998},
url = {https://doi.org/10.1137/S0097539792238431},
doi = {10.1137/S0097539792238431},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chang98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chazelle98,
author = {Bernard Chazelle},
title = {A Spectral Approach to Lower Bounds with Applications to Geometric
Searching},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {545--556},
year = {1998},
url = {https://doi.org/10.1137/S0097539794275665},
doi = {10.1137/S0097539794275665},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chazelle98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanKL98,
author = {Edward G. Coffman Jr. and
Nabil Kahal{\'{e}} and
Frank Thomson Leighton},
title = {Processor-Ring Communication: {A} Tight Asymptotic Bound on Packet
Waiting Times},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1221--1236},
year = {1998},
url = {https://doi.org/10.1137/S0097539794268637},
doi = {10.1137/S0097539794268637},
timestamp = {Wed, 31 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanKL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CondonHPW98,
author = {Anne Condon and
Lisa Hellerstein and
Samuel Pottle and
Avi Wigderson},
title = {On the Power of Finite Automata with Both Nondeterministic and Probabilistic
States},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {739--762},
year = {1998},
url = {https://doi.org/10.1137/S0097539794265578},
doi = {10.1137/S0097539794265578},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CondonHPW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CrochmoreGHMR98,
author = {Maxime Crochemore and
Leszek Gasieniec and
Ramesh Hariharan and
S. Muthukrishnan and
Wojciech Rytter},
title = {A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern
Matching},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {668--681},
year = {1998},
url = {https://doi.org/10.1137/S0097539795280068},
doi = {10.1137/S0097539795280068},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CrochmoreGHMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cusick98,
author = {Thomas W. Cusick},
title = {Value Sets of Some Polynomials Over Finite Fields GF(2\({}^{\mbox{2m}}\))},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {120--131},
year = {1998},
url = {https://doi.org/10.1137/S0097539794270352},
doi = {10.1137/S0097539794270352},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cusick98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dezani-CiancaglinidP98,
author = {Mariangiola Dezani{-}Ciancaglini and
Ugo de'Liguoro and
Adolfo Piperno},
title = {A Filter Model for Concurrent lambda-Calculus},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1376--1419},
year = {1998},
url = {https://doi.org/10.1137/S0097539794275860},
doi = {10.1137/S0097539794275860},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Dezani-CiancaglinidP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DudekRW98,
author = {Gregory Dudek and
Kathleen Romanik and
Sue Whitesides},
title = {Localizing a Robot with Minimum Travel},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {583--604},
year = {1998},
url = {https://doi.org/10.1137/S0097539794279201},
doi = {10.1137/S0097539794279201},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DudekRW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DworkHW98,
author = {Cynthia Dwork and
Joseph Y. Halpern and
Orli Waarts},
title = {Performing Work Efficiently in the Presence of Faults},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1457--1491},
year = {1998},
url = {https://doi.org/10.1137/S0097539793255527},
doi = {10.1137/S0097539793255527},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DworkHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerFJ98,
author = {Martin E. Dyer and
Alan M. Frieze and
Mark Jerrum},
title = {Approximately Counting Hamilton Paths and Cycles in Dense Graphs},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1262--1272},
year = {1998},
url = {https://doi.org/10.1137/S009753979426112X},
doi = {10.1137/S009753979426112X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerFJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGH98,
author = {Martin E. Dyer and
Peter Gritzmann and
Alexander Hufnagel},
title = {On the Complexity of Computing Mixed Volumes},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {356--400},
year = {1998},
url = {https://doi.org/10.1137/S0097539794278384},
doi = {10.1137/S0097539794278384},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerGH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Edmonds98,
author = {Jeff Edmonds},
title = {Time-Space Tradeoffs For Undirected \emph{st}-Connectivity on a Graph
Automata},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1492--1513},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277135},
doi = {10.1137/S0097539794277135},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Edmonds98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FerraginaG98,
author = {Paolo Ferragina and
Roberto Grossi},
title = {Optimal On-Line Search and Sublinear Time Update in String Matching},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {713--736},
year = {1998},
url = {https://doi.org/10.1137/S0097539795286119},
doi = {10.1137/S0097539795286119},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FerraginaG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GarayKP98,
author = {Juan A. Garay and
Shay Kutten and
David Peleg},
title = {A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning
Trees},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {302--316},
year = {1998},
url = {https://doi.org/10.1137/S0097539794261118},
doi = {10.1137/S0097539794261118},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GarayKP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GarayM98,
author = {Juan A. Garay and
Yoram Moses},
title = {Fully Polynomial Byzantine Agreement for \emph{n} {\textgreater} 3t
Processors in \emph{t} + 1 Rounds},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {247--290},
year = {1998},
url = {https://doi.org/10.1137/S0097539794265232},
doi = {10.1137/S0097539794265232},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GarayM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GilM98,
author = {Joseph Gil and
Yossi Matias},
title = {Simple Fast Parallel Hashing by Oblivious Execution},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1348--1375},
year = {1998},
url = {https://doi.org/10.1137/S0097539794291580},
doi = {10.1137/S0097539794291580},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GilM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gillman98,
author = {David Gillman},
title = {A Chernoff Bound for Random Walks on Expander Graphs},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1203--1220},
year = {1998},
url = {https://doi.org/10.1137/S0097539794268765},
doi = {10.1137/S0097539794268765},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Gillman98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJM98,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Philip D. MacKenzie},
title = {An Omega(sqrt\{log log n\}) Lower Bound for Routing in Optical Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1083--1098},
year = {1998},
url = {https://doi.org/10.1137/S0097539794272569},
doi = {10.1137/S0097539794272569},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldmannH98,
author = {Mikael Goldmann and
Johan H{\aa}stad},
title = {Monotone Circuits for Connectivity Have Depth (log \emph{n})\({}^{\mbox{2-\emph{o}(1)}}\)},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1283--1294},
year = {1998},
url = {https://doi.org/10.1137/S0097539795285631},
doi = {10.1137/S0097539795285631},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldmannH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldmannK98,
author = {Mikael Goldmann and
Marek Karpinski},
title = {Simulating Threshold Circuits by Majority Circuits},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {230--246},
year = {1998},
url = {https://doi.org/10.1137/S0097539794274519},
doi = {10.1137/S0097539794274519},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldmannK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichGL98,
author = {Oded Goldreich and
Shafi Goldwasser and
Nathan Linial},
title = {Fault-Tolerant Computation in the Full Information Model},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {506--544},
year = {1998},
url = {https://doi.org/10.1137/S0097539793246689},
doi = {10.1137/S0097539793246689},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldreichGL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldreichOP98,
author = {Oded Goldreich and
Rafail Ostrovsky and
Erez Petrank},
title = {Computational Complexity and Knowledge Complexity},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1116--1141},
year = {1998},
url = {https://doi.org/10.1137/S0097539795280524},
doi = {10.1137/S0097539795280524},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldreichOP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Goldwasser98,
author = {Shafi Goldwasser},
title = {Introduction to Special Section on Probabilistic Proof Systems},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {737--738},
year = {1998},
url = {https://doi.org/10.1137/SMJCAT000027000003000737000001},
doi = {10.1137/SMJCAT000027000003000737000001},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Goldwasser98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinRSS98,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1036--1072},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277718},
doi = {10.1137/S0097539794277718},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinRSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrigorievK98,
author = {Dima Grigoriev and
Marek Karpinski},
title = {Computing the Additive Complexity of Algebraic Circuits with Root
Extracting},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {694--701},
year = {1998},
url = {https://doi.org/10.1137/S0097539793258313},
doi = {10.1137/S0097539793258313},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GrigorievK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hastad98,
author = {Johan H{\aa}stad},
title = {The Shrinkage Exponent of de Morgan Formulas is 2},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {48--64},
year = {1998},
url = {https://doi.org/10.1137/S0097539794261556},
doi = {10.1137/S0097539794261556},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hastad98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HecklerT98,
author = {Christian Heckler and
Lothar Thiele},
title = {Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1295--1302},
year = {1998},
url = {https://doi.org/10.1137/S0097539795295626},
doi = {10.1137/S0097539795295626},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HecklerT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuntMRS98,
author = {Harry B. Hunt III and
Madhav V. Marathe and
Venkatesh Radhakrishnan and
Richard Edwin Stearns},
title = {The Complexity of Planar Counting Problems},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1142--1167},
year = {1998},
url = {https://doi.org/10.1137/S0097539793304601},
doi = {10.1137/S0097539793304601},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuntMRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanW98,
author = {Sampath Kannan and
Tandy J. Warnow},
title = {Computing the Local Consensus of Trees},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1695--1724},
year = {1998},
url = {https://doi.org/10.1137/S0097539795287642},
doi = {10.1137/S0097539795287642},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kao98,
author = {Ming{-}Yang Kao},
title = {Tree Contractions and Evolutionary Trees},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1592--1616},
year = {1998},
url = {https://doi.org/10.1137/S0097539795283504},
doi = {10.1137/S0097539795283504},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kao98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KloksK98,
author = {Ton Kloks and
Dieter Kratsch},
title = {Listing All Minimal Separators of a Graph},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {605--613},
year = {1998},
url = {https://doi.org/10.1137/S009753979427087X},
doi = {10.1137/S009753979427087X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KloksK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KortsarzP98,
author = {Guy Kortsarz and
David Peleg},
title = {Generating Low-Degree 2-Spanners},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1438--1456},
year = {1998},
url = {https://doi.org/10.1137/S0097539794268753},
doi = {10.1137/S0097539794268753},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KortsarzP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KrishnanV98,
author = {P. Krishnan and
Jeffrey Scott Vitter},
title = {Optimal Prediction for Prefetching in the Worst Case},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1617--1636},
year = {1998},
url = {https://doi.org/10.1137/S0097539794261817},
doi = {10.1137/S0097539794261817},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KrishnanV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KushilevitzM98,
author = {Eyal Kushilevitz and
Yishay Mansour},
title = {An Omega(\emph{D} log (\emph{N/D})) Lower Bound for Broadcast in Radio
Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {702--712},
year = {1998},
url = {https://doi.org/10.1137/S0097539794279109},
doi = {10.1137/S0097539794279109},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KushilevitzM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KushilevitzMRZ98,
author = {Eyal Kushilevitz and
Yishay Mansour and
Michael O. Rabin and
David Zuckerman},
title = {Lower Bounds for Randomized Mutual Exclusion},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1550--1563},
year = {1998},
url = {https://doi.org/10.1137/S009753979426513X},
doi = {10.1137/S009753979426513X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KushilevitzMRZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KushilevitzOR98,
author = {Eyal Kushilevitz and
Rafail Ostrovsky and
Adi Ros{\'{e}}n},
title = {Log-Space Polynomial End-to-End Communication},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1531--1549},
year = {1998},
url = {https://doi.org/10.1137/S0097539795296760},
doi = {10.1137/S0097539795296760},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KushilevitzOR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LaiW98,
author = {Tony W. Lai and
Derick Wood},
title = {Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1564--1591},
year = {1998},
url = {https://doi.org/10.1137/S0097539793250329},
doi = {10.1137/S0097539793250329},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LaiW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LandauMS98,
author = {Gad M. Landau and
Eugene W. Myers and
Jeanette P. Schmidt},
title = {Incremental String Comparison},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {557--582},
year = {1998},
url = {https://doi.org/10.1137/S0097539794264810},
doi = {10.1137/S0097539794264810},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LandauMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeightonMS98,
author = {Frank Thomson Leighton and
Bruce M. Maggs and
Ramesh K. Sitaraman},
title = {On the Fault Tolerance of Some Popular Bounded-Degree Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1303--1333},
year = {1998},
url = {https://doi.org/10.1137/S0097539793255163},
doi = {10.1137/S0097539793255163},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeightonMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeightonP98,
author = {Frank Thomson Leighton and
C. Greg Plaxton},
title = {Hypercubic Sorting Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {1--47},
year = {1998},
url = {https://doi.org/10.1137/S0097539794268406},
doi = {10.1137/S0097539794268406},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LeightonP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Leung98,
author = {Hing Leung},
title = {Separating Exponentially Ambiguous Finite Automata from Polynomially
Ambiguous Finite Automata},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1073--1082},
year = {1998},
url = {https://doi.org/10.1137/S0097539793252092},
doi = {10.1137/S0097539793252092},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Leung98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiS98,
author = {Rongheng Li and
Lijie Shi},
title = {An On-Line Algorithm for Some Uniform Processor Scheduling},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {414--422},
year = {1998},
url = {https://doi.org/10.1137/S0097539799527969},
doi = {10.1137/S0097539799527969},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Macarie98,
author = {Ioan I. Macarie},
title = {Space-Efficient Deterministic Simulation of Probabilistic Automata},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {448--465},
year = {1998},
url = {https://doi.org/10.1137/S0097539793253851},
doi = {10.1137/S0097539793253851},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Macarie98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MaratheHSR98,
author = {Madhav V. Marathe and
Harry B. Hunt III and
Richard Edwin Stearns and
Venkatesh Radhakrishnan},
title = {Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically
Specified Problems},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1237--1261},
year = {1998},
url = {https://doi.org/10.1137/S0097539795285254},
doi = {10.1137/S0097539795285254},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MaratheHSR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorW98,
author = {Moni Naor and
Avishai Wool},
title = {The Load, Capacity, and Availability of Quorum Systems},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {423--447},
year = {1998},
url = {https://doi.org/10.1137/S0097539795281232},
doi = {10.1137/S0097539795281232},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NaorW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ogihara98,
author = {Mitsunori Ogihara},
title = {The {PL} Hierarchy Collapses},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1430--1437},
year = {1998},
url = {https://doi.org/10.1137/S0097539795295924},
doi = {10.1137/S0097539795295924},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Ogihara98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ParedaensBG98,
author = {Jan Paredaens and
Jan Van den Bussche and
Dirk Van Gucht},
title = {First-Order Queries on Finite Structures Over the Reals},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1747--1763},
year = {1998},
url = {https://doi.org/10.1137/S009753979629766},
doi = {10.1137/S009753979629766},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ParedaensBG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Raz98,
author = {Ran Raz},
title = {A Parallel Repetition Theorem},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {763--803},
year = {1998},
url = {https://doi.org/10.1137/S0097539795280895},
doi = {10.1137/S0097539795280895},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Raz98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Schmidt98,
author = {Jeanette P. Schmidt},
title = {All Highest Scoring Paths in Weighted Grid Graphs and Their Application
to Finding All Approximate Repeats in Strings},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {972--992},
year = {1998},
url = {https://doi.org/10.1137/S0097539795288489},
doi = {10.1137/S0097539795288489},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Schmidt98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShallcrossPL98,
author = {David Shallcross and
Victor Y. Pan and
Yu Lin{-}Kriz},
title = {Planar Integer Linear Programming is {NC} Equivalent to Euclidean
{GCD}},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {960--971},
year = {1998},
url = {https://doi.org/10.1137/S0097539794276841},
doi = {10.1137/S0097539794276841},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShallcrossPL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Tamaki98,
author = {Hisao Tamaki},
title = {Efficient Self-Embedding of Butterfly Networks with Random Faults},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {614--636},
year = {1998},
url = {https://doi.org/10.1137/S0097539794270364},
doi = {10.1137/S0097539794270364},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Tamaki98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-06 03:34 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:
