Jan L. A. Snepscheut

694 total citations
21 papers, 264 citations indexed

About

Jan L. A. Snepscheut is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Jan L. A. Snepscheut has authored 21 papers receiving a total of 264 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Jan L. A. Snepscheut's work include Distributed systems and fault tolerance (4 papers), Logic, programming, and type systems (4 papers) and semigroups and automata theory (3 papers). Jan L. A. Snepscheut is often cited by papers focused on Distributed systems and fault tolerance (4 papers), Logic, programming, and type systems (4 papers) and semigroups and automata theory (3 papers). Jan L. A. Snepscheut collaborates with scholars based in Netherlands and United States. Jan L. A. Snepscheut's co-authors include Charles L. Seitz, Sven Mattisson, Alain J. Martin, David Gries, Jan Tijmen Udding, K. Rustan M. Leino, Johan J. Lukkien and H. Peter Hofstee and has published in prestigious journals such as Journal of the ACM, IEEE Transactions on Computers and Lecture notes in computer science.

In The Last Decade

Jan L. A. Snepscheut

20 papers receiving 240 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jan L. A. Snepscheut Netherlands	9	116	111	85	85	83	21	264
M. Rem Netherlands	9	102 0.9×	69 0.6×	74 0.9×	122 1.4×	118 1.4×	42	258
Philipp Woelfel Canada	11	98 0.8×	143 1.3×	239 2.8×	48 0.6×	98 1.2×	50	360
Louis Monier United States	9	71 0.6×	71 0.6×	120 1.4×	103 1.2×	111 1.3×	16	267
Debesh K. Das India	12	148 1.3×	221 2.0×	53 0.6×	371 4.4×	217 2.6×	103	517
Matthew Lewis Germany	7	93 0.8×	61 0.5×	67 0.8×	69 0.8×	84 1.0×	20	195
Michael Abbott United Kingdom	6	55 0.5×	101 0.9×	46 0.5×	44 0.5×	18 0.2×	25	167
Scott Little United States	8	132 1.1×	19 0.2×	52 0.6×	101 1.2×	123 1.5×	21	218
Shih-Chieh Chang Taiwan	9	32 0.3×	79 0.7×	63 0.7×	191 2.2×	213 2.6×	30	300
Kanupriya Gulati United States	11	74 0.6×	36 0.3×	115 1.4×	285 3.4×	273 3.3×	35	419
Denis Barthou France	8	35 0.3×	54 0.5×	118 1.4×	42 0.5×	156 1.9×	31	227

Countries citing papers authored by Jan L. A. Snepscheut

Since Specialization

Citations

This map shows the geographic impact of Jan L. A. Snepscheut'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 Jan L. A. Snepscheut with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan L. A. Snepscheut more than expected).

Fields of papers citing papers by Jan L. A. Snepscheut

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan L. A. Snepscheut. 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 Jan L. A. Snepscheut. The network helps show where Jan L. A. Snepscheut may publish in the future.

Co-authorship network of co-authors of Jan L. A. Snepscheut

This figure shows the co-authorship network connecting the top 25 collaborators of Jan L. A. Snepscheut. A scholar is included among the top collaborators of Jan L. A. Snepscheut 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 Jan L. A. Snepscheut. Jan L. A. Snepscheut is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Snepscheut, Jan L. A.. (1995). The sliding-window protocol revisited. Formal Aspects of Computing. 7(1). 3–17. 4 indexed citations

Leino, K. Rustan M. & Jan L. A. Snepscheut. (1993). Semantics of Exceptions. CaltechAUTHORS (California Institute of Technology). 447–466. 10 indexed citations

Snepscheut, Jan L. A.. (1993). Proxac: An Editor for Program Transformation. CaltechAUTHORS (California Institute of Technology). 3 indexed citations

Snepscheut, Jan L. A.. (1993). What Computing Is All About. 15 indexed citations

Lukkien, Johan J. & Jan L. A. Snepscheut. (1992). Weakest preconditions for progress. Formal Aspects of Computing. 4(2). 195–236. 3 indexed citations

Snepscheut, Jan L. A.. (1991). Inversion of a recursive tree traversal. Information Processing Letters. 39(5). 265–267. 4 indexed citations

Hofstee, H. Peter, Alain J. Martin, & Jan L. A. Snepscheut. (1990). Distributed sorting. Science of Computer Programming. 15(2-3). 119–133. 4 indexed citations

Martin, Alain J. & Jan L. A. Snepscheut. (1990). An interconnection network for distributed recursive computations. IEEE Transactions on Computers. 39(11). 1393–1395. 1 indexed citations

Snepscheut, Jan L. A.. (1989). Mathematics of program construction : 375th anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989 : proceedings. Springer eBooks. 3 indexed citations

10.

Snepscheut, Jan L. A.. (1989). Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University. 1 indexed citations

11.

Gries, David, Alain J. Martin, Jan L. A. Snepscheut, & Jan Tijmen Udding. (1989). An algorithm for transitive reduction of an acyclic graph. Science of Computer Programming. 12(2). 151–155. 19 indexed citations

12.

Snepscheut, Jan L. A., et al.. (1989). Mathematics of Program Construction. Lecture notes in computer science. 32 indexed citations

13.

Snepscheut, Jan L. A., et al.. (1989). On the design of some systolic algorithms. Journal of the ACM. 36(4). 826–840. 5 indexed citations

14.

Snepscheut, Jan L. A.. (1987). Fair mutual exclusion on a graph of processes. Distributed Computing. 2(2). 113–115. 28 indexed citations

15.

Snepscheut, Jan L. A.. (1987). “Algorithms for on-the-fly garbage collection” revisited. Information Processing Letters. 24(4). 211–216. 13 indexed citations

16.

Snepscheut, Jan L. A.. (1986). A derivation of a distributed implementation of Warshall's algorithm. Science of Computer Programming. 7. 55–60. 8 indexed citations

17.

Snepscheut, Jan L. A.. (1985). Trace Theory and VLSJ Design. Lecture notes in computer science. 33 indexed citations

18.

Seitz, Charles L., et al.. (1985). Hot Clock nMOS. 67 indexed citations

19.

Snepscheut, Jan L. A.. (1981). Synchronous communication between asynchronous components. Information Processing Letters. 13(3). 127–130. 8 indexed citations

20.

Snepscheut, Jan L. A., et al.. (1980). SATHE: Some aspects of an ALGOL implementation. Software Practice and Experience. 10(7). 563–573. 1 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.

Explore authors with similar magnitude of impact