Ásványi, Tibor Representation transformations of ordered lists. (English) Zbl 1340.68020 Ann. Math. Inform. 44, 5-13 (2015). MSC: 68P05 68P10 68P20 68Q25 PDF BibTeX XML Cite \textit{T. Ásványi}, Ann. Math. Inform. 44, 5--13 (2015; Zbl 1340.68020)
Sakuraba, Celso S.; Yagiura, Mutsunori Efficient local search algorithms for the linear ordering problem. (English) Zbl 1220.90154 Int. Trans. Oper. Res. 17, No. 6, 711-737 (2010). MSC: 90C35 PDF BibTeX XML Cite \textit{C. S. Sakuraba} and \textit{M. Yagiura}, Int. Trans. Oper. Res. 17, No. 6, 711--737 (2010; Zbl 1220.90154) Full Text: DOI
Vaucher, Jean G. Building optimal binary search trees from sorted values in \(O( N)\) time. (English) Zbl 1278.68083 Owe, Olaf (ed.) et al., From object-orientation to formal methods. Essays in memory of Ole-Johan Dahl. Berlin: Springer (ISBN 3-540-21366-X/pbk). Lecture Notes in Computer Science 2635, 376-388 (2004). MSC: 68P05 PDF BibTeX XML Cite \textit{J. G. Vaucher}, Lect. Notes Comput. Sci. 2635, 376--388 (2004; Zbl 1278.68083) Full Text: DOI
Panholzer, Alois; Prodinger, Helmut An analytic approach for the analysis of rotations in fringe-balanced binary search trees. (English) Zbl 0936.68110 Ann. Comb. 2, No. 2, 173-184 (1998). MSC: 68W05 68P05 68P10 PDF BibTeX XML Cite \textit{A. Panholzer} and \textit{H. Prodinger}, Ann. Comb. 2, No. 2, 173--184 (1998; Zbl 0936.68110) Full Text: DOI
Fleischer, Rudolf A simple balanced search tree with \(O(1)\) worst-case update time. (English) Zbl 0852.68020 Int. J. Found. Comput. Sci. 7, No. 2, 137-149 (1996). MSC: 68P10 68Q42 PDF BibTeX XML Cite \textit{R. Fleischer}, Int. J. Found. Comput. Sci. 7, No. 2, 137--149 (1996; Zbl 0852.68020) Full Text: DOI
Maelbráncke, Rudi; Olivié, Henk Dynamic tree rebalancing using recurrent rotations. (English) Zbl 0830.68102 Int. J. Found. Comput. Sci. 5, No. 3-4, 247-260 (1994). MSC: 68R10 68W10 PDF BibTeX XML Cite \textit{R. Maelbráncke} and \textit{H. Olivié}, Int. J. Found. Comput. Sci. 5, No. 3--4, 247--260 (1994; Zbl 0830.68102) Full Text: DOI
Lai, Tony W.; Wood, Derick A top-down updating algorithm for weight-balanced trees. (English) Zbl 0804.68031 Int. J. Found. Comput. Sci. 4, No. 4, 309-324 (1993). MSC: 68P05 68P10 PDF BibTeX XML Cite \textit{T. W. Lai} and \textit{D. Wood}, Int. J. Found. Comput. Sci. 4, No. 4, 309--324 (1993; Zbl 0804.68031) Full Text: DOI
Booth, Heather; Tarjan, Robert E. Finding the minimum-cost maximum flow in a series-parallel network. (English) Zbl 0795.90018 J. Algorithms 15, No. 3, 416-446 (1993). MSC: 90B10 68Q25 PDF BibTeX XML Cite \textit{H. Booth} and \textit{R. E. Tarjan}, J. Algorithms 15, No. 3, 416--446 (1993; Zbl 0795.90018) Full Text: DOI
Casas, R.; Díaz, J.; Martínez, C. Average-case analysis on simple families of trees using a balanced probability model. (English) Zbl 0785.68044 Theor. Comput. Sci. 117, No. 1-2, 99-112 (1993). MSC: 68Q25 68P05 68P10 PDF BibTeX XML Cite \textit{R. Casas} et al., Theor. Comput. Sci. 117, No. 1--2, 99--112 (1993; Zbl 0785.68044) Full Text: DOI
Ahuja, Mohan; Zhu, Yahui An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube. (English) Zbl 0704.68052 Inf. Process. Lett. 35, No. 1, 7-11 (1990). MSC: 68Q25 68M20 68M01 PDF BibTeX XML Cite \textit{M. Ahuja} and \textit{Y. Zhu}, Inf. Process. Lett. 35, No. 1, 7--11 (1990; Zbl 0704.68052) Full Text: DOI
Levcopoulos, Christos; Overmars, Mark H. A balanced search tree O(1) worst-case update time. (English) Zbl 0662.68016 Acta Inf. 26, No. 3, 269-277 (1988). MSC: 68P05 68P20 68P10 PDF BibTeX XML Cite \textit{C. Levcopoulos} and \textit{M. H. Overmars}, Acta Inf. 26, No. 3, 269--277 (1988; Zbl 0662.68016) Full Text: DOI
Tarjan, Robert E.; van Wyk, Christopher J. Erratum to: “An O(n log log n)-time algorithm for triangulating a simple polygon”. (English) Zbl 0659.68068 SIAM J. Comput. 17, No. 5, 1061 (1988). MSC: 68Q25 68P10 52-04 52A10 PDF BibTeX XML Cite \textit{R. E. Tarjan} and \textit{C. J. van Wyk}, SIAM J. Comput. 17, No. 5, 1061 (1988; Zbl 0659.68068) Full Text: DOI
Tarjan, Robert E.; van Wyk, Christopher J. An O(n log log n)-time algorithm for triangulating a simple polygon. (English) Zbl 0637.68044 SIAM J. Comput. 17, No. 1, 143-178 (1988). MSC: 68Q25 68P10 52-04 52A10 PDF BibTeX XML Cite \textit{R. E. Tarjan} and \textit{C. J. van Wyk}, SIAM J. Comput. 17, No. 1, 143--178 (1988; Zbl 0637.68044) Full Text: DOI
Tarjan, Robert E.; van Wyk, Christopher J. An \(O(n\log\log n)\)-time algorithm for triangulating a simple polygon. (Russian. English original) Zbl 0797.68073 Kibern. Sb., Nov. Ser. 27, 41-96 (1990); translation from SIAM J. Comput. 17, 143-178 (1988). MSC: 68Q25 68P10 52-04 52A10 PDF BibTeX XML Cite \textit{R. E. Tarjan} and \textit{C. J. van Wyk}, Kibern. Sb., Nov. Ser. 27, 41--96 (1988; Zbl 0797.68073); translation from SIAM J. Comput. 17, 143--178 (1988)
Van Leijenhorst, D. C.; Van der Weide, Th. P. On a recursion connected with tree balancing algorithms. (English) Zbl 0653.68056 Inf. Process. Lett. 24, 189-192 (1987). MSC: 68P10 11A63 11B37 68P05 PDF BibTeX XML Cite \textit{D. C. Van Leijenhorst} and \textit{Th. P. Van der Weide}, Inf. Process. Lett. 24, 189--192 (1987; Zbl 0653.68056) Full Text: DOI
Schrapp, Michael 1-pass top-down update schemes for search trees. Design, analysis and application. (English) Zbl 0569.68049 Fortschritt-Berichte der VDI-Zeitschriften. Reihe 10: Angewandte Informatik, Nr. 38. Verein Deutscher Ingenieure. Düsseldorf: VDI-Verlag GmbH. II, 101 p. (1984). Reviewer: T.R.Walsh MSC: 68P10 68P20 68Q25 68P05 PDF BibTeX XML
Ottmann, Thomas; Parker, D. Stott; Rosenberg, Arnold L.; Six, Hans W.; Wood, Derick Minimal-cost brother trees. (English) Zbl 0542.68048 SIAM J. Comput. 13, 197-217 (1984). Reviewer: G.Slutzki MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{T. Ottmann} et al., SIAM J. Comput. 13, 197--217 (1984; Zbl 0542.68048) Full Text: DOI
Pal, A. K.; Sagchi, A. Analysis of a simple insertion algorithm for 3-trees. (English) Zbl 0538.68075 Foundations of software technology and theoretical computer science, 3rd Conf., Bangalore/India 1983, 390-417 (1983). Reviewer: A.Slisenko MSC: 68P20 68P10 68P05 PDF BibTeX XML
Ottman, Th.; Wood, D. A uniform approach to balanced binary and multiway trees. (English) Zbl 0404.68066 Mathematical foundations of computer science, Proc. 8th Symp., Olomouc/Czech. 1979, Lect. Notes Comput. Sci. 74, 398-407 (1979). MSC: 68R10 68P20 68P05 PDF BibTeX XML
Horibe, Yasuichi Weight sequences and individual path length in a balanced binary tree. (English) Zbl 0403.94004 J. Comb. Inf. Syst. Sci. 4, 19-22 (1979). MSC: 94A15 94B99 68R10 94A45 94B40 PDF BibTeX XML Cite \textit{Y. Horibe}, J. Comb. Inf. Syst. Sci. 4, 19--22 (1979; Zbl 0403.94004)
Horibe, Yasuichi Entropy and balance in binary trees. (English) Zbl 0482.94004 Theorie de l’information, developpements recents et applications, Colloq. int. CNRS 276, Cachan/Fr. 1977, 115-120 (1978). MSC: 94A17 94A45 68P10 PDF BibTeX XML