C.A.R. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey, and B.A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672--686, August 1987.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....of affected zone will be shown in the next section. Figure 2 depicts parallel merge of block triangulations by decomposing the domain into four sub domains. The other phase that needs parallelization is partitioning the point set. A parallel partitioning method of Hoare s finding median algorithm [10] is designed to partition the point set into 2D blocks. This partition can reduce the boundary length that need to merge between all processors. As in Figure 2, the processors in the same column merge part of the x direction cut. Only the processors which merge between columns are needed to merge ....

C. A. R. HOARE, Algorithm 63 (partition) and algorithm 65 (find), Communications of the ACM, 4(1961), pp. 321-322.

....An attempt to put a token into a receiver will not return, until a corresponding attempt is made to get a token from the same receiver, and vice versa. As a consequence, the process that first reaches a rendezvous point will stall until the other process also reaches the same rendezvous point. [23] 4.4.2 Continuous time The continuous time (CT) domain [38] models ordinary differential equations (ODEs) extended to allow the handling of discrete events. Special actors which represent integrators are connected in feedback loops in order to represent the ODEs. Each connection in this domain ....

C. Hoare. A theory of CSP. Communications of the ACM, 21(8), August 1978.

....from IBM Corporation. completely against deterioration to quadratic time it would seem necessary to pay a substantial time penalty for the great majority of input sequences. A similar dilemma appears with selection algorithms for finding the i th smallest element of a sequence. Hoare s algorithm [7] based on partitioning has a linear bound in the average case but is quadratic in the worst case. The Blum Floyd Pratt Rivest Tarjan linear time worstcase algorithm [8] is much slower on the average than Hoare s algorithm. In this paper, we concentrate on the sorting problem and return to the ....

....interface but with different or additional behind the scenes functionality. A counting adaptor is an example of adding both to the interface (for initializing and reporting counts) and internal functionality (incrementing the counts) Introspective Selection Algorithms Hoare s find algorithm [7] for selecting the i smallest element of a sequence is similar to quicksort, but only one of the two subproblems generated by partitioning must be pursued. With even splits, the computing time is O(N N=2 N=4 : or O(N ) But the same median of 3 killer sequences described in Section 2 cause ....

C. A. R. Hoare. Algorithm 63 (partition) and algorithm 65 (find). Communications of the ACM, 4(7):321-322, 1961.

....An attempt to put a token into a receiver will not complete until a corresponding attempt is made to get a token from the same receiver, and vice versa. As a consequence, the process that first reaches a rendezvous point will stall until the other process also reaches the same rendezvous point [22]. 2) Continuous time: The continuous time (CT) domain [34] models ordinary differential equations (ODEs) extended to allow the handling of discrete events. Special actors that represent integrators are connected in feedback loops in order to represent the ODEs. Each connection in this domain ....

C. A. R. Hoare. A theory of CSP. Communications of the ACM, 21(8), August 1978.

....in input ports, and there is one receiver for each communication channel. Receivers could represent FIFO queues, mailboxes, proxies for a global queue, or rendezvous points. The communicating sequential processes (CSP) domain represents actor processesthat communicate by instantaneous rendezvous [5]. The continuous time (CT) domain [12] models ordinary differential equations (ODEs) extended to allow the handling of discrete events.Special actors which represent integrators are connected in feedback loops in order to represent the ODEs. In the discrete event (DE) domain, actors communicate ....

Hoare,C. ATheory of CSP. Communications of the ACM,vol.21,no.8,1978.

....de Inform atica Universidade Federal de Pernambuco e mail: fphmb,acasg cin.ufpe.br 1. Introduction The laws of imperative programming are well established and have been useful both for assisting software development and for providing precise axiomatic programming language semantic definitions [Het al..87, Mor94] In fact, besides being used as guidelines to informal programming practices, programming laws establish a sound basis for formal and rigorous software development methods. Moreover, axiomatic semantic definitions are an important tool for the design of correct compilers and code ....

