71
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
108
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
90
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...
68
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
72
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
CONCUR
1990
Springer
15 years 4 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
56
Voted
CONCUR
1990
Springer
15 years 4 months ago
1990
Springer
56
Voted
CONCUR
1990
Springer
15 years 4 months ago
1990
Springer
CONCUR
1989
Springer
15 years 4 months ago
1989
Springer
In summary, RDL is an intuitionistic temporal logic for the specification of requirements and design of time-dependent systems. Coverage of RDL includes a backward chaining theore...