A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two

The participation of the first author in multiple algorithmic contests (both as a contestant and as a member of the scientific committee) influenced many of the results presented in this paper. The attached ZIP archive contains a few sample tasks and solutions (of the first author or of others) which are related to some of the algorithms presented in this paper.

Data and Resources

Additional Info

Field Value
Source EISSN: 1537-744X
Author Andreica, Mugurel Ionut
Maintainer CCSD
Last Updated May 8, 2026, 06:14 (UTC)
Created May 8, 2026, 06:14 (UTC)
Identifier hal-00904177
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Parallel and Distributed Systems Laboratory [Bucarest] ; Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România] (UPB)
creator Andreica, Mugurel Ionut
date 2013-11-11T00:00:00
harvest_object_id 564d6c19-8725-450d-ba57-8c4b6551ac33
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-01-14T00:00:00
relation info:eu-repo/semantics/altIdentifier/doi/10.1155/2013/751358
set_spec type:ART