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/siamcomp34.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/AgarwalS05,
author = {Pankaj K. Agarwal and
Micha Sharir},
title = {Pseudo-Line Arrangements: Duality, Algorithms, and Applications},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {526--552},
year = {2005},
url = {https://doi.org/10.1137/S0097539703433900},
doi = {10.1137/S0097539703433900},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgarwalS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalCGKES05,
author = {Gagan Aggarwal and
Qi Cheng and
Michael H. Goldwasser and
Ming{-}Yang Kao and
Pablo Moisset de Espan{\'{e}}s and
Robert T. Schweller},
title = {Complexities for Generalized Models of Self-Assembly},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1493--1515},
year = {2005},
url = {https://doi.org/10.1137/S0097539704445202},
doi = {10.1137/S0097539704445202},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalCGKES05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnagnostopoulosKU05,
author = {Aris Anagnostopoulos and
Adam Kirsch and
Eli Upfal},
title = {Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial
Input},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {616--639},
year = {2005},
url = {https://doi.org/10.1137/S0097539703437831},
doi = {10.1137/S0097539703437831},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnagnostopoulosKU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeimelW05,
author = {Amos Beimel and
Enav Weinreb},
title = {Separating the Power of Monotone Span Programs over Different Fields},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1196--1215},
year = {2005},
url = {https://doi.org/10.1137/S0097539704444038},
doi = {10.1137/S0097539704444038},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BeimelW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlondelJKP05,
author = {Vincent D. Blondel and
Emmanuel Jeandel and
Pascal Koiran and
Natacha Portier},
title = {Decidable and Undecidable Problems about Quantum Automata},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1464--1473},
year = {2005},
url = {https://doi.org/10.1137/S0097539703425861},
doi = {10.1137/S0097539703425861},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlondelJKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonisGV05,
author = {Annalisa De Bonis and
Leszek Gasieniec and
Ugo Vaccaro},
title = {Optimal Two-Stage Algorithms for Group Testing Problems},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1253--1270},
year = {2005},
url = {https://doi.org/10.1137/S0097539703428002},
doi = {10.1137/S0097539703428002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonisGV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanD05,
author = {Harry Buhrman and
Christoph D{\"{u}}rr and
Mark Heiligman and
Peter H{\o}yer and
Fr{\'{e}}d{\'{e}}ric Magniez and
Miklos Santha and
Ronald de Wolf},
title = {Quantum Algorithms for Element Distinctness},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1324--1330},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402780},
doi = {10.1137/S0097539702402780},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BulatovJK05,
author = {Andrei A. Bulatov and
Peter Jeavons and
Andrei A. Krokhin},
title = {Classifying the Complexity of Constraints Using Finite Algebras},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {720--742},
year = {2005},
url = {https://doi.org/10.1137/S0097539700376676},
doi = {10.1137/S0097539700376676},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BulatovJK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cesa-BianchiCG05,
author = {Nicol{\`{o}} Cesa{-}Bianchi and
Alex Conconi and
Claudio Gentile},
title = {A Second-Order Perceptron Algorithm},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {640--668},
year = {2005},
url = {https://doi.org/10.1137/S0097539703432542},
doi = {10.1137/S0097539703432542},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cesa-BianchiCG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Chan05,
author = {Timothy M. Chan},
title = {Low-Dimensional Linear Programming with Violations},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {879--893},
year = {2005},
url = {https://doi.org/10.1137/S0097539703439404},
doi = {10.1137/S0097539703439404},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Chan05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChanLT05,
author = {Ho{-}Leung Chan and
Tak Wah Lam and
Kar{-}Keung To},
title = {Nonmigratory Online Deadline Scheduling on Multiprocessors},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {669--682},
year = {2005},
url = {https://doi.org/10.1137/S0097539703435765},
doi = {10.1137/S0097539703435765},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChanLT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarG05,
author = {Moses Charikar and
Sudipto Guha},
title = {Improved Combinatorial Algorithms for Facility Location Problems},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {803--824},
year = {2005},
url = {https://doi.org/10.1137/S0097539701398594},
doi = {10.1137/S0097539701398594},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CharikarG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChazelleRT05,
author = {Bernard Chazelle and
Ronitt Rubinfeld and
Luca Trevisan},
title = {Approximating the Minimum Spanning Tree Weight in Sublinear Time},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1370--1379},
year = {2005},
url = {https://doi.org/10.1137/S0097539702403244},
doi = {10.1137/S0097539702403244},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChazelleRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cheng05,
author = {Qi Cheng},
title = {On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite
Fields},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1432--1442},
year = {2005},
url = {https://doi.org/10.1137/S0097539704446037},
doi = {10.1137/S0097539704446037},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cheng05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChiangLL05,
author = {Yi{-}Ting Chiang and
Ching{-}Chi Lin and
Hsueh{-}I Lu},
title = {Orderly Spanning Trees with Applications},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {924--945},
year = {2005},
url = {https://doi.org/10.1137/S0097539702411381},
doi = {10.1137/S0097539702411381},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChiangLL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenP05,
author = {Reuven Cohen and
David Peleg},
title = {Convergence Properties of the Gravitational Algorithm in Asynchronous
Robot Systems},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1516--1528},
year = {2005},
url = {https://doi.org/10.1137/S0097539704446475},
doi = {10.1137/S0097539704446475},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CohenP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH05,
author = {Richard Cole and
Ramesh Hariharan},
title = {Dynamic {LCA} Queries on Trees},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {894--923},
year = {2005},
url = {https://doi.org/10.1137/S0097539700370539},
doi = {10.1137/S0097539700370539},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CorneilR05,
author = {Derek G. Corneil and
Udi Rotics},
title = {On the Relationship Between Clique-Width and Treewidth},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {825--847},
year = {2005},
url = {https://doi.org/10.1137/S0097539701385351},
doi = {10.1137/S0097539701385351},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CorneilR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CzumajS05,
author = {Artur Czumaj and
Christian Sohler},
title = {Abstract Combinatorial Programs and Efficient Property Testers},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {580--615},
year = {2005},
url = {https://doi.org/10.1137/S009753970444199X},
doi = {10.1137/S009753970444199X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CzumajS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurGKR05,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot and
Oded Regev},
title = {A New Multilayered {PCP} and the Hardness of Hypergraph Vertex Cover},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1129--1146},
year = {2005},
url = {https://doi.org/10.1137/S0097539704443057},
doi = {10.1137/S0097539704443057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinurGKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DujmovicMW05,
author = {Vida Dujmovic and
Pat Morin and
David R. Wood},
title = {Layout of Graphs with Bounded Tree-Width},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {553--579},
year = {2005},
url = {https://doi.org/10.1137/S0097539702416141},
doi = {10.1137/S0097539702416141},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DujmovicMW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Efrat05,
author = {Alon Efrat},
title = {The Complexity of the Union of (alpha, beta)-Covered Objects},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {775--787},
year = {2005},
url = {https://doi.org/10.1137/S0097539702407515},
doi = {10.1137/S0097539702407515},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Efrat05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ErlebachJS05,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
title = {Polynomial-Time Approximation Schemes for Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1302--1323},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402676},
doi = {10.1137/S0097539702402676},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ErlebachJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiWS05,
author = {Kousha Etessami and
Thomas Wilke and
Rebecca A. Schuller},
title = {Fair Simulation Relations, Parity Games, and State Space Reduction
for Bu"chi Automata},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1159--1175},
year = {2005},
url = {https://doi.org/10.1137/S0097539703420675},
doi = {10.1137/S0097539703420675},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtessamiWS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EzraS05,
author = {Esther Ezra and
Micha Sharir},
title = {Output-Sensitive Construction of the Union of Triangles},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1331--1351},
year = {2005},
url = {https://doi.org/10.1137/S0097539704444245},
doi = {10.1137/S0097539704444245},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EzraS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FatourouMS05,
author = {Panagiota Fatourou and
Marios Mavronicolas and
Paul G. Spirakis},
title = {Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic,
Rate-based Flow Control},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1216--1252},
year = {2005},
url = {https://doi.org/10.1137/S009753970343275X},
doi = {10.1137/S009753970343275X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FatourouMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fischer05,
author = {Eldar Fischer},
title = {The Difficulty of Testing for Isomorphism against a Graph That Is
Given in Advance},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1147--1158},
year = {2005},
url = {https://doi.org/10.1137/S009753970445603},
doi = {10.1137/S009753970445603},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fischer05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalR05,
author = {Anna G{\'{a}}l and
Adi Ros{\'{e}}n},
title = {Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private
Computation},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {946--959},
year = {2005},
url = {https://doi.org/10.1137/S0097539703432785},
doi = {10.1137/S0097539703432785},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GeorgiouRS05,
author = {Chryssis Georgiou and
Alexander Russell and
Alexander A. Shvartsman},
title = {Work-Competitive Scheduling for Cooperative Computing with Dynamic
Groups},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {848--862},
year = {2005},
url = {https://doi.org/10.1137/S0097539704440442},
doi = {10.1137/S0097539704440442},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GeorgiouRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HemaspaandraHH05,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
title = {Extending Downward Collapse from 1-versus-2 Queries to m-versus-m
+ 1 Queries},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1352--1369},
year = {2005},
url = {https://doi.org/10.1137/S0097539701391002},
doi = {10.1137/S0097539701391002},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HemaspaandraHH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HershbergerST05,
author = {John Hershberger and
Subhash Suri and
Csaba D. T{\'{o}}th},
title = {Binary Space Partitions of Orthogonal Subdivisions},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1380--1397},
year = {2005},
url = {https://doi.org/10.1137/S0097539704445706},
doi = {10.1137/S0097539704445706},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HershbergerST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HuoL05,
author = {Yumei Huo and
Joseph Y.{-}T. Leung},
title = {Online Scheduling of Precedence Constrained Tasks},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {743--762},
year = {2005},
url = {https://doi.org/10.1137/S0097539704444440},
doi = {10.1137/S0097539704444440},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HuoL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HutchinsonSV05,
author = {David A. Hutchinson and
Peter Sanders and
Jeffrey Scott Vitter},
title = {Duality Between Prefetching and Queued Writing with Parallel Disks},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1443--1463},
year = {2005},
url = {https://doi.org/10.1137/S0097539703431573},
doi = {10.1137/S0097539703431573},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HutchinsonSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HwangHW05,
author = {Frank Kwang{-}Ming Hwang and
Yong He and
Yang Wang},
title = {Strictly Nonblocking Multirate log\({}_{\mbox{d}}\)(\emph{N, m, p})
Networks},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1271--1278},
year = {2005},
url = {https://doi.org/10.1137/S0097539703433158},
doi = {10.1137/S0097539703433158},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HwangHW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JacksonS05,
author = {Jeffrey C. Jackson and
Rocco A. Servedio},
title = {Learning Random Log-Depth Decision Trees under Uniform Distribution},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1107--1128},
year = {2005},
url = {https://doi.org/10.1137/S0097539704444555},
doi = {10.1137/S0097539704444555},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JacksonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KalyanasundaramP05,
author = {Bala Kalyanasundaram and
Kirk Pruhs},
title = {Fault-Tolerant Scheduling},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {697--719},
year = {2005},
url = {https://doi.org/10.1137/S0097539794261799},
doi = {10.1137/S0097539794261799},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KalyanasundaramP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kaminski05,
author = {Michael Kaminski},
title = {A Lower Bound on the Complexity of Polynomial Multiplication over
Finite Fields},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {960--992},
year = {2005},
url = {https://doi.org/10.1137/S0097539704442118},
doi = {10.1137/S0097539704442118},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kaminski05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoltunS05,
author = {Vladlen Koltun and
Micha Sharir},
title = {Curve-Sensitive Cuttings},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {863--878},
year = {2005},
url = {https://doi.org/10.1137/S0097539703435686},
doi = {10.1137/S0097539703435686},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KoltunS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannR05,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
title = {Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform
Degree Bounds},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {763--773},
year = {2005},
url = {https://doi.org/10.1137/S0097539702418048},
doi = {10.1137/S0097539702418048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KonemannR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Malewicz05,
author = {Grzegorz Malewicz},
title = {A Work-Optimal Deterministic Algorithm for the Certified Write-All
Problem with a Nontrivial Number of Asynchronous Processors},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {993--1024},
year = {2005},
url = {https://doi.org/10.1137/S0097539703428014},
doi = {10.1137/S0097539703428014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Malewicz05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McCannP05,
author = {Mark McCann and
Nicholas Pippenger},
title = {{SRT} Division Algorithms as Dynamical Systems},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1279--1301},
year = {2005},
url = {https://doi.org/10.1137/S009753970444106X},
doi = {10.1137/S009753970444106X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/McCannP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NickelsenT05,
author = {Arfst Nickelsen and
Till Tantau},
title = {The Complexity of Finding Paths in Graphs with Bounded Independence
Number},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1176--1195},
year = {2005},
url = {https://doi.org/10.1137/S0097539704441642},
doi = {10.1137/S0097539704441642},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NickelsenT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PettieR05,
author = {Seth Pettie and
Vijaya Ramachandran},
title = {A Shortest Path Algorithm for Real-Weighted Undirected Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1398--1431},
year = {2005},
url = {https://doi.org/10.1137/S0097539702419650},
doi = {10.1137/S0097539702419650},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PettieR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SeidelS05,
author = {Raimund Seidel and
Micha Sharir},
title = {Top-Down Analysis of Path Compression},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {515--525},
year = {2005},
url = {https://doi.org/10.1137/S0097539703439088},
doi = {10.1137/S0097539703439088},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SeidelS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Senizergues05,
author = {G{\'{e}}raud S{\'{e}}nizergues},
title = {The Bisimulation Problem for Equational Graphs of Finite Out-Degree},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1025--1106},
year = {2005},
url = {https://doi.org/10.1137/S0097539700377256},
doi = {10.1137/S0097539700377256},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Senizergues05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShiJ05,
author = {Qingmin Shi and
Joseph F. J{\'{a}}J{\'{a}}},
title = {Novel Transformation Techniques Using Q-Heaps with Applications to
Computational Geometry},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1474--1492},
year = {2005},
url = {https://doi.org/10.1137/S0097539703435728},
doi = {10.1137/S0097539703435728},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShiJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SkutellaU05,
author = {Martin Skutella and
Marc Uetz},
title = {Stochastic Machine Scheduling with Precedence Constraints},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {788--802},
year = {2005},
url = {https://doi.org/10.1137/S0097539702415007},
doi = {10.1137/S0097539702415007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SkutellaU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ZhangH05,
author = {Huaming Zhang and
Xin He},
title = {On Even Triangulations of 2-Connected Embedded Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {683--696},
year = {2005},
url = {https://doi.org/10.1137/S0097539702408247},
doi = {10.1137/S0097539702408247},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ZhangH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AkcogluDK04,
author = {Karhan Akcoglu and
Petros Drineas and
Ming{-}Yang Kao},
title = {Fast Universalization of Investment Strategies},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {1--22},
year = {2004},
url = {https://doi.org/10.1137/S0097539702405619},
doi = {10.1137/S0097539702405619},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AkcogluDK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlekhnovichBRW04,
author = {Michael Alekhnovich and
Eli Ben{-}Sasson and
Alexander A. Razborov and
Avi Wigderson},
title = {Pseudorandom Generators in Propositional Proof Complexity},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {67--88},
year = {2004},
url = {https://doi.org/10.1137/S0097539701389944},
doi = {10.1137/S0097539701389944},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlekhnovichBRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlvarezBS04,
author = {Carme {\`{A}}lvarez and
Maria J. Blesa and
Maria J. Serna},
title = {A Characterization of Universal Stability in the Adversarial Queuing
Model},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {41--66},
year = {2004},
url = {https://doi.org/10.1137/S0097539703435522},
doi = {10.1137/S0097539703435522},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlvarezBS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartalM04,
author = {Yair Bartal and
Manor Mendel},
title = {Multiembedding of Metric Spaces},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {248--259},
year = {2004},
url = {https://doi.org/10.1137/S0097539703433122},
doi = {10.1137/S0097539703433122},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BartalM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharjeeGL04,
author = {Rajat Bhattacharjee and
Ashish Goel and
Zvi Lotker},
title = {Instability of {FIFO} at Arbitrarily Low Rates in the Adversarial
Queueing Model},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {318--332},
year = {2004},
url = {https://doi.org/10.1137/S0097539703426805},
doi = {10.1137/S0097539703426805},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharjeeGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Blaser04,
author = {Markus Bl{\"{a}}ser},
title = {A Complete Characterization of the Algebras of Minimal Bilinear Complexity},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {277--298},
year = {2004},
url = {https://doi.org/10.1137/S0097539703438277},
doi = {10.1137/S0097539703438277},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Blaser04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Buresh-OppenheimBPRS04,
author = {Joshua Buresh{-}Oppenheim and
Paul Beame and
Toniann Pitassi and
Ran Raz and
Ashish Sabharwal},
title = {Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {261--276},
year = {2004},
url = {https://doi.org/10.1137/S0097539703433146},
doi = {10.1137/S0097539703433146},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Buresh-OppenheimBPRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuKR04,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
title = {Approximation Algorithms for the 0-Extension Problem},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {358--372},
year = {2004},
url = {https://doi.org/10.1137/S0097539701395978},
doi = {10.1137/S0097539701395978},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CalinescuKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandraHJT04,
author = {Tushar Deepak Chandra and
Vassos Hadzilacos and
Prasad Jayanti and
Sam Toueg},
title = {Generalized Irreducibility of Consensus and the Equivalence of t-Resilient
and Wait-Free Implementations of Consensus},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {333--357},
year = {2004},
url = {https://doi.org/10.1137/S0097539798344367},
doi = {10.1137/S0097539798344367},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChandraHJT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChungL04,
author = {Kai{-}Min Chung and
Hsueh{-}I Lu},
title = {An Optimal Algorithm for the Maximum-Density Segment Problem},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {373--387},
year = {2004},
url = {https://doi.org/10.1137/S0097539704440430},
doi = {10.1137/S0097539704440430},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChungL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenK04,
author = {Edith Cohen and
Haim Kaplan},
title = {Balanced-Replication Algorithms for Distribution Trees},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {227--247},
year = {2004},
url = {https://doi.org/10.1137/S0097539702412143},
doi = {10.1137/S0097539702412143},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CohenK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Doerr04,
author = {Benjamin Doerr},
title = {Nonindependent Randomized Rounding and an Application to Digital Halftoning},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {299--317},
year = {2004},
url = {https://doi.org/10.1137/S0097539703430154},
doi = {10.1137/S0097539703430154},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Doerr04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaKR04,
author = {Anupam Gupta and
Amit Kumar and
Rajeev Rastogi},
title = {Traveling with a Pez Dispenser (or, Routing Issues in {MPLS)}},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {453--474},
year = {2004},
url = {https://doi.org/10.1137/S0097539702409927},
doi = {10.1137/S0097539702409927},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuptaKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hitchcock04,
author = {John M. Hitchcock},
title = {Small Spans in Scaled Dimension},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {170--194},
year = {2004},
url = {https://doi.org/10.1137/S0097539703426416},
doi = {10.1137/S0097539703426416},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hitchcock04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HougardyW04,
author = {Stefan Hougardy and
Annegret Wagler},
title = {Perfectness is an Elusive Graph Property},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {109--117},
year = {2004},
url = {https://doi.org/10.1137/S0097539703426799},
doi = {10.1137/S0097539703426799},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HougardyW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IshiharaISI04,
author = {Yasunori Ishihara and
Shin Ishii and
Hiroyuki Seki and
Minoru Ito},
title = {Temporal Reasoning about Two Concurrent Sequences of Events},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {498--513},
year = {2004},
url = {https://doi.org/10.1137/S0097539799362172},
doi = {10.1137/S0097539799362172},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/IshiharaISI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IvanssonL04,
author = {Lars Ivansson and
Jens Lagergren},
title = {Algorithms for {RH} Mapping: New Ideas and Improved Analysis},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {89--108},
year = {2004},
url = {https://doi.org/10.1137/S0097539701388355},
doi = {10.1137/S0097539701388355},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IvanssonL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaibelMSZ04,
author = {Volker Kaibel and
Rafael Mechtel and
Micha Sharir and
G{\"{u}}nter M. Ziegler},
title = {The Simplex Algorithm in Dimension Three},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {475--497},
year = {2004},
url = {https://doi.org/10.1137/S0097539703434978},
doi = {10.1137/S0097539703434978},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaibelMSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KatzKKP04,
author = {Michal Katz and
Nir A. Katz and
Amos Korman and
David Peleg},
title = {Labeling Schemes for Flow and Connectivity},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {23--40},
year = {2004},
url = {https://doi.org/10.1137/S0097539703433912},
doi = {10.1137/S0097539703433912},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KatzKKP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Micciancio04,
author = {Daniele Micciancio},
title = {Almost Perfect Lattices, the Covering Radius Problem, and Applications
to Ajtai's Connection Factor},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {118--169},
year = {2004},
url = {https://doi.org/10.1137/S0097539703433511},
doi = {10.1137/S0097539703433511},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Micciancio04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MorrisS04,
author = {Ben Morris and
Alistair Sinclair},
title = {Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {1},
pages = {195--226},
year = {2004},
url = {https://doi.org/10.1137/S0097539702411915},
doi = {10.1137/S0097539702411915},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MorrisS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MuthukrishnanRSG04,
author = {S. Muthukrishnan and
Rajmohan Rajaraman and
Anthony Shaheen and
Johannes Gehrke},
title = {Online Scheduling to Minimize Average Stretch},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {433--452},
year = {2004},
url = {https://doi.org/10.1137/S0097539701387544},
doi = {10.1137/S0097539701387544},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MuthukrishnanRSG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RaoR04,
author = {Satish Rao and
Andr{\'{e}}a W. Richa},
title = {New Approximation Techniques for Some Linear Ordering Problems},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {388--404},
year = {2004},
url = {https://doi.org/10.1137/S0097539702413197},
doi = {10.1137/S0097539702413197},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RaoR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Thorup04,
author = {Mikkel Thorup},
title = {Quick k-Median, k-Center, and Facility Location for Sparse Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {405--432},
year = {2004},
url = {https://doi.org/10.1137/S0097539701388884},
doi = {10.1137/S0097539701388884},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Thorup04.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-08 21:51 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:
