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

Pereira, Paulo Renato C; Pires, Oswaldo Vernet de Souza; Markenzon, Lilian

Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/1925

Full metadata record

DC Field	Value	Language
dc.contributor.author	Markenzon, Lilian	-
dc.contributor.author	Pires, Oswaldo Vernet de Souza	-
dc.contributor.author	Pereira, Paulo Renato C	-
dc.date.accessioned	2017-05-09T14:22:59Z	-
dc.date.available	2023-12-21T03:00:56Z	-
dc.date.issued	2005-12-31	-
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.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.language	eng	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.title	(L, U): bounded priority queues and the codification of Rényi k-Trees	en
dc.type	Relatório	pt_BR
dc.publisher.country	Brasil	pt_BR
dc.publisher.department	Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais	pt_BR
dc.subject.cnpq	CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO	pt_BR
dc.citation.issue	0505	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
05_05_000643158.pdf		197.94 kB	Adobe PDF	View/Open

Show simple item record Recommend this item View Statistics

Pantheon Institutional repository