Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jal/BaschGH99,
  author       = {Julien Basch and
                  Leonidas J. Guibas and
                  John Hershberger},
  title        = {Data Structures for Mobile Data},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {1--28},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0988},
  doi          = {10.1006/JAGM.1998.0988},
  timestamp    = {Sat, 08 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BaschGH99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BazganST99,
  author       = {Cristina Bazgan and
                  Miklos Santha and
                  Zsolt Tuza},
  title        = {On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic
                  Hamiltonian Graphs},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {249--268},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0998},
  doi          = {10.1006/JAGM.1998.0998},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BazganST99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BenderC99,
  author       = {Edward A. Bender and
                  E. Rodney Canfield},
  title        = {An Approximate Probabilistic Model for Structured Gaussian Elimination},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {271--290},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1999.1008},
  doi          = {10.1006/JAGM.1999.1008},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BenderC99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FaigleKN99,
  author       = {Ulrich Faigle and
                  Walter Kern and
                  Willem M. Nawijn},
  title        = {A Greedy On-Line Algorithm for thek-Track Assignment Problem},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {196--210},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.1001},
  doi          = {10.1006/JAGM.1998.1001},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FaigleKN99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FerraginaG99,
  author       = {Paolo Ferragina and
                  Roberto Grossi},
  title        = {Improved Dynamic Text Indexing},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {291--319},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0999},
  doi          = {10.1006/JAGM.1998.0999},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/FerraginaG99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Fujito99,
  author       = {Toshihiro Fujito},
  title        = {Approximating Node-Deletion Problems for Matroidal Properties},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {211--227},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0995},
  doi          = {10.1006/JAGM.1998.0995},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Fujito99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GuhaK99,
  author       = {Sudipto Guha and
                  Samir Khuller},
  title        = {Greedy Strikes Back: Improved Facility Location Algorithms},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {228--248},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0993},
  doi          = {10.1006/JAGM.1998.0993},
  timestamp    = {Sat, 08 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GuhaK99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HeideV99,
  author       = {Friedhelm Meyer auf der Heide and
                  Berthold V{\"{o}}cking},
  title        = {Shortest-Path Routing in Arbitrary Networks},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {105--131},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0980},
  doi          = {10.1006/JAGM.1998.0980},
  timestamp    = {Mon, 09 Dec 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/HeideV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KantorLM99,
  author       = {William M. Kantor and
                  Eugene M. Luks and
                  Peter D. Mark},
  title        = {Sylow Subgroups in Parallel},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {132--195},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1999.0982},
  doi          = {10.1006/JAGM.1999.0982},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/KantorLM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LaMarcaL99,
  author       = {Anthony LaMarca and
                  Richard E. Ladner},
  title        = {The Influence of Caches on the Performance of Sorting},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {66--104},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0985},
  doi          = {10.1006/JAGM.1998.0985},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/LaMarcaL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MahajanR99,
  author       = {Meena Mahajan and
                  Venkatesh Raman},
  title        = {Parameterizing above Guaranteed Values: MaxSat and MaxCut},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {335--354},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0996},
  doi          = {10.1006/JAGM.1998.0996},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MahajanR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MillerTT99,
  author       = {Gary L. Miller and
                  Dafna Talmor and
                  Shang{-}Hua Teng},
  title        = {Optimal Coarsening of Unstructured Meshes},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {1},
  pages        = {29--65},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.0990},
  doi          = {10.1006/JAGM.1998.0990},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MillerTT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/SaksZ99,
  author       = {Michael E. Saks and
                  Fotios Zaharoglou},
  title        = {Optimal Space Distributed Order-Preserving Lists},
  journal      = {J. Algorithms},
  volume       = {31},
  number       = {2},
  pages        = {320--334},
  year         = {1999},
  url          = {https://doi.org/10.1006/jagm.1998.1000},
  doi          = {10.1006/JAGM.1998.1000},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/SaksZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}