![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/jal/jal39.bht:"
@article{DBLP:journals/jal/AnderssonEH01, author = {Gunnar Andersson and Lars Engebretsen and Johan H{\aa}stad}, title = {A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p}, journal = {J. Algorithms}, volume = {39}, number = {2}, pages = {162--204}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1154}, doi = {10.1006/JAGM.2000.1154}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/AnderssonEH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Bar-Yehuda01, author = {Reuven Bar{-}Yehuda}, title = {Using Homogeneous Weights for Approximating the Partial Cover Problem}, journal = {J. Algorithms}, volume = {39}, number = {2}, pages = {137--144}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1150}, doi = {10.1006/JAGM.2000.1150}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Bar-Yehuda01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/ChandraH01a, author = {Barun Chandra and Magn{\'{u}}s M. Halld{\'{o}}rsson}, title = {Greedy Local Improvement and Weighted Set Packing Approximation}, journal = {J. Algorithms}, volume = {39}, number = {2}, pages = {223--240}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1155}, doi = {10.1006/JAGM.2000.1155}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/ChandraH01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/CooperDF01, author = {Colin Cooper and Martin E. Dyer and Alan M. Frieze}, title = {On Markov Chains for Randomly H-Coloring a Graph}, journal = {J. Algorithms}, volume = {39}, number = {1}, pages = {117--134}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1142}, doi = {10.1006/JAGM.2000.1142}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/CooperDF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/DiazPPS01, author = {Josep D{\'{\i}}az and Mathew D. Penrose and Jordi Petit and Maria J. Serna}, title = {Approximating Layout Problems on Random Geometric Graphs}, journal = {J. Algorithms}, volume = {39}, number = {1}, pages = {78--116}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1149}, doi = {10.1006/JAGM.2000.1149}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/DiazPPS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/HalperinZ01, author = {Shay Halperin and Uri Zwick}, title = {Optimal Randomized {EREW} {PRAM} Algorithms for Finding Spanning Forests}, journal = {J. Algorithms}, volume = {39}, number = {1}, pages = {1--46}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1146}, doi = {10.1006/JAGM.2000.1146}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/HalperinZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/IwamaM01, author = {Kazuo Iwama and Eiji Miyano}, title = {A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes}, journal = {J. Algorithms}, volume = {39}, number = {2}, pages = {145--161}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1152}, doi = {10.1006/JAGM.2000.1152}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/IwamaM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KranakisKP01, author = {Evangelos Kranakis and Danny Krizanc and Andrzej Pelc}, title = {Fault-Tolerant Broadcasting in Radio Networks}, journal = {J. Algorithms}, volume = {39}, number = {1}, pages = {47--67}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1147}, doi = {10.1006/JAGM.2000.1147}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/KranakisKP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/MunroRR01, author = {J. Ian Munro and Venkatesh Raman and S. Srinivasa Rao}, title = {Space Efficient Suffix Trees}, journal = {J. Algorithms}, volume = {39}, number = {2}, pages = {205--222}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1151}, doi = {10.1006/JAGM.2000.1151}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/MunroRR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/Yeh01, author = {Wei{-}Chang Yeh}, title = {A Simple Algorithm for the Planar Multiway Cut Problem}, journal = {J. Algorithms}, volume = {39}, number = {1}, pages = {68--77}, year = {2001}, url = {https://doi.org/10.1006/jagm.2000.1148}, doi = {10.1006/JAGM.2000.1148}, timestamp = {Fri, 28 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/Yeh01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.