Sorting Jordan sequences in linear time using level-linked search trees
Rosenstiehl, Pierre ; Hoffmann, K. ; Mehlhorn, Kurt ; Tarjan, R. E.
HAL, hal-00259775 / Harvested from HAL
Publié le : 1986-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
@article{hal-00259775,
     author = {Rosenstiehl, Pierre and Hoffmann, K. and Mehlhorn, Kurt and Tarjan, R. E.},
     title = {Sorting Jordan sequences in linear time using level-linked search trees},
     journal = {HAL},
     volume = {1986},
     number = {0},
     year = {1986},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00259775}
}
Rosenstiehl, Pierre; Hoffmann, K.; Mehlhorn, Kurt; Tarjan, R. E. Sorting Jordan sequences in linear time using level-linked search trees. HAL, Tome 1986 (1986) no. 0, . http://gdmltest.u-ga.fr/item/hal-00259775/