Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Information-theoretic lower bounds for distributed function computation
Aolin Xu,
Maxim Raginsky
Electrical and Computer Engineering
Coordinated Science Lab
Carl R. Woese Institute for Genomic Biology
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Information-theoretic lower bounds for distributed function computation'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Computation Time
100%
Information-theoretic Bounds
100%
Distributed Function Computation
100%
Cut Set
60%
Conditional mutual Information
60%
Small Ball Probability
40%
Tight
20%
Joint Distribution
20%
Value Function
20%
Common Function
20%
Linear Function
20%
Minimum Time
20%
Sums of Independent Random Variables
20%
Finite Capacity
20%
General Network
20%
Random Observations
20%
Accuracy Requirements
20%
Given Accuracy
20%
Line Network
20%
Point-to-point Channel
20%
Strong Data Processing Inequality
20%
Information-theoretic Converse
20%
Bidirectional Link
20%
Concentration Function
20%
Capacity Upper Bound
20%
Mathematics
Mutual Information
100%
Conditionals
100%
Probability Theory
66%
Upper Bound
66%
Joint Distribution
33%
Function Value
33%
Linear Function
33%
Sums Of Independent Random Variables
33%
Computer Science
Computation Time
100%
Function Computation
100%
Mutual Information
60%
Joint Distribution
20%
Actual Function
20%
Function Value
20%
Data Processing
20%
Needed Information
20%
Linear Function
20%
Random Variable
20%
Accuracy Requirement
20%