On the average number of registers needed to evaluate a special class of backtrack trees

DOI10.1051/ita/1993270605411zbMath0809.68104OpenAlexW194764182MaRDI QIDQ4304555

Uwe Trier

Publication date: 13 October 1994

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92465

zbMATH Keywords

binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (1)

Uniformly growing backtrack trees

Cites Work

• Additive weights of a special class of nonuniformly distributed backtrack trees
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• The expected additive weight of trees
• Tree Size by Partial Backtracking
• On the Altitude of Nodes in Random Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: On the average number of registers needed to evaluate a special class of backtrack trees