Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jal/BlackburnGGS06,
  author       = {Simon R. Blackburn and
                  Domingo G{\'{o}}mez{-}P{\'{e}}rez and
                  Jaime Gutierrez and
                  Igor E. Shparlinski},
  title        = {Reconstructing noisy polynomial evaluation in residue rings},
  journal      = {J. Algorithms},
  volume       = {61},
  number       = {2},
  pages        = {47--59},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.002},
  doi          = {10.1016/J.JALGOR.2004.07.002},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/BlackburnGGS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ChepoiDV06,
  author       = {Victor Chepoi and
                  Feodor F. Dragan and
                  Yann Vax{\`{e}}s},
  title        = {Distance and routing labeling schemes for non-positively curved plane
                  graphs},
  journal      = {J. Algorithms},
  volume       = {61},
  number       = {2},
  pages        = {60--88},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.011},
  doi          = {10.1016/J.JALGOR.2004.07.011},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ChepoiDV06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Coja-OghlanKN06,
  author       = {Amin Coja{-}Oghlan and
                  Sven Oliver Krumke and
                  Till Nierhoff},
  title        = {A heuristic for the Stacker Crane Problem on trees which is almost
                  surely exact},
  journal      = {J. Algorithms},
  volume       = {61},
  number       = {1},
  pages        = {1--19},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.007},
  doi          = {10.1016/J.JALGOR.2004.07.007},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Coja-OghlanKN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/KolmanS06,
  author       = {Petr Kolman and
                  Christian Scheideler},
  title        = {Improved bounds for the unsplittable flow problem},
  journal      = {J. Algorithms},
  volume       = {61},
  number       = {1},
  pages        = {20--44},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.006},
  doi          = {10.1016/J.JALGOR.2004.07.006},
  timestamp    = {Sat, 16 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/KolmanS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}