Skip list (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Skip list" in English language version.

Last modified: 17:28:43, 7 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

88doi.org

2^nd place

66semanticscholar.org

15^th place

8^th place

33github.com

380^th place

337^th place

33umd.edu

1,356^th place

1,172^nd place

21uwaterloo.ca

3,649^th place

2,434^th place

11unicamp.br

4,289^th place

7,541^st place

11unc.edu

1,577^th place

913^th place

11yale.edu

559^th place

389^th place

11apache.org

4,440^th place

3,599^th place

11lwn.net

4,372^nd place

3,269^th place

11lkml.org

low place

11qt-project.org

low place

11discord.com

low place

11tau.ac.il

3,866^th place

3,877^th place

11yorku.ca

3,804^th place

2,412^th place

11chalmers.se

low place

11espacenet.com

950^th place

813^th place

apache.org (Global: 4,440^th place; English: 3,599^th place)

apr.apache.org

Apache Portable Runtime APR 1.6 documentation

chalmers.se (Global: low place; English: low place)

cse.chalmers.se

Sundell, H. K.; Tsigas, P. (2004). "Scalable and lock-free concurrent dictionaries" (PDF). Proceedings of the 2004 ACM symposium on Applied computing - SAC '04. p. 1438. doi:10.1145/967900.968188. ISBN 978-1-58113-812-2. S2CID 10393486.

discord.com (Global: low place; English: low place)

Nowack, Matt. "Using Rust to Scale Elixir for 11 Million Concurrent Users". Discord Blog. Retrieved 23 July 2023.

doi.org (Global: 2^nd place; English: 2^nd place)

Pugh, W. (1990). "Skip lists: A probabilistic alternative to balanced trees" (PDF). Communications of the ACM. 33 (6): 668–676. doi:10.1145/78973.78977. S2CID 207691558.
Bethea, Darrell; Reiter, Michael K. (September 21–23, 2009). Data Structures with Unpredictable Timing (PDF). ESORICS 2009, 14th European Symposium on Research in Computer Security. Saint-Malo, France. pp. 456–471, §4 "Skip Lists". doi:10.1007/978-3-642-04444-1_28. ISBN 978-3-642-04443-4.
Sen, Sandeep (1991). "Some observations on skip lists". Information Processing Letters. 39 (4): 173–176. doi:10.1016/0020-0190(91)90175-H.
Shavit, N.; Lotan, I. (2000). "Skiplist-based concurrent priority queues" (PDF). Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000. p. 263. doi:10.1109/IPDPS.2000.845994. ISBN 978-0-7695-0574-9. S2CID 8664407.
Sundell, H.; Tsigas, P. (2003). "Fast and lock-free concurrent priority queues for multi-thread systems". Proceedings International Parallel and Distributed Processing Symposium. p. 11. doi:10.1109/IPDPS.2003.1213189. ISBN 978-0-7695-1926-5. S2CID 20995116.
Fomitchev, Mikhail; Ruppert, Eric (2004). Lock-free linked lists and skip lists (PDF). Proc. Annual ACM Symp. on Principles of Distributed Computing (PODC). pp. 50–59. doi:10.1145/1011767.1011776. ISBN 1-58113-802-4.
Bajpai, R.; Dhara, K. K.; Krishnaswamy, V. (2008). "QPID: A Distributed Priority Queue with Item Locality". 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications. p. 215. doi:10.1109/ISPA.2008.90. ISBN 978-0-7695-3471-8. S2CID 15677922.
Sundell, H. K.; Tsigas, P. (2004). "Scalable and lock-free concurrent dictionaries" (PDF). Proceedings of the 2004 ACM symposium on Applied computing - SAC '04. p. 1438. doi:10.1145/967900.968188. ISBN 978-1-58113-812-2. S2CID 10393486.

espacenet.com (Global: 950^th place; English: 813^th place)

worldwide.espacenet.com

US patent 7937378

github.com (Global: 380^th place; English: 337^th place)

Cyrus IMAP server. skiplist source file
"Redis ordered set implementation". GitHub.
"MemTable". GitHub. Retrieved 2023-12-12.

lkml.org (Global: low place; English: low place)

"LKML: Con Kolivas: [ANNOUNCE] Multiple Queue Skiplist Scheduler version 0.120". lkml.org. Retrieved 2017-05-11.

lwn.net (Global: 4,372^nd place; English: 3,269^th place)

LWN's article

qt-project.org (Global: low place; English: low place)

QMap

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Pugh, W. (1990). "Skip lists: A probabilistic alternative to balanced trees" (PDF). Communications of the ACM. 33 (6): 668–676. doi:10.1145/78973.78977. S2CID 207691558.
Munro, J. Ian; Papadakis, Thomas; Sedgewick, Robert (1992). "Deterministic skip lists" (PDF). Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (SODA '92). Orlando, Florida, USA: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. pp. 367–375. S2CID 7477119.
Shavit, N.; Lotan, I. (2000). "Skiplist-based concurrent priority queues" (PDF). Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000. p. 263. doi:10.1109/IPDPS.2000.845994. ISBN 978-0-7695-0574-9. S2CID 8664407.
Sundell, H.; Tsigas, P. (2003). "Fast and lock-free concurrent priority queues for multi-thread systems". Proceedings International Parallel and Distributed Processing Symposium. p. 11. doi:10.1109/IPDPS.2003.1213189. ISBN 978-0-7695-1926-5. S2CID 20995116.
Bajpai, R.; Dhara, K. K.; Krishnaswamy, V. (2008). "QPID: A Distributed Priority Queue with Item Locality". 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications. p. 215. doi:10.1109/ISPA.2008.90. ISBN 978-0-7695-3471-8. S2CID 15677922.
Sundell, H. K.; Tsigas, P. (2004). "Scalable and lock-free concurrent dictionaries" (PDF). Proceedings of the 2004 ACM symposium on Applied computing - SAC '04. p. 1438. doi:10.1145/967900.968188. ISBN 978-1-58113-812-2. S2CID 10393486.

tau.ac.il (Global: 3,866^th place; English: 3,877^th place)

cs.tau.ac.il

Shavit, N.; Lotan, I. (2000). "Skiplist-based concurrent priority queues" (PDF). Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000. p. 263. doi:10.1109/IPDPS.2000.845994. ISBN 978-0-7695-0574-9. S2CID 8664407.

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

drum.lib.umd.edu

William Pugh. "A skip list cookbook". 1990. Section 3.4 Linear List Operations .
Pugh, William (April 1989). Concurrent Maintenance of Skip Lists (PS, PDF) (Technical report). Dept. of Computer Science, U. Maryland. CS-TR-2222.

ftp.cs.umd.edu

Pugh, W. (1990). "Skip lists: A probabilistic alternative to balanced trees" (PDF). Communications of the ACM. 33 (6): 668–676. doi:10.1145/78973.78977. S2CID 207691558.

unc.edu (Global: 1,577^th place; English: 913^th place)

cs.unc.edu

Bethea, Darrell; Reiter, Michael K. (September 21–23, 2009). Data Structures with Unpredictable Timing (PDF). ESORICS 2009, 14th European Symposium on Research in Computer Security. Saint-Malo, France. pp. 456–471, §4 "Skip Lists". doi:10.1007/978-3-642-04444-1_28. ISBN 978-3-642-04443-4.

unicamp.br (Global: 4,289^th place; English: 7,541^st place)

ic.unicamp.br

Munro, J. Ian; Papadakis, Thomas; Sedgewick, Robert (1992). "Deterministic skip lists" (PDF). Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (SODA '92). Orlando, Florida, USA: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. pp. 367–375. S2CID 7477119.

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

cs.uwaterloo.ca

Papadakis, Thomas (1993). Skip Lists and Probabilistic Analysis of Algorithms (PDF) (Ph.D.). University of Waterloo.

yale.edu (Global: 559^th place; English: 389^th place)

cs.yale.edu

Shah, Gauri (2003). Distributed Data Structures for Peer-to-Peer Systems (PDF) (Ph.D. thesis). Yale University.

yorku.ca (Global: 3,804^th place; English: 2,412^th place)

cse.yorku.ca

Fomitchev, Mikhail; Ruppert, Eric (2004). Lock-free linked lists and skip lists (PDF). Proc. Annual ACM Symp. on Principles of Distributed Computing (PODC). pp. 50–59. doi:10.1145/1011767.1011776. ISBN 1-58113-802-4.

Skip list (English Wikipedia)

apache.org (Global: 4,440th place; English: 3,599th place)

apr.apache.org

chalmers.se (Global: low place; English: low place)

cse.chalmers.se

discord.com (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

espacenet.com (Global: 950th place; English: 813th place)

worldwide.espacenet.com

github.com (Global: 380th place; English: 337th place)

lkml.org (Global: low place; English: low place)

lwn.net (Global: 4,372nd place; English: 3,269th place)

qt-project.org (Global: low place; English: low place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

tau.ac.il (Global: 3,866th place; English: 3,877th place)

cs.tau.ac.il

umd.edu (Global: 1,356th place; English: 1,172nd place)

drum.lib.umd.edu

ftp.cs.umd.edu

unc.edu (Global: 1,577th place; English: 913th place)

cs.unc.edu

unicamp.br (Global: 4,289th place; English: 7,541st place)

ic.unicamp.br

uwaterloo.ca (Global: 3,649th place; English: 2,434th place)

cs.uwaterloo.ca

yale.edu (Global: 559th place; English: 389th place)

cs.yale.edu

yorku.ca (Global: 3,804th place; English: 2,412th place)

cse.yorku.ca

apache.org (Global: 4,440^th place; English: 3,599^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

espacenet.com (Global: 950^th place; English: 813^th place)

github.com (Global: 380^th place; English: 337^th place)

lwn.net (Global: 4,372^nd place; English: 3,269^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

tau.ac.il (Global: 3,866^th place; English: 3,877^th place)

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

unc.edu (Global: 1,577^th place; English: 913^th place)

unicamp.br (Global: 4,289^th place; English: 7,541^st place)

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

yale.edu (Global: 559^th place; English: 389^th place)

yorku.ca (Global: 3,804^th place; English: 2,412^th place)