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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Loop cleaning
V.N. Kasyanov
Information Processing Letters
18
(1), 1984, January, pp. 1-6
Performance evaluation of concurrent systems using Petri nets
J. Magott
Information Processing Letters
18
(1), 1984, January, pp. 7-13
Infinitary tree languages recognized by
\omega
-automata
A. Saoudi
Information Processing Letters
18
(1), 1984, January, pp. 15-19
Note on node-rewriting graph grammars
H.-J. Kreowski
,
G. Rozenberg
Information Processing Letters
18
(1), 1984, January, pp. 21-24
Diophantine inference on a statistical database
N.C. Rowe
Information Processing Letters
18
(1), 1984, January, pp. 25-31
Termination detection for distributed computations
R.W. Topor
Information Processing Letters
18
(1), 1984, January, pp. 33-36
Parallel strong orientation of an undirected graph
M.J. Atallah
Information Processing Letters
18
(1), 1984, January, pp. 37-39
Minimum vertex distance between separable convex polygons
F. Chin
,
C.A. Wang
Information Processing Letters
18
(1), 1984, January, pp. 41-45
Large processors are good in VLSI chips
Xiaolong Jin
Information Processing Letters
18
(1), 1984, January, pp. 47-49
A note on array grammars
E. Yodogawa
Information Processing Letters
18
(1), 1984, January, pp. 51-54
Perception-based configuration design of computer systems
R. Geist
Information Processing Letters
18
(1), 1984, January, pp. 55-57
A partitioning algorithm for minimum weighted Euclidean matching
M.E. Dyer
,
A.M. Frieze
Information Processing Letters
18
(2), 1984, February, pp. 59-62
A parallel view of stable marriages
M.E.C. Hull
Information Processing Letters
18
(2), 1984, February, pp. 63-66
Insecurity of set controls for statistical databases
J. Schlörer
Information Processing Letters
18
(2), 1984, February, pp. 67-71
Extending binary Byzantine agreement to multivalued Byzantine agreement
R. Turpin
,
B.A. Coan
Information Processing Letters
18
(2), 1984, February, pp. 73-76
A note on specifying and verifying concurrent processes
L. Holenderski
Information Processing Letters
18
(2), 1984, February, pp. 77-85
On legal path problems in digraphs
H.S. Ihm
,
S.C. Ntafos
Information Processing Letters
18
(2), 1984, February, pp. 93-98
A probabilistic analysis of an error-correcting algorithm for the towers of Hanoi puzzle
F. Scarioni
,
H.G. Speranza
Information Processing Letters
18
(2), 1984, February, pp. 99-103
Remarks on two-way automata with weak-counters
S. Miyano
Information Processing Letters
18
(2), 1984, February, pp. 105-107
On a circle-cover minimization problem
C.C. Lee
,
D.T. Lee
Information Processing Letters
18
(2), 1984, February, pp. 109-115
Backtrack: an
O(1)
expected time algorithm for the graph coloring problem
H.S. Wilf
Information Processing Letters
18
(3), 1984, March, pp. 119-121
An
O(n)
algorithm for the linear multiple choice knapsack problem and related problems
E. Zemel
Information Processing Letters
18
(3), 1984, March, pp. 123-128
Experiments with a fast string searching algorithm
P. Mller-Nielsen
,
J. Staunstrup
Information Processing Letters
18
(3), 1984, March, pp. 129-135
A technique for developing loop invariants
J.H. Remmers
Information Processing Letters
18
(3), 1984, March, pp. 137-139
A fast VLSI conversion between binary and residue systems
G. Alia
,
F. Barsi
,
E. Martinelli
Information Processing Letters
18
(3), 1984, March, pp. 141-145
Seiten 1
2
3
>