John N. Tsitsiklis

Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1-2): 453-476 (2013)

Julien M. Hendrickx, John N. Tsitsiklis: Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems. IEEE Trans. Automat. Contr. 58(1): 214-218 (2013)

Krishna P. Jagannathan, Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Queue-Length Asymptotics for Generalized Max-Weight Scheduling in the Presence of Heavy-Tailed Traffic. IEEE/ACM Trans. Netw. 20(4): 1096-1111 (2012)

John N. Tsitsiklis, Yunjian Xu: Pricing of fluctuations in electricity markets. CDC 2012: 457-464

Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis: Conditions for learning in generalized tandem networks. CDC 2012: 7437-7444

John N. Tsitsiklis, Yunjian Xu: Efficiency Loss in a Cournot Oligopoly with Convex Market Demand. GAMENETS 2012: 63-76

Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Max-weight scheduling in networks with heavy-tailed traffic. INFOCOM 2012: 2318-2326

Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Delay Stability Regions of the Max-Weight Policy under Heavy-Tailed Traffic. CoRR abs/1207.5746 (2012)

Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis: On Learning with Finite Memory. CoRR abs/1209.1122 (2012)

Ramesh Johari, John N. Tsitsiklis: Parameterized Supply Function Bidding: Equilibrium and Efficiency. Operations Research 59(5): 1079-1089 (2011)

Anna Scaglione, Mark Coates, Michael Gastpar, John N. Tsitsiklis, Martin Vetterli: Introduction to the Issue on Gossiping Algorithms Design and Applications. J. Sel. Topics Signal Processing 5(4): 645-648 (2011)

Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Syst. 68(3-4): 375-384 (2011)

Alexander Olshevsky, John N. Tsitsiklis: Convergence Speed in Distributed Consensus and Averaging. SIAM Review 53(4): 747-772 (2011)

Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis: Distributed Anonymous Discrete Function Computation. IEEE Trans. Automat. Contr. 56(10): 2276-2289 (2011)

Alexander Olshevsky, John N. Tsitsiklis: A Lower Bound for Distributed Averaging Algorithms on the Line Graph. IEEE Trans. Automat. Contr. 56(11): 2694-2698 (2011)

Devavrat Shah, David N. C. Tse, John N. Tsitsiklis: Hardness of Low Delay Network Scheduling. IEEE Transactions on Information Theory 57(12): 7810-7817 (2011)

O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Zoumpoulis: On Decentralized Detection With Partial Information Sharing Among Sensors. IEEE Transactions on Signal Processing 59(4): 1759-1765 (2011)

Julien M. Hendrickx, John N. Tsitsiklis: A new condition for convergence in continuous-time consensus seeking systems. CDC-ECE 2011: 5070-5075

Alexander Olshevsky, John N. Tsitsiklis: Degree fluctuations and the convergence time of consensus algorithms. CDC-ECE 2011: 6602-6607

Wee-Peng Tay, John N. Tsitsiklis: Error exponents for decentralized detection in feedback architectures. ICASSP 2011: 2496-2499

Shie Mannor, John N. Tsitsiklis: Mean-Variance Optimization in Markov Decision Processes. ICML 2011: 177-184

Krishna P. Jagannathan, Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Queue length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic. INFOCOM 2011: 2318-2326

John N. Tsitsiklis, Kuang Xu: On the power of (even a little) centralization in distributed processing. SIGMETRICS 2011: 161-172

Julien M. Hendrickx, John N. Tsitsiklis: Convergence of type-symmetric and cut-balanced consensus seeking systems. CoRR abs/1102.2361 (2011)

Alexander Olshevsky, John N. Tsitsiklis: Degree Fluctuations and the Convergence Time of Consensus Algorithms. CoRR abs/1104.0454 (2011)

Shie Mannor, John N. Tsitsiklis: Mean-Variance Optimization in Markov Decision Processes. CoRR abs/1104.5601 (2011)

Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic. CoRR abs/1108.0370 (2011)

John N. Tsitsiklis: Commentary - Perspectives on Stochastic Optimization Over Time. INFORMS Journal on Computing 22(1): 18-19 (2010)

