On boolean decision trees with faulty nodes

DOI10.1002/RSA.3240050306zbMATH Open0811.68101OpenAlexW2011827786MaRDI QIDQ4306374FDOQ4306374

Authors: Valerie King, Claire Kenyon 

Publication date: 19 September 1994

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050306

Recommendations

• Decision tree approximations of Boolean functions
• Randomized Boolean decision trees: Several remarks
• Totally optimal decision trees for Boolean functions
• Efficient exploration of faulty trees
• Bounds on the depth of decision trees that compute Boolean functions
• Lower bounds for noisy Boolean decision trees
• Computing in fault tolerant broadcast networks and noisy decision trees
• Fault-Tree Analysis Using a Binary Decision Tree
• Decision trees with Boolean threshold queries

zbMATH Keywords

Boolean decision tree modelcomputing with faulty components

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Sums of independent random variables; random walks (60G50)

Cited In (11)

• Computing in fault tolerant broadcast networks and noisy decision trees
• Fault-Tree Analysis Using a Binary Decision Tree
• Efficient exploration of faulty trees
• Searching games with errors -- fifty years of coping with liars
• Title not available (Why is that?)
• Decision tree approximations of Boolean functions
• Computing Boolean functions from multiple faulty copies of input bits
• Title not available (Why is that?)
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Title not available (Why is that?)
• Decision Trees for Fault Diagnosis in Circuits and Switching Networks

This page was built for publication: On boolean decision trees with faulty nodes

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