Skip to search formSkip to main contentSkip to account menu

Skip list

Known as: Skiplist, Skiplists, Jump list 
In computer science, a skip list is a data structure that allows fast search within an ordered sequence of elements. Fast search is made possible by… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
Bloom filterComputer scienceData structureDictionary of Algorithms and Data Structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Comprehend DeepWalk as Matrix Factorization
Word2vec, as an efficient tool for learning vector representation of words has shown its effectiveness in many natural language… 
Review
2015
Review
2015
RUSSE: The First Workshop on Russian Semantic Similarity
The paper gives an overview of the Russian Semantic Similarity Evaluation (RUSSE) shared task held in conjunction with the… 
Review
2011
Review
2011
중국유학생의 한식 메뉴 선호도 및 기숙사 급식만족도 :목포대 일부 재학생을 대상으로
The preference and satisfaction for Korean food by Chinese students studying at Mokpo National University of Korea were surveyed… 
Review
2009
Review
2009
Where Are They Now? Results of a Career Survey of Library and Information Science Graduates
This paper provides an overview of Workforce Issues in Library and Information Science 1 (WILIS 1), a large scale retrospective… 
2005
2005
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems
Skip Lists were first used as data structures for their simple implementation and optimal update and search time. Goodrich [7][8… 
2004
2004
Automatic Language-Independent Induction of Gazetteer Lists
Adaptation of existing Information Extraction (IE) systems to new languages and domains is the focus of much current research… 
2003
2003
Shot type classification by dominant color for sports video segmentation and summarization
This paper introduces a novel generic framework for sports video processing by using the common feature of most sports: the… 
2002
2002
Occurrence and Substring Heuristics for i-Matching
We consider a version of pattern matching useful in processing large musical data: δ-matching, which consists in finding matches… 
1993
1993
Supporting Pascal Programming with an On-Line Template Library and Case Studies
Abstract We propose a template library as a good representation of programming knowledge, and programming case studies as part of… 
1993
1993
Should Decision Trees be Learned from Examples of from Decision Rules?
A standard method for determining decision trees is to learn them from examples. A disadvantage of this approach is that once a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)