scientific article; zbMATH DE number 6146451

DOI10.4230/LIPIcs.STACS.2008.1341zbMath1259.68056MaRDI QIDQ4910715

Joshua Brody, Amit Chakrabarti

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_68b9.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

communication complexitypointer jumpingnumber on the forehead

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

The function-inversion problem: barriers and opportunities ⋮ Optimal collapsing protocol for multiparty pointer jumping ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ One-way multiparty communication lower bound for pointer jumping with applications

This page was built for publication: