Optimal speedup for backtrack search on a butterfly network

DOI10.1007/BF01187094zbMath0798.68044OpenAlexW4252591780MaRDI QIDQ4277378

Abhiram G. Ranade

Publication date: 7 February 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187094

zbMATH Keywords

backtrack searchbutterfly networkgeneric algorithmsearch tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (2)

Cyclic-cubes and wrap-around butterflies ⋮ Deterministic parallel backtrack search

Cites Work

• Unnamed Item
• Probability Inequalities for the Sum of Independent Random Variables
• Dynamic Tree Embeddings in Butterflies and Hypercubes
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Optimal speedup for backtrack search on a butterfly network