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: Author="Tsitsiklis, J.N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Local versus non-local computation of length of digitized curves
S.R. Kulkarni
,
S.K. Mitter
,
T.J. Richardson
,
J.N. Tsitsiklis
Lecture Notes in Computer Science
761
, 1993, pp. 94-103
Optimal communication algorithms for hypercubes
D.P. Bertsekas
,
C. özveren
,
G.D. Stamoulis
,
P. Tseng
,
J.N. Tsitsiklis
Journal Parallel Distributed Computing
11
(4), 1991, April, pp. 263-275
On the predictability of coupled automata: An allegory about chaos
S. Buss
,
C.H. Papadimitriou
,
J.N. Tsitsiklis
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 788-793
Communication complexity of algebraic computation
Z.-Q. Luo
,
J.N. Tsitsiklis
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 758-765
On stochastic scheduling with in-tree precedence constraints
C.H. Papadimitriou
,
J.N. Tsitsiklis
SIAM Journal on Computing
16
(1), 1987, February, pp. 1-6
The performance of a precedence-based queuing discipline
J.N. Tsitsiklis
,
C.H. Papadimitriou
,
P. Humblet
Journal of the ACM
33
(3), 1986, pp. 593-602