Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki Two new methods for constructing double-ended priority queues from priority queues. (English) Zbl 1183.68213 Computing 83, No. 4, 193-204 (2008). MSC: 68P05 68P10 68W40 68Q25 PDFBibTeX XMLCite \textit{A. Elmasry} et al., Computing 83, No. 4, 193--204 (2008; Zbl 1183.68213) Full Text: DOI
Bhattacharya, B.; Toussaint, G. Computing shortest transversals. (English) Zbl 0723.68102 Computing 46, No. 2, 93-119 (1991). MSC: 68U05 68N20 52A30 52A10 PDFBibTeX XMLCite \textit{B. Bhattacharya} and \textit{G. Toussaint}, Computing 46, No. 2, 93--119 (1991; Zbl 0723.68102) Full Text: DOI
Shermer, T. Hiding people in polygons. (English) Zbl 0675.68070 Computing 42, No. 2-3, 109-131 (1989). Reviewer: H.-D.Hecker MSC: 68U99 68Q25 52A30 52C17 PDFBibTeX XMLCite \textit{T. Shermer}, Computing 42, No. 2--3, 109--131 (1989; Zbl 0675.68070) Full Text: DOI
Hinz, A. M. An iterative algorithm for the Tower of Hanoi with four pegs. (English) Zbl 0672.05016 Computing 42, No. 2-3, 133-140 (1989). MSC: 05A99 68W99 PDFBibTeX XMLCite \textit{A. M. Hinz}, Computing 42, No. 2--3, 133--140 (1989; Zbl 0672.05016) Full Text: DOI
Widmayer, P.; Wu, Y. F.; Schlag, M. D. F.; Wong, C. K. On some union and intersection problems for polygons with fixed orientations. (English) Zbl 0579.68044 Computing 36, 183-197 (1986). MSC: 68R99 51M20 PDFBibTeX XMLCite \textit{P. Widmayer} et al., Computing 36, 183--197 (1986; Zbl 0579.68044) Full Text: DOI
Lausen, G. Integrated concurrency control in shared B-trees. (English) Zbl 0532.68033 Computing 33, 13-26 (1984). MSC: 68N25 68P05 PDFBibTeX XMLCite \textit{G. Lausen}, Computing 33, 13--26 (1984; Zbl 0532.68033) Full Text: DOI
Ottmann, Th.; Six, H.-W.; Wood, D. Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees. (English) Zbl 0452.68068 Computing 26, 367-378 (1981). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{Th. Ottmann} et al., Computing 26, 367--378 (1981; Zbl 0452.68068) Full Text: DOI
Ottmann, Th.; Six, H.-W.; Wood, D. On the correspondence between AVL trees and brother trees. (English) Zbl 0399.68069 Computing 23, 43-54 (1979). MSC: 68R10 68P20 68W99 PDFBibTeX XMLCite \textit{Th. Ottmann} et al., Computing 23, 43--54 (1979; Zbl 0399.68069) Full Text: DOI
Ottmann, Th.; Six, H. W.; Wood, D. One-sided k-height-balanced trees. (English) Zbl 0394.68047 Computing 22, 283-290 (1979). MSC: 68R10 68R99 PDFBibTeX XMLCite \textit{Th. Ottmann} et al., Computing 22, 283--290 (1979; Zbl 0394.68047) Full Text: DOI
Vaishnavi, V. K.; Kriegel, H. P.; Wood, D. Height balanced 2-3 trees. (English) Zbl 0392.68055 Computing 21, 195-211 (1979). MSC: 68R10 05C05 68W99 PDFBibTeX XMLCite \textit{V. K. Vaishnavi} et al., Computing 21, 195--211 (1979; Zbl 0392.68055) Full Text: DOI