Paat Rusmevichientong, John N. Tsitsiklis: Linearly Parameterized Bandits. Math. Oper. Res. 35(2): 395-411 (2010)

Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis: Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications. SIAM J. Control and Optimization 48(8): 5214-5240 (2010)

Alexander Olshevsky, John N. Tsitsiklis: A lower bound for distributed averaging algorithms on the line graph. CDC 2010: 4523-4528

Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis: Opinion dynamics for agents with opinion-dependent connections. CDC 2010: 6626-6632

Florence Bénézit, Vincent D. Blondel, Patrick Thiran, John N. Tsitsiklis, Martin Vetterli: Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. ISIT 2010: 1753-1757

Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Qualitative properties of alpha-weighted scheduling policies. SIGMETRICS 2010: 239-250

Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Qualitative Properties of alpha-Weighted Scheduling Policies. CoRR abs/1003.5979 (2010)

Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis: Distributed anonymous discrete function computation. CoRR abs/1004.2102 (2010)

Krishna P. Jagannathan, Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis: Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic. CoRR abs/1007.4286 (2010)

Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis: NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems. CoRR abs/1012.1908 (2010)

Shie Mannor, John N. Tsitsiklis: Approachability in repeated games: Computational aspects and a Stackelberg variant. Games and Economic Behavior 66(1): 315-325 (2009)

Ramesh Johari, John N. Tsitsiklis: Efficiency of Scalar-Parameterized Mechanisms. Operations Research 57(4): 823-839 (2009)

Shie Mannor, John N. Tsitsiklis, Jia Yuan Yu: Online Learning with Sample Path Constraints. Journal of Machine Learning Research 10: 569-590 (2009)

Alexander Olshevsky, John N. Tsitsiklis: Convergence Speed in Distributed Consensus and Averaging. SIAM J. Control and Optimization 48(1): 33-55 (2009)

Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis: On Distributed Averaging Algorithms and Quantization Effects. IEEE Trans. Automat. Contr. 54(11): 2506-2517 (2009)

Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis: On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity. IEEE Trans. Automat. Contr. 54(11): 2586-2597 (2009)

Adam J. Mersereau, Paat Rusmevichientong, John N. Tsitsiklis: A Structured Multiarmed Bandit Problem and the Greedy Policy. IEEE Trans. Automat. Contr. 54(12): 2787-2802 (2009)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Bayesian detection in bounded height tree networks. IEEE Transactions on Signal Processing 57(10): 4042-4051 (2009)

Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis: Distributed anonymous function computation in information fusion and multiagent systems. CoRR abs/0907.2949 (2009)

Alp Muharremoglu, John N. Tsitsiklis: A Single-Unit Decomposition Approach to Multiechelon Inventory Systems. Operations Research 56(5): 1089-1103 (2008)

Thomas Bortfeld, Timothy C. Y. Chan, Alexei Trofimov, John N. Tsitsiklis: Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy. Operations Research 56(6): 1461-1473 (2008)

Alexander Olshevsky, John N. Tsitsiklis: On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms. IEEE Trans. Automat. Contr. 53(11): 2642-2645 (2008)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Data Fusion Trees for Detection: Does Architecture Matter? IEEE Transactions on Information Theory 54(9): 4155-4168 (2008)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: On the Subexponential Decay of Detection Error Probabilities in Long Tandems. IEEE Transactions on Information Theory 54(10): 4767-4771 (2008)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks. IEEE Transactions on Signal Processing 56(6): 2535-2546 (2008)

Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis: Distributed subgradient methods and quantization effects. CDC 2008: 4177-4184

Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis: On distributed averaging algorithms and quantization effects. CDC 2008: 4825-4830

Adam J. Mersereau, Paat Rusmevichientong, John N. Tsitsiklis: A structured multiarmed bandit problem and the greedy policy. CDC 2008: 4945-4950

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Data Fusion Trees for Detection: Does Architecture Matter? CoRR abs/0803.2337 (2008)

Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis: On Krause's consensus formation model with state-dependent connectivity. CoRR abs/0807.2028 (2008)

Paat Rusmevichientong, John N. Tsitsiklis: Linearly Parameterized Bandits. CoRR abs/0812.3465 (2008)

Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis: Bias and Variance Approximation in Value Function Estimates. Management Science 53(2): 308-322 (2007)

