Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average within
it), or reaches the top citation threshold in at least one of its specific research topics.
Parallel and Distributed Computation: Numerical Methods
19893.8k citationsJohn N. Tsitsiklis et al.profile →
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
19861.3k citationsJohn N. Tsitsiklis et al.profile →
Actor-critic algorithms
20021.1k citationsJohn N. Tsitsiklis et al.profile →
Parallel and distributed computation
1989850 citationsJohn N. Tsitsiklis et al.profile →
Simulated Annealing
1993828 citationsDimitris Bertsimas, John N. TsitsiklisStatistical Scienceprofile →
The Complexity of Markov Decision Processes
1987794 citationsJohn N. Tsitsiklis et al.profile →
An analysis of temporal-difference learning with function approximation
1997717 citationsJohn N. Tsitsiklis, Benjamin Van Royprofile →
Convergence in Multiagent Coordination, Consensus, and Flocking
2006589 citationsVincent D. Blondel, Julien M. Hendrickx et al.profile →
Efficient algorithms for globally optimal trajectories
Countries citing papers authored by John N. Tsitsiklis
Since Specialization
Citations
This map shows the geographic impact of John N. Tsitsiklis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by John N. Tsitsiklis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John N. Tsitsiklis more than expected).
Fields of papers citing papers by John N. Tsitsiklis
This network shows the impact of papers produced by John N. Tsitsiklis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by John N. Tsitsiklis. The network helps show where John N. Tsitsiklis may publish in the future.
Co-authorship network of co-authors of John N. Tsitsiklis
This figure shows the co-authorship network connecting the top 25 collaborators of John N. Tsitsiklis.
A scholar is included among the top collaborators of John N. Tsitsiklis based on the total number of citations
received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with John N. Tsitsiklis. John N. Tsitsiklis is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
#
Work
Indexed citations
1
Convergence of type-symmetric and cut-balanced consensus seeking systems
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.