scientific article; zbMATH DE number 1263186

zbMath0968.68507MaRDI QIDQ4234056

Shmuel Safra, Noam Nisan, Avi Wigderson, Peter Bro Miltersen

Publication date: 27 August 2001

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

zbMATH Keywords

party communication complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05)

Related Items (14)

Predecessor queries in dynamic integer sets ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ On the difficulty of range searching ⋮ Tables should be sorted (on random access machines) ⋮ A discrepancy lower bound for information complexity ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ Unnamed Item ⋮ Property testing lower bounds via communication complexity ⋮ On the difficulty of range searching. ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Derandomization for sliding window algorithms with strict correctness ⋮ Unnamed Item ⋮ Pointer chasing via triangular discrimination ⋮ Protocols for asymmetric communication channels

This page was built for publication: