Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

TOC
2010

favoriteEmaildiscussreport

106views Management» more TOC 2010»

Separating Deterministic from Randomized Multiparty Communication Complexity

12 years 11 months ago

Separating Deterministic from Randomized Multiparty Communication Complexity

Download www.cs.toronto.edu

Paul Beame, Matei David, Toniann Pitassi, Philipp

Real-time Traffic

Management | TOC 2010 |

claim paper

Related Content

» Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity

» The Maximum Communication Complexity of MultiParty Pointer Jumping

» Exponential Separation of Quantum and Classical Noninteractive Multiparty Communication Co...

» Multiparty Communication Complexity of Disjointness

» Lower Bounds on Quantum Multiparty Communication Complexity

» On distance to monotonicity and longest increasing subsequence of a data stream

» Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multipar...

» Communication vs Computation

» TimeSeries Similarity Problems and WellSeparated Geometric Sets

Post Info
More Details (n/a)

Added	22 May 2011
Updated	22 May 2011
Type	Journal
Year	2010
Where	TOC
Authors	Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel

Comments (0)