Volume 8; Issue 5

Information Processing Letters

Volume 8; Issue 5
1

Average case analysis of region search in balanced k-d trees

Year:
1979
Language:
english
File:
PDF, 564 KB
english, 1979
3

On a generalization of binary search

Year:
1979
Language:
english
File:
PDF, 339 KB
english, 1979
5

A fast equivalence-checking algorithm for circular lists

Year:
1979
Language:
english
File:
PDF, 376 KB
english, 1979
6

A note on the representation of finite tree automata

Year:
1979
Language:
english
File:
PDF, 237 KB
english, 1979
8

Decomposable searching problems

Year:
1979
Language:
english
File:
PDF, 1.18 MB
english, 1979
9

Mathematical solution for a data processing system

Year:
1979
Language:
english
File:
PDF, 733 KB
english, 1979
10

The decidability of the FOL-DOL equivalence problem

Year:
1979
Language:
english
File:
PDF, 465 KB
english, 1979
11

Immediate error detection in strong LL(1) parsers

Year:
1979
Language:
english
File:
PDF, 907 KB
english, 1979
12

On the space complexity of recursive algorithms

Year:
1979
Language:
english
File:
PDF, 769 KB
english, 1979
13

A note on paths embedded in trees

Year:
1979
Language:
english
File:
PDF, 202 KB
english, 1979
14

Axiomatic proofs of total correctness of programs

Year:
1979
Language:
english
File:
PDF, 511 KB
english, 1979
15

Corrigendum

Year:
1979
File:
PDF, 40 KB
1979
17

Author index: Vvolume 8 (1979)

Year:
1979
Language:
english
File:
PDF, 364 KB
english, 1979