A technique for counting ones in a binary computer

  title={A technique for counting ones in a binary computer},
  author={Peter Wegner},
  journal={Commun. ACM},
  • P. Wegner
  • Published 1 May 1960
  • Computer Science
  • Commun. ACM
Standard methods of counting binary ones on a computer with a 704 type instruction code require an inner loop which is carried out once for each bit in the machine word. Program 1 (written in SAP language for purposes of illustration) is an example of such a standard program. 
A Non-Oblivious Reduction of Counting Ones to Multiplication
An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number-wise logical operations and multiplication.
Incremental bounded software model checking
This work presents an incremental approach to Bounded Software Model Checking, which enables increasing the bound without incurring the overhead of a restart, and provides an LLVM-based open-source implementation which supports a wide range of incremental SMT solvers.
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem
Job Shop Scheduling is currently one of the most addressed planning and scheduling optimization problems in the field. Due to its complexity, as it belongs to the NP-Hard class of problems,
An Efficient and Precise Remote Sensing Optical Image Matching Technique Using Binary-Based Feature Points
A systematic algorithm that incorporates the synthetic-colored enhanced accelerated binary robust invariant scalar keypoints (SC-EABRISK) method and the affine transformation with bounding box (ATBB) procedure to address image matching efficiently and precisely is proposed.
Random logic networks: From classical Boolean to quantum dynamics.
We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations
Rank and select operations on a word
Spangle: A Distributed In-Memory Processing System for Large-Scale Arrays
By adopting the array data model, Spangle provides an interface for expressing machine learning algorithms, which heavily rely on linear algebra, and is implemented on top of Apache Spark, a popular map-reduce framework for complex computation workloads.
Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs
Zilch is presented, a framework that accelerates and simplifies the deployment of VC and ZKPK for any application transparently, i.e., without the need of trusted setup, and implemented Z MIPS: a MIPS-like processor model that allows verifying each instruction independently and composing a proof for the execution of the target application.
A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem †
This work proposes a new GA that generalizes the concept of a massive local search operator; it improves the use of a local search strategy in the traditional mutation operator; and it developed a new multi-crossover operator.