Now showing items 1-1 of 1

    • Selectable Heaps and Their Application to Lazy Search Trees 

      Zhang, Lingyi (University of Waterloo, 2021-04-29)
      We show the O(log n) time extract minimum function of efficient priority queues can be generalized to the extraction of the k smallest elements in O(k log(n/k)) time. We first show the heap-ordered tree selection of Kaplan ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages