Towards a reverse Newman's theorem in interactive information complexity
type: Item
instance of: scholarly article
title: Towards a reverse Newman's theorem in interactive information complexity
zbMATH Open document ID: 1353.68073
author: Joshua Brody
author: Harry Buhrman
author: Michal Koucký
author: Bruno Loff
author: Florian Speelman
author: Nikolai K. Vereshchagin
published in: Algorithmica
publication date: 2016-11-29T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6657218
zbMATH Keywords: communication complexity
zbMATH Keywords: information complexity
zbMATH Keywords: information theory
zbMATH Keywords: compression
zbMATH Keywords: Slepian-Wolf
Wikidata QID: Q59477355
MaRDI profile type: Publication
full work available at URL: s00453-015-0112-9
OpenAlex ID: W3001333482
cites work: How to compress interactive communication
cites work: Public vs Private Coin in Bounded-Round Information
cites work: Internal Compression of Protocols to Entropy
cites work: Information Equals Amortized Communication
cites work: Direct Product via Round-Preserving Compression
cites work: An information statistics approach to data stream and communication complexity
cites work: Computing with Noisy Information
cites work: On Representatives of Subsets
cites work: A direct product theorem for two-party bounded-round public-coin communication complexity
cites work: Q4449184
cites work: Private vs. common random bits in communication complexity
cites work: Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
cites work: Noiseless coding of correlated information sources
DBLP publication ID: journals/algorithmica/BrodyBKLSV16
DOI: 10.1007/S00453-015-0112-9
description: scientific article; zbMATH DE number 6657218