Persistent data structure (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Persistent data structure" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

5haskell.org

low place

7,198^th place

3semanticscholar.org

11^th place

8^th place

3worldcat.org

5^th place

3infoq.com

6,158^th place

4,128^th place

3clojure.org

low place

2psu.edu

207^th place

136^th place

2web.archive.org

1^st place

2youtube.com

9^th place

13^th place

2github.com

383^rd place

320^th place

2facebook.github.io

low place

2redux.js.org

low place

2cmu.edu

1,564^th place

1,028^th place

2elm-lang.org

low place

1tau.ac.il

4,464^th place

4,468^th place

1handle.net

102^nd place

76^th place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1ghostarchive.org

32^nd place

21^st place

1epfl.ch

4,521^st place

4,877^th place

1cwi.nl

low place

1medium.com

551^st place

406^th place

1swannodette.github.io

low place

1princeton.edu

741^st place

577^th place

1kuleuven.be

4,725^th place

3,556^th place

1codecentric.de

low place

1kostyukov.net

low place

1c2.com

5,959^th place

6,263^rd place

arxiv.org

Liljenzin, Olle (2013). "Confluently Persistent Sets and Maps". arXiv:1301.3388. Bibcode:2013arXiv1301.3388L. {{cite journal}}: Cite journal requires |journal= (help)

c2.com

wiki.c2.com

"Immutable Objects And Garbage Collection". wiki.c2.com. Retrieved 2018-11-30.

clojure.org

"Clojure - Differences with other Lisps". clojure.org. Retrieved 2018-10-23.
"Clojure - Data Structures". clojure.org. Retrieved 2018-10-23.
"Clojure - Atoms". clojure.org. Retrieved 2018-11-30.

cmu.edu

link.cs.cmu.edu

Neil Sarnak; Robert E. Tarjan (1986). "Planar Point Location Using Persistent Search Trees" (PDF). Communications of the ACM. 29 (7): 669–679. doi:10.1145/6138.6151. S2CID 8745316. Archived from the original (PDF) on 2015-10-10. Retrieved 2011-04-06.

cs.cmu.edu

Chris Okasaki. "Purely Functional Data Structures (thesis)" (PDF). {{cite journal}}: Cite journal requires |journal= (help)

codecentric.de

blog.codecentric.de

"The Essence of Object-Functional Programming and the Practical Potential of Scala - codecentric AG Blog". codecentric AG Blog. 2015-08-31. Retrieved 2018-10-23.

cwi.nl

ir.cwi.nl

Steindorfer, Michael J.; Vinju, Jurgen J. (2015-10-23). "Optimizing hash-array mapped tries for fast and lean immutable JVM collections". ACM SIGPLAN Notices. 50 (10): 783–800. doi:10.1145/2814270.2814312. ISSN 0362-1340. S2CID 10317844.

doi.org

Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1986). "Making data structures persistent". Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. pp. 109–121. CiteSeerX 10.1.1.133.4630. doi:10.1145/12130.12142. ISBN 978-0-89791-193-1. S2CID 364871.
Conchon, Sylvain; Filliâtre, Jean-Christophe (2008), "Semi-persistent Data Structures", Programming Languages and Systems, Lecture Notes in Computer Science, vol. 4960, Springer Berlin Heidelberg, pp. 322–336, doi:10.1007/978-3-540-78739-6_25, ISBN 9783540787389
Brodal, Gerth Stølting; Makris, Christos; Tsichlas, Kostas (2006), "Purely Functional Worst Case Constant Time Catenable Sorted Lists", Algorithms – ESA 2006, Lecture Notes in Computer Science, vol. 4168, Springer Berlin Heidelberg, pp. 172–183, CiteSeerX 10.1.1.70.1493, doi:10.1007/11841036_18, ISBN 9783540388753
Lenhof, Hans-Peter; Smid, Michiel (1994). "Using persistent data structures for adding range restrictions to searching problems". RAIRO - Theoretical Informatics and Applications. 28 (1): 25–49. doi:10.1051/ita/1994280100251. hdl:11858/00-001M-0000-0014-AD4F-B. ISSN 0988-3754.
Neil Sarnak; Robert E. Tarjan (1986). "Planar Point Location Using Persistent Search Trees" (PDF). Communications of the ACM. 29 (7): 669–679. doi:10.1145/6138.6151. S2CID 8745316. Archived from the original (PDF) on 2015-10-10. Retrieved 2011-04-06.
Steindorfer, Michael J.; Vinju, Jurgen J. (2015-10-23). "Optimizing hash-array mapped tries for fast and lean immutable JVM collections". ACM SIGPLAN Notices. 50 (10): 783–800. doi:10.1145/2814270.2814312. ISSN 0362-1340. S2CID 10317844.

