On programming of arithmetic operations

DOI10.1145/368892.368907MaRDI QIDQ3259307zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrei P. Ershov

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

zbMATH Keywords

numerical analysis

Cited in

(21)

• Size-space tradeoffs for oblivious computations
• The number of registers required for evaluating arithmetic expressions
• A note on the Horton-Strahler number for random trees
• Some width function asymptotics for weighted trees
• On the expressivity and complexity of quantitative branching-time temporal logics
• Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation
• The Horton-Strahler number of conditioned Galton-Watson trees
• Random self-similar trees: a mathematical theory of Horton laws
• XML compression via directed acyclic graphs
• Synchronizing automata over nested words
• Garbage Collection for Reversible Functional Languages
• Sawja: static analysis workshop for Java
• On the Horton-Strahler number for random tries
• scientific article; zbMATH DE number 3872676 (Why is no real title available?)
• A principled, complete, and efficient representation of C++
• Efficient tabling of structured data with enhanced hash-consing
• Strahler number of natural language sentences in comparison with random trees
• The Strahler number of a parity game
• Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
• Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
• Convergence of Newton's method over commutative semirings

This page was built for publication: On programming of arithmetic operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3259307)