(L, U): bounded priority queues and the codification of Rényi k-Trees

dc.creatorMarkenzon, Lilian
dc.creatorPires, Oswaldo Vernet de Souza
dc.creatorPereira, Paulo Renato C
dc.date2017-05-09T14:22:59Z
dc.date2023-09-27T03:01:28Z
dc.date2005-12-31
dc.date.accessioned2023-09-27T13:09:05Z
dc.date.available2023-09-27T13:09:05Z
dc.identifierMARKENZON, L.; PIRES, O. V. de S.; PEREIRA, P. R. C. (L, U): bounded priority queues and the codification of Rényi k-Trees . Rio de Janeiro: NCE/UFRJ, 2005. 11 p. (Relatório Técnico, 05/05)
dc.identifierhttp://hdl.handle.net/11422/1925
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8901966
dc.descriptionWe introduce in this paper a data structure named (L, U)- bounded priority queue, which particularizes priority queues in two aspects: the priorities associated to the elements must be integer numbers constrained to a predefined interval and, in a sequence of operations, no more than one Insert can immediatly follow a DeleteMin. This data structure is used in the development of efficient algorithms for coding and decoding Rényi k-trees.
dc.languageeng
dc.publisherBrasil
dc.publisherInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
dc.relationRelatório técnico NCE
dc.rightsAcesso Aberto
dc.subjectEstruturas de dados k-trees
dc.subjectCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
dc.title(L, U): bounded priority queues and the codification of Rényi k-Trees
dc.typeRelatório


Este ítem pertenece a la siguiente institución