Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A fast algorithm for copying binary trees

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

DOI10.1016/0020-0190(75)90003-4zbMATH Open0312.68021OpenAlexW1965853963MaRDI QIDQ1219682FDOQ1219682


Authors: Douglas W. Clark Edit this on Wikidata


Publication date: 1975

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

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90003-4





Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Cites Work

  • Title not available (Why is that?)
  • Copying cyclic list structures in linear time using bounded workspace






This page was built for publication: A fast algorithm for copying binary trees

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1219682&oldid=13293817"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 07:03. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki