scientific article; zbMATH DE number 432837

zbMATH Open0800.68643MaRDI QIDQ3138971FDOQ3138971

David S. Greenberg, Pangfeng Liu, Tom Leighton, Sandeep Bhatt

Publication date: 20 October 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

distributed algorithmsmessage passingon-line tree embeddings

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distributed algorithms (68W15)

Cited In (7)

• Scheduling task-trees with additive scales on parallel/distributed machines
• Deterministic parallel backtrack search
• Optimal speedup for backtrack search on a butterfly network
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• Scheduling task-tree with additive scales on parallel/distributed machines
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

This page was built for publication:

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