Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A family of rules for recursion removal

From MaRDI portal
Publication:1233310
Jump to:navigation, search

DOI10.1016/0020-0190(76)90015-6zbMath0345.68011OpenAlexW1967952826MaRDI QIDQ1233310

Peter Pepper, Helmut Partsch

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90015-6


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items

Derivation of efficient programs for computing sequences of actions, Tours de Hanoï et automates, The multiway trees of hanoi†, Efficient memo-table management strategies, On a class of recursive procedures and equivalent iterative ones, A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle



Cites Work

  • Translating recursion equations into flow charts
  • The Equivalence of Certain Computations
  • An axiomatic basis for computer programming
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1233310&oldid=13312577"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 08:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki