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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal deadlock resolutions in edge-disjoint reducible wait-for graphs
Kenneth Luo
,
William Klostermeyer
,
Yuan-Chieh Chow
,
Richard Newman-Wolfe
Information Processing Letters
38
, 1991, pp. 307-313
Distributed subcube identification algorithms for reliable hypercubes
Shahram Latifi
Information Processing Letters
38
, 1991, pp. 315-321
Conflict detection and resolution in a lexical analyzer generator
Jerzy R. Nawrocki
Information Processing Letters
38
, 1991, pp. 323-328
A note on the token distribution problem
Kieran T. Herley
Information Processing Letters
38
, 1991, pp. 329-334
On the time to traverse all edges of a graph
David Zuckerman
Information Processing Letters
38
, 1991, pp. 335-337
A fast algorithm for finding the compact sets
Dejan Zivkovic
Information Processing Letters
38
, 1991, pp. 339-342
Seiten
<
1
2
3