Cited by 21Cellular Automata and ApplicationsSimulation Techniques and ApplicationsTheoretical and Computational Physics

Parallel random number generator for inexpensive configurable hardware cells

Ackermann, J., Tangen, U., Bödekker, B., Breyer, J., Stoll, E., McCaskill, J.S.·2001·Computer Physics Communications

Integrity signals

Registry

Crossref · 10.1016/s0010-4655(01)00242-9

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Parallel random bit generation methods could dramatically improve the generation rate and scalability by producing many random bits simultaneously.

    “Parallel random bit generation methods could dramatically improve the generation rate and scalability by producing many random bits simultaneously.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ackermann, J., Tangen, U., Bödekker, B., Breyer, J., Stoll, E., & McCaskill, J. S.
Affiliations
University of Zurich (CH)
Corresponding author
Ackermann, J.
Venue
Computer Physics Communications
Publisher
Elsevier BV
Published
2001-11
Volume
140
Issue
3
Pages
293-302
ISSN
0010-4655 (ISSN-L)
OpenAlex
W2055371453
Cited by
21
References
30
Citations by year
2023: 1 · 2015: 1 · 2013: 3 · 2012: 1
FWCI
1.73
Type
journal article
Language
en
Open access
closed
Locations
  • Computer Physics Communications (publishedVersion)
  • Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Simulation Techniques and Applications
  • Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
Keywords
random number generators, parallel processors, cellular automata, configurable hardware, FPGA, self-avoiding walks, two-dimensional Ising model, speedup

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review