Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,180,683 papers from all fields of science
Search
Sign In
Create Free Account
Skip list
Known as:
Skiplist
, Skiplists
, Jump list
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Bloom filter
Computer science
Data structure
Dictionary of Algorithms and Data Structures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Short-Text Topic Modeling via Non-negative Matrix Factorization Enriched with Local Word-Context Correlations
Tian Shi
,
Kyeongpil Kang
,
J. Choo
,
Chandan K. Reddy
The Web Conference
2018
Corpus ID: 3341803
Being a prevalent form of social communications on the Internet, billions of short texts are generated everyday. Discovering…
Expand
Highly Cited
2015
Highly Cited
2015
An HEVC-Compliant Perceptual Video Coding Scheme Based on JND Models for Variable Block-Sized Transform Kernels
Jae-il Kim
,
S. Bae
,
Munchurl Kim
IEEE transactions on circuits and systems for…
2015
Corpus ID: 2460823
In this paper, a High Efficiency Video Coding (HEVC)-compliant perceptual video coding (PVC) scheme is introduced based on just…
Expand
Review
2004
Review
2004
DEVELOPING A PROTOCOL FOR THE CONVERSION OF RANK-BASED TAXON NAMES TO PHYLOGENETICALLY DEFINED CLADE NAMES, AS EXEMPLIFIED BY TURTLES
W. Joyce
,
J. F. Parham
,
J. Gauthier
2004
Corpus ID: 15078337
Abstract We present a rank-free phylogenetic nomenclature for 25 well-established ancient clades of living turtles. This is the…
Expand
Highly Cited
2004
Highly Cited
2004
A General Model for Authenticated Data Structures
C. Martel
,
Glen Nuckolls
,
Premkumar T. Devanbu
,
Michael Gertz
,
April Kwong
,
S. Stubblebine
Algorithmica
2004
Corpus ID: 9525091
Abstract Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is…
Expand
Highly Cited
2004
Highly Cited
2004
Scalable and lock-free concurrent dictionaries
H. Sundell
,
P. Tsigas
ACM Symposium on Applied Computing
2004
Corpus ID: 10393486
We present an efficient and practical lock-free implementation of a concurrent dictionary that is suitable for both fully…
Expand
Highly Cited
2004
Highly Cited
2004
Lock-free linked lists and skip lists
M. Fomitchev
,
E. Ruppert
ACM SIGACT-SIGOPS Symposium on Principles of…
2004
Corpus ID: 5554798
Lock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and…
Expand
Highly Cited
2002
Highly Cited
2002
Electricity used by office equipment and network equipment in the US
K. Kawamoto
,
J. Koomey
,
+4 authors
A. Meier
2002
Corpus ID: 110909470
Highly Cited
2001
Highly Cited
2001
Measurement and analysis of atmospheric concentrations of isoprene and its reaction products in central Texas
C. Wiedinmyer
,
S. Friedfeld
,
+4 authors
David T. Allen
2001
Corpus ID: 59148039
Highly Cited
1990
Highly Cited
1990
A skip list cookbook
W. Pugh
1990
Corpus ID: 62665394
Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice…
Expand
Highly Cited
1989
Highly Cited
1989
Incremental computation via function caching
W. Pugh
,
T. Teitelbaum
ACM-SIGACT Symposium on Principles of Programming…
1989
Corpus ID: 18711713
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)
ACCEPT & CONTINUE