Sorting Jordan sequences in linear time using level-linked search trees

@article{citeulike:2730432, address = {San Diego, CA, USA}, author = {Hoffmann, Kurt and Mehlhorn, Kurt and Rosenstiehl, Pierre and Tarjan, Robert E. }, citeulike-article-id = {2730432}, doi = {http://dx.doi.org/10.1016/S0019-9958(86)80033-X}, issn = {0019-9958}, journal = {Inf. Control}, keywords = {algorithms, combinatorics, data\_structure}, number = {1-3}, pages = {170--184}, posted-at = {2008-04-28 17:23:00}, priority = {2}, publisher = {Academic Press Professional, Inc.}, title = {Sorting Jordan sequences in linear time using level-linked search trees}, url = {http://dx.doi.org/10.1016/S0019-9958(86)80033-X}, volume = {68}, year = {1986} }

TY - JOUR ID - citeulike:2730432 L3 - citeulike-article-id:2730432 TI - Sorting Jordan sequences in linear time using level-linked search trees JF - Inf. Control VL - 68 IS - 1-3 SP - 170 EP - 184 AD - San Diego, CA, USA PB - Academic Press Professional, Inc. SN - 0019-9958 KW - algorithms KW - combinatorics KW - data_structure AU - Hoffmann, Kurt AU - Mehlhorn, Kurt AU - Rosenstiehl, Pierre AU - Tarjan, Robert PY - 1986/// UR - http://dx.doi.org/10.1016/S0019-9958(86)80033-X ER -