Jay Sethuraman, John N. Tsitsiklis: Stochastic Search in a Forest Revisited. Math. Oper. Res. 32(3): 589-593 (2007)

John N. Tsitsiklis: NP-Hardness of checking the unichain condition in average cost MDPs. Oper. Res. Lett. 35(3): 319-323 (2007)

Dimitri P. Bertsekas, John N. Tsitsiklis: Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules". IEEE Trans. Automat. Contr. 52(5): 968-969 (2007)

Dimitri P. Bertsekas, John N. Tsitsiklis: Erratum to "Comments on `Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'". IEEE Trans. Automat. Contr. 52(7): 1356 (2007)

Anand Ganti, Eytan Modiano, John N. Tsitsiklis: Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. IEEE Transactions on Information Theory 53(3): 998-1008 (2007)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Asymptotic Performance of a Censoring Sensor Network. IEEE Transactions on Information Theory 53(11): 4191-4209 (2007)

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Bayesian Detection in Bounded Height Tree Networks. DCC 2007: 243-252

Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win: Detection in Dense Wireless Sensor Networks. WCNC 2007: 3483-3488

Ramesh Johari, Shie Mannor, John N. Tsitsiklis: A contract-based model for directed network formation. Games and Economic Behavior 56(2): 201-224 (2006)

Ramesh Johari, John N. Tsitsiklis: A scalable network resource allocation mechanism with bounded efficiency loss. IEEE Journal on Selected Areas in Communications 24(5): 992-999 (2006)

Duncan Simester, Peng Sun, John N. Tsitsiklis: Dynamic Catalog Mailing Policies. Management Science 52(5): 683-696 (2006)

Alvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal transmission scheduling over a fading channel with energy and deadline constraints. IEEE Transactions on Wireless Communications 5(3): 630-641 (2006)

Shie Mannor, John N. Tsitsiklis: Online Learning with Constraints. COLT 2006: 529-543

Shie Mannor, John N. Tsitsiklis: On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies. Math. Oper. Res. 30(3): 545-561 (2005)

Ramesh Johari, Shie Mannor, John N. Tsitsiklis: Efficiency loss in a network resource allocation game: the case of elastic supply. IEEE Trans. Automat. Contr. 50(11): 1712-1724 (2005)

Ramesh Johari, Shie Mannor, John N. Tsitsiklis: Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply. CoRR abs/cs/0506054 (2005)

Shie Mannor, John N. Tsitsiklis: The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. Journal of Machine Learning Research 5: 623-648 (2004)

Ramesh Johari, John N. Tsitsiklis: Efficiency Loss in a Network Resource Allocation Game. Math. Oper. Res. 29(3): 407-435 (2004)

Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis: Bias and variance in value function estimation. ICML 2004

Peter Marbach, John N. Tsitsiklis: Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Processes. Discrete Event Dynamic Systems 13(1-2): 111-148 (2003)

Vijay R. Konda, John N. Tsitsiklis: OnActor-Critic Algorithms. SIAM J. Control and Optimization 42(4): 1143-1166 (2003)

Alvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal energy allocation and admission control for communications satellites. IEEE/ACM Trans. Netw. 11(3): 488-500 (2003)

Shie Mannor, John N. Tsitsiklis: Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. COLT 2003: 418-432

Alvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel. INFOCOM 2003

John N. Tsitsiklis: On the Convergence of Optimistic Policy Iteration. Journal of Machine Learning Research 3: 59-72 (2002)

John N. Tsitsiklis, Benjamin Van Roy: On Average Versus Discounted Reward Temporal-Difference Learning. Machine Learning 49(2-3): 179-191 (2002)

Alvin Fu, Eytan Modiano, John N. Tsitsiklis: Optimal Energy Allocation and Admission Control for Communications Satellites. INFOCOM 2002

Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. 62(3): 442-462 (2001)

Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis: Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001)

John N. Tsitsiklis, Benjamin Van Roy: Regression methods for pricing complex American-style options. IEEE Transactions on Neural Networks 12(4): 694-703 (2001)

