Countries citing papers authored by Roberto Segala
Since
Specialization
Citations
This map shows the geographic impact of Roberto Segala'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 Roberto Segala with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roberto Segala more than expected).
This network shows the impact of papers produced by Roberto Segala. 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 Roberto Segala. The network helps show where Roberto Segala may publish in the future.
Co-authorship network of co-authors of Roberto Segala
This figure shows the co-authorship network connecting the top 25 collaborators of Roberto Segala.
A scholar is included among the top collaborators of Roberto Segala 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 Roberto Segala. Roberto Segala 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
1.
Canetti, Ran, Ling Cheung, Moses Liskov, et al.. (2017). Task-structured probabilistic I/O automata. Journal of Computer and System Sciences. 94. 63–97.2 indexed citations
Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2006). Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. DSpace@MIT (Massachusetts Institute of Technology).6 indexed citations
11.
Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2006). The Theory of Timed I/O Automata. Radboud Repository (Radboud University).26 indexed citations
12.
Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2005). Using Probabilistic I/O Automata to improve the analysis of cryptographic protocols. DIAL (Catholic University of Leuven). 63. 40–41.1 indexed citations
13.
Kaynar, Dilsun, et al.. (2003). A Framework for Modeling Timed Systems with Restricted Hybrid Automata.2 indexed citations
Segala, Roberto. (1992). A process algebraic view of I/O automata. DSpace@MIT (Massachusetts Institute of Technology).12 indexed citations
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.