On Slepian–Wolf Theorem with Interaction (Q5740187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Internal Compression of Protocols to Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public vs Private Coin in Bounded-Round Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a reverse Newman's theorem in interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noiseless coding of correlated information sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499280 / rank
 
Normal rank

Latest revision as of 08:49, 12 July 2024

scientific article; zbMATH DE number 6605929
Language Label Description Also known as
English
On Slepian–Wolf Theorem with Interaction
scientific article; zbMATH DE number 6605929

    Statements