An interactive information odometer and applications

DOI10.1145/2746539.2746548MaRDI QIDQ2941524zbMATH OpenOpenAlexFDO

Authors Mark Braverman, O. Weinstein

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746548

zbMATH Keywords

direct product theoremsinformation complexityinteractive compressionsecure computation

Mathematics Subject Classification ID

Network protocols (68M12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• How to compress interactive communication
• How to compress interactive communication
• New Lower Bounds for Privacy in Communication Protocols
• Interactive compression for product distributions
• Interactive compression to external information

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(6)

• Information complexity and applications.
• New strong direct product results in communication complexity
• A direct product theorem for two-party bounded-round public-coin communication complexity
• Interactive information complexity
• Communication complexity of statistical distance
• The work of Mark Braverman

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: An interactive information odometer and applications

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