src/HOL/Data_Structures/document/root.bib
changeset 67966 f13796496e82
parent 62706 49c6a54ceab6
child 69133 22fe10b4c0c6
equal deleted inserted replaced
67965:aaa31cd0caef 67966:f13796496e82
       
     1 @techreport{Adams-TR92,author="Stephen Adams",
       
     2 title="Implementing Sets Efficiently in a Functional Language",
       
     3 institution="University of Southampton, Department of Electronics and Computer Science",number="CSTR 92-10",year=1992}
       
     4 
       
     5 @article{Adams-JFP93,
       
     6   author    = {Stephen Adams},
       
     7   title     = {Efficient Sets - {A} Balancing Act},
       
     8   journal   = {J. Funct. Program.},
       
     9   volume    = {3},
       
    10   number    = {4},
       
    11   pages     = {553--561},
       
    12   year      = {1993}
       
    13 }
       
    14 
     1 @inproceedings{Andersson-WADS93,author={Arne Andersson},
    15 @inproceedings{Andersson-WADS93,author={Arne Andersson},
     2 title={Balanced search trees made simple},pages={60--71},year=1993,
    16 title={Balanced search trees made simple},pages={60--71},year=1993,
     3 booktitle={Algorithms and Data Structures (WADS '93)},
    17 booktitle={Algorithms and Data Structures (WADS '93)},
     4 series={LNCS},volume={709},publisher={Springer}}
    18 series={LNCS},volume={709},publisher={Springer}}
       
    19 
       
    20 @inproceedings{BlellochFS-SPAA16,
       
    21   author    = {Guy E. Blelloch and
       
    22                Daniel Ferizovic and
       
    23                Yihan Sun},
       
    24   title     = {Just Join for Parallel Ordered Sets},
       
    25   booktitle = {{SPAA}},
       
    26   pages     = {253--264},
       
    27   publisher = {{ACM}},
       
    28   year      = {2016}
       
    29 }
     5 
    30 
     6 @phdthesis{Crane72,author={Clark A. Crane},
    31 @phdthesis{Crane72,author={Clark A. Crane},
     7 title={Linear Lists and Prorty Queues as Balanced Binary Trees},
    32 title={Linear Lists and Prorty Queues as Balanced Binary Trees},
     8 school={Computer Science Department, Stanford University},year=1972}
    33 school={Computer Science Department, Stanford University},year=1972}
     9 
    34