Volume 31; Issue 2

Information Processing Letters

Volume 31; Issue 2
1

On the upper bound on the rotation distance of binary trees

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

Counting clique trees and computing perfect elimination schemes in parallel

Year:
1989
Language:
english
File:
PDF, 1.08 MB
english, 1989
3

Worst-case data structures for the priority queue with attrition

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

An approximation algorithm for the TSP

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

Analysis of random probing hashing

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

A note on higher-order functions versus logical variables

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

An algorithm for colouring perfect planar graphs

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