Vincent D. Blondel, John N. Tsitsiklis: A survey of computational complexity results in systems and control. Automatica 36(9): 1249-1274 (2000)

Peter Marbach, Oliver Mihatsch, John N. Tsitsiklis: Call admission control and routing in integrated services networks using neuro-dynamic programming. IEEE Journal on Selected Areas in Communications 18(2): 197-208 (2000)

Dimitri P. Bertsekas, John N. Tsitsiklis: Gradient Convergence in Gradient methods with Errors. SIAM Journal on Optimization 10(3): 627-642 (2000)

Ioannis Ch. Paschalidis, John N. Tsitsiklis: Congestion-dependent pricing of network services. IEEE/ACM Trans. Netw. 8(2): 171-184 (2000)

Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis: The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490

Vincent D. Blondel, John N. Tsitsiklis: Complexity of stability and controllability of elementary hybrid systems. Automatica 35(3): 479-489 (1999)

John N. Tsitsiklis, Benjamin Van Roy: Average cost temporal-difference learning. Automatica 35(11): 1799-1808 (1999)

Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. Machine Learning 35(3): 225-245 (1999)

Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis: Large deviations analysis of the generalized processor sharing policy. Queueing Syst. 32(4): 319-349 (1999)

Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Performance analysis of multiclass queueing networks. SIGMETRICS Performance Evaluation Review 27(3): 11-14 (1999)

Vijay R. Konda, John N. Tsitsiklis: Actor-Critic Algorithms. NIPS 1999: 1008-1014

Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu: Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3(3): 245-262 (1997)

Vincent D. Blondel, John N. Tsitsiklis: When is a Pair of Matrices Mortal? Inf. Process. Lett. 63(5): 283-286 (1997)

John N. Tsitsiklis, Vincent D. Blondel: The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate. MCSS 10(1): 31-40 (1997)

John N. Tsitsiklis, Vincent D. Blondel: Lyapunov exponents of pairs of matrices, a correction. MCSS 10(4): 381 (1997)

Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis: Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. COLT 1997: 314-324

Peter Marbach, Oliver Mihatsch, Miriam Schulte, John N. Tsitsiklis: Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks. NIPS 1997

John N. Tsitsiklis, Benjamin Van Roy: Feature-Based Methods for Large Scale Dynamic Programming. Machine Learning 22(1-3): 59-94 (1996)

George H. Polychronopoulos, John N. Tsitsiklis: Stochastic shortest path problems with recourse. Networks 27(2): 133-143 (1996)

John N. Tsitsiklis, Benjamin Van Roy: Analysis of Temporal-Diffference Learning with Function Approximation. NIPS 1996: 1075-1081

John N. Tsitsiklis, Benjamin Van Roy: Approximate Solutions to Optimal Stopping Problems. NIPS 1996: 1082-1088

Munther A. Dahleh, Eduardo D. Sontag, David N. C. Tse, John N. Tsitsiklis: Worst-case identification of nonlinear fading memory systems. Automatica 31(3): 503-508 (1995)

John N. Tsitsiklis, George D. Stamoulis: On the Average Communication Complexity of Asynchronous Distributed Algorithms. J. ACM 42(2): 382-400 (1995)

David N. C. Tse, Robert G. Gallager, John N. Tsitsiklis: Statistical Multiplexing of Multiple Time-Scale Markov Streams. IEEE Journal on Selected Areas in Communications 13(6): 1028-1038 (1995)

Benjamin Van Roy, John N. Tsitsiklis: Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions. NIPS 1995: 1045-1051

John N. Tsitsiklis: Asynchronous Stochastic Approximation and Q-Learning. Machine Learning 16(3): 185-202 (1994)

Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis: Local Versus Nonlocal Computation of Length of Digitized Curves. IEEE Trans. Pattern Anal. Mach. Intell. 16(7): 711-718 (1994)

George D. Stamoulis, John N. Tsitsiklis: The efficiency of greedy routing in hypercubes and butterflies. IEEE Transactions on Communications 42(11): 3051-3061 (1994)

Zhi-Quan Luo, John N. Tsitsiklis: Data fusion with minimal communication. IEEE Transactions on Information Theory 40(5): 1551-1563 (1994)

