Koprowski, Przemysław; Mehlhorn, Kurt; Ray, Saurabh Corrigendum to: “Faster algorithms for computing Hong’s bound on absolute positiveness”. (English) Zbl 1481.11122 J. Symb. Comput. 87, 238-241 (2018). MSC: 11Y16 12D99 12E05 PDFBibTeX XMLCite \textit{P. Koprowski} et al., J. Symb. Comput. 87, 238--241 (2018; Zbl 1481.11122) Full Text: DOI
Mehlhorn, Kurt; Ray, Saurabh Faster algorithms for computing Hong’s bound on absolute positiveness. (English) Zbl 1206.11151 J. Symb. Comput. 45, No. 6, 677-683 (2010); corrigendum ibid. 87, 238-241 (2018). Reviewer: Hendrik Hubrechts (Leuven) MSC: 11Y16 12D99 12E05 12Y05 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{S. Ray}, J. Symb. Comput. 45, No. 6, 677--683 (2010; Zbl 1206.11151) Full Text: DOI DOI
Mehlhorn, K.; Tsakalidis, A. Data structures. (English) Zbl 0900.68256 Van Leeuwen, Jan (ed.), Algorithms and complexity. Handbook of theoretical computer science. Vol. A. Amsterdam etc.: Elsevier Science Publishers. 301-341 (1990). MSC: 68Q25 11Y16 94A60 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{A. Tsakalidis}, in: Algorithms and complexity. Handbook of theoretical computer science. Vol. A. Amsterdam etc.: Elsevier Science Publishers; Cambridge, MA: The MIT Press. 301--341 (1990; Zbl 0900.68256)
Fürer, Martin; Mehlhorn, Kurt \(AT^2\)-optimal Galois field multiplier for VLSI. (English) Zbl 1395.68355 IEEE Trans. Comput. 38, No. 9, 1333-1336 (1989). MSC: 68W35 11Y16 65T50 65Y10 PDFBibTeX XMLCite \textit{M. Fürer} and \textit{K. Mehlhorn}, IEEE Trans. Comput. 38, No. 9, 1333--1336 (1989; Zbl 1395.68355) Full Text: DOI
Fürer, Martin; Mehlhorn, Kurt \(AT^ 2\)-optimal Galois field multiplier for VLSI. (English) Zbl 0595.68040 VLSI algorithms and architectures, Proc. Aegean Workshop Comput., Loutraki/Greece 1986, Lect. Notes Comput. Sci. 227, 217-225 (1986). MSC: 68W30 68Q25 11T55 PDFBibTeX XML