| 2009 |
|---|
| 49 | EE | Amin Aminzadeh Gohari,
Venkat Anantharam:
Evaluation of Marton's Inner Bound for the General Broadcast Channel
CoRR abs/0904.4541: (2009) |
| 48 | EE | Amin Aminzadeh Gohari,
Venkat Anantharam:
A Generalized Cut-Set Bound
CoRR abs/0904.4542: (2009) |
| 2008 |
|---|
| 47 | EE | Zhengya Zhang,
Lara Dolecek,
Borivoje Nikolic,
Venkat Anantharam,
Martin J. Wainwright:
Lowering LDPC Error Floors by Postprocessing.
GLOBECOM 2008: 3074-3079 |
| 46 | EE | Libin Jiang,
Venkat Anantharam,
Jean C. Walrand:
Efficiency of selfish investments in network security.
NetEcon 2008: 31-36 |
| 45 | EE | Venkat Anantharam:
A technique to study the correlation measures of binary sequences.
Discrete Mathematics 308(24): 6203-6209 (2008) |
| 44 | EE | Aaron B. Wagner,
Venkat Anantharam:
An Improved Outer Bound for Multiterminal Source Coding.
IEEE Transactions on Information Theory 54(5): 1919-1937 (2008) |
| 2007 |
|---|
| 43 | EE | Zhengya Zhang,
Lara Dolecek,
Martin J. Wainwright,
Venkat Anantharam,
Borivoje Nikolic:
Quantization Effects in Low-Density Parity-Check Decoders.
ICC 2007: 6231-6237 |
| 42 | EE | Lara Dolecek,
Zhengya Zhang,
Venkat Anantharam,
Martin J. Wainwright,
Borivoje Nikolic:
Analysis of Absorbing Sets for Array-Based LDPC Codes.
ICC 2007: 6261-6268 |
| 41 | EE | Lara Dolecek,
Venkat Anantharam:
Using Reed-Muller RM(1, m) Codes Over Channels With Synchronization and Substitution Errors.
IEEE Transactions on Information Theory 53(4): 1430-1443 (2007) |
| 2006 |
|---|
| 40 | EE | Zhengya Zhang,
Lara Dolecek,
Borivoje Nikolic,
Venkat Anantharam,
Martin J. Wainwright:
Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation.
GLOBECOM 2006 |
| 39 | EE | Payam Pakzad,
Venkat Anantharam:
Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels.
IEEE Transactions on Communications 54(7): 1149-1153 (2006) |
| 38 | EE | Venkat Anantharam:
On the rod placement theorem of Rybko and Shlosman.
Queueing Syst. 52(3): 185-188 (2006) |
| 37 | EE | Anand D. Sarwate,
Venkat Anantharam:
Exact emulation of a priority queue with a switch and delay lines.
Queueing Syst. 53(3): 115-125 (2006) |
| 2005 |
|---|
| 36 | EE | Aaron B. Wagner,
Venkat Anantharam:
An Infeasibility Result for the Multiterminal Source-Coding Problem
CoRR abs/cs/0511103: (2005) |
| 35 | EE | Aaron B. Wagner,
Venkat Anantharam:
Zero-rate reliability of the exponential-server timing channel.
IEEE Transactions on Information Theory 51(2): 447-465 (2005) |
| 34 | EE | Payam Pakzad,
Venkat Anantharam:
Estimation and Marginalization Using the Kikuchi Approximation Methods.
Neural Computation 17(8): 1836-1873 (2005) |
| 33 | EE | Venkat Anantharam,
Takis Konstantopoulos:
Regulating Functions on Partially Ordered Sets.
Order 22(2): 145-183 (2005) |
| 2004 |
|---|
| 32 | | Venkat Anantharam:
Fourth order cumulant based frequency estimation.
Circuits, Signals, and Systems 2004: 7-10 |
| 31 | | Payam Pakzad,
Venkat Anantharam:
A New Look at the Generalized Distributive Law.
IEEE Transactions on Information Theory 50(6): 1132-1155 (2004) |
| 2003 |
|---|
| 30 | | Pablo Anigstein,
Venkat Anantharam:
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum.
IEEE Transactions on Information Theory 49(4): 873-885 (2003) |
| 2002 |
|---|
| 29 | | Pramod Viswanath,
Venkat Anantharam:
Optimal sequences for CDMA under colored noise: A Schur-saddle function property.
IEEE Transactions on Information Theory 48(6): 1295-1318 (2002) |
| 28 | EE | Richard J. La,
Venkat Anantharam:
Utility-based rate control in the Internet for elastic traffic.
IEEE/ACM Trans. Netw. 10(2): 272-286 (2002) |
| 2001 |
|---|
| 27 | EE | Richard J. La,
Venkat Anantharam:
Window-Based Congestion Control with Heterogeneous Users.
INFOCOM 2001: 1320-1329 |
| 26 | | Pramod Viswanath,
David N. C. Tse,
Venkat Anantharam:
Asymptotically optimal water-filling in vector multiple-access channels.
IEEE Transactions on Information Theory 47(1): 241-267 (2001) |
| 2000 |
|---|
| 25 | EE | Richard J. La,
Venkat Anantharam:
Charge-Sensitive TCP and Rate Control in the Internet.
INFOCOM 2000: 1166-1175 |
| 24 | | Sivarama Venkatesan,
Venkat Anantharam:
The common randomness capacity of a network of discrete memoryless channels.
IEEE Transactions on Information Theory 46(2): 367-387 (2000) |
| 1999 |
|---|
| 23 | | Jeonghoon Mo,
Richard J. La,
Venkat Anantharam,
Jean C. Walrand:
Analysis and Comparison of TCP Reno and Vegas.
INFOCOM 1999: 1556-1563 |
| 22 | | Pramod Viswanath,
Venkat Anantharam,
David N. C. Tse:
Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers.
IEEE Transactions on Information Theory 45(6): 1968-1983 (1999) |
| 21 | | Pramod Viswanath,
Venkat Anantharam:
Optimal sequences and sum capacity of synchronous CDMA systems.
IEEE Transactions on Information Theory 45(6): 1984-1991 (1999) |
| 20 | | Venkat Anantharam:
Scheduling Strategies and Long-Range Dependence.
Queueing Syst. 33(1-3): 73-89 (1999) |
| 1998 |
|---|
| 19 | | Sivarama Venkatesan,
Venkat Anantharam:
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels.
IEEE Transactions on Information Theory 44(1): 215-224 (1998) |
| 18 | | Sivarama Venkatesan,
Venkat Anantharam:
Identification Plus Transmission Over Channels with Perfect Feedbac.
IEEE Transactions on Information Theory 44(1): 284-290 (1998) |
| 17 | EE | Sokratis D. Vamvakos,
Venkat Anantharam:
On the departure process of a leaky bucket system with long-range dependent input traffic.
Queueing Syst. 28(1-3): 191-214 (1998) |
| 1996 |
|---|
| 16 | | Nick McKeown,
Venkat Anantharam,
Jean C. Walrand:
Achieving 100% Throughput in an Input-Queued Switch.
INFOCOM 1996: 296-302 |
| 15 | | Venkat Anantharam,
Sergio Verdú:
Bits through queues.
IEEE Transactions on Information Theory 42(1): 4-18 (1996) |
| 14 | | Ayalvadi J. Ganesh,
Venkat Anantharam:
Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals.
Queueing Syst. 22(3-4): 203-247 (1996) |
| 1995 |
|---|
| 13 | EE | Takis Konstantopoulos,
Venkat Anantharam:
Optimal flow control schemes that regulate the burstiness of traffic.
IEEE/ACM Trans. Netw. 3(4): 423-432 (1995) |
| 1994 |
|---|
| 12 | | Venkat Anantharam,
Ayalvadi J. Ganesh:
Correctness within a constant of an optimal buffer allocation rule of thumb.
IEEE Transactions on Information Theory 40(3): 871-882 (1994) |
| 11 | | Venkat Anantharam,
Michael L. Honig,
U. Madhov,
Victor K. Wei:
Optimization of a Database Hierarchy for Mobility Tracking in a Personal Communications Network.
Perform. Eval. 20(1-3): 278-300 (1994) |
| 1993 |
|---|
| 10 | | Venkat Anantharam:
The input-output map of a monotone discrete-time quasireversible node.
IEEE Transactions on Information Theory 39(2): 543-552 (1993) |
| 9 | | Venkat Anantharam:
Correction to 'The Input-Output Map of a Monotone Discrete-Time Quasireversible Node'.
IEEE Transactions on Information Theory 39(4): 1466- (1993) |
| 8 | EE | Venkat Anantharam,
Ralph L. Disney,
Jean C. Walrand:
Editorial introduction.
Queueing Syst. 13(1-3): 1-3 (1993) |
| 1991 |
|---|
| 7 | | Venkat Anantharam:
The stability region of the finite-user slotted ALOHA protocol.
IEEE Transactions on Information Theory 37(3): 535-540 (1991) |
| 1990 |
|---|
| 6 | | Venkat Anantharam:
A large deviations approach to error exponents in source coding and hypothesis testing.
IEEE Transactions on Information Theory 36(4): 938- (1990) |
| 1989 |
|---|
| 5 | | Venkat Anantharam:
The optimal buffer allocation problem.
IEEE Transactions on Information Theory 35(4): 721-724 (1989) |
| 4 | | Venkat Anantharam:
Threshold Phenomena in the Transient Behaviour of Markovian Models of Communication Networks and Databases.
Queueing Syst. 5(1-3): 77-97 (1989) |
| 3 | | Venkat Anantharam:
How Large Delays Build Up in a GI/G/1 Queue.
Queueing Syst. 5(4): 345-367 (1989) |
| 1988 |
|---|
| 2 | | Venkat Anantharam,
B. Gopinath,
D. Hajela:
A Generalization of the Erlang Formula of Traffic Engineering.
Queueing Syst. 3(3): 277-288 (1988) |
| 1987 |
|---|
| 1 | | Venkat Anantharam:
Probabilistic Proof of the Interchangeability of ./M/1 Queues in Series.
Queueing Syst. 2(4): 387-392 (1987) |
