Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Analysis of a new sk ...
Conference paper

Analysis of a new skip list variant

Guy Louchard (1), Helmut Prodinger (2) (3)
(1) Département d'Informatique [Bruxelles]
(2) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(3) Department of Mathematical Sciences [Stellenbosch University]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2005
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Proceedings
DOI
10.46298/dmtcs.3476
License
https://about.hal.science/hal-authorisation-v1
Indicators
596
Views
486
Downloads

Analysis of a new skip list variant

Guy Louchard (1), Helmut Prodinger (2) (3)
(1) Département d'Informatique [Bruxelles]
(2) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(3) Department of Mathematical Sciences [Stellenbosch University]
Abstract
For a skip list variant, introduced by Cho and Sahni, we analyse what is the analogue of horizontal plus vertical search cost in the original skip list model. While the average in Pugh's original version behaves like $Q \log_Q n$, with $Q = \frac{1}{q}$ a parameter, it is here given by $(Q+1) \log_Q n$.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Skip list
  • Rice's method
  • moments
  • functional equation
  • asymptotic expansion
Cited by

Source: OpenCitations

  • Consecutive records in geometrically distributed words

    Afrika Matematika

    Authors : Kamilla Oliver, Helmut Prodinger ORCID

    Journal reference : Volume 23, 2011, pp. 163-172

    DOI : 10.1007/s13370-011-0027-9
Preview
Loading PDF preview...