The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Venkat Anantharam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Quantization Effects in Low-Density Parity-Check Decoders. [Citation Graph (, )][DBLP]


  41. Analysis of Absorbing Sets for Array-Based LDPC Codes. [Citation Graph (, )][DBLP]


  42. Efficiency of selfish investments in network security. [Citation Graph (, )][DBLP]


  43. Lowering LDPC Error Floors by Postprocessing. [Citation Graph (, )][DBLP]


  44. An Infeasibility Result for the Multiterminal Source-Coding Problem [Citation Graph (, )][DBLP]


  45. Evaluation of Marton's Inner Bound for the General Broadcast Channel [Citation Graph (, )][DBLP]


  46. A Generalized Cut-Set Bound [Citation Graph (, )][DBLP]


  47. On an Outer bound and an Inner Bound for the General Broadcast Channel [Citation Graph (, )][DBLP]


  48. A technique to study the correlation measures of binary sequences. [Citation Graph (, )][DBLP]


Search in 1.110secs, Finished in 1.112secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002