Partition expanders

DOI10.4230/LIPICS.STACS.2014.325MaRDI QIDQ2965495zbMATH OpenFDO

Authors Dmitry Gavinsky, Pavel Pudlák

Publication date 3 March 2017

Full work available at URL https://arxiv.org/abs/1401.5781

zbMATH Keywords

partitionscommunication complexityexpanders

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Partition expanders
• Splitting an Expander Graph
• Partition arguments in multiparty communication complexity
• On multi-partition communication complexity
• Partition Arguments in Multiparty Communication Complexity

Cited in

(5)

• Turning the Partition Crank
• scientific article; zbMATH DE number 5942192 (Why is no real title available?)
• Maximum transfer distance between partitions
• Partition expanders
• On flushed partitions

This page was built for publication: Partition expanders

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