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="Tsitsiklis, John N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Convergence speed in distributed consensus and averaging
Alex Olshevsky
,
John N. Tsitsiklis
SIAM Review
53
(4), 2011, pp. 747-772
Deciding stability and mortality of piecewise affine dynamcial systems
Vincent D. Blondel
,
Olivier Bournez
,
Pascal Koiran
,
Christos H. Papadimitriou
,
John N. Tsitsiklis
Theoretical Computer Science
255
(1-2), 2001, pp. 687-696
The stability of saturated linear dynamical systems is undecidable
Vincent D. Blondel
,
Olivier Bournez
,
Pascal Koiran
,
John N. Tsitsiklis
Journal of Computer and System Sciences
62
(3), 2001, pp. 442-462
The stability of saturated linear dynamical systems is undecidable
Vincent D. Blondel
,
Olivier Bournez
,
Pascal Koiran
,
John N. Tsitsiklis
Lecture Notes in Computer Science
1770
, 2000, pp. 479-490
When is a pair of matrices mortal?
Vincent D. Blondel
,
John N. Tsitsiklis
Information Processing Letters
63
(5), 1997, pp. 283-286
Stochastic shortest path problems with recourse
George H. Polychronopoulos
,
John N. Tsitsiklis
Networks
27
(2), 1996, pp. 133-143
On the average communication complexity of asynchronous distributed algorithms
John N. Tsitsiklis
,
George D. Stamoulis
Journal of the ACM
42
(2), 1995, pp. 382-400
The complexity of optimal queueing network control
Christos H. Papadimitriou
,
John N. Tsitsiklis
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 318-322
On the communication complexity of distributed algebraic computation
Zhi-Quan Luo
,
John N. Tsitsiklis
Journal of the ACM
40
(5), 1993, November, pp. 1019-1047
An efficient algorithm for multiple simultaneous broadcasts in the hypercube
George D. Stamoulis
,
John N. Tsitsiklis
Information Processing Letters
46
(5), 1993, pp. 219-224
Special cased of Traveling Salesman and repairman problems with time windows
John N. Tsitsiklis
Networks
22
(3), 1992, pp. 263-282
On the communication complexity of solving a polynomial equation
Zhi-Quan Luo
,
John N. Tsitsiklis
SIAM Journal on Computing
20
(5), 1991, October, pp. 936-950
The efficiency of greedy routing in hypercubes and butterflies
George D. Stamoulis
,
John N. Tsitsiklis
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'91 (Hilton Head, South Carolina, July 21-24, 1991)
, 1991, pp. 248-259
The complexity of dynamic programming
Chee-Seng Chow
,
John N. Tsitsiklis
Journal of Complexity
5
, 1989, pp. 466-488
On the use of random numbers in asynchronous simulation via rollback
John N. Tsitsiklis
Information Processing Letters
31
, 1989, pp. 139-144
Communication complexity of convex optimization
John N. Tsitsiklis
,
Zhi-Quan Luo
Journal of Complexity
3
, 1987, pp. 231-243
On the stability of asynchronous iterative processes
John N. Tsitsiklis
Math. Systems Theory
20
, 1987, pp. 137-153