Volume 13; Issue 2

Information Processing Letters

Volume 13; Issue 2
1

Using duality for the synthesis of an optimal algorithm involving matrix multiplication

Year:
1981
Language:
english
File:
PDF, 148 KB
english, 1981
2

Real-time queue operations in pure LISP

Year:
1981
Language:
english
File:
PDF, 546 KB
english, 1981
3

An adversary-based lower bound for sorting

Year:
1981
Language:
english
File:
PDF, 365 KB
english, 1981
4

The dynamic simulation of recursive and stack manipulating programs

Year:
1981
Language:
english
File:
PDF, 776 KB
english, 1981
5

On the average height of trees in digital search and dynamic hashing

Year:
1981
Language:
english
File:
PDF, 294 KB
english, 1981
6

Optimal choice of discriminators in a balanced k-d binary search tree

Year:
1981
Language:
english
File:
PDF, 448 KB
english, 1981
8

NTS grammars and church–rosser systems

Year:
1981
Language:
english
File:
PDF, 606 KB
english, 1981
9

A shared-memory scheme for coalesced hashing

Year:
1981
Language:
english
File:
PDF, 311 KB
english, 1981
10

Some remarks on one-pebble rectangular array acceptors

Year:
1981
Language:
english
File:
PDF, 493 KB
english, 1981
11

A note on ‘is shortest path problem not harder than matrix multiplication?’

Year:
1981
Language:
english
File:
PDF, 198 KB
english, 1981
12

Author's reply to S. Moran's note on the shortest path problem

Year:
1981
Language:
english
File:
PDF, 116 KB
english, 1981
13

The inclusion of DOL in multi-reset

Year:
1981
Language:
english
File:
PDF, 435 KB
english, 1981