Christos H. Papadimitriou, John N. Tsitsiklis: The Complexity of Optimal Queueing Network Control. Structure in Complexity Theory Conference 1994: 318-322

George D. Stamoulis, John N. Tsitsiklis: An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube. Inf. Process. Lett. 46(5): 219-224 (1993)

Zhi-Quan Luo, John N. Tsitsiklis: On the Communication Complexity of Distributed Algebraic Computation. J. ACM 40(5): 1019-1047 (1993)

Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis: Active Learning Using Arbitrary Binary Valued Queries. Machine Learning 11: 23-35 (1993)

Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis, Ofer Zeitouni: PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 933-942 (1993)

John N. Tsitsiklis: Extremal properties of likelihood-ratio quantizers. IEEE Transactions on Communications 41(4): 550-558 (1993)

George D. Stamoulis, John N. Tsitsiklis: Efficient Routing Schemes for Multiple Broadcasts in Hypercubes. IEEE Trans. Parallel Distrib. Syst. 4(7): 725-739 (1993)

Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis: Local Versus Non-local Computation of Length of Digitized Curves. FSTTCS 1993: 94-103

John N. Tsitsiklis: Special cases of traveling salesman and repairman problems with time windows. Networks 22(3): 263-282 (1992)

Sanjeev R. Kulkarni, John N. Tsitsiklis, Sanjoy K. Mitter, Ofer Zeitouni: PAC Learning With Generalized Samples and an Application to Stochastic Geometry. COLT 1992: 172-179

Dimitri P. Bertsekas, John N. Tsitsiklis: Some aspects of parallel and distributed iterative algorithms - A survey^, . Automatica 27(1): 3-21 (1991)

Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis: Optimal Communication Algorithms for Hypercubes. J. Parallel Distrib. Comput. 11(4): 263-275 (1991)

Zhi-Quan Luo, John N. Tsitsiklis: On the Communication Complexity of Solving a Polynomial Equation. SIAM J. Comput. 20(5): 936-950 (1991)

Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis: On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Transactions on Information Theory 37(3): 639-643 (1991)

George D. Stamoulis, John N. Tsitsiklis: The Efficiency of Greedy Routing in Hypercubes and Butterflies. SPAA 1991: 248-259

Zhi-Quan Luo, John N. Tsitsiklis: Communication Complexity of Algebraic Computation (Extended Abstract). FOCS 1990: 758-765

Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis: On the Predictability of Coupled Automata: An Allegory about Chaos. FOCS 1990: 788-793

Dimitri P. Bertsekas, John N. Tsitsiklis: Parallel and distributed computation. Prentice Hall 1989, isbn 978-0-13-648759-3, pp. I-XIX, 1-715

John N. Tsitsiklis: On the Use of Random Numbers in Asynchronous Simulation via Rollback. Inf. Process. Lett. 31(3): 139-144 (1989)

Chef-Seng Chow, John N. Tsitsiklis: The complexity of dynamic programming. J. Complexity 5(4): 466-488 (1989)

Dimitri P. Bertsekas, John N. Tsitsiklis: Convergence rate and termination of asynchronous iterative algorithms. ICS 1989: 461-470

John N. Tsitsiklis, Zhi-Quan Luo: Communication complexity of convex optimization. J. Complexity 3(3): 231-243 (1987)

John N. Tsitsiklis: On the Stability of Asynchronous Iterative Processes. Mathematical Systems Theory 20(2-3): 137-153 (1987)

Christos H. Papadimitriou, John N. Tsitsiklis: On Stochastic Scheduling with In-Tree Precedence Constraints. SIAM J. Comput. 16(1): 1-6 (1987)

John N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet: The performance of a precedence-based queuing discipline. J. ACM 33(3): 593-602 (1986)

Bernard C. Levy, John N. Tsitsiklis: A fast algorithm for linear estimation of two- dimensional isotropic random fields. IEEE Transactions on Information Theory 31(5): 635-644 (1985)

Christos H. Papadimitriou, John N. Tsitsiklis: On the Complexity of Designing Distributed Protocols. Information and Control 53(3): 211-218 (1982)