On programming of arithmetic operations
From MaRDI portal
Publication:3259307
DOI10.1145/368892.368907zbMATH Open0086.33203DBLPjournals/cacm/Ershov58OpenAlexW2008913431WikidataQ59699011 ScholiaQ59699011MaRDI QIDQ3259307FDOQ3259307
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
Cited In (19)
- XML compression via directed acyclic graphs
- Dynamical pruning of rooted trees with applications to 1-D ballistic annihilation
- The Horton-Strahler number of conditioned Galton-Watson trees
- Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)
- The number of registers required for evaluating arithmetic expressions
- Random self-similar trees: a mathematical theory of Horton laws
- Strahler number of natural language sentences in comparison with random trees
- A note on the Horton-Strahler number for random trees
- Some width function asymptotics for weighted trees
- Convergence of Newton's method over commutative semirings
- Garbage Collection for Reversible Functional Languages
- Efficient tabling of structured data with enhanced hash-consing
- A principled, complete, and efficient representation of C++
- Size-space tradeoffs for oblivious computations
- Sawja: static analysis workshop for Java
- On the expressivity and complexity of quantitative branching-time temporal logics
- Title not available (Why is that?)
- On the Horton-Strahler number for random tries
- Synchronizing automata over nested words
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)
