External Links

    Journal: BIT

    Volume 31, Issue 4

    558 -- 565Frank Bartling, Klaus Hinrichs. Probabilistic Analysis of an Algorithm for Solving the ::::k::::-Dimensional All-Nearest-Neighbors Problem by Projection
    566 -- 575C. Y. Chen, H. F. Lin. Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files
    576 -- 590Jaana Eloranta. Minimizing the Number of Transitions with Respect to Observation Equivalence
    591 -- 597Andrzej Lingas. An Unfeasible Matching Problem
    598 -- 606Kim-Heng Teo, Tai-Ching Tuan. A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths
    runs on