Allerton

1,172 papers445 directions
Allerton is a research venue that has been active since 1987, focusing on the intersection of communication, control, and computing. With a corpus of over 1,200 papers, it serves as a forum for technical research into the theoretical foundations of information systems and signal processing. The venue is characterized by its focus on statistical-to-computational gaps in high-dimensional inference, topology-aware decentralized optimization, and scaling laws for both content delivery and covert communication. The research published at Allerton spans a variety of disciplines, including queueing theory for non-stationary traffic, redundancy strategies for distributed systems, and resource-aware control for networked systems. In recent years, the venue has increasingly incorporated machine learning and artificial intelligence topics, such as mitigating backdoor threats in large language models, graph convolutional network (GCN) sampling, and metric clustering. This evolution reflects a broader trend of applying information-theoretic principles to contemporary AI challenges, including neural population communication and state obfuscation in Gaussian channels. The community associated with Allerton includes prolific contributors such as H. Vincent Poor, Lizhong Zheng, Kannan Ramchandran, and Vaneet Aggarwal. These researchers and their peers contribute to a body of work that emphasizes mathematical rigor in addressing problems like load balancing for heavy-tailed workloads and social learning in interacting filters. By maintaining a focus on the fundamental limits of computation and transmission, the venue provides a consistent framework for analyzing complex networked and automated systems.

Papers by Year

2024 20
2023 36
2022 36
2019 71
2018 92
2017 94
2016 114
2015 116
2014 89
2013 106
2011 102
2010 109
2009 82
2008 97
2007 3
2006 4
2005 4
2001 1
2000 1
1987 1

Top Research Directions

Research directions most represented by papers from this venue.

How Network Topology Governs Decentralized Learning Convergence 8
The Statistical Computational Gap in High Dimensions 7
Quantifying Privacy Leakage with Information Theory 5
Semidefinite Relaxation for Non-Convex Engineering Optimization 5
Overcoming the Limitations of Linear Codes 4
The Linear Deterministic Approach to Wireless Networks 4
Balancing Data Privacy and System Utility 4
The Real World Validation Gap of Synthetic Data 4
Modeling Network Connectivity via Intersected Random Graphs 3
Concentration Inequalities for High Dimensional Systems 3
Distributed Optimization over Directed Networks 3
Zero One Laws for Random Graph Connectivity 3
Communication with Asymmetric Channel State Information 3
From Non-Constructive Existence to Explicit Code Constructions 3
Robust Communication Under Transmitter Side Channel Uncertainty 3

Top Authors

AuthorPapers
Vijay G Subramanian14
Vaneet Aggarwal13
Mingyan Liu12
Pablo Piantanida12
Anant Sahai11
Atilla Eryilmaz11
H. Vincent Poor11
Kannan Ramchandran11
Tsachy Weissman11
Yingbin Liang11
Arya Mazumdar10
George K. Atia10
Jorge Cortes10
Lifeng Lai10
Ness Shroff10
Shuguang Cui10
Venkatesh Saligrama10
Ayfer Ozgur9
Babak Hassibi9
Constantine Caramanis9

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
The shapley value: Its use and implications on internet economics2008
The two-tap input-earasure Gaussian channel and its application to cellular communications2008
Transmission techniques for relay-interference networks2008
Unicast throughput analysis of finite-buffer sparse mobile networks using Markov chains2008
Uniform approximation of functions with random bases2008
Union support recovery in high-dimensional multivariate regression2008
Uplink sum-rate analysis of a multicell system with feedback2008
Weight distribution of codes on hypergraphs2008
Convergence rates of min-cost subgraph yorithiris for multicast in coded networks2007
Distributed protocol for determlisleg when averaging consensus Is readied2007
Secrecy capacity of the wiretap channel with noisy feedback2007
Distributed scheduling schemes for throughput guarantees in wireless networks2006
Enumerating RNA Motifs: A coding-Theoretic approach2006
Randomization for robust communication in networks, or Brother, can you spare a bit?2006
The stopping redundancy hierarchy of cyclic codes2006
Asymptotic distributions of trapping sets in random regular LDPC code ensembles2005
Multi-source change detection for compound Poisson processes2005
Polynomial level-set methods for nonlinear dynamical systems analysis2005
Toward a local, discrete-step tatonnement process for market equilibrium2005
Simultaneous routing and resource allocation in wireless networks2001
On Optimal Control over Packet-Oriented Communication Links2000
Bounds on the variances of importance sampling simulations in digital communication systems.1987

« prev Page 24/24