Arthur Bernstein

Available identifiers

Publication	Date of Publication	Type
A highly asynchronous minimum spanning tree protocol	2020-11-30	Paper
Automatic workflow verification and generation	2006-04-28	Paper
COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS	2006-04-06	Paper
https://portal.mardi4nfdi.de/entity/Q4852241	1995-10-30	Paper
False Deadlock Detection in Distributed Systems	1985-01-01	Paper
A modula based language supporting hierarchical development and verification	1981-01-01	Paper
Conditional Capabilities	1979-01-01	Paper
Conditions for the Equivalence of Synchronous and Asynchronous Systems	1978-01-01	Paper
Extending Concurrent Pascal to Allow Dynamic Resource Management	1977-01-01	Paper
Synthesizing a Response Function with a Feedback Scheduling Algorithm	1976-01-01	Paper
A Computer Architecture for Level Structured Systems	1975-01-01	Paper
Analysis of a Feedback Scheduler	1974-01-01	Paper
Comment on the working set model for program behavior	1970-01-01	Paper
Maximally Connected Arrays on the n-Cube	1967-01-01	Paper
A class of binary recurrent codes with limited error propagation	1967-01-01	Paper
A Shared Memory Computer Display System	1966-01-01	Paper
Encoding of analog signals for binary symmetric channels	1966-01-01	Paper
Optimal Binary Coding of Ordered Numbers	1965-01-01	Paper
Computing Irredundant Normal Forms from Abbreviated Presence Functions	1965-01-01	Paper

This page was built for person: Arthur Bernstein