Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/1925
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMarkenzon, Lilian-
dc.contributor.authorPires, Oswaldo Vernet de Souza-
dc.contributor.authorPereira, Paulo Renato C-
dc.date.accessioned2017-05-09T14:22:59Z-
dc.date.available2017-05-11T03:00:11Z-
dc.date.issued2005-12-31-
dc.identifier.citationMARKENZON, 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.urihttp://hdl.handle.net/11422/1925-
dc.description.abstractWe 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.languageengpt_BR
dc.relation.ispartofRelatório técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectEstruturas de dados k-treespt_BR
dc.title(L, U): bounded priority queues and the codification of Rényi k-Treesen
dc.typeRelatóriopt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaispt_BR
dc.subject.cnpqCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOpt_BR
dc.citation.issue0505pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios Técnicos e de Pesquisa

Files in This Item:
File Description SizeFormat 
05_05_000643158.pdf197,94 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.