Volume 32; Issue 1

Information Processing Letters

Volume 32; Issue 1
1

Editorial board

Year:
1989
Language:
english
File:
PDF, 64 KB
english, 1989
2

The Hamiltonian circuit problem for circle graphs is NP-complete

Year:
1989
Language:
english
File:
PDF, 134 KB
english, 1989
3

Path integral methods for computer performance analysis

Year:
1989
Language:
english
File:
PDF, 636 KB
english, 1989
4

On-line computation of convolutions

Year:
1989
Language:
english
File:
PDF, 191 KB
english, 1989
5

On verifying that a concurrent program satisfies a nondeterministic specification

Year:
1989
Language:
english
File:
PDF, 730 KB
english, 1989
6

An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm

Year:
1989
Language:
english
File:
PDF, 283 KB
english, 1989
7

Boyce–Codd normal form and object normal forms

Year:
1989
Language:
english
File:
PDF, 415 KB
english, 1989
8

Hybridsort revisited and parallelized

Year:
1989
Language:
english
File:
PDF, 377 KB
english, 1989
9

On Matijasevitch's nontraditional approach to search problems

Year:
1989
Language:
english
File:
PDF, 497 KB
english, 1989
10

A fast algorithm for finding interlocking sets

Year:
1989
Language:
english
File:
PDF, 354 KB
english, 1989
11

An optimal parallel circle-cover algorithm

Year:
1989
Language:
english
File:
PDF, 296 KB
english, 1989