Search dblp for Publications

• > Home > Search

@article{DBLP:journals/jea/AnderssonN98,
  author       = {Arne Andersson and
                  Stefan Nilsson},
  title        = {Implementing Radixsort},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {7},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297136},
  doi          = {10.1145/297096.297136},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/AnderssonN98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/CherkasskyGM98,
  author       = {Boris V. Cherkassky and
                  Andrew V. Goldberg and
                  Paul Martin},
  title        = {Augment or Push: {A} Computational Study of Bipartite Matching and
                  Unit-Capacity Flow Algorithms},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {8},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297140},
  doi          = {10.1145/297096.297140},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/CherkasskyGM98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/ChoS98,
  author       = {Seonghun Cho and
                  Sartaj Sahni},
  title        = {Weight-Biased Leftist Trees and Modified Skip Lists},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {2},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297111},
  doi          = {10.1145/297096.297111},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/ChoS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/FrigioniINP98,
  author       = {Daniele Frigioni and
                  Mario Ioffreda and
                  Umberto Nanni and
                  Giulio Pasqualone},
  title        = {Experimental Analysis of Dynamic Algorithms for the Single-Source
                  Shortest-Path Problem},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {5},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297147},
  doi          = {10.1145/297096.297147},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/FrigioniINP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/HelmanJB98,
  author       = {David R. Helman and
                  Joseph F. J{\'{a}}J{\'{a}} and
                  David A. Bader},
  title        = {A New Deterministic Parallel Sorting Algorithm with an Experimental
                  Evaluation},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {4},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297128},
  doi          = {10.1145/297096.297128},
  timestamp    = {Fri, 02 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/HelmanJB98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/HemaspaandraRSZ98,
  author       = {Lane A. Hemaspaandra and
                  Kulathur S. Rajasethupathy and
                  Prasanna Sethupathy and
                  Marius Zimand},
  title        = {Power Balance and Apportionment Algorithms for the United States Congress},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {1},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297106},
  doi          = {10.1145/297096.297106},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/HemaspaandraRSZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/Magun98,
  author       = {Jakob Magun},
  title        = {Greedy Matching Algorithms: An Experimental Study},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {6},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297131},
  doi          = {10.1145/297096.297131},
  timestamp    = {Fri, 07 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/Magun98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/Radzik98,
  author       = {Tomasz Radzik},
  title        = {Implementation of Dynamic Trees with In-Subtree Operations},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {9},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297144},
  doi          = {10.1145/297096.297144},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jea/Radzik98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jea/YanZ98,
  author       = {Yong Yan and
                  Xiaodong Zhang},
  title        = {Lock Bypassing: An Efficient Algorithm for Concurrently Accessing
                  Priority Heaps},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {3},
  pages        = {3},
  year         = {1998},
  url          = {https://doi.org/10.1145/297096.297116},
  doi          = {10.1145/297096.297116},
  timestamp    = {Wed, 25 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/YanZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}