Parallel algorithms for shared-memory machines. In J. 27] Y. Matias and U. Vishkin. Converting high probability into nearly-constant time|with applications to parallel hashing. 6] O. Berkman and Y. Matias. Fast parallel algorithms for minimum and related problems with small integer inputs. 11] J. Edmonds. Lower bounds with smaller domain size on concurrent write parallel machines. Lower bounds ...

The Casimir force on a D-dimensional sphere due to the confinement of a massless scalar field is computed as a function of D, where D is a continuous variable that ranges from −∞ to ∞. The dependence of the force on the dimension is obtained using a simple and straightforward Green’s function technique. We find that the Casimir force vanishes as D → +∞ (D non-even integer) and also vanishes whe...

This paper aims to model integer valued time series with possible negative values and either positive or negative correlations by introducing the Poisson difference integer valued autoregressive model of order one. This model has Poisson difference marginal distribution and is defined by a new operator called the extended binomial thinning operator. It includes previous integer valued autoregre...

Abstract. A signed binary representation (SBR) of an integer N is a string ab · · · a2a1a0 over the alphabet {−1, 0, 1} such that N = ∑b i=0 ai2 i. An SBR of an integer N is said to be minimal if the number of nonzero digits is minimum. In this paper, we describe a simple 3-close Gray code for listing all minimal SBRs of an integer N . The algorithm is implemented to run in constant amortized t...