Showing papers in "Information Processing Letters in 1984"

TL;DR: The determinant, characteristic polynomial and adjoint over an arbitrary commutative ring with unity can be computed by a circuit with size O(n3.496) and depth O(log2n).

TL;DR: It is shown that the problem of finding a minimum cardinality dominating set is NP-complete for split graphs and bipartite graphs.

TL;DR: A binary Byzantine agreement algorithms can be extended to produce a multivalued Byzantine agreement algorithm that is cheaper than previously published algorithms when the cost of transmitting values from the multivaluing domain is significant.

TL;DR: An O(n) algorithm is presented for the Linear Multiple Choice Knapsack Problem and its d-dimensional generalization which is based on Megiddo's (1982) algorithm for linear programming and a certain type of convex programming problems which are common in geometric location models.

TL;DR: Il existe deux approches du temps de modelisation des operations, la premiere methode associe le temps aux transitions tandis que la seconde associes le Temps au lieu.

TL;DR: The usual backtrack algorithm for the decision problem of K-colorability of a graph G is considered, and it is shown that the algorithm operates in average time that is O(1), as the number of vertices of G approaches infinity.

TL;DR: Le probleme de calcul du mouvement de gestion pour un systeme robotise simple a ete etudie plus recemment a partir d'un point de vue algorithmique.

TL;DR: A simple derivation of a general solution to the problem of detecting the termination of a distributed computation is presented.

TL;DR: On determine les bornes superieures du volume de donnees tests necessaire pour satisfaire chaque critere, and par consequent la difficulte relative pour satisfaires chacun de ces criteres.

TL;DR: The physical design of database organizations is a difficult and complex task and the need for the development of automated tools to aid in this process is pointed out.

TL;DR: The complexity of any incremental convex hull algorithm in Rd is shown to be Ω(n [ (d+1) 2 ] ) for n points and constant d.

TL;DR: Presentation d'un algorithme pour generer une liste S 1, S 2,...,Sm (m=( k n )) de sous-ensembles de taille k d' un ensemble de tailles n.

TL;DR: Un algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de transmissions connues, mais le systeme binaire reste certainement le mieux adapte aux applications informatiques.

TL;DR: It is shown that for Petri nets in general, ∞- fairness equals k-fairness for all k, and that for a large subclass of nets, (k+1)-fairness equals (k- Fairness) for allk.

TL;DR: En considerant le temps d'execution et the facilite de codage, on recommande la structure de donnees complete, si l'espace le permet, plutot que the structure compacte.

TL;DR: The algorithm is developed by first finding an intuitively clear divide-and-conquer algorithm with sublinear workspace, and then removing the workspace.

TL;DR: A parallel algorithm is presented for selecting the kth smallest element of a totally ordered (but not sorted) set of n elements, 1⩽k ⩽n, for an optimal total cost of O(n).

TL;DR: If the endpoints of these n arcs are given, it is shown that O(n log n) is both sufficient and necessary for solving the minimum cover problem.

TL;DR: Dans cet article, on considere le probleme de minimisation de la longueur de l'horaire dans des systemes dans lesquels quelques tâches peuvent etre traitees en parallele par deux processeurs.

TL;DR: Applied to the structural tensor of n × n matrix multiplication this criterion yields a 3 2 n 2 + 1 2 n − 1 lower bound on its border rank.

TL;DR: An Ω(n log n) lower bound on the complexity of deciding whether there is a Manhattan path between two given segments is proved, under the linear decision tree model.

TL;DR: On souligne des preuves formelles de la concavite de rendement and de the convexite du temps de reponse dans des rapports techniques.

TL;DR: These properties assure good performance in two linear-time algorithms for five-coloring planar graphs, and a newlinear-time algorithm, based on a third property, is presented.

TL;DR: It is shown here that there exist sets S of arbitrary cardinality in d-space, d ⩾ 5, for which d 2 + 1 open regions together contain at least n − d 2 points of S, in any partition by d intersecting hyperplanes.

TL;DR: A new fast implementation of the Sardinas-Patterson-Even test for unique decipherability is presented, based on the structure of a Pattern Matching Machine.

TL;DR: Proposition d'une methode operationnelle pour l'evaluation du cout pour l’accession aux tuples d’une relation via un index through un index.

TL;DR: This time-and space-optimal algorithm to compute the edges of the disjoint polygons, that is, the contour, uses the scan-line paradigm as in two previous approaches to this problem for rectangles, but requires a simpler data structure.