This map shows the geographic impact of Andre Scedrov'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 Andre Scedrov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andre Scedrov more than expected).
This network shows the impact of papers produced by Andre Scedrov. 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 Andre Scedrov. The network helps show where Andre Scedrov may publish in the future.
Co-authorship network of co-authors of Andre Scedrov
This figure shows the co-authorship network connecting the top 25 collaborators of Andre Scedrov.
A scholar is included among the top collaborators of Andre Scedrov 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 Andre Scedrov. Andre Scedrov is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kanovich, Max, et al.. (2014). Progressing Collaborative Systems. Advances in computer science : an international journal. 3(3). 78–86.2 indexed citations
Chadha, Rohit, John C. Mitchell, Andre Scedrov, & Vitaly Shmatikov. (2005). Contract signing, optimism, and advantage. The Journal of Logic and Algebraic Programming. 64(2). 189–218.9 indexed citations
8.
Scedrov, Andre, et al.. (2004). Soundness and Completeness of Formal Logics of Symmetric Encryption.. Scholarly Commons (University of Pennsylvania). 2005. 101.6 indexed citations
9.
Cervesato, Iliano, Nancy Durgin, Patrick Lincoln, John C. Mitchell, & Andre Scedrov. (2003). A meta-notation for protocol analysis.110 indexed citations
Breazu-Tannen, Val, Thierry Coquand, Carl A. Gunter, & Andre Scedrov. (1991). Inheritance as implicit coercion. Information and Computation. 93(1). 172–221.114 indexed citations
Nerode, Anil, Jeffrey B. Remmel, & Andre Scedrov. (1989). Polynomially graded logic. 375–385.2 indexed citations
17.
Gray, John W. & Andre Scedrov. (1989). Categories in computer science and logic : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held June 14-20, 1987 with support from the National Science Foundation. American Mathematical Society eBooks.5 indexed citations
18.
Tannen, Val, Thierry Coquand, Carl A. Gunter, & Andre Scedrov. (1989). INHERITANCE AND EXPLICIT COERCION (Preliminary Report). 112–129.7 indexed citations
19.
Felty, Amy, Elsa L. Gunter, John Hannan, et al.. (1988). Lambda-Prolog: An Extended Logic Programming Language. 754–755.4 indexed citations
20.
Freyd, Peter & Andre Scedrov. (1987). Some Semantic Aspects of Polymorphic Lambda Calculus. 315–319.7 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.