Results 1  10
of
1,653,989
How powerful are integervalued martingales?
"... Abstract. In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on the values of the bits of X. In the classical mod ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
model, the martingales considered are realvalued, that is, the bets made by the martingale can be arbitrary real numbers. In this paper, we investigate a more restricted model, where only integervalued martingales are considered, and we study the class of random sequences induced by this model. 1
How to break MD5 and other hash functions
 In EUROCRYPT
, 2005
"... Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi freestart collision, in which the initial value of the has ..."
Abstract

Cited by 317 (7 self)
 Add to MetaCart
of the hash function is replaced by a nonstandard value, which is the result of the attack. In this paper we present a new powerful attack on MD5 which allows us to find collisions efficiently. We used this attack to find collisions of MD5 in about 15 minutes up to an hour computation time. The attack is a
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGERVALUED FUNCTIONS
"... Abstract. We consider iterations of integervalued functions φ, which have no fixed points in the domain of positive integers. We define a local function φn, which is a subfunction of φ being restricted to the subdomain {0,..., n}. The iterations of φn can be described by a certain n × n sparse mat ..."
Abstract
 Add to MetaCart
Abstract. We consider iterations of integervalued functions φ, which have no fixed points in the domain of positive integers. We define a local function φn, which is a subfunction of φ being restricted to the subdomain {0,..., n}. The iterations of φn can be described by a certain n × n sparse
THE RING OF INTEGERVALUED POLYNOMIALS OF A DEDEKIND DOMAIN
"... Abstract. Let D be a Dedekind domain and R Int{D) be the ring of integervalued polynomials of D. We relate the ideal class groups of D and R. In particular we prove that, if D = 2 is the ring of rational integers, then the ideal class group of R is a free abelian group on a countably infinite basi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
basis. If D is an integral domain with field of fractions K, the ring of integervalued polynomials of D is denoted by Int(D) and is defined to be the subring of K[t] (where t is an indeterminate) consisting of those polynomials /(/) in K[t] such that f(D) ç D. Work on rings of integervalued polynomials
Loper Rings of integervalued rational functions
 J. Pure Appl. Algebra
, 1998
"... Abstract. Let D be an integral domain which differs from its quotient field K. The ring of integervalued rational functions of D on a subset E of D is defined as IntR(E,D) = {f(X) ∈ K(X)f(E) ⊆ D}. We write IntR(D) for IntR(D,D). It is easy to see that IntR(D) is strictly larger than the more fa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Let D be an integral domain which differs from its quotient field K. The ring of integervalued rational functions of D on a subset E of D is defined as IntR(E,D) = {f(X) ∈ K(X)f(E) ⊆ D}. We write IntR(D) for IntR(D,D). It is easy to see that IntR(D) is strictly larger than the more
Integervalued polynomials and the strong twogenerator property
 Houston J. Math
"... Throughout this paper we denote by D the ring Int(Z,1) of integervalued polynomials of the ring Z of rational integers. Thus, D is by definition the set of all polynomials f(X) C Q[X] such that f(n • C Z for each n • Z. The ring D is known to be a twodimensional Prfifer domain [1]. In [7], we show ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Throughout this paper we denote by D the ring Int(Z,1) of integervalued polynomials of the ring Z of rational integers. Thus, D is by definition the set of all polynomials f(X) C Q[X] such that f(n • C Z for each n • Z. The ring D is known to be a twodimensional Prfifer domain [1]. In [7], we
Author's personal copy Decision Support Additive superefficiency in integervalued data envelopment analysis
, 2011
"... This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or sel ..."
Abstract
 Add to MetaCart
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal noncommercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:
Detection of additive outliers in Poisson INtegervalued AutoRegressive time series
, 2011
"... Outlying observations are commonly encountered in the analysis of time series. In this paper the problem of detecting additive outliers in integervalued time series is considered. We show how Gibbs sampling can be used to detect outlying observations in INAR(1) processes. The methodology proposed i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Outlying observations are commonly encountered in the analysis of time series. In this paper the problem of detecting additive outliers in integervalued time series is considered. We show how Gibbs sampling can be used to detect outlying observations in INAR(1) processes. The methodology proposed
Results 1  10
of
1,653,989