On programming of arithmetic operations
From MaRDI portal
Publication:3259307
DOI10.1145/368892.368907zbMath0086.33203OpenAlexW2008913431WikidataQ59699011 ScholiaQ59699011MaRDI QIDQ3259307
Publication date: 1958
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/368892.368907
Related Items (18)
XML compression via directed acyclic graphs ⋮ A note on the Horton-Strahler number for random trees ⋮ A principled, complete, and efficient representation of C++ ⋮ Some width function asymptotics for weighted trees ⋮ Unnamed Item ⋮ On the expressivity and complexity of quantitative branching-time temporal logics ⋮ Convergence of Newton's method over commutative semirings ⋮ Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation ⋮ The Horton-Strahler number of conditioned Galton-Watson trees ⋮ Efficient tabling of structured data with enhanced hash-consing ⋮ Sawja: Static Analysis Workshop for Java ⋮ The number of registers required for evaluating arithmetic expressions ⋮ Synchronizing Automata over Nested Words ⋮ Random self-similar trees: a mathematical theory of Horton laws ⋮ Garbage Collection for Reversible Functional Languages ⋮ Size-space tradeoffs for oblivious computations ⋮ On the Horton-Strahler number for random tries ⋮ Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
This page was built for publication: On programming of arithmetic operations
