Search dblp for Publications

export results for "toc:db/journals/jal/jal51.bht:"

 download as .bib file

@article{DBLP:journals/jal/BadgerKLTJ04,
  author       = {Jonathan H. Badger and
                  Paul E. Kearney and
                  Ming Li and
                  John Tsang and
                  Tao Jiang},
  title        = {Selecting the branches for an evolutionary tree.: {A} polynomial time
                  approximation scheme},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {1},
  pages        = {1--14},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0196-6774(03)00086-5},
  doi          = {10.1016/S0196-6774(03)00086-5},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BadgerKLTJ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Bar-NoyM04,
  author       = {Amotz Bar{-}Noy and
                  Grzegorz Malewicz},
  title        = {Establishing wireless conference calls under delay constraints},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {2},
  pages        = {145--169},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.11.003},
  doi          = {10.1016/J.JALGOR.2003.11.003},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Bar-NoyM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Charron-BostS04,
  author       = {Bernadette Charron{-}Bost and
                  Andr{\'{e}} Schiper},
  title        = {Uniform consensus is harder than consensus},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {1},
  pages        = {15--37},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.11.001},
  doi          = {10.1016/J.JALGOR.2003.11.001},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Charron-BostS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DiksFKP04,
  author       = {Krzysztof Diks and
                  Pierre Fraigniaud and
                  Evangelos Kranakis and
                  Andrzej Pelc},
  title        = {Tree exploration with little memory},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {1},
  pages        = {38--63},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.10.002},
  doi          = {10.1016/J.JALGOR.2003.10.002},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/DiksFKP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Georgakopoulos04,
  author       = {George F. Georgakopoulos},
  title        = {Splay trees: a reweighing lemma and a proof of competitiveness vs.
                  dynamic balanced trees},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {1},
  pages        = {64--76},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.09.004},
  doi          = {10.1016/J.JALGOR.2003.09.004},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Georgakopoulos04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Liberatore04,
  author       = {Vincenzo Liberatore},
  title        = {Circular arrangements and cyclic broadcast scheduling},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {2},
  pages        = {185--215},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.10.003},
  doi          = {10.1016/J.JALGOR.2003.10.003},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/Liberatore04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/NikolopoulosP04,
  author       = {Stavros D. Nikolopoulos and
                  Leonidas Palios},
  title        = {Parallel algorithms for P\({}_{\mbox{4}}\)-comparability graphs},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {1},
  pages        = {77--104},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.11.005},
  doi          = {10.1016/J.JALGOR.2003.11.005},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/NikolopoulosP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/PaghR04,
  author       = {Rasmus Pagh and
                  Flemming Friche Rodler},
  title        = {Cuckoo hashing},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {2},
  pages        = {122--144},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2003.12.002},
  doi          = {10.1016/J.JALGOR.2003.12.002},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/PaghR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/PanholzerPR04,
  author       = {Alois Panholzer and
                  Helmut Prodinger and
                  Marko Riedel},
  title        = {Permuting in place: analysis of two stopping rules},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {2},
  pages        = {170--184},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2004.01.003},
  doi          = {10.1016/J.JALGOR.2004.01.003},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PanholzerPR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Wahlstrom04,
  author       = {Magnus Wahlstr{\"{o}}m},
  title        = {Exact algorithms for finding minimum transversals in rank-3 hypergraphs},
  journal      = {J. Algorithms},
  volume       = {51},
  number       = {2},
  pages        = {107--121},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jalgor.2004.01.001},
  doi          = {10.1016/J.JALGOR.2004.01.001},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Wahlstrom04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.