Volume 63; Issue 2

Information Processing Letters

Volume 63; Issue 2
1

The bit complexity of the predecessor problem

Y. Afek, M. Cohen, E. Haalman
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 348 KB
english, 1997
2

Recognizing Hamming graphs in linear time and space

Wilfried Imrich, Sandi Klavžar
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 417 KB
english, 1997
3

Impossibility results for weak threshold networks

Costas Busch, Marios Mavronicolas
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 538 KB
english, 1997
4

An approximation algorithm for maximum packing of 3-edge paths

Refael Hassin, Shlomi Rubinstein
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 354 KB
english, 1997
5

3D straight-line grid drawing of 4-colorable graphs

Tiziana Calamoneri, Andrea Sterbini
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 438 KB
english, 1997
7

Dynamic maintenance of majority information in constant time per update

Gudmund S. Frandsen, Sven Skyum
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 268 KB
english, 1997
8

A fast algorithm for stereo matching

Kuo-Liang Chung
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 426 KB
english, 1997
9

Partitions with minimum entropy of regions in R2

J.G. Gaines
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 423 KB
english, 1997
10

Bounded fan-out m-center problem

Ho Jan-Ming, Ming-Tat Ko
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 548 KB
english, 1997
11

Performance bounds for modeling NUMA architectures

Robert Geist
Journal:
Information Processing Letters
Year:
1997
Language:
english
File:
PDF, 457 KB
english, 1997