Showing papers in "Information Processing Letters in 1980"

TL;DR: This work considers the following two dimensional bin packing problem: Given a set of rectangular pieces, find a way to pack the pieces into a bin of width 1, bounded below but not above, so as to minimize the height to which the pieces fill the bin.

TL;DR: This work restates that no on-line bin pack,ng algorithm can have a performance ratio better than 9.7, and obtains a slightly impruvru iower bound of 1.536-s.

TL;DR: This note shows that it is not possible to design a complete binary tree layout with area O(n) and all leaves on the boundary, if the boundary of the chip is a convex plane curve and the leaves onThe boundary are separated by at least unit distance, then area of order nlogn is necessary just to accomodate all the wires.

TL;DR: In the Towers of Hanoi Problem there are three pegs A, B and C, and n (n 3 1) disks of different diameters, and there is a simple recursive solution, which is used by many texts as an example of recursive programming.

TL;DR: Several methods of implementing a queue in Pure LISP are presented, including a technique to distribute the reversal of a list over a number of operations leads to a real-time queue implementation.

TL;DR: The following questions were investigated: if C is the complexity of the convex hull algorithm for X1, .

TL;DR: Two different pebble games that are yed on directed ‘acyclic graphs’ that are studied in the past and one game uses ek pebbles only and is called the black pebbling game.

TL;DR: In the complexity theory of geometric configurations one encounters a fair number of problems for which a very efficient static solution is known, but no alternative to complete reconstruction seems to come to mind when the authors wish to insert or delete even a single point.

TL;DR: Be a Boolean CNF-formula with at most three literals per ‘Or-clause’ Ci (1 < i < q), transform each Ci into a polynomial Qi in xl, using the transformation X -+ 1 A for every complemented Boolean ‘And-clusa’ A.

TL;DR: Several universal classes of hash functions are exhibited, and a slightly different definition is given which leads to collections ofHash functions which are, in at least one sense, optimal.