Acta Informatica 17, 245–265.Doberkat, E.E.: Deleting the root of a heap. Acta Inf. 17, 245-265 (1982)E. Doberkat. Deleting the root of a heap. Acta Informatica, 17:245-265, 1982.E. Doberkat. Deleting the root of a heap. Acta Informatica, 17:245{265, 1982....
Daniel Dadushhttps://ror.org/00x7ekv49grid.6054.70000 0004 0369 4183Centrum Wiskunde & Informatica (CWI) Amsterdam The NetherlandsSophie Huibertshttps://ror.org/00hj8s172grid.21729.3f0000 0004 1936 8729Columbia University New York USADanish Kashaev...
Abdulla, P.A., Hol´ik, L., Jonsson, B., Lenga´l, O., Trinh, C.Q., Vojnar, T.: Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4), 357-385 (2016), http://dx.doi.org/10.1007/s00236-015-0235-0...
Acta InformaticaP. A. Abdulla, L. Hol´ik, B. Jonsson, O. Lenga´l, C. Q. Trinh, and T. Vojnar. Verification of heap manipulating programs with ordered data by extended forest automata. In ATVA, pages 224-239, 2013.P. Abdulla, L. Hol´ik, B. Jonsson, O. Lenga´l, C...
Acta InformaticaAbdulla, P.A., Hol´ik, L., Jonsson, B., Lenga´l, O., Trinh, C.Q., Vojnar, T.: Ver- ification of heap manipulating programs with ordered data by extended forest automata. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 224-239....
Ding, Y., Weiss, M.A.: The relaxed min-max heap. Acta Informatica 30, 215–231 (1993) MATH MathSciNetThe relaxed min-max heap - Ding, Weiss - 1993 () Citation Context ...time. As a simple consequence of our construction we get a new implementation of meldable double ended ...