Daniel Leven, Micha Sharir An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:2, pp:192-215 [Journal]
Boris Pittel Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:2, pp:236-249 [Journal]
Thomas Lengauer Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:2, pp:260-284 [Journal]