- Home
- Best Scientists - Computer Science
- John N. Tsitsiklis

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
95
Citations
74,571
317
World Ranking
264
National Ranking
164

2018 - INFORMS John von Neumann Theory Prize

2018 - IEEE Control Systems Award “For contributions to the theory and application of optimization in large dynamic and distributed systems.”

2007 - Member of the National Academy of Engineering For contributions to the theory and application of optimization in dynamic and distributed systems.

2007 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

- Statistics
- Artificial intelligence
- Algorithm

John N. Tsitsiklis mostly deals with Mathematical optimization, Dynamic programming, Computational complexity theory, Algorithm and Theoretical computer science. The concepts of his Mathematical optimization study are interwoven with issues in Decision theory, Convergence, Upper and lower bounds and Markov decision process. John N. Tsitsiklis combines subjects such as Computation, State space and Graph with his study of Dynamic programming.

His Computational complexity theory research includes elements of Time complexity, Computability, Stochastic control, Discretization and Integer. His studies deal with areas such as Temporal difference learning, Markov process, Expected cost, Decentralised system and Nonlinear system as well as Algorithm. His Theoretical computer science research incorporates elements of Parallel computing, Optimization problem, Decision problem and Decentralized decision-making.

- Parallel and Distributed Computation: Numerical Methods (4260 citations)
- Neuro-dynamic programming (3576 citations)
- Introduction to linear optimization (1933 citations)

His main research concerns Mathematical optimization, Discrete mathematics, Combinatorics, Algorithm and Theoretical computer science. John N. Tsitsiklis works in the field of Mathematical optimization, namely Dynamic programming. His work investigates the relationship between Discrete mathematics and topics such as Computational complexity theory that intersect with problems in Time complexity.

His Combinatorics study combines topics in areas such as Function and Upper and lower bounds. John N. Tsitsiklis interconnects Distributed algorithm and Computation in the investigation of issues within Theoretical computer science. He has included themes like Server and Traffic intensity in his Queue study.

- Mathematical optimization (34.12%)
- Discrete mathematics (11.29%)
- Combinatorics (10.35%)

- Mathematical optimization (34.12%)
- Queue (9.18%)
- Bounded function (9.88%)

John N. Tsitsiklis focuses on Mathematical optimization, Queue, Bounded function, Upper and lower bounds and Scheduling. His work deals with themes such as Convergence, Network delay, Markov decision process and Topology, which intersect with Mathematical optimization. His Queue research integrates issues from Discrete mathematics, Queueing theory, Server and Traffic intensity.

His Bounded function research incorporates themes from Mathematical economics, Computation, Quadratic growth and Graph. He has researched Upper and lower bounds in several fields, including Markov process, Degree, Combinatorics, Exponential growth and Function. His study in Function is interdisciplinary in nature, drawing from both Node and Algorithm.

- Linearly Parameterized Bandits (285 citations)
- Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices (192 citations)
- Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems (170 citations)

- Statistics
- Artificial intelligence
- Computer network

His primary scientific interests are in Mathematical optimization, Queue, Combinatorics, Convergence and Upper and lower bounds. His Mathematical optimization research incorporates themes from Theoretical computer science, Markov decision process, Limit and Applied mathematics. His studies in Queue integrate themes in fields like Scheduling, Distributed computing and Traffic intensity.

His Combinatorics research includes themes of Discrete mathematics, Multi-armed bandit, Degree of a polynomial and Symmetric polynomial. The various areas that John N. Tsitsiklis examines in his Convergence study include Stochastic process, Multi-agent system and Topology. His research in Algorithm intersects with topics in Distributed algorithm and Robustness.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Parallel and Distributed Computation: Numerical Methods

Dimitri P. Bertsekas;John N. Tsitsiklis.

**(1989)**

8727 Citations

Parallel and Distributed Computation: Numerical Methods

Dimitri P. Bertsekas;John N. Tsitsiklis.

**(1989)**

8727 Citations

Parallel and distributed computation

Dimitri P. Bertsekas;John N. Tsitsiklis;Alexander N. Sennikov.

**(1989)**

8628 Citations

Parallel and distributed computation

Dimitri P. Bertsekas;John N. Tsitsiklis;Alexander N. Sennikov.

**(1989)**

8628 Citations

Neuro-dynamic programming

Dimitri P. Bertsekas;John N. Tsitsiklis.

**(1996)**

7280 Citations

Neuro-dynamic programming

Dimitri P. Bertsekas;John N. Tsitsiklis.

**(1996)**

7280 Citations

Neuro-dynamic programming: an overview

D.P. Bertsekas;J.N. Tsitsiklis.

conference on decision and control **(1995)**

5778 Citations

Neuro-dynamic programming: an overview

D.P. Bertsekas;J.N. Tsitsiklis.

conference on decision and control **(1995)**

5778 Citations

Introduction to linear optimization

Dimitris Bertsimas;John Tsitsiklis.

**(1997)**

3936 Citations

Introduction to linear optimization

Dimitris Bertsimas;John Tsitsiklis.

**(1997)**

3936 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Université Catholique de Louvain

Arizona State University

MIT

Technion – Israel Institute of Technology

MIT

MIT

Columbia University

Stanford University

University of Florida

Indian Institute of Technology Kharagpur

IBM (United States)

University of Warwick

University of California, Berkeley

Amrita Vishwa Vidyapeetham University

University of Porto

University of Antwerp

Rega Institute for Medical Research

University of Tasmania

Met Office

Kantonsspital St. Gallen

Johannes Gutenberg University of Mainz

University of Lübeck

Columbia University

Lawrence Berkeley National Laboratory

Something went wrong. Please try again later.