From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Simple Confluently Persistent Catenable Lists (Extended Abstract).

H. Kaplan, C. Okasaki, и R. Tarjan. SWAT, том 1432 из Lecture Notes in Computer Science, стр. 119-130. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Simple Confluently Persistent Catenable Lists (Extended Abstract).H. Kaplan, C. Okasaki, и R. Tarjan. SWAT, том 1432 из Lecture Notes in Computer Science, стр. 119-130. Springer, (1998)Theoretical Pearls.C. Okasaki. J. Funct. Program., 13 (4): 815-822 (2003)Safe-for-Space Threads in Standard ML.E. Biagioni, K. Cline, P. Lee, C. Okasaki, и C. Stone. High. Order Symb. Comput., 11 (2): 209-225 (1998)Red-Black Trees in a Functional Setting.C. Okasaki. J. Funct. Program., 9 (4): 471-477 (1999)Three Algorithms on Braun Trees.C. Okasaki. J. Funct. Program., 7 (6): 661-666 (1997)Catenable Double-Ended Queues.C. Okasaki. ICFP, стр. 66-74. ACM, (1997)SIGPLAN Notices 32(8), August 1997.Call-by-Need and Continuation-Passing Style.C. Okasaki, P. Lee, и D. Tarditi. LISP Symb. Comput., 7 (1): 57-82 (1994)Simple Confluently Persistent Catenable Lists.H. Kaplan, C. Okasaki, и R. Tarjan. SIAM J. Comput., 30 (3): 965-977 (2000)The Role of Lazy Evaluation in Amortized Data Structures.C. Okasaki. ICFP, стр. 62-72. ACM, (1996)SIGPLAN Notices 31(6), June 1996.Alternatives to two classic data structures.C. Okasaki. SIGCSE, стр. 162-165. ACM, (2005)