@inproceedings{8c5e79d7c3704b6098e0e349b963c1ca,

title = "Fully persistent lists with catenation",

author = "Driscoll, {James R.} and Sleator, {Daniel D.K.} and Tarjan, {Robert E.}",

note = "Funding Information: ~artment of Mathematics and Computer Science, Dartmouth College, Hanover, NH 03755. Research supported in part by the National Science Foundation under Grant No. CCR-8809573, and by DARPA as monitored by the Air Force Office of Scientific Research under Grant No. AFOSR-90-0292. t School of Computer Science, Carnegie Mellon uniwx+, Pittsburgh, PA 15213. Research supported in part by the National Science Foundation under grant CCR-8658139, and by DIMACS, a National Science Foundation Science and Technology center, Grant No. NSF-STC88-09648. 1computer Science Department, Princeton University, ton, NJ 08544 and NEC Research Institute, Princeton, Research at Princeton University partially supported by the Office of Naval Research, Contract No. NOO014-87-K-0467, and by DIMACS.; 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",

year = "1991",

month = mar,

day = "1",

language = "English (US)",

isbn = "0897913760",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "89--99",

booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",

}