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 YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
Suresh Viswanathan
,
Éva Czabarka
,
Abhijit Sengupta
Information Processing Letters
57
(5), 1996, pp. 265-271
The two headed disk: Stochastic dominance of the greedy policy
S. Seshadri
,
D. Rotem
Information Processing Letters
57
(5), 1996, pp. 273-277
A gap theorem for the anonymous torus
Angelo Monti
,
Alessandro Roncato
Information Processing Letters
57
(5), 1996, pp. 279-285
An NC algorithm for the clique cover problem in cocomparability graphs and its application
Chongkye Rhee
,
Y. Daniel Liang
Information Processing Letters
57
(5), 1996, pp. 287-290
On the computational complexity of graph closures
Angelo Monti
Information Processing Letters
57
(6), 1996, pp. 291-295
A note on scheduling on a single procesor with speed dependent on a number of executed jobs
Stanisƚaw Gawiejnowicz
Information Processing Letters
57
(6), 1996, pp. 297-300
A higly safe self-stabilizing mutual exclusion algorithm
I-Ling Yen
Information Processing Letters
57
(6), 1996, pp. 301-305
On pattern occurrences in a random text
Ioannis Fudos
,
Evaggelia Pitoura
,
Wojciech Szpankowski
Information Processing Letters
57
(6), 1996, pp. 307-312
Rectilinear short path queries among rectangular obstacles
Danny Z. Chen
,
Kevin S. Klenk
Information Processing Letters
57
(6), 1996, pp. 313-319
On two-processor scheduling and maximum matching in permutation graphs
Sarnath Ramnath
,
Sivaprakasam Sunder
Information Processing Letters
57
(6), 1996, pp. 321-327
Agreement in the presence of faults, on networks of bounded degree
Michael Ben-Or
,
Dana Ron
Information Processing Letters
57
(6), 1996, pp. 329-334
A note on finding compact sets in graphs represented by an adjacency list
Sung Kwon Kim
Information Processing Letters
57
(6), 1996, pp. 335-338
Seiten
<
1
2
3
4
5
6
7
8
9