Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jal/AndersonKKL02,
  author       = {Richard J. Anderson and
                  Sampath Kannan and
                  Howard J. Karloff and
                  Richard E. Ladner},
  title        = {Thresholds and optimal binary comparison search trees},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {338--358},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00203-1},
  doi          = {10.1016/S0196-6774(02)00203-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AndersonKKL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BourdonDV02,
  author       = {J{\'{e}}r{\'{e}}mie Bourdon and
                  Benoit Daireaux and
                  Brigitte Vall{\'{e}}e},
  title        = {Dynamical analysis of alpha-Euclidean algorithms},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {246--285},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00218-3},
  doi          = {10.1016/S0196-6774(02)00218-3},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/BourdonDV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ChassaingL02,
  author       = {Philippe Chassaing and
                  Guy Louchard},
  title        = {Reflected Brownian Bridge area conditioned on its local time at the
                  origin},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {29--51},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00209-2},
  doi          = {10.1016/S0196-6774(02)00209-2},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ChassaingL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ChernHT02,
  author       = {Hua{-}Huai Chern and
                  Hsien{-}Kuei Hwang and
                  Tsung{-}Hsi Tsai},
  title        = {An asymptotic theory for Cauchy-Euler differential equations with
                  applications to the analysis of algorithms},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {177--225},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00208-0},
  doi          = {10.1016/S0196-6774(02)00208-0},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ChernHT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/CsirikW02,
  author       = {J{\'{a}}nos Csirik and
                  Gerhard J. Woeginger},
  title        = {Resource augmentation for online bounded space bin packing},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {308--320},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00202-X},
  doi          = {10.1016/S0196-6774(02)00202-X},
  timestamp    = {Fri, 25 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/CsirikW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DellAmicoF02,
  author       = {Mauro Dell'Amico and
                  Lucian Finta},
  title        = {A linear time algorithm for scheduling outforests with communication
                  delays on three processors},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {287--307},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00201-8},
  doi          = {10.1016/S0196-6774(02)00201-8},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/DellAmicoF02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/DuchM02,
  author       = {Amalia Duch and
                  Conrado Mart{\'{\i}}nez},
  title        = {On the average performance of orthogonal range search in multidimensional
                  data structures},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {226--245},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00213-4},
  doi          = {10.1016/S0196-6774(02)00213-4},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/DuchM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/FillJ02,
  author       = {James Allen Fill and
                  Svante Janson},
  title        = {Quicksort asymptotics},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {4--28},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00216-X},
  doi          = {10.1016/S0196-6774(02)00216-X},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/FillJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/GarefalakisP02,
  author       = {Theodoulos Garefalakis and
                  Daniel Panario},
  title        = {Polynomials over finite fields free from large and small degree irreducible
                  factors},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {98--120},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00207-9},
  doi          = {10.1016/S0196-6774(02)00207-9},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GarefalakisP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Grolmusz02,
  author       = {Vince Grolmusz},
  title        = {Constructing set systems with prescribed intersection sizes},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {321--337},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00204-3},
  doi          = {10.1016/S0196-6774(02)00204-3},
  timestamp    = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Grolmusz02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/HubalekHLMP02,
  author       = {Friedrich Hubalek and
                  Hsien{-}Kuei Hwang and
                  William Lew and
                  Hosam M. Mahmoud and
                  Helmut Prodinger},
  title        = {A multivariate view of random bucket digital search trees},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {121--158},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00210-9},
  doi          = {10.1016/S0196-6774(02)00210-9},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/HubalekHLMP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/KnesslS02,
  author       = {Charles Knessl and
                  Wojciech Szpankowski},
  title        = {Limit laws for the height in {PATRICIA} tries},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {63--97},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00212-2},
  doi          = {10.1016/S0196-6774(02)00212-2},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/KnesslS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/MerliniS02,
  author       = {Donatella Merlini and
                  Renzo Sprugnoli},
  title        = {Fountains and histograms},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {159--176},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00211-0},
  doi          = {10.1016/S0196-6774(02)00211-0},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/MerliniS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/NeiningerR02,
  author       = {Ralph Neininger and
                  Ludger R{\"{u}}schendorf},
  title        = {Rates of convergence for Quicksort},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {52--62},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00206-7},
  doi          = {10.1016/S0196-6774(02)00206-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/NeiningerR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/ProdingerV02,
  author       = {Helmut Prodinger and
                  Brigitte Vall{\'{e}}e},
  title        = {Preface},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {1},
  pages        = {1--3},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00219-5},
  doi          = {10.1016/S0196-6774(02)00219-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/ProdingerV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/Wu02,
  author       = {Bang Ye Wu},
  title        = {A polynomial time approximation scheme for the two-source minimum
                  routing cost spanning trees},
  journal      = {J. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {359--378},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0196-6774(02)00205-5},
  doi          = {10.1016/S0196-6774(02)00205-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Wu02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.