We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with O(logn) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P and for a given point q ∈ P , we sa...

Testing two-port memories requires the use of single-port tests as well as special two-port tests; the test strategy determines which tests to be used. Many two-port memories have ports which are read-only or write-only; this impacts the possible fault models, the tests for single-port and two-port memories, as well as the test strategy. This paper presents a test strategy for two-port memories...

If these statements are taken literally (which the theory allows us to do), they imply that God modified the design of the universe after the Fall (cf. Rom. 8:20−22). If he carried this through consistently, so that all parts of the universe conformed to the new design, then, after the Curse, the universe would again have been a going concern, and would again have appeared to have a history tha...

Abstract A generating set S for a group G is independent if the subgroup generated by $S\setminus \{s\}$ properly contained in all $s \in S.$ We describe structure of finite groups such that there are precisely two numbers appearing as cardinalities sets .

[no abstract available]