Ernesti, Felix; Lendvai, Jonas; Schneider, Matti Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods. (English) Zbl 1514.74073 Comput. Mech. 71, No. 2, 277-293 (2023). MSC: 74R10 74Q99 74S60 74S99 PDFBibTeX XMLCite \textit{F. Ernesti} et al., Comput. Mech. 71, No. 2, 277--293 (2023; Zbl 1514.74073) Full Text: DOI
Elmasry, Amr; Katajainen, Jyrki Regular numeral systems for data structures. (English) Zbl 07528111 Acta Inf. 59, No. 2-3, 245-281 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Elmasry} and \textit{J. Katajainen}, Acta Inf. 59, No. 2--3, 245--281 (2022; Zbl 07528111) Full Text: DOI
Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye Partial sums on the ultra-wide word RAM. (English) Zbl 07467481 Theor. Comput. Sci. 905, 99-105 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Bille} et al., Theor. Comput. Sci. 905, 99--105 (2022; Zbl 07467481) Full Text: DOI arXiv
Lammich, Peter Efficient verified implementation of introsort and pdqsort. (English) Zbl 07614678 Peltier, Nicolas (ed.) et al., Automated reasoning. 10th international joint conference, IJCAR 2020, Paris, France, July 1–4, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12167, 307-323 (2020). MSC: 68V15 PDFBibTeX XMLCite \textit{P. Lammich}, Lect. Notes Comput. Sci. 12167, 307--323 (2020; Zbl 07614678) Full Text: DOI
Lange, Kenneth Algorithms from THE BOOK. (English) Zbl 1464.00003 Other Titles in Applied Mathematics 168. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-616-8/pbk; 978-1-61197-617-5/ebook). xi, 214 p. (2020). Reviewer: Martin D. Buhmann (Gießen) MSC: 00A09 65-04 05-04 92-04 PDFBibTeX XMLCite \textit{K. Lange}, Algorithms from THE BOOK. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (2020; Zbl 1464.00003) Full Text: DOI
Volz, Marcus; Brazil, Marcus; Ras, Charl; Thomas, Doreen Computing skeletons for rectilinearly convex obstacles in the rectilinear plane. (English) Zbl 1442.90035 J. Optim. Theory Appl. 186, No. 1, 102-133 (2020). MSC: 90B10 52B05 68U05 PDFBibTeX XMLCite \textit{M. Volz} et al., J. Optim. Theory Appl. 186, No. 1, 102--133 (2020; Zbl 1442.90035) Full Text: DOI arXiv
Edelkamp, Stefan; Weiß, Armin; Wild, Sebastian QuickXsort: a fast sorting scheme in theory and practice. (English) Zbl 1447.68003 Algorithmica 82, No. 3, 509-588 (2020). Reviewer: Ernst-Erich Doberkat (Dortmund) MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{S. Edelkamp} et al., Algorithmica 82, No. 3, 509--588 (2020; Zbl 1447.68003) Full Text: DOI arXiv
Gamby, Ask Neve; Katajainen, Jyrki Convex-hull algorithms: implementation, testing, and experimentation. (English) Zbl 1461.68242 Algorithms (Basel) 11, No. 12, Paper No. 195, 27 p. (2018). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{A. N. Gamby} and \textit{J. Katajainen}, Algorithms (Basel) 11, No. 12, Paper No. 195, 27 p. (2018; Zbl 1461.68242) Full Text: DOI
Sevcik, Carlos Fractal analysis of pi normality. (English) Zbl 1440.11140 Exp. Math. 27, No. 3, 331-343 (2018). MSC: 11K16 PDFBibTeX XMLCite \textit{C. Sevcik}, Exp. Math. 27, No. 3, 331--343 (2018; Zbl 1440.11140) Full Text: DOI arXiv
Erkan, Ö. Feyza; Cihan, Onur; Akar, Mehmet Analysis of distributed consensus protocols with multi-equilibria under time-delays. (English) Zbl 1380.93011 J. Franklin Inst. 355, No. 1, 332-360 (2018). MSC: 93A14 68T42 94C15 PDFBibTeX XMLCite \textit{Ö. F. Erkan} et al., J. Franklin Inst. 355, No. 1, 332--360 (2018; Zbl 1380.93011) Full Text: DOI
Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki Optimizing binary heaps. (English) Zbl 1378.68030 Theory Comput. Syst. 61, No. 2, 606-636 (2017). MSC: 68P05 PDFBibTeX XMLCite \textit{S. Edelkamp} et al., Theory Comput. Syst. 61, No. 2, 606--636 (2017; Zbl 1378.68030) Full Text: DOI Link
Gould, Nicholas I. M.; Robinson, Daniel P. A dual gradient-projection method for large-scale strictly convex quadratic problems. (English) Zbl 1401.90142 Comput. Optim. Appl. 67, No. 1, 1-38 (2017). MSC: 90C20 90C26 PDFBibTeX XMLCite \textit{N. I. M. Gould} and \textit{D. P. Robinson}, Comput. Optim. Appl. 67, No. 1, 1--38 (2017; Zbl 1401.90142) Full Text: DOI
Louridas, Panos Real-world algorithms. A beginner’s guide. (English) Zbl 1373.68004 Cambridge, MA: MIT Press (ISBN 978-0-262-03570-5/hbk; 978-0-262-33814-1/ebook). xvi, 509 p. (2017). Reviewer: Irina Ioana Mohorianu (Norwich) MSC: 68-01 05C85 68P05 68P10 68P25 68P30 68T05 68Wxx PDFBibTeX XMLCite \textit{P. Louridas}, Real-world algorithms. A beginner's guide. Cambridge, MA: MIT Press (2017; Zbl 1373.68004)
Diekert, Volker; Weiß, Armin QuickHeapsort: modifications and improved analysis. (English) Zbl 1353.68063 Theory Comput. Syst. 59, No. 2, 209-230 (2016). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{A. Weiß}, Theory Comput. Syst. 59, No. 2, 209--230 (2016; Zbl 1353.68063) Full Text: DOI arXiv
Lee, Chia-Wei; Chen, Pin-Liang; Hsieh, Sun-Yuan Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths. (English) Zbl 1303.05088 Discrete Appl. Math. 180, 126-134 (2015). MSC: 05C30 05C35 05C42 05C38 05C05 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{C.-W. Lee} et al., Discrete Appl. Math. 180, 126--134 (2015; Zbl 1303.05088) Full Text: DOI
Kim, Jinha; Han, Wook-Shin; Oh, Jinoh; Kim, Sungchul; Yu, Hwanjo Processing time-dependent shortest path queries without pre-computed speed information on road networks. (English) Zbl 1320.68221 Inf. Sci. 255, 135-154 (2014). MSC: 68U35 90B20 90C35 PDFBibTeX XMLCite \textit{J. Kim} et al., Inf. Sci. 255, 135--154 (2014; Zbl 1320.68221) Full Text: DOI
Benini, Marco; Gobbo, Federico Algorithms and their explanations. (English) Zbl 1432.68548 Beckmann, Arnold (ed.) et al., Language, life, limits. 10th conference on computability in Europe, CiE 2014, Budapest, Hungary, June 23–27, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8493, 32-41 (2014). MSC: 68W01 68P10 PDFBibTeX XMLCite \textit{M. Benini} and \textit{F. Gobbo}, Lect. Notes Comput. Sci. 8493, 32--41 (2014; Zbl 1432.68548) Full Text: DOI Link
Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki Weak heaps engineered. (English) Zbl 1334.68051 J. Discrete Algorithms 23, 83-97 (2013). MSC: 68P05 PDFBibTeX XMLCite \textit{S. Edelkamp} et al., J. Discrete Algorithms 23, 83--97 (2013; Zbl 1334.68051) Full Text: DOI
Klein, Shmuel T. On the connection between Hamming codes, Heapsort and other methods. (English) Zbl 1284.68225 Inf. Process. Lett. 113, No. 17, 617-620 (2013). MSC: 68P10 94B25 68W05 PDFBibTeX XMLCite \textit{S. T. Klein}, Inf. Process. Lett. 113, No. 17, 617--620 (2013; Zbl 1284.68225) Full Text: DOI
Brodal, Gerth Stølting A survey on priority queues. (English) Zbl 1394.68091 Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 150-163 (2013). MSC: 68P05 PDFBibTeX XMLCite \textit{G. S. Brodal}, Lect. Notes Comput. Sci. 8066, 150--163 (2013; Zbl 1394.68091) Full Text: DOI Link
Diekert, Volker; Weiß, Armin QuickHeapsort: modifications and improved analysis. (English) Zbl 1345.68120 Bulatov, Andrei A. (ed.) et al., Computer science – theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25–29, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). Lecture Notes in Computer Science 7913, 24-35 (2013). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{V. Diekert} and \textit{A. Weiß}, Lect. Notes Comput. Sci. 7913, 24--35 (2013; Zbl 1345.68120) Full Text: DOI arXiv
Browne, P. A.; Budd, C.; Gould, N. I. M.; Kim, H. A.; Scott, J. A. A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints. (English) Zbl 1352.74234 Int. J. Numer. Methods Eng. 92, No. 12, 1026-1043 (2012). MSC: 74P15 49Q12 74G60 90C30 90C09 PDFBibTeX XMLCite \textit{P. A. Browne} et al., Int. J. Numer. Methods Eng. 92, No. 12, 1026--1043 (2012; Zbl 1352.74234) Full Text: DOI
Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki The weak-heap data structure: variants and applications. (English) Zbl 1257.68059 J. Discrete Algorithms 16, 187-205 (2012). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{S. Edelkamp} et al., J. Discrete Algorithms 16, 187--205 (2012; Zbl 1257.68059) Full Text: DOI
Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki Two skew-binary numeral systems and one application. (English) Zbl 1254.68097 Theory Comput. Syst. 50, No. 1, 185-211 (2012). MSC: 68P05 11A99 PDFBibTeX XMLCite \textit{A. Elmasry} et al., Theory Comput. Syst. 50, No. 1, 185--211 (2012; Zbl 1254.68097) Full Text: DOI
Letchford, Adam N.; Miller, Sebastian J. Fast bounding procedures for large instances of the simple plant location problem. (English) Zbl 1251.90243 Comput. Oper. Res. 39, No. 5, 985-990 (2012). MSC: 90B80 90C27 90C06 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{S. J. Miller}, Comput. Oper. Res. 39, No. 5, 985--990 (2012; Zbl 1251.90243) Full Text: DOI Link
Suchenek, Marek A. Elementary yet precise worst-case analysis of Floyd’s heap-construction program. (English) Zbl 1252.68090 Fundam. Inform. 120, No. 1, 75-92 (2012). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{M. A. Suchenek}, Fundam. Inform. 120, No. 1, 75--92 (2012; Zbl 1252.68090) Full Text: DOI
Hasan, Md. Mahbubul; Shahjalal, Md.; Kaykobad, M. An in-place heapsort algorithm requiring \(n \log n+n \log^* n - 0.546871n\) comparisons. (English) Zbl 1242.68086 Int. J. Comput. Math. 88, No. 16, 3350-3360 (2011). MSC: 68P10 68P05 68W05 PDFBibTeX XMLCite \textit{Md. M. Hasan} et al., Int. J. Comput. Math. 88, No. 16, 3350--3360 (2011; Zbl 1242.68086) Full Text: DOI
Edelkamp, Stefan; Elmasry, Amr; Katajainen, Jyrki Two constant-factor-optimal realizations of adaptive heapsort. (English) Zbl 1314.68112 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 195-208 (2011). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{S. Edelkamp} et al., Lect. Notes Comput. Sci. 7056, 195--208 (2011; Zbl 1314.68112) Full Text: DOI
Kaparis, Konstantinos; Letchford, Adam N. Separation algorithms for 0-1 knapsack polytopes. (English) Zbl 1198.90297 Math. Program. 124, No. 1-2 (B), 69-91 (2010). MSC: 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{K. Kaparis} and \textit{A. N. Letchford}, Math. Program. 124, No. 1--2 (B), 69--91 (2010; Zbl 1198.90297) Full Text: DOI Link
Navarro, Gonzalo; Paredes, Rodrigo On sorting, heaps, and minimum spanning trees. (English) Zbl 1209.68177 Algorithmica 57, No. 4, 585-620 (2010). MSC: 68P10 68W05 PDFBibTeX XMLCite \textit{G. Navarro} and \textit{R. Paredes}, Algorithmica 57, No. 4, 585--620 (2010; Zbl 1209.68177) Full Text: DOI Link
Geffert, Viliam; Gajdoš, Jozef Multiway in-place merging. (English) Zbl 1191.68223 Theor. Comput. Sci. 411, No. 16-18, 1793-1808 (2010). MSC: 68P10 68W05 PDFBibTeX XMLCite \textit{V. Geffert} and \textit{J. Gajdoš}, Theor. Comput. Sci. 411, No. 16--18, 1793--1808 (2010; Zbl 1191.68223) Full Text: DOI
Blunck, Henrik; Vahrenhold, Jan In-place algorithms for computing (Layers of) maxima. (English) Zbl 1184.68558 Algorithmica 57, No. 1, 1-21 (2010). MSC: 68U05 PDFBibTeX XMLCite \textit{H. Blunck} and \textit{J. Vahrenhold}, Algorithmica 57, No. 1, 1--21 (2010; Zbl 1184.68558) Full Text: DOI Link
Xin, Shiqing; Wang, Guojin New method in information processing for maintaining an efficient dynamic ordered set. (English) Zbl 1191.68215 Sci. China, Ser. F 52, No. 8, 1292-1301 (2009). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{S. Xin} and \textit{G. Wang}, Sci. China, Ser. F 52, No. 8, 1292--1301 (2009; Zbl 1191.68215) Full Text: DOI
Letchford, Adam N.; Pearson, Nicholas A. Exploiting planarity in separation routines for the symmetric traveling salesman problem. (English) Zbl 1151.90039 Discrete Optim. 5, No. 2, 220-230 (2008). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{A. N. Letchford} and \textit{N. A. Pearson}, Discrete Optim. 5, No. 2, 220--230 (2008; Zbl 1151.90039) Full Text: DOI Link
Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki Two-tier relaxed heaps. (English) Zbl 1144.68015 Acta Inf. 45, No. 3, 193-210 (2008). MSC: 68P05 PDFBibTeX XMLCite \textit{A. Elmasry} et al., Acta Inf. 45, No. 3, 193--210 (2008; Zbl 1144.68015) Full Text: DOI
Gould, Nicholas I. M. How good are projection methods for convex feasibility problems? (English) Zbl 1146.90039 Comput. Optim. Appl. 40, No. 1, 1-12 (2008). MSC: 90C05 90C56 PDFBibTeX XMLCite \textit{N. I. M. Gould}, Comput. Optim. Appl. 40, No. 1, 1--12 (2008; Zbl 1146.90039) Full Text: DOI
Vahrenhold, Jan An in-place algorithm for Klee’s measure problem in two dimensions. (English) Zbl 1184.68573 Inf. Process. Lett. 102, No. 4, 169-174 (2007). MSC: 68U05 68W40 PDFBibTeX XMLCite \textit{J. Vahrenhold}, Inf. Process. Lett. 102, No. 4, 169--174 (2007; Zbl 1184.68573) Full Text: DOI
Brass, Peter Multidimensional heaps and complementary range searching. (English) Zbl 1184.68199 Inf. Process. Lett. 102, No. 4, 152-155 (2007). MSC: 68P05 PDFBibTeX XMLCite \textit{P. Brass}, Inf. Process. Lett. 102, No. 4, 152--155 (2007; Zbl 1184.68199) Full Text: DOI
Vahrenhold, Jan Line-segment intersection made in-place. (English) Zbl 1131.68113 Comput. Geom. 38, No. 3, 213-230 (2007). Reviewer: Jesus Illán González (Vigo) MSC: 68U05 65D18 68P10 68W05 PDFBibTeX XMLCite \textit{J. Vahrenhold}, Comput. Geom. 38, No. 3, 213--230 (2007; Zbl 1131.68113) Full Text: DOI
Paul, Gerald A complexity O(1) priority queue for event driven molecular dynamics simulations. (English) Zbl 1121.82301 J. Comput. Phys. 221, No. 2, 615-625 (2007). MSC: 82-08 PDFBibTeX XMLCite \textit{G. Paul}, J. Comput. Phys. 221, No. 2, 615--625 (2007; Zbl 1121.82301) Full Text: DOI arXiv
Buchbinder, Niv; Petrank, Erez Lower and upper bounds on obtaining history independence. (English) Zbl 1093.68027 Inf. Comput. 204, No. 2, 291-337 (2006). MSC: 68P05 PDFBibTeX XMLCite \textit{N. Buchbinder} and \textit{E. Petrank}, Inf. Comput. 204, No. 2, 291--337 (2006; Zbl 1093.68027) Full Text: DOI
Islam, Tarique Mesbaul; Kaykobad, M. Worst-case analysis of generalized heapsort algorithm revisited. (English) Zbl 1084.68032 Int. J. Comput. Math. 83, No. 1, 59-67 (2006). MSC: 68P10 68W40 PDFBibTeX XMLCite \textit{T. M. Islam} and \textit{M. Kaykobad}, Int. J. Comput. Math. 83, No. 1, 59--67 (2006; Zbl 1084.68032) Full Text: DOI
Wu, Jigang; Srikanthan, Thambipillai An efficient data structure for branch-and-bound algorithm. (English) Zbl 1094.68550 Inf. Sci. 167, No. 1-4, 233-237 (2004). MSC: 68P05 90C57 90C27 90C60 PDFBibTeX XMLCite \textit{J. Wu} and \textit{T. Srikanthan}, Inf. Sci. 167, No. 1--4, 233--237 (2004; Zbl 1094.68550) Full Text: DOI
Brönnimann, Hervé; Iacono, John; Katajainen, Jyrki; Morin, Pat; Morrison, Jason; Toussaint, Godfried Space-efficient planar convex hull algorithms. (English) Zbl 1068.68153 Theor. Comput. Sci. 321, No. 1, 25-40 (2004). MSC: 68U05 52B55 68Q25 90C27 PDFBibTeX XMLCite \textit{H. Brönnimann} et al., Theor. Comput. Sci. 321, No. 1, 25--40 (2004; Zbl 1068.68153) Full Text: DOI
Pacheco, Joaquín; Valencia, Olga Design of hybrids for the minimum sum-of-squares clustering problem. (English) Zbl 1429.65124 Comput. Stat. Data Anal. 43, No. 2, 235-248 (2003). MSC: 65K05 90C59 62-08 62H30 PDFBibTeX XMLCite \textit{J. Pacheco} and \textit{O. Valencia}, Comput. Stat. Data Anal. 43, No. 2, 235--248 (2003; Zbl 1429.65124) Full Text: DOI
Gould, Nicholas I. M.; Toint, Philippe L. An iterative working-set method for large-scale nonconvex quadratic programming. (English) Zbl 1012.65054 Appl. Numer. Math. 43, No. 1-2, 109-128 (2002). MSC: 65K05 65F10 65F35 90C06 90C20 90C52 PDFBibTeX XMLCite \textit{N. I. M. Gould} and \textit{P. L. Toint}, Appl. Numer. Math. 43, No. 1--2, 109--128 (2002; Zbl 1012.65054) Full Text: DOI
Piotrów, Marek A note on constructing binary heaps with periodic networks. (English) Zbl 1051.68146 Inf. Process. Lett. 83, No. 3, 129-134 (2002). MSC: 68W10 68P05 PDFBibTeX XMLCite \textit{M. Piotrów}, Inf. Process. Lett. 83, No. 3, 129--134 (2002; Zbl 1051.68146) Full Text: DOI
Cantone, D.; Cincotti, G. QuickHeapsort, an efficient mix of classical sorting algorithms. (English) Zbl 1016.68042 Theor. Comput. Sci. 285, No. 1, 25-42 (2002). MSC: 68Q25 PDFBibTeX XMLCite \textit{D. Cantone} and \textit{G. Cincotti}, Theor. Comput. Sci. 285, No. 1, 25--42 (2002; Zbl 1016.68042) Full Text: DOI
Bernstein, Daniel J. Enumerating solutions to \(p(a)+q(b)=r(c)+s(d)\). (English) Zbl 0960.11055 Math. Comput. 70, No. 233, 389-394 (2001). Reviewer: B.Z.Moroz (Bonn) MSC: 11Y50 11D25 11D41 11P05 PDFBibTeX XMLCite \textit{D. J. Bernstein}, Math. Comput. 70, No. 233, 389--394 (2001; Zbl 0960.11055) Full Text: DOI
Cantone, Domenico; Cincotti, Gianluca QuickHeapsort, an efficient mix of classical sorting algorithms. (English) Zbl 0971.68628 Bongiovanni, Giancarlo (ed.) et al., Algorithms and complexity. 4th Italian conference, CIAC 2000, Rome, Italy, March 1-3, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1767, 150-162 (2000). MSC: 68U99 68P10 68W40 PDFBibTeX XMLCite \textit{D. Cantone} and \textit{G. Cincotti}, Lect. Notes Comput. Sci. 1767, 150--162 (2000; Zbl 0971.68628)
Edelkamp, Stefan; Wegener, Ingo On the performance of WEAK-HEAPSORT. (English) Zbl 0971.68620 Reichel, Horst (ed.) et al., STACS 2000. 17th annual symposium on Theoretical aspects of computer science. Lille, France, February 17-19, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1770, 254-266 (2000). MSC: 68U99 68P10 68Q25 PDFBibTeX XMLCite \textit{S. Edelkamp} and \textit{I. Wegener}, Lect. Notes Comput. Sci. 1770, 254--266 (2000; Zbl 0971.68620)
Chowdhury, Rezaul Alam; Kaykobad, M.; Nath, Suman Kumar A simplified complexity analysis of McDiarmid and Reed’s variant of bottom-up-heapsort. (English) Zbl 0956.68038 Int. J. Comput. Math. 73, No. 3, 293-297 (2000). MSC: 68P05 68W05 PDFBibTeX XMLCite \textit{R. A. Chowdhury} et al., Int. J. Comput. Math. 73, No. 3, 293--297 (2000; Zbl 0956.68038) Full Text: DOI
Luk, R. W. P. Near optimal \(\beta\) heap. (English) Zbl 0937.68034 Comput. J. 42, No. 5, 391-399 (1999). MSC: 68P05 PDFBibTeX XMLCite \textit{R. W. P. Luk}, Comput. J. 42, No. 5, 391--399 (1999; Zbl 0937.68034) Full Text: DOI
Brodal, Gerth Stølting; Pinotti, M. Cristina Comparator networks for binary heap construction. (English) Zbl 1502.68088 Arnborg, Stefan (ed.) et al., Algorithm theory – SWAT’98. 6th Scandinavian workshop on algorithm theory, Stockholm, Sweden, July 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1432, 158-168 (1998). MSC: 68P05 PDFBibTeX XMLCite \textit{G. S. Brodal} and \textit{M. C. Pinotti}, Lect. Notes Comput. Sci. 1432, 158--168 (1998; Zbl 1502.68088) Full Text: DOI
Brodal, Gerth Stølting; Katajainen, Jyrki Worst-case efficient external-memory priority queues. (English) Zbl 1502.68087 Arnborg, Stefan (ed.) et al., Algorithm theory – SWAT’98. 6th Scandinavian workshop on algorithm theory, Stockholm, Sweden, July 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1432, 107-118 (1998). MSC: 68P05 PDFBibTeX XMLCite \textit{G. S. Brodal} and \textit{J. Katajainen}, Lect. Notes Comput. Sci. 1432, 107--118 (1998; Zbl 1502.68087) Full Text: DOI
Katajainen, Jyrki The ultimate heapsort. Repr. from Australian Computer Science Communications 20, No. 3 (1998). (English) Zbl 0951.68506 Lin, Xuemin (ed.), Computing theory ‘98. Proceedings of the 4th Australasian theory symposium - CATS ‘98, Perth, Australia, February 2-3, 1998. Singapore: Springer. 87-95 (1998). MSC: 68P10 PDFBibTeX XMLCite \textit{J. Katajainen}, in: Computing theory `98. Proceedings of the 4th Australasian theory symposium - CATS `98, Perth, Australia, February 2--3, 1998. Singapore: Springer. 87--95 (1998; Zbl 0951.68506)
Li, Ming; Vitányi, Paul Average-case analysis via incompressibility. (English) Zbl 1507.68134 Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 38-50 (1997). MSC: 68Q30 68W40 PDFBibTeX XMLCite \textit{M. Li} and \textit{P. Vitányi}, Lect. Notes Comput. Sci. 1279, 38--50 (1997; Zbl 1507.68134) Full Text: DOI
Boyar, Joan; Fagerberg, Rolf; Larsen, Kim S. Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 0897.68034 J. Comput. Syst. Sci. 55, No. 3, 504-521 (1997). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{J. Boyar} et al., J. Comput. Syst. Sci. 55, No. 3, 504--521 (1997; Zbl 0897.68034) Full Text: DOI
Fagerberg, Rolf A generalization of binomial queues. (English) Zbl 0875.68306 Inf. Process. Lett. 57, No. 2, 109-114 (1996). MSC: 68P05 PDFBibTeX XMLCite \textit{R. Fagerberg}, Inf. Process. Lett. 57, No. 2, 109--114 (1996; Zbl 0875.68306) Full Text: DOI
Carlsson, Svante; Chen, Jingsen; Mattsson, Christer Heaps with bits. (English) Zbl 0874.68084 Theor. Comput. Sci. 164, No. 1-2, 1-12 (1996). MSC: 68P10 68W15 PDFBibTeX XMLCite \textit{S. Carlsson} et al., Theor. Comput. Sci. 164, No. 1--2, 1--12 (1996; Zbl 0874.68084) Full Text: DOI
Gu, Xunrang; Zhu, Yuzhang Optimal heapsort algorithm. (English) Zbl 0874.68083 Theor. Comput. Sci. 163, No. 1-2, 239-243 (1996). MSC: 68P10 PDFBibTeX XMLCite \textit{X. Gu} and \textit{Y. Zhu}, Theor. Comput. Sci. 163, No. 1--2, 239--243 (1996; Zbl 0874.68083) Full Text: DOI
Gutin, Gregory; Yeo, Anders Ranking the vertices of a complete multipartite paired comparison digraph. (English) Zbl 0868.68083 Discrete Appl. Math. 69, No. 1-2, 75-82 (1996). MSC: 68R10 05C20 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, Discrete Appl. Math. 69, No. 1--2, 75--82 (1996; Zbl 0868.68083) Full Text: DOI Link
Bollobás, B.; Fenner, T. I.; Frieze, A. M. On the best case of Heapsort. (English) Zbl 0843.68035 J. Algorithms 20, No. 2, 205-217 (1996). MSC: 68W10 PDFBibTeX XMLCite \textit{B. Bollobás} et al., J. Algorithms 20, No. 2, 205--217 (1996; Zbl 0843.68035) Full Text: DOI Link
Brodal, Gerth Stølting Priority queues on parallel machines. (English) Zbl 1502.68046 Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 416-427 (1996). MSC: 68M20 68P05 PDFBibTeX XMLCite \textit{G. S. Brodal}, Lect. Notes Comput. Sci. 1097, 416--427 (1996; Zbl 1502.68046) Full Text: DOI
Brodal, Gerth Stølting; Chaudhuri, Shiva; Radhakrishnan, Jaikumar The randomized complexity of maintaining the minimum. (English) Zbl 1502.68137 Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 4-15 (1996). MSC: 68Q25 68P05 68W05 68W20 PDFBibTeX XMLCite \textit{G. S. Brodal} et al., Lect. Notes Comput. Sci. 1097, 4--15 (1996; Zbl 1502.68137) Full Text: DOI
Carlsson, Svante; Chen, Jingsen Searching rigid data structures (extended abstract). (English) Zbl 1527.68046 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 446-451 (1995). MSC: 68P05 68P10 68Q25 68W05 PDFBibTeX XMLCite \textit{S. Carlsson} and \textit{J. Chen}, Lect. Notes Comput. Sci. 959, 446--451 (1995; Zbl 1527.68046) Full Text: DOI
Carlsson, Svante; Chen, Jingsen Heap construction: optimal in both worst and average cases? (English) Zbl 1512.68065 Staples, John (ed.) et al., Algorithms and computations. 6th international symposium, ISAAC ’95, Cairns, Australia, December 4–6, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1004, 254-263 (1995). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{S. Carlsson} and \textit{J. Chen}, Lect. Notes Comput. Sci. 1004, 254--263 (1995; Zbl 1512.68065) Full Text: DOI
Brodal, Gerth Stølting Fast meldable priority queues. (English) Zbl 1502.68086 Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 282-290 (1995). MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{G. S. Brodal}, Lect. Notes Comput. Sci. 955, 282--290 (1995; Zbl 1502.68086) Full Text: DOI
Boyar, Joan; Fagerberg, Rolf; Larsen, Kim S. Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 1502.68085 Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 270-281 (1995). MSC: 68P05 PDFBibTeX XMLCite \textit{J. Boyar} et al., Lect. Notes Comput. Sci. 955, 270--281 (1995; Zbl 1502.68085) Full Text: DOI
Ding, Yuzheng; Weiss, Mark Alien The \(k\)-d heap: an efficient multi-dimensional priority queue. (English) Zbl 1504.68045 Dehne, Frank (ed.) et al., Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 709, 302-313 (1993). MSC: 68P05 PDFBibTeX XMLCite \textit{Y. Ding} and \textit{M. A. Weiss}, Lect. Notes Comput. Sci. 709, 302--313 (1993; Zbl 1504.68045) Full Text: DOI
Ding, Yuzheng; Weiss, Mark Allen The relaxed min-max heap: A mergeable double-ended priority queue. (English) Zbl 0790.68026 Acta Inf. 30, No. 3, 215-231 (1993). Reviewer: M.A.Weiss (Miami) MSC: 68P05 68Q25 PDFBibTeX XMLCite \textit{Y. Ding} and \textit{M. A. Weiss}, Acta Inf. 30, No. 3, 215--231 (1993; Zbl 0790.68026) Full Text: DOI
Dutton, Ronald D. Weak-heap sort. (English) Zbl 1408.68043 BIT 33, No. 3, 372-381 (1993). MSC: 68P10 68P05 PDFBibTeX XMLCite \textit{R. D. Dutton}, BIT 33, No. 3, 372--381 (1993; Zbl 1408.68043) Full Text: DOI
Khoong, C. M. Optimal parallel construction of heaps. (English) Zbl 0787.68051 Inf. Process. Lett. 48, No. 4, 159-161 (1993). MSC: 68Q25 68P05 68W15 PDFBibTeX XMLCite \textit{C. M. Khoong}, Inf. Process. Lett. 48, No. 4, 159--161 (1993; Zbl 0787.68051) Full Text: DOI
Schaffer, Russel; Sedgewick, Robert The analysis of heapsort. (English) Zbl 0789.68072 J. Algorithms 15, No. 1, 76-100 (1993). Reviewer: E.E.Doberkat (Essen) MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{R. Schaffer} and \textit{R. Sedgewick}, J. Algorithms 15, No. 1, 76--100 (1993; Zbl 0789.68072) Full Text: DOI Link
Wegener, Ingo BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small). (English) Zbl 0783.68060 Theor. Comput. Sci. 118, No. 1, 81-98 (1993). Reviewer: E.E.Doberkat (Dortmund) MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{I. Wegener}, Theor. Comput. Sci. 118, No. 1, 81--98 (1993; Zbl 0783.68060) Full Text: DOI
Chang, S. C.; Du, M. W. Diamond deque: A simple data structure for priority deques. (English) Zbl 0778.68028 Inf. Process. Lett. 46, No. 5, 231-237 (1993). Reviewer: M.W.Du MSC: 68P05 PDFBibTeX XMLCite \textit{S. C. Chang} and \textit{M. W. Du}, Inf. Process. Lett. 46, No. 5, 231--237 (1993; Zbl 0778.68028) Full Text: DOI
Levcopoulos, Christos; Petersson, Ola Adaptive heapsort. (English) Zbl 0781.68045 J. Algorithms 14, No. 3, 395-413 (1993). Reviewer: Christos Levcopoulos MSC: 68P10 PDFBibTeX XMLCite \textit{C. Levcopoulos} and \textit{O. Petersson}, J. Algorithms 14, No. 3, 395--413 (1993; Zbl 0781.68045) Full Text: DOI
Wegener, I. A simple modification of Xunrang and Yuzhang’s HEAPSORT variant improving its complexity significantly. (English) Zbl 0770.68075 Comput. J. 36, No. 3, 286-288 (1993). MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{I. Wegener}, Comput. J. 36, No. 3, 286--288 (1993; Zbl 0770.68075) Full Text: DOI
Fleischer, R.; Sinha, B. P.; Uhrig, C. A lower bound for the worst case of bottom-up-heapsort. (English) Zbl 0785.68045 Inf. Comput. 102, No. 2, 263-279 (1993). MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{R. Fleischer} et al., Inf. Comput. 102, No. 2, 263--279 (1993; Zbl 0785.68045) Full Text: DOI DOI
Carlsson, S. A note on HEAPSORT. (English) Zbl 0756.68024 Comput. J. 35, No. 4, 410-411 (1992). MSC: 68P10 PDFBibTeX XMLCite \textit{S. Carlsson}, Comput. J. 35, No. 4, 410--411 (1992; Zbl 0756.68024) Full Text: DOI
Ding, Y.; Weiss, M. A. Best case lower bounds for heapsort. (English. German summary) Zbl 0756.68050 Computing 49, No. 1, 1-9 (1992). MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{Y. Ding} and \textit{M. A. Weiss}, Computing 49, No. 1, 1--9 (1992; Zbl 0756.68050) Full Text: DOI
Wegener, Ingo The worst case complexity of McDiarmid and Reed’s variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\). (English) Zbl 0766.68025 Inf. Comput. 97, No. 1, 86-96 (1992). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{I. Wegener}, Inf. Comput. 97, No. 1, 86--96 (1992; Zbl 0766.68025) Full Text: DOI
Klavžar, Sandi; Marinček, Jože Bottom-up heapsort. (Slovenian. English summary) Zbl 0724.68024 Obz. Mat. Fiz. 38, No. 2, 45-52 (1991). MSC: 68P10 68P05 68Q25 PDFBibTeX XMLCite \textit{S. Klavžar} and \textit{J. Marinček}, Obz. Mat. Fiz. 38, No. 2, 45--52 (1991; Zbl 0724.68024)
Carlsson, Svante An optimal algorithm for deleting the root of a heap. (English) Zbl 0713.68018 Inf. Process. Lett. 37, No. 2, 117-120 (1991). MSC: 68P05 68W10 PDFBibTeX XMLCite \textit{S. Carlsson}, Inf. Process. Lett. 37, No. 2, 117--120 (1991; Zbl 0713.68018) Full Text: DOI
Gambosi, Giorgio; Nardelli, Enrico; Talamo, Maurizio A pointer-free data structure for merging heaps and min-max heaps. (English) Zbl 0739.68023 Theor. Comput. Sci. 84, No. 1, 107-126 (1991). Reviewer: J.Błazewicz (Poznań) MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{G. Gambosi} et al., Theor. Comput. Sci. 84, No. 1, 107--126 (1991; Zbl 0739.68023) Full Text: DOI
Munro, J. Ian; Raman, Venkatesh Sorting multisets and vectors in-place. (English) Zbl 0765.68027 Algorithms and data structures, Proc. 2nd Workshop, WADS ’91, Ottawa/Can. 1991, Lect. Notes Comput. Sci. 519, 473-480 (1991). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{J. I. Munro} and \textit{V. Raman}, Lect. Notes Comput. Sci. 519, 473--480 (1991; Zbl 0765.68027)
Geng, Guohua; Zhou, Mingquan Tri-heaping and tri-heap sort algorithm. (Chinese. English summary) Zbl 0792.68026 J. Northwest Univ., Nat. Sci. 21, No. 1, 25-29 (1991). MSC: 68P10 PDFBibTeX XML
Guénoche, E.; Hansen, P.; Jaumard, B. Efficient algorithms for divisive hierarchical clustering with the diameter criterion. (English) Zbl 0739.62050 J. Classif. 8, No. 1, 5-30 (1991). Reviewer: V.J.Urbakh (Moskva) MSC: 62H30 68Q25 PDFBibTeX XMLCite \textit{E. Guénoche} et al., J. Classif. 8, No. 1, 5--30 (1991; Zbl 0739.62050) Full Text: DOI
Sack, Jörg-Rüdiger; Strothotte, Thomas A characterization of heaps and its applications. (English) Zbl 0705.68043 Inf. Comput. 86, No. 1, 69-86 (1990). MSC: 68P05 68W10 PDFBibTeX XMLCite \textit{J.-R. Sack} and \textit{T. Strothotte}, Inf. Comput. 86, No. 1, 69--86 (1990; Zbl 0705.68043) Full Text: DOI
Paulik, A. Worst-case analysis of a generalized heapsort algorithm. (English) Zbl 0704.68056 Inf. Process. Lett. 36, No. 3, 159-165 (1990). MSC: 68Q25 68P10 PDFBibTeX XMLCite \textit{A. Paulik}, Inf. Process. Lett. 36, No. 3, 159--165 (1990; Zbl 0704.68056) Full Text: DOI
Gurwitz, Chaya Weighted median algorithms for \(L_ 1\) approximation. (English) Zbl 0704.65044 BIT 30, No. 2, 301-310 (1990). Reviewer: W.Krabs MSC: 65K05 90C05 41A45 65D99 PDFBibTeX XMLCite \textit{C. Gurwitz}, BIT 30, No. 2, 301--310 (1990; Zbl 0704.65044) Full Text: DOI
Minoux, M. Solving combinatorial problems with combined min-max-min-sum objective and applications. (English) Zbl 0682.90076 Math. Program., Ser. B 45, No. 2, 361-372 (1989). MSC: 90C27 05C70 68Q25 05B35 90C35 05C38 05C15 PDFBibTeX XMLCite \textit{M. Minoux}, Math. Program. 45, No. 2 (B), 361--372 (1989; Zbl 0682.90076) Full Text: DOI
Paessens, H. The savings algorithm for the vehicle routing problem. (English) Zbl 0635.90047 Eur. J. Oper. Res. 34, No. 3, 336-344 (1988). MSC: 90B35 90C27 PDFBibTeX XMLCite \textit{H. Paessens}, Eur. J. Oper. Res. 34, No. 3, 336--344 (1988; Zbl 0635.90047) Full Text: DOI
Lipschutz, Seymour Data structures. (Datenstrukturen.) (German) Zbl 0812.68004 Schaum’s Outline. Hamburg etc.: McGraw-Hill Book Company GmbH. 410 p. (1987). MSC: 68-01 68Q15 68P05 68R10 68P10 PDFBibTeX XMLCite \textit{S. Lipschutz}, Datenstrukturen. Hamburg etc.: McGraw-Hill Book Company GmbH (1987; Zbl 0812.68004)
Carlsson, Svante A variant of heapsort with almost optimal number of comparisons. (English) Zbl 0653.68051 Inf. Process. Lett. 24, 247-250 (1987). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{S. Carlsson}, Inf. Process. Lett. 24, 247--250 (1987; Zbl 0653.68051) Full Text: DOI
Hasham, A.; Sack, J.-R. Bounds for min-max heaps. (English) Zbl 0642.68056 BIT 27, 315-323 (1987). MSC: 68M20 68Q25 68P05 PDFBibTeX XMLCite \textit{A. Hasham} and \textit{J. R. Sack}, BIT 27, 315--323 (1987; Zbl 0642.68056) Full Text: DOI
Carlsson, Svante Average-case results on heapsort. (English) Zbl 0631.68057 BIT 27, 2-17 (1987). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{S. Carlsson}, BIT 27, 2--17 (1987; Zbl 0631.68057) Full Text: DOI
Munro, J. Ian An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time. (English) Zbl 0625.68044 J. Comput. Syst. Sci. 33, 66-74 (1986). MSC: 68P10 PDFBibTeX XMLCite \textit{J. I. Munro}, J. Comput. Syst. Sci. 33, 66--74 (1986; Zbl 0625.68044) Full Text: DOI
Fredman, Michael L.; Sedgewick, Robert; Sleator, Daniel D.; Tarjan, Robert E. The pairing heap: A new form of self-adjusting heap. (English) Zbl 0611.68042 Algorithmica 1, 111-129 (1986). MSC: 68P10 68P05 PDFBibTeX XMLCite \textit{M. L. Fredman} et al., Algorithmica 1, 111--129 (1986; Zbl 0611.68042) Full Text: DOI
Moffat, Alistair; Takaoka, Tadao A priority queue for the all pairs shortest path problem. (English) Zbl 0539.68022 Inf. Process. Lett. 18, 189-193 (1984). MSC: 68W99 68P05 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Moffat} and \textit{T. Takaoka}, Inf. Process. Lett. 18, 189--193 (1984; Zbl 0539.68022) Full Text: DOI