....to show that this set of laws is complete in some sense. The standard approach is to show that the basic set of laws is sufficient to transform an arbitrary program into a normal form expressed in terms of a small subset of the language operators, following the approach adopted, for example, in [Het al..87, RH88] This, however, is beyond the scope of this article. This work is in the context of the CO OP (Calculus of Object Oriented Programming) project, a joint initiative funded by PROTEM CC NSF which aims at defining a formal semantics for rool [CN99] and proposing and proving basic, design, ....

[Article contains additional citation context not shown here]

C. A. R. Hoare et al . Laws of programming. Communications of the ACM, 30(8):672--686, August 1987.

.... value of their di erence then this de nition of median reduces to the usual one in statistics (if the numbers are sorted the scalar median is the number that appears in the middle of the list) To nd the scalar median linear time algorithms are available such as the Hoare nd algorithm [1]. Remedian [2] is an approximate median computation algorithm. It works in linear time and only needs a logarithmic storage. The authors thank the Spanish CICyT for partial support of this work through project TIC97 0941 and TIC2000 1703 CO3 02. approximate median median computation ....

C.A.R. Hoare. Find (algorithm 65). Communications of the ACM, 4(7):321-322, 1961.

....for quicksort. 1 Introduction Early in the sixties, C.A.R. Hoare devised two efficient algorithms, quicksort and quickselect (also known as Hoare s Find algorithm and as one sided quicksort) for internal sorting and selection, respectively, both of great theoretical and practical importance [7, 8]. These algorithms combine elegance and efficiency, and still remain among the best practical algorithms for sorting and This research was supported by the ESPRIT LTR Project ALCOM IT, contract # 20244 and by a grant from CIRIT (Comissi o Interdepartamental de Recerca i Innovaci o ....

C.A.R. Hoare. Find (Algorithm 65). Communications of the ACM, 4:321-- 322, 1961.

No context found.

C.A.R. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey, and B.A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672--686, August 1987.

No context found.

C. A. R. Hoare et al. Laws of programming. Communications of the ACM, 30(8):672--686, August 1987.

No context found.

HOARE, C. H'v#'...+) 6 Pfr...h#vt T'+#r T#...p#...vt 8'prf#, Communications of the ACM, 12(10), October 1974.

No context found.

C. Hoare: Communicating sequential processes. Communications of the ACM 21, 666-677 (1978)

No context found.

C. A. R. Hoare. Algorithm 63 (partition) and algorithm 65 (find). Communications of the acm, 4(7):321-322, 1961.

No context found.

C.A.R. Hoare. Find (algorithm 65). Communications of the ACM, 4(7):321--322, 1961.

No context found.

C. A. R. Hoare and et al. Laws of programming. Communications of the ACM, 30(8):672--686, 1987.

No context found.

C. A. R. Hoare and et al. Laws of programming. Communications of the ACM, 30(8):672--686, 1987.

No context found.

C. A. R. Hoare, I. J. Hayes, He Jifeng, C. C. Morgan, A. W. Roscoe, J. W. Sanders, I. H. Srensen, J. M. Spivey, and B. A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672-686, August 1987. See corrigendum

No context found.

Hoare, C., J. Spivey, I. Hayes, J. He, C. Morgan, A. W. Roscoe, J. Sanders, I. Sorenson and B. Sufrin, Laws of programming, Communications of the ACM 30 (1987), pp. 672--686.

No context found.

C.A.R. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey, and B.A. Sufrin. Laws of programming. Communications of the ACM, 30(8):672--686, August 1987.

No context found.

C. A. R. Hoare. Quicksort. Communication of the ACM, 4(7):321, 1961.

No context found.

Hoare et al , C.A.R.: Laws of programming. Communications of the ACM 30 (1987) 672--686

No context found.

C.A.R. Hoare et al. Laws of programming. Communications of the ACM, 30(8):672-- 686, 1987.

No context found.

C. A. R. Hoare. Algorithm 63, Partition; Algorithm 64, Quicksort; Algorithm 65, Find. Communications of the ACM, 4(7):321--322, July 1961.

No context found.

C. A. R. Hoare. Algorithm 63 (partition) and algorithm 65 (find). Communications of the ACM, 4(7):321--322, 1961.

No context found.

Hoare, C. A. R. Algorithm 63 (partition) and algorithm 65 (find). Communications of the ACM 4, 7 (1961), 321--322.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC