(L, U): bounded priority queues and the codification of Rényi k-Trees
| dc.citation.issue | 0505 | pt_BR |
| dc.creator | Markenzon, Lilian | |
| dc.creator | Pires, Oswaldo Vernet de Souza | |
| dc.creator | Pereira, Paulo Renato C | |
| dc.date.accessioned | 2017-05-09T14:22:59Z | |
| dc.date.available | 2026-05-16T03:01:34Z | |
| dc.date.issued | 2005-12-31 | |
| dc.description.abstract | We 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. | pt_BR |
| dc.embargo.terms | aberto | pt_BR |
| dc.identifier.citation | MARKENZON, 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) | pt_BR |
| dc.identifier.uri | http://hdl.handle.net/11422/1925 | |
| dc.language | eng | pt_BR |
| dc.publisher.country | Brasil | pt_BR |
| dc.publisher.department | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais | pt_BR |
| dc.relation.ispartof | Relatório técnico NCE | pt_BR |
| dc.rights | Acesso Aberto | pt_BR |
| dc.subject | Estruturas de dados k-trees | pt_BR |
| dc.subject.cnpq | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO | pt_BR |
| dc.title | (L, U): bounded priority queues and the codification of Rényi k-Trees | en |
| dc.type | Relatório | pt_BR |