Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on Post's correspondence problem
J.J. Pansiot
Information Processing Letters
12
, 1981, pp. 233
A family of codes commutatively equivalent to prefix codes
S. Mauceri
,
A. Restivo
Information Processing Letters
12
(1), 1981, February, pp. 1-4
On a stable minimum storage merging algorithm
K. DudziĆski
,
A. Dydek
Information Processing Letters
12
(1), 1981, February, pp. 5-8
Scheduling periodically occurring tasks on multiple processors
E.L. Lawler
,
C.U. Martel
Information Processing Letters
12
(1), 1981, February, pp. 9-12
A closure property of deterministic context-free languages
C. Choffrut
Information Processing Letters
12
(1), 1981, February, pp. 13-16
The numerical instability of Bini's algorithm
N. Tsao
Information Processing Letters
12
(1), 1981, February, pp. 17-19
A linear-time recognition algorithm for interval DAGS
H.N. Gabow
Information Processing Letters
12
(1), 1981, February, pp. 20-22
Master keys for group sharing
D.E. Denning
,
F.B. Schneider
Information Processing Letters
12
(1), 1981, February, pp. 23-25
Bunch theory: a simple set theory for computer science
E.C.R. Hehner
Information Processing Letters
12
(1), 1981, February, pp. 26-30
An algorithm for finding clique cut-sets
S.H. Whitesides
Information Processing Letters
12
(1), 1981, February, pp. 31-32
On generalized matching problems
P. Hell
,
D.G. Kirkpatrick
Information Processing Letters
12
(1), 1981, February, pp. 33-35
Solving combinatorial search problems by intelligent backtracking
M. Bruynooghe
Information Processing Letters
12
(1), 1981, February, pp. 36-39
Coffman-Graham scheduling of UET task systems with 0-1 resources
E.L. Lloyd
Information Processing Letters
12
(1), 1981, February, pp. 40-45
An upper bound on the number of execution nodes for a distributed join
S. Ceri
,
G. Pelagatti
Information Processing Letters
12
(1), 1981, February, pp. 46-48
Some principles for dynamizing decomposable search problems
M.H. Overmars
,
J. van Leeuwen
Information Processing Letters
12
(1), 1981, February, pp. 49-53
Optimal policy for database backup and recovery
M. Hatzopoulos
,
J.G. Kollias
Information Processing Letters
12
(2), 1981, April, pp. 55-58
Concurrency in a language employing messages
D.M. Harland
Information Processing Letters
12
(2), 1981, April, pp. 59-62
A user authentication scheme for shared data based on a trap-door one-way function
I. Ingemarsson
,
C.K. Wong
Information Processing Letters
12
(2), 1981, April, pp. 63-67
The Morse sequence and iterated morphisms
J.J. Pansiot
Information Processing Letters
12
(2), 1981, April, pp. 68-70
Efficient searching using partial ordering
A. Borodin
,
L.J. Guibas
,
N.A. Lynch
,
A.C. Yao
Information Processing Letters
12
(2), 1981, April, pp. 71-75
Presburger arithmetic with array segments
J. Jaffar
Information Processing Letters
12
(2), 1981, April, pp. 79-82
A layout for the shuffle-exchange network with
\Theta(n^2/\log n)
area
D. Steinberg
,
M. Rodeh
Information Processing Letters
12
(2), 1981, April, pp. 83-88
Another-look at the degree constrained subgraph problem
Y. Shiloach
Information Processing Letters
12
(2), 1981, April, pp. 89-92
Optimal dynamization of decomposable searching problems
K. Mehlhorn
,
M.H. Overmars
Information Processing Letters
12
(2), 1981, April, pp. 93-98
General methods for 'all elements' and 'all pairs' problems
M.H. Overmars
Information Processing Letters
12
(2), 1981, April, pp. 99-102
Seiten 1
2
3
>