Volume 40; Issue 1

Information Processing Letters

Volume 40; Issue 1
1

Editorial Board

Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 58 KB
english, 1991
2

A note on the approximation of the max clique problem

P. Crescenzi, C. Fiorini, R. Silvestri
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 312 KB
english, 1991
3

Lower and upper power domain constructions commute on all cpos

Reinhold Heckmann
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 354 KB
english, 1991
4

Complexity of the repeaters allocating problem

Nen-Fu Huang, Ching-Ho Huang
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 512 KB
english, 1991
6

A note on the space complexity of some decision problems for finite automata

Tao Jiang, B. Ravikumar
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 533 KB
english, 1991
7

Parallel priority queues

Maria Cristina Pinotti, Geppino Pucci
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 475 KB
english, 1991
8

A counterexample to the algorithms for determining opaque minimal forests

Thomas Shermer
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 117 KB
english, 1991
9

The benefits of external wires in single row routing

Jean R.S. Blair, Errol L. Lloyd
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 563 KB
english, 1991
10

Repetitions, known or unknown?

Wim H. Hesselink
Journal:
Information Processing Letters
Year:
1991
Language:
english
File:
PDF, 260 KB
english, 1991