• Corpus ID: 60324038

The art of computer programming: sorting and searching (volume 3)

  title={The art of computer programming: sorting and searching (volume 3)},
  author={Donald Ervin Knuth},
Apparatus for supporting different nets for various sporting purposes including interengaging tubular rods which are arranged to interconnect and have ground engaging portions suitable to be useful for the several functions. The frame of the net support structure includes a pair of spaced apart, vertically extending posts; each of the posts is divided into a pair of telescoping sections. An upper horizontally extending multi-section member extends and connects the upper end of the vertical… 
A representation for linear lists with movable fingers
The structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts, but is substantially simpler and may be practical for lists of moderate size.
Simulating the Bitonic Sort on a 2D-mesh with P Systems
This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log N). When applying it to the 2D mesh architecture, two indexing functions are
Hierarchical representations of collections of small rectangles
A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the
Parallel space-filling curve generation
Initial results have shown the algorithm can generate curves quickly and scales well up to thousands of processors, as well as creating traversal order indices while each processor generates a curve over a subset of the domain.
Plane-sweep algorithms for intersecting geometric figures
Algorithms in computational geometry are of increasing importance in computer-aided design, for example, in the layout of integrated circuits. The efficient computation of the intersection of several
An Efficient Combinatorial Algorithm for Optimal Compression of a Polyline with Segments and Arcs
  • A. Gribov
  • Computer Science
    2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR)
  • 2017
An improvement to the dynamic programming approach is described by reducing the amount of arc fitting necessary to find the optimal solution of polyline compression by skipping as many steps as possible without affecting the inference in any way.
The cube-connected cycles: a versatile network for parallel computation
This work describes in detail how to program the cube-connected cycles for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.
Dynamic monotone priorities on planar sets
  • M. FischerM. Paterson
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
A monotonic priority set is a new data structure which supports maximum-finding and deletions over a set of weighted points in the plane and an efficient implementation is presented and two main applications are described.
Storage reorganization techniques for matrix computation in a paging environment
The procedure TANGENTS accepts as its inputs a point p and a convex polygon P, given as a sequence of vertices beginning with m, which is represented by means of an A VL tree T(P) modified so that each vertex Vi stores a pointer NEXT to the address of its successor Vi+l on the boundary of P.
Parallel Construction and Searches of Digital Trees
This project is compare the performance of different tree varieties and exhaustive search in a parallel setting and makes comparisons of three such search methods.