We stand with Ukraine  

Jan L. A. van de Snepscheut

Affiliations:
  • California Institute of Technology, USA


According to our database1, Jan L. A. van de Snepscheut authored at least 23 papers between 1979 and 1995.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1995
The Sliding-Window Protocol Revisited.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Formal Aspects Comput., 1995

1994
Semantics of Exceptions.
[BibTeX]
K. Rustan M. Leino
,
Jan L. A. van de Snepscheut
Proceedings of the Programming Concepts, 1994

Mechanized Support for Stepwise Refinement.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Proceedings of the Programming Languages and System Architectures, 1994

1993
What Computing Is All About.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-2710-6, 1993

1992
A LISP Programming Exercise.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Inf. Process. Lett., 1992

Weakest Preconditions for Progress.
[BibTeX]
[DOI]
Johan J. Lukkien
,
Jan L. A. van de Snepscheut
Formal Aspects Comput., 1992

1991
Inversion of a Recursive Tree Traversal.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Inf. Process. Lett., 1991

A Distributed Implementation of a Task Pool.
[BibTeX]
[DOI]
H. Peter Hofstee
,
Johan J. Lukkien
,
Jan L. A. van de Snepscheut
Proceedings of the Research Directions in High-Level Parallel Programming Languages, 1991

1990
An Interconnection Network for Distributed Recursive Computations.
[BibTeX]
[DOI]
Alain J. Martin
,
Jan L. A. van de Snepscheut
IEEE Trans. Computers, 1990

Foreword (Special Issue on Mathematics of Program Construction).
[BibTeX]
Jan L. A. van de Snepscheut
Sci. Comput. Program., 1990

Distributed Sorting.
[BibTeX]
[DOI]
H. Peter Hofstee
,
Alain J. Martin
,
Jan L. A. van de Snepscheut
Sci. Comput. Program., 1990

1989
An Algorithm for Transitive Reduction of an Acyclic Graph.
[BibTeX]
[DOI]
David Gries
,
Alain J. Martin
,
Jan L. A. van de Snepscheut
,
Jan Tijmen Udding
Sci. Comput. Program., 1989

On the design of some systolic algorithms.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
,
Johan B. Swenker
J. ACM, 1989

1987
"Algorithms for On-the-Fly Garbage Collection" Revisited.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Inf. Process. Lett., 1987

Fair Mutual Exclusion on a Graph of Processes.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Distributed Comput., 1987

The Twisted Cube.
[BibTeX]
[DOI]
Peter A. J. Hilbers
,
Marion R. J. Koopman
,
Jan L. A. van de Snepscheut
Proceedings of the PARLE, 1987

1986
A Derivation of a Distributed Implementation of Warshall's Algorithm.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Sci. Comput. Program., 1986

An Alternative Implementation of Communication Primitives.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
,
Jan Tijmen Udding
Inf. Process. Lett., 1986

1985
Evaluating Expressions with a Queue.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Inf. Process. Lett., 1985

Trace Theory and VLSJ Design
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Lecture Notes in Computer Science 200, Springer, ISBN: 978-3-540-15988-9, 1985

1981
Synchronous Communication Between Asynchronous Components.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
Inf. Process. Lett., 1981

1980
SATHE: Some Aspects of an ALGOL Implementation.
[BibTeX]
[DOI]
F. E. J. Kruseman Aretz
,
Jan L. A. van de Snepscheut
,
H. Grasdijk
,
J. M. H. Smeets
Softw. Pract. Exp., 1980

1979
Introducing the notion of processes to hardware.
[BibTeX]
[DOI]
Jan L. A. van de Snepscheut
,
Gert Slavenburg
SIGARCH Comput. Archit. News, 1979


  Loading...