Jan L. A. van de Snepscheut

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:88/6446 · DBLP profile ↗

← Back

16ranked-venue papers

11as first author

0since 2021 · last 1995

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 7 first-authorDatabases, data management, data science and information retrieval · 6 · 6 first-authorSoftware engineering, systems software and programming languages · 5 · 2 first-authorSystems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems

2 papers

Interconnection networks and networks-on-chip · 50% Parallel and multicore computing · 29% Hardware accelerators and domain-specific architectures · 22%

Topics — the 5 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Interconnection networks and networks-on-chip network topology	1	1990	An Interconnection Network for Distributed Recursive Computations · IEEE Trans. Computers 1990
Interconnection networks and networks-on-chip › network topology recursive networks	1	1990	An Interconnection Network for Distributed Recursive Computations · IEEE Trans. Computers 1990
Parallel and multicore computing › parallel algorithms › parallel algorithm design systolic algorithms	1	1989	On the design of some systolic algorithms · J. ACM 1989
Hardware accelerators and domain-specific architectures systolic array	1	1989	On the design of some systolic algorithms · J. ACM 1989
Parallel and multicore computing load balancing	1	1990	An Interconnection Network for Distributed Recursive Computations · IEEE Trans. Computers 1990

Methods — techniques the papers use, named apart from their topics

sequential programming techniques · 0.0local communication · 0.0

Year	Publication	Venue	Position
1995	The Sliding-Window Protocol Revisited abstract Abstract We give a correctness proof of the sliding-window protocol. Both safety and liveness properties are addressed. We show how faulty channels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satisfies the original specification, with the exception that it does not have any faulty channels. We work as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The final transformation steps consist in distributing the actions of the sequential program over a number of processes. Jan L. A. van de Snepscheut	Formal Aspects Comput.	1
1992	Weakest Preconditions for Progress abstract Abstract Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced. They can be used to specify certain progress properties of sequential programs. Johan J. Lukkien, Jan L. A. van de Snepscheut	Formal Aspects Comput.	2
1992	A LISP Programming Exercise Jan L. A. van de Snepscheut	Inf. Process. Lett.	1
1991	Inversion of a Recursive Tree Traversal Jan L. A. van de Snepscheut	Inf. Process. Lett.	1
1990	Distributed Sorting H. Peter Hofstee, Alain J. Martin, Jan L. A. van de Snepscheut	Sci. Comput. Program.	3
1990	Foreword (Special Issue on Mathematics of Program Construction) Jan L. A. van de Snepscheut	Sci. Comput. Program.	1
1990	An Interconnection Network for Distributed Recursive Computations abstract Distributed computations may be viewed as a set of communicating processes. If such a computation is to be executed by a multiprocessor system, the processes have to be distributed over the processors, and the communications have to be distributed over a network. This leads to the questions of load balancing and message routing. The authors consider distributed recursive computations and propose a class of interconnection networks that admits a homogeneous distribution of processes and trivial routing. A subclass that admits a planar embedding of the network is identified.> Alain J. Martin, Jan L. A. van de Snepscheut	IEEE Trans. Computers	2
1989	On the design of some systolic algorithms abstract The design of systolic algorithms is discussed, that is, algorithms that may efficiently be executed by a synchronous array of cells that perform local communications only. Systolic algorithms are designed through techniques developed in the context of sequential programming. Heuristics are given that guide the programmer in the design of a variety of efficient solutions. Jan L. A. van de Snepscheut, Johan B. Swenker	J. ACM	1
1989	An Algorithm for Transitive Reduction of an Acyclic Graph David Gries, Alain J. Martin, Jan L. A. van de Snepscheut, Jan Tijmen Udding	Sci. Comput. Program.	3
1987	Fair Mutual Exclusion on a Graph of Processes Jan L. A. van de Snepscheut	Distributed Comput.	1
1987	"Algorithms for On-the-Fly Garbage Collection" Revisited Jan L. A. van de Snepscheut	Inf. Process. Lett.	1
1986	An Alternative Implementation of Communication Primitives Jan L. A. van de Snepscheut, Jan Tijmen Udding	Inf. Process. Lett.	1
1986	A Derivation of a Distributed Implementation of Warshall's Algorithm Jan L. A. van de Snepscheut	Sci. Comput. Program.	1
1985	Evaluating Expressions with a Queue Jan L. A. van de Snepscheut	Inf. Process. Lett.	1
1981	Synchronous Communication Between Asynchronous Components Jan L. A. van de Snepscheut	Inf. Process. Lett.	1
1980	SATHE: Some Aspects of an ALGOL Implementation abstract Abstract The development of a compiler for a dialect of ALGOL 60 is described. The emphasis is on the strategies used in the detection and smooth recovery from errors in the input text. These strategies are independent of both the language implemented and the implementation language. The user's view is such that he sees an ALGOL machine: the user is addressed in a language he is familiar with, using notions from the programming language and his particular program only. F. E. J. Kruseman Aretz, Jan L. A. van de Snepscheut, H. Grasdijk, J. M. H. Smeets	Softw. Pract. Exp.	2