A new optimal distributed algorithm for the set intersection problem

DOI10.1016/0020-0190(91)90236-BMaRDI QIDQ1178213zbMATH OpenOpenAlexWikidataFDO

Authors Subbiah Rajanarayanan, S. S. Iyengar

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90236-b

zbMATH Keywords

distributed computinglower bounddistributed algorithmasynchronous systemcentralized protocoldecentrallized protocol

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 3911705
• scientific article; zbMATH DE number 1202979
• Combinatorial Pattern Matching
• Beyond set disjointness: the communication complexity of finding the intersection
• The communication complexity of set intersection and multiple equality testing

Cites work

• Distributed computation on graphs
• Distributed network protocols

Cited in

(2)

• Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
• scientific article; zbMATH DE number 3911705 (Why is no real title available?)

This page was built for publication: A new optimal distributed algorithm for the set intersection problem

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