Information Processing Letters

Title Publication Date Language Citations
The complexity of incremental convex hull algorithms in Rd1984/11/01English
Path for AND-parallel execution of logic programs1994/11/01English
The edge Hamiltonian path problem is NP-complete1981/01/01English
A correction to “An optimal algorithm to compute all the covers of a string”1995/04/01English
Universal traversal sequences for expander graphs1993/05/01English
A self-stabilizing algorithm for maximal matching1992/08/01English
Deterministic one-way simulation of two-way real-time cellular automata and its related problems1982/06/01English
On spanning trees with restricted degrees2000/03/01English
On linear context-free languages and one-way multihead automata1984/11/01English
Fixed points of increasing functions1990/04/01English
A proof of the substitution lemma in de Bruijn's notation1993/05/01English
An optimal demand prepaging algorithm1978/04/01English
A new solution for Thue's problem1995/05/01English
An agent calculus with simple actions where the enabling and disabling are derived operators1991/11/01English
A generalization of two code ordering optimizations1983/02/01English
The parallel complexity of finding a blocking flow in a 3-layer network1989/05/01English
On a compaction theorem of Ragde1992/10/01English
The inclusion of DOL in multi-reset1981/11/01English
Optimal superprimitivity testing for strings1991/07/01English
On the agreement of many trees1995/09/01English
The weighted perfect domination problem1990/09/01English
Acknowledgment1988/02/01English
Optimal policy for database backup and recovery1981/04/01English
An adaptive algorithm for finding a covering hypersphere1989/10/01English
A new approach to optimal cache scheduling1989/03/01English
An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals1990/08/01English
Object-oriented interaction in resource constrained scheduling1990/10/01English
A new class of generalized almost perfect nonlinear monomial functions2024/02/01English
On reversing arcs to improve arc-connectivity2024/02/01English
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard2024/02/01English