Information Processing Letters

Title Publication Date Language Citations
How many polynomials can be approximated faster than they can be evaluated?1981/04/01English
On the angle restricted nearest neighbor problem1990/03/01English
The order of Appel's algorithm1992/03/01English
Periodic string division generated by deterministic l systems1990/05/01English
Editorial Board1979/01/01English
Author index volume 30 (1989)1989/03/01English
An analysis of the Karp-Rabin string matching algorithm1990/05/01English
Load imbalance in DASD dynamic reconnection1988/07/01English
On similarity of polynomial configurations1993/10/01English
Implementation of a wait-free synchronization primitive that solves n-process consensus1989/07/01English
Author index1979/12/01English
Efficient expansion of factored expressions1990/06/01English
Reply to the paper “the numerical instability of Bini's algorithm”1982/05/01English
Two-dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW as CRCW model1990/10/01English
An efficient implementation of priority queues using fixed-sized systolic coprocessors1993/06/01English
On Cahit's result on graceful permutations1978/06/01English
An improved data-dependency-based backtracking scheme for prolog1989/05/01English
On the complexity of the recognition of parallel 2D-image languages1991/06/01English
Formal correctness proofs of a nondeterministic program1982/04/01English
Two remarks on a convex hull algorithm1979/02/01English
On the generation of compilers from language definitions1980/03/01English
On process assignment in parallel computing1988/09/01English
A faster algorithm for the maximum weighted tardiness problem1990/10/01English
An optimal algorithm for finding the edge visibility polygon under limited visibility1995/03/01English
Bounded ordered dictionaries in O(log log N) time and O(n) space1990/08/01English
Embedding meshes of trees into deBruijn graphs1992/10/01English
One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages1990/10/01English
A note on the construction of the data structure “deap”1989/06/01English
A note on weak operator precedence grammars1977/12/01English
An efficient algorithm for multiple simultaneous broadcasts in the hypercube1993/07/01English