dx.doi.org

Lenhof, Hans-Peter; Smid, Michiel (1994). "Using persistent data structures for adding range restrictions to searching problems". RAIRO - Theoretical Informatics and Applications. 28 (1): 25–49. doi:10.1051/ita/1994280100251. hdl:11858/00-001M-0000-0014-AD4F-B. ISSN 0988-3754.

elm-lang.org

package.elm-lang.org

"core 1.0.0". package.elm-lang.org. Retrieved 2018-10-23.

elm-lang.org

"blog/blazing-fast-html-round-two". elm-lang.org. Retrieved 2018-10-23.

epfl.ch

infoscience.epfl.ch

Phil, Bagwell (2001). "Ideal Hash Trees". {{cite journal}}: Cite journal requires |journal= (help)

facebook.github.io

"Flux | Application Architecture for Building User Interfaces". facebook.github.io. Retrieved 2018-10-23.
"Immutable.js". facebook.github.io. Archived from the original on 2015-08-09. Retrieved 2018-10-23.

ghostarchive.org

BoostCon (2017-06-13), C++Now 2017: Phil Nash "The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++", archived from the original on 2021-12-21, retrieved 2018-10-22

github.com

"Persistent (immutable) collections for Java and Kotlin". github.com. Retrieved 2023-12-13.
"Immer". GitHub. 26 October 2021.

handle.net

hdl.handle.net

Lenhof, Hans-Peter; Smid, Michiel (1994). "Using persistent data structures for adding range restrictions to searching problems". RAIRO - Theoretical Informatics and Applications. 28 (1): 25–49. doi:10.1051/ita/1994280100251. hdl:11858/00-001M-0000-0014-AD4F-B. ISSN 0988-3754.

harvard.edu

ui.adsabs.harvard.edu

Liljenzin, Olle (2013). "Confluently Persistent Sets and Maps". arXiv:1301.3388. Bibcode:2013arXiv1301.3388L. {{cite journal}}: Cite journal requires |journal= (help)

haskell.org

hackage.haskell.org

"Data.List". hackage.haskell.org. Retrieved 2018-10-23.
"Data.Map.Strict". hackage.haskell.org. Retrieved 2018-10-23.
"Data.Set". hackage.haskell.org. Retrieved 2018-10-23.

haskell.org

"Haskell Language". www.haskell.org. Retrieved 2018-10-22.

wiki.haskell.org

"Performance/Arrays - HaskellWiki". wiki.haskell.org. Retrieved 2018-10-23.

infoq.com

"Are We There Yet?". InfoQ. Retrieved 2018-10-22.
"Keynote: The Value of Values". InfoQ. Retrieved 2018-10-23.
"The Last Frontier in Java Performance: Remove the Garbage Collector". InfoQ. Retrieved 2018-11-30.

kostyukov.net

"Vladimir Kostyukov - Posts / Slides". kostyukov.net. Retrieved 2018-11-30.

kuleuven.be

lirias.kuleuven.be

The Use of Mercury for the Implementation of a Finite Domain Solver - Henk Vandecasteele, Bart Demoen, Joachim Van Der Auwera, 1999

medium.com

Mora, Osmel (2016-07-18). "How to handle state in React". React Ecosystem. Retrieved 2018-10-23.

princeton.edu

press.princeton.edu

Djamboulian, Ara M.; Boizumault, Patrice (1993), The Implementation of Prolog - Patrice Boizumault, Princeton University Press, ISBN 9780691637709

psu.edu

citeseerx.ist.psu.edu

Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1986). "Making data structures persistent". Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. pp. 109–121. CiteSeerX 10.1.1.133.4630. doi:10.1145/12130.12142. ISBN 978-0-89791-193-1. S2CID 364871.
Brodal, Gerth Stølting; Makris, Christos; Tsichlas, Kostas (2006), "Purely Functional Worst Case Constant Time Catenable Sorted Lists", Algorithms – ESA 2006, Lecture Notes in Computer Science, vol. 4168, Springer Berlin Heidelberg, pp. 172–183, CiteSeerX 10.1.1.70.1493, doi:10.1007/11841036_18, ISBN 9783540388753

redux.js.org

"Read Me - Redux". redux.js.org. Retrieved 2018-10-23.
"Immutable Data - Redux". redux.js.org. Retrieved 2018-10-23.

semanticscholar.org

api.semanticscholar.org

Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1986). "Making data structures persistent". Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. pp. 109–121. CiteSeerX 10.1.1.133.4630. doi:10.1145/12130.12142. ISBN 978-0-89791-193-1. S2CID 364871.
Neil Sarnak; Robert E. Tarjan (1986). "Planar Point Location Using Persistent Search Trees" (PDF). Communications of the ACM. 29 (7): 669–679. doi:10.1145/6138.6151. S2CID 8745316. Archived from the original (PDF) on 2015-10-10. Retrieved 2011-04-06.
Steindorfer, Michael J.; Vinju, Jurgen J. (2015-10-23). "Optimizing hash-array mapped tries for fast and lean immutable JVM collections". ACM SIGPLAN Notices. 50 (10): 783–800. doi:10.1145/2814270.2814312. ISSN 0362-1340. S2CID 10317844.

swannodette.github.io

"Mori".

tau.ac.il

math.tau.ac.il

Kaplan, Haim (2001). "Persistent data structures". Handbook on Data Structures and Applications.

web.archive.org

Neil Sarnak; Robert E. Tarjan (1986). "Planar Point Location Using Persistent Search Trees" (PDF). Communications of the ACM. 29 (7): 669–679. doi:10.1145/6138.6151. S2CID 8745316. Archived from the original (PDF) on 2015-10-10. Retrieved 2011-04-06.
"Immutable.js". facebook.github.io. Archived from the original on 2015-08-09. Retrieved 2018-10-23.

worldcat.org

search.worldcat.org

Tiark, Bagwell, Philip Rompf (2011). RRB-Trees: Efficient Immutable Vectors. OCLC 820379112.{{cite book}}: CS1 maint: multiple names: authors list (link)
Lenhof, Hans-Peter; Smid, Michiel (1994). "Using persistent data structures for adding range restrictions to searching problems". RAIRO - Theoretical Informatics and Applications. 28 (1): 25–49. doi:10.1051/ita/1994280100251. hdl:11858/00-001M-0000-0014-AD4F-B. ISSN 0988-3754.
Steindorfer, Michael J.; Vinju, Jurgen J. (2015-10-23). "Optimizing hash-array mapped tries for fast and lean immutable JVM collections". ACM SIGPLAN Notices. 50 (10): 783–800. doi:10.1145/2814270.2814312. ISSN 0362-1340. S2CID 10317844.

youtube.com

BoostCon (2017-06-13), C++Now 2017: Phil Nash "The Holy Grail!? A Persistent Hash-Array-Mapped Trie for C++", archived from the original on 2021-12-21, retrieved 2018-10-22
ClojureTV (2013-01-07), Extreme Cleverness: Functional Data Structures in Scala - Daniel Spiewak, retrieved 2018-10-23^{[dead YouTube link]}