scientific article; zbMATH DE number 3911705

MaRDI QIDQ3687712zbMATH OpenFDO

Authors Thomas G. Kurtz, Udi Manber

Publication date 1985

zbMATH Keywords

amount of communicationdistributed computingMarkov chainsprobabilistic algorithmset disjointness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A probabilistic distributed algorithm for set intersection and its analysis
• A new optimal distributed algorithm for the set intersection problem
• Distributed Interpolatory Algorithms for Set Membership Estimation
• An Interpolatory Algorithm for Distributed Set Membership Estimation in Asynchronous Networks
• Distributed algorithms for selection in sets
• Probabilistic Analysis of Disjoint Set Union Algorithms
• The Probabilistic Communication Complexity of Set Intersection
• Probabilistic analysis of some distributed algorithms
• scientific article; zbMATH DE number 125893
• A lower bound for probabilistic distributed algorithms

Cited in

(4)

• A flexible way of counting large numbers approximately in small registers
• A new optimal distributed algorithm for the set intersection problem
• Probabilistic Analysis of Disjoint Set Union Algorithms
• scientific article; zbMATH DE number 88939 (Why is no real title available?)

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 Q3687712)