- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 5, MAY 2009 2139 The Error Exponent of Variable-Length Codes Over
- Capacity of Markov Channels with Partial State Serdar Yuksel
- Graph Covers and Quadratic Minimization Nicholas Ruozzi
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005 799 Feedback Capacity of Finite-State Machine Channels
- Calculating Blocking Probabilities for Loss Networks Based on Probabilistic Graphical Models
- On the Burnashev exponent for Markov channels Giacomo Como
- Cooperative Control Under Communication Constraints
- The Sequential Rate Distortion Function and Joint Source-Channel Coding with Feedback
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 3, MARCH 2007 929 On the Feedback Capacity of Power-Constrained
- Performance Analysis of Sum-Product Algorithms for Multiple Fault Diagnosis Applications
- On the error exponent of Markov channels with ISI and feedback
- ISlT2003,Yokohama, Japan, June29 -July 4,2003 Delayed Feedback Capacity of Finite-State Machine Channels
- A Markov Decision Approach to Feedback Channel Capacity Sekhar Tatikonda
- A Factor Graph Modelling of Product-Form Loss and Queueing Networks
- Revenue Optimization via Call Admission Control and Pricing for Mobile Cellular Systems
- MAXIMUM WEIGHT PARTIAL COLORINGS ON SPARSE RANDOM GRAPHS*
- Opportunistic capacity and error exponent regions for variable length communication over compound
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 323 The Capacity of Channels With Feedback
- Network Tomography Based on Additive Metrics Jian Ni Sekhar Tatikonda
- Capacity-achieving Feedback Scheme for Markov Channels with Channel State Information
- Network Routing Topology Inference from End-to-End Measurements
- Distributed Sensing and Control over Communication Channels and a Counterexample
- Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
- The Structure of Encoders for Channels with Feedback
- Achievable Rates for Channels with Deletions and Insertions
- Threshold and Reservation Based Call Admission Control Policies for Multiservice
- Sequential team form and its simplification using graphical models
- Control Under Communication Constraints Sekhar Chandra Tatikonda
- Uniqueness of Gibbs Measures with Applications to Gibbs Sampling and the Sum-Product Algorithm
- Coding and Routing Complexity in Sensor Networks Sekhar Tatikonda
- A Large-Scale Distributed Traffic Matrix Estimation Algorithm Jian Ni, Sekhar Tatikonda, Edmund M. Yeh1
- IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 1, FEBRUARY 2010 123 Efficient and Dynamic Routing Topology Inference
- s-t Paths Using the Min-Sum Algorithm Nicholas Ruozzi
- Message Passing Algorithms for Optimization Nicholas Robert Ruozzi
- ITW2003, Paris, France,March31 -April 4,2003 Convergenceof the Sum-ProductAlgorithm
- Explicit Link Parameter Estimators Based on End-to-End Measurements Jian Ni and Sekhar Tatikonda
- 1196 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 7, JULY 2004 Control Over Noisy Channels
- Proceeding ofthe 2004 American Control Conference Boston,MassachusettsJune 30 -July 2,2004
- Analysis of Max-Product via Local Maxifiers Stephan Winkler
- Criteria for Rapid Mixing of Gibbs Samplers and Uniqueness of Gibbs Measures
- Convergent and Correct Message Passing Schemes for Optimization Problems over Graphical Models
- Sequential Source Coding: An optimization viewpoint V.S. Borkar1, S.K. Mitter2, Anant Sahai3, Sekhar Tatikonda4
- A Markov Random Field Approach to Multicast-Based Network Inference Problems
- Proceedingsof the 37th IEEE Conferenceon Decision & Control
- Bounds on the Optimal Rate for Synchronization from Deletions and Insertions
- Feedback Capacity of Stationary Sources over Gaussian Intersymbol Interference Channels
- Pmeeedigs ofthe 42nd IEEE Conferenceon Decisionand Control
- Performance Analysis and Inference of Communication Networks In this thesis we design, analyze, and develop accurate and scalable algorithms and
- Control Under Communication Constraints Sekhar Chandra Tatikonda
- 1588 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 8, AUGUST 2007 Analyzing Product-Form Stochastic Networks Via
- 158 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 Optimal and Structured Call Admission Control
- Loopy Belief Propagation and Gibbs Measures Sekhar C. Tatikonda
- Convergence of Optimal Values Past Critical Threshold Steven Jaslar
- Feedback and Side-Information in Information Theory
- Clustering Phenomena in Message-Passing Schemes Sekhar Tatikonda
- IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 4, APRIL 2009 841 A Counterexample in Distributed
- A training based scheme for communicating over unknown channels with feedback
- The Asymptotics of Combinatorial Problems on Random Steven Jaslar
- ISlT 1998,Cambridge, M A , USA, August 16 -August 21 Optimal Sequential Vector Quantization of Markov Sources
- 1056 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 7, JULY 2004 Control Under Communication Constraints
