Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 5 of 5.

Add to Quick Collection   All 5 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41607
Description: We show that the communication complexity of the parity of the sum of binary digits of x+y is at least 0.085667...n+O(1) where x and y are n-bit integers. We also obtain a nontrivial (but weaker) lowe ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/115255
Description: We bound exponential sums along the orbits of essentially arbitrary multivariate polynomial dynamical systems, provided that the orbits are long enough. We use these bounds to derive nontrivial estima ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/9952
Description: The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. In this paper we present a new bound on the s-dimensional ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/101357
Description: We prove a discrepancy bound “on average” over all initial values aα(0)=α of congruential pseudorandom numbers obtained from the sequences aα(n) over a finite field of prime order defined by aα(n)=naα ... More
Reviewed: Reviewed
Date: 2003
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/79990
Description: 17 page(s)
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last