Relevant bibliographies by topics / Skip lists

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Skip lists'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Skip lists.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Skip lists"

1

Bagchi, Amitabha, Adam L. Buchsbaum, and Michael T. Goodrich. "Biased Skip Lists." Algorithmica 42, no. 1 (2005): 31–48. http://dx.doi.org/10.1007/s00453-004-1138-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sen, Sandeep. "Some observations on skip-lists." Information Processing Letters 39, no. 4 (1991): 173–76. http://dx.doi.org/10.1016/0020-0190(91)90175-h.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Devroye, Luc. "A Limit Theory for Random Skip Lists." Annals of Applied Probability 2, no. 3 (1992): 597–609. http://dx.doi.org/10.1214/aoap/1177005651.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kirschenhofer, Peter, and Helmut Prodinger. "The path length of random skip lists." Acta Informatica 31, no. 8 (1994): 775–92. http://dx.doi.org/10.1007/bf01178735.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

CHO, SEONGHUN, and SARTAJ SAHNI. "A NEW WEIGHT BALANCED BINARY SEARCH TREE." International Journal of Foundations of Computer Science 11, no. 03 (2000): 485–513. http://dx.doi.org/10.1142/s0129054100000296.

Full text
Abstract:
We develop a new class of weight balanced binary search trees called β-balanced binary search trees (β-BBSTs). β-BBSTs are designed to have reduced internal path length. As a result, they are expected to exhibit good search time characteristics. Individual search, insert, and delete operations in an n node β-BBST take O( log n) time for [Formula: see text]. Experimental results comparing the performance of β-BBSTs, WB(α) trees, AVL-trees, red/black trees, treaps, deterministic skip lists and skip lists are presented. Two simplified versions of, β-BBSTs are also developed.
APA, Harvard, Vancouver, ISO, and other styles
6

Messeguer, Xavier. "Skip trees, an alternative data structure to skip lists in a concurrent approach." RAIRO - Theoretical Informatics and Applications 31, no. 3 (1997): 251–69. http://dx.doi.org/10.1051/ita/1997310302511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pugh, William. "Skip lists: a probabilistic alternative to balanced trees." Communications of the ACM 33, no. 6 (1990): 668–76. http://dx.doi.org/10.1145/78973.78977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cho, Seonghun, and Sartaj Sahni. "Weight-biased leftist trees and modified skip lists." ACM Journal of Experimental Algorithmics 3 (September 1998): 2. http://dx.doi.org/10.1145/297096.297111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Papadakis, Thomas, J. Ian Munro, and Patricio V. Poblete. "Average search and update costs in skip lists." BIT 32, no. 2 (1992): 316–32. http://dx.doi.org/10.1007/bf01994884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Zhuohua, and Chuankun Wu. "Privacy of a randomised skip lists-based protocol." IET Information Security 9, no. 5 (2015): 288–93. http://dx.doi.org/10.1049/iet-ifs.2014.0287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Skip lists"

1

Sayed, Hassan Adelyar. "The Complexity of Splay Trees and Skip Lists." Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_6858_1263424080.

Full text
Abstract:
<p>Our main results are that splay trees are faster for sorted insertion, where AVL trees are faster for random insertion. For searching, skip lists are faster than single class top-down splay trees, but two-class and multi-class top-down splay trees can behave better than skip lists.</p>
APA, Harvard, Vancouver, ISO, and other styles
2

Mendes, Hammurabi das Chagas. "Estruturas de dados concorrentes: um estudo de caso em skip graphs." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-29092008-132758/.

Full text
Abstract:
Muitos dos sistemas de computação existentes atualmente são concorrentes, ou seja, neles constam diversas entidades que, ao mesmo tempo, operam sobre um conjunto de recursos compartilhados. Nesse contexto, devemos controlar a concorrência das diversas operações realizadas, ou então a interferência entre elas poderia causar inconsistências nos recursos compartilhados ou nas próprias operações realizadas. Nesse texto, vamos tratar especificamente de estruturas de dados concorrentes, ou seja, estruturas de dados cujas operações associadas -- consideramos inserção, remoção e busca -- sejam passíveis de execução simultânea por diversas entidades. Tendo em vista o controle da concorrência, vamos adotar uma abordagem baseada no emprego de locks, uma primitiva de sincronização muito usual na literatura. Nossa discussão será apresentada em termos de certas estruturas de dados chamadas skip graphs, que têm propriedades interessantes para outros contextos, como o contexto de sistemas distribuídos.<br>Many existing computer systems are concurrent, or, in other words, they are composed of many entities that, at the same time, operate over some set of shared resources. In this context, we must control the concurrency of the operations, otherwise the interference between them could cause inconsistencies in the shared resources or in the operations themselves. In this text, we specifically discuss concurrent data structures, or, in other words, data structures over which the associated operations -- we consider insertion, removal and search -- could be executed simultaneously by various entities. In order to control the concurrency, we will employ an aproach based on the use of locks, a widely known synchronization primitive in the literature. Our discussion will be presented in terms of data structures called skip graphs, which have interesting properties in other contexts, as the context of distributed systems.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Bing. "Using skip lists in the implementation of a hypertext tool for maintenance programmers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ39119.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pan, Yunlan. "Investigation of a dynamic k-d Search Skip List requiring [Theta](kn) space." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0008/MQ30013.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alam, Sarwar. "Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries." Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/46286.

Full text
Abstract:
With scalability in mind, we have implemented a pure message-passing distributed data structure ideal for range queries. The structure is a distributed skip list that takes full advantage of Fine-Grain MPI to execute on a variety of scales ranging from a single multicore to multiple machines across clusters. The skip list data structure provides parallel implementation of range queries. Our implementation architecture is based on several services layered on top of each other that simplifies the effort required in building distributed code. Unlike concurrent data structures the distributed skip list operations are deterministic and atomic. The layered service architecture of our implementation exposes several control parameters that make it easy to distribute load, have operation flow control, vary granularity at different layers and tune performance to the underlying machine and network. Range-queries are implemented in a way that parallelizes the operation and takes advantage of the recursive properties of the skip list structure. We investigate a shortcut mechanism that alleviates the bottleneck at the head and introduces semantic trade offs between performance and consistency. We report on the performance of the skip list on a medium size cluster of two hundred cores with twenty thousand processes.
APA, Harvard, Vancouver, ISO, and other styles
6

Smati, Cherif Besma. "Gouvernance et performance des services publics : cas des entreprises de remontées mécaniques." Thesis, Nice, 2014. http://www.theses.fr/2014NICE0018.

Full text
Abstract:
Ce travail doctoral se situe dans le cadre du management public qui s'intéresse principalement à étudier l’impact des modes de gouvernance public-privé sur l’efficience technique des remontées mécaniques. Une étude empirique a été menée auprès de 68 entreprises de remontées mécaniques sur cinq ans (2006-2010). Ces données ont été traitées au moyen d’une étude quantitative confirmatoire à l’aide d’un modèle statistique. La recherche quantitative a pour objectif final de tester la validité des deux modèles de recherche proposée à l’issue de l’analyse de la littérature. Le premier modèle de frontière stochastique se compose de trois variables explicatives (productivité du capital, productivité du travail et moment de puissance), et de trois variables de contrôle (taille, altitude et effectif) et d'une variable à expliquer (la journée skieur). Le second se compose de deux variables explicatives (régie et SEM) et d’une variable à expliquée (l’inefficience technique). Les résultats de cette recherche mettent en avant l'importance des modes de gouvernance (régie ou SEM) dans le processus d’augmentation de l’efficience technique des remontées mécaniques. Une deuxième étude empirique (2011-2013) approche la compétitivité par la mesure de la productivité des opérateurs de remontées mécaniques. A l’aide de l’indice de productivité de Malmquist et ses deux composantes, nous cherchons à appréhender les changements de productivité entre deux périodes de temps, puis, dans un second temps, cette productivité est décomposée en deux éléments afin de mettre en évidence le progrès technologique. Alors,la relation entre taille et variation de l’efficience technique est vérifiée<br>Public-Private Partnership is a tool for modernization and renewal of public intervention, its main goal is to achieve very high levels of performance. This doctoral work is therefore in the context of public management that focuses on studying the impact of public-private modes of governance on the technical efficiency of ski lifts. To answer our questions, an empirical study was conducted among 68 ski lift companies over five years (2006-2010). These data have been processed using a quantitative confirmatory study using a statistical model. To test the validity of the two models proposed by the literature, a quantitative research has been conducted. The first stochastic frontier model consists of three variables (capital productivity, labor productivity and power momentum), and three control variables (size, altitude and staff) and a dependent variable (the skier day). The second model of technical inefficiency consists of two explanatory variables (“time and materials » and SEM) and an explanatory variable (technical inefficiency). The results of this research outline, among other things, the importance of modes of governance (“time and materials » or SEM) in the process of increasing the technical efficiency of ski lifts. The second empirical study (2011-2013) which approaches the competitiveness of the French winter sports resorts by the measure of the productivity of the operators of ski lifts. By means of the indication of productivity of Malmquist and its two constituents, we look to arrest the changes of productivity then, this productivity is decomposed into two elements. Then, the relation between size and variation Technical efficiency is verified
APA, Harvard, Vancouver, ISO, and other styles
7

Fomitchev, Mikhail. "Lock-free linked lists and skip lists /." 2003. http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99307.

Full text
Abstract:
Thesis (M.Sc.)--York University, 2003. Graduate Programme in Computer Science.<br>Typescript. Includes bibliographical references (leaves 224-226). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99307
APA, Harvard, Vancouver, ISO, and other styles
8

游仕宏. "A Skip-list-Based NOR-FLASH File System." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/08843998174306831768.

Full text
Abstract:
碩士<br>國立交通大學<br>網路工程研究所<br>96<br>Flash memory has become a crucial component in building embedded computing systems. To manage a massive amount of data, index structures or file systems are needed. The physical characteristics of flash memory, write once and bulk erase in particular, impose many difficulties on realizing structured data. In past work, the notion of logical address space is introduce to decouple changes to data and to the physical addresses of them. To map between logical addresses and physical addresses, RAM-resident translation tables are needed, it may require lengthy initialization scan procedure. In this work, a skip-list implementation based on physical pointers is proposed. It is to investigate the feasibility of organizing data with physical pointers over flash memory. The benefits are that no translation tables and initialization scan are needed. It is also demonstrated that a file system can be easily realized based on the proposed skip-list implementation
APA, Harvard, Vancouver, ISO, and other styles
9

Benavides, Raul Martinez. "Pricing in a congestible service industry with a focus on the ski industry." Thesis, 2003. http://hdl.handle.net/2429/15158.

Full text
Abstract:
In 2003, the Centre for Operations Excellence at the University of British Columbia's Sauder School of Business worked on a project for a company in the resort industry. The project was an initial attempt to develop and implement a pricing management practice for the ski lift ticket business of that company. Our main deliverable was the development of an Excel-based tool with a user-friendly interface that could help the company in their budgeting of the ski lift ticket business. After completing the project, we did some further investigation relative to pricing management techniques that could be applied to this sort of business, namely a congestible service industry. In this thesis we argue that a revenue management system could bring substantial benefits if implemented in this industry. We also identify the requirements and main features of a revenue management system applied to congestible service industries. Although revenue management is a very popular system in fields such as the airline, hotel and car rental industry, none of them can be classified as congestible industries. The ski lift ticket industry and similar industries possess one characteristic that differentiates them from the ones previously mentioned, there is no fixed capacity. This is the reason why we considered important to study the application of revenue management in congestible service industries.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Skip lists"

1

Goeldner, Charles R. The Colorado ski industry: Highlights of the 1989-90 season. Business Research Division, Graduate School of Business Administration, University of Colorado, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

[Environmental assessment for the Alpine ski lift modifications, Bridger Bowl ski area]. The Dept., 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ahlsten, Erkki. Hiihtohissien tarvearvio Suomessa vuosina 1985-1995. 2nd ed. Matkailun edistämiskeskus, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ahlsten, Erkki. Hiihtohissien tarvearvio Suomessa vuosina 1985-1995. Matkailun edistämiskeskus, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ahlsten, Erkki. Hiihtohissien tarvearvio Suomessa vuosina 1988-1997. 3rd ed. Matkailun edistämiskeskus, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wirz-Julen, Agathe. Die Geschichte der Bergbahnen von Zermatt: Von den Anfängen bis zur erfolgreichen Fusion. Zermatt Bergbahnen AG, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Maine. Board of Elevator and Tramway Safety. State of Maine Board of Elevator & Tramway Safety: Laws and rules. 2nd ed. Dept. of Professional and Financial Regulation, Office of Licensing and Registration, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sardi, Luigi. I due Cermis: 9 marzo 1976-3 febbraio 1998. Curcu & Genovese, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Association, National Ski Access. American national standard for passenger ropeways: Aerial tramways, aerial lifts, surface lifts, tows and conveyors-- safety requirements. American National Standards Institute, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koleje linowe i wyciągi narciarskie w Polsce: Historia i dzień dzisiejszy. "Księży Młyn" Dom Wydawniczy, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Skip lists"

1

Bagchi, Amitabha, Adam L. Buchsbaum, and Michael T. Goodrich. "Biased Skip Lists." In Algorithms and Computation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36136-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pittard, Jonathan J., and Alan L. Tharp. "Simplified Self-Adapting Skip Lists." In Intelligent Data Engineering and Automated Learning – IDEAL 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15381-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Di Battista, Giuseppe, and Bernardo Palazzi. "Authenticated Relational Tables and Authenticated Skip Lists." In Data and Applications Security XXI. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73538-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gabarró, Joaquim, Conrado Martínez, and Xavier Messeguer. "Parallel Update and Search in Skip Lists." In Computer Science 2. Springer US, 1994. http://dx.doi.org/10.1007/978-1-4757-9805-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pugh, William. "Skip lists: A probabilistic alternative to balanced trees." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51542-9_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cho, Seonghun, and Sartaj Sahni. "Weight biased leftist trees and modified skip lists." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61332-3_170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Blibech, Kaouthar, and Alban Gabillon. "A New Timestamping Scheme Based on Skip Lists." In Computational Science and Its Applications - ICCSA 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11751595_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ergun, Funda, S. Cenk Şahinalp, Jonathan Sharp, and Rakesh K. Sinha. "Biased Skip Lists for Highly Skewed Access Patterns." In Algorithm Engineering and Experimentation. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44808-x_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Papadakis, Thomas, J. Ian Munro, and Patricio V. Poblete. "Analysis of the expected search cost in skip lists." In SWAT 90. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52846-6_86.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Boldi, Paolo, and Sebastiano Vigna. "Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups." In String Processing and Information Retrieval. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11575832_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Skip lists"

1

Fomitchev, Mikhail, and Eric Ruppert. "Lock-free linked lists and skip lists." In the twenty-third annual ACM symposium. ACM Press, 2004. http://dx.doi.org/10.1145/1011767.1011776.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bender, Michael A., Martín Farach-Colton, Rob Johnson, et al. "Write-Optimized Skip Lists." In SIGMOD/PODS'17: International Conference on Management of Data. ACM, 2017. http://dx.doi.org/10.1145/3034786.3056117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dean, Brian C., and Zachary H. Jones. "Exploring the duality between skip lists and binary search trees." In the 45th annual southeast regional conference. ACM Press, 2007. http://dx.doi.org/10.1145/1233341.1233413.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xie, Zhongle, Qingchao Cai, H. V. Jagadish, Beng Chin Ooi, and Weng-Fai Wong. "Parallelizing Skip Lists for In-Memory Multi-Core Database Systems." In 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, 2017. http://dx.doi.org/10.1109/icde.2017.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cacciari Miraldo, Victor, Harold Carr, Mark Moir, Lisandra Silva, and Guy L. Steele Jr. "Formal verification of authenticated, append-only skip lists in Agda." In CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs. ACM, 2021. http://dx.doi.org/10.1145/3437992.3439924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sakai, Kazuya, Min-Te Sun, Wei-Shinn Ku, and Ten H. Lai. "Randomized skip lists-based private authentication for large-scale RFID systems." In the fourteenth ACM international symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2491288.2491322.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

R, Rajesh. "Kakkot List- An Improved Variant of Skip List." In 2020 2nd International Conference on Advances in Computing, Communication Control and Networking (ICACCCN). IEEE, 2020. http://dx.doi.org/10.1109/icacccn51052.2020.9362974.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Crain, Tyler, Vincent Gramoli, and Michel Raynal. "No Hot Spot Non-blocking Skip List." In 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2013. http://dx.doi.org/10.1109/icdcs.2013.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alam, Sarwar, Humaira Kamal, and Alan Wagner. "A scalable distributed skip list for range queries." In the 23rd international symposium. ACM Press, 2014. http://dx.doi.org/10.1145/2600212.2600712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mandal, Subhrangsu, Sandip Chakraborty, and Sushanta Karmakar. "Deterministic 1–2 skip list in distributed system." In 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing (PDGC). IEEE, 2012. http://dx.doi.org/10.1109/pdgc.2012.6449835.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Skip lists"

1

KRISKOVICH, J. R. Master equipment list 500 CFM portable exhauster POR-005 skid C. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/797499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Skip lists' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography