uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Approximate Indexed Lists.
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
1998 (English)In: Journal of Algorithms, Vol. 29, no 2Article in journal (Refereed) Published
Abstract [en]

Let the position of a list element in a list be the number of elements preceding it plus one. An indexed list supports the following operations on a list: Insert; delete; return the position of an element; and return the element at a certain position. The order in which the elements appear in the list is completely determined by where the insertions take place; we do not require the presence of any keys that induce the ordering.

We consider approximate indexed lists, and show that a tiny relaxation in precision of the query operations allows a considerable improvement in time complexity. The new data structure has applications in two other problems; namely, list labeling and subset rank.

Place, publisher, year, edition, pages
1998. Vol. 29, no 2
Keyword [en]
Algorithms, dtaa structures
URN: urn:nbn:se:uu:diva-25781OAI: oai:DiVA.org:uu-25781DiVA: diva2:53555
Available from: 2007-02-13 Created: 2007-02-13 Last updated: 2011-01-14

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Andersson, Arne
By organisation
Department of Information TechnologyComputing Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 157 hits
ReferencesLink to record
Permanent link

Direct link