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: Author="Loui, M.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconstructing a minimum spanning tree after deletion of any node
B. Das
,
M.C. Loui
Algorithmica
31
(4), 2001, pp. 530-547
The power of parallel random access machines with augmented instruction sets
J.L. Trahan
,
V. Ramachandran
,
M.C. Loui
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 97-103
Election in a complete network with a sense of direction
M.C. Loui
,
T.A. Matsushita
,
D.B. West
Information Processing Letters
22
(4), 1986, April, pp. 185-187
On the worst case performance of buddy systems
E.L. Lloyd
,
M.C. Loui
Acta Informatica
22
(4), 1985, pp. 451-473
Minimizing access pointers into trees and arrays
M.C. Loui
Journal of Computer and System Sciences
28
(3), 1984, June, pp. 359-378
Optimal dynamic embedding of trees into arrays
M.C. Loui
SIAM Journal on Computing
12
(3), 1983, August, pp. 463-472
Simulations among multidimensional Turing machines
M.C. Loui
Theoretical Computer Science
21
(2), 1982, pp. 145-161
Simulations among multidimensional Turing machines (preliminary version)
M.C. Loui
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 58-67
A space bound for one-tape multidimensional Turing machines (Note)
M.C. Loui
Theoretical Computer Science
15
, 1981, pp. 311-320