Table of Contents

• Network coding for computingRathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger. 1-6 [doi]
• Landmark-based position and movement detection of wireless sensor network devicesIoannis Ch. Paschalidis, Keyong Li, Dong Guo 0004. 7-14 [doi]
• Range-based geolocation in fading environmentsBrian M. Sadler, Ning Liu 0005, Zhengyuan Xu, Richard J. Kozick. 15-20 [doi]
• Union support recovery in high-dimensional multivariate regressionGuillaume Obozinski, Martin J. Wainwright, Michael I. Jordan. 21-26 [doi]
• Diversity-multiplexing tradeoff of the half-duplex relay channelSameer Pawar, Amir Salman Avestimehr, David N. C. Tse. 27-33 [doi]
• Reduced-complexity transmit power optimization techniques for multiuser MIMO with per-antenna power constraintYusuke Ohwatari, Anass Benjebbour, Junichiro Hagiwara, Tomoyuki Ohya. 34-38 [doi]
• Optimal resource allocation for MIMO ad hoc cognitive radio networksSeung-Jun Kim 0002, Georgios B. Giannakis. 39-45 [doi]
• Maximizing the sum rate in symmetric networks of interfering links under flat power constraintsNasreen Badruddin, Sibi Raj Bhaskaran, Jamie S. Evans, Stephen V. Hanly. 46-53 [doi]
• Minimum energy-per-bit multi-hop wireless networksChanghun Bae, Wayne E. Stark. 54-61 [doi]
• Minimization of transceiver energy consumption in wireless sensor networks with AWGN channelsTianqi Wang, Wendi B. Heinzelman, Alireza Seyedi. 62-66 [doi]
• Modeling and analysis of energy harvesting nodes in wireless sensor networksAlireza Seyedi, Biplab Sikdar 0001. 67-71 [doi]
• Power-bandwidth tradeoff in multiuser relay channels with opportunistic schedulingOzgur Oyman, Moe Z. Win. 72-78 [doi]
• Opportunistic multi-antenna downlink transmission with finite-rate feedbackAli Tajer, Xiaodong Wang 0001. 79-86 [doi]
• Diversity-multiplexing tradeoff in multiple-relay network-part I: Proposed scheme and single-antenna networksShahab Oveis Gharan, Alireza Bayesteh, Amir K. Khandani. 87-94 [doi]
• Diversity-multiplexing tradeoff in multiple-relay network-part II: Multiple-antenna networksShahab Oveis Gharan, Alireza Bayesteh, Amir K. Khandani. 95-102 [doi]
• Diversity multiplexing tradeoff of asynchronous cooperative relay networksR. N. Krishnakumar, Naveen Naveen, K. Sreeram, P. Vijay Kumar. 103-110 [doi]
• Some geometric methods for construction of space-time codes in Grassmann manifoldsZoran Utkovski, Pi-Chin Chen, Juergen Lindner. 111-118 [doi]
• Broadcast channel: Degrees of freedom with no CSIRUmer Salim, Dirk Slock. 119-125 [doi]
• On replica symmetry breaking in vector precoding for the Gaussian MIMO broadcast channelBenjamin M. Zaidel, Ralf R. Müller, Rodrigo de Miguel, Aris L. Moustakas. 126-132 [doi]
• Complementary codes based channel estimation for MIMO-OFDM systemsMichael D. Zoltowski, Tariq R. Qureshi, A. Robert Calderbank. 133-138 [doi]
• An adaptive limited feedback scheme for MIMO-OFDMA based on optimal stoppingJieying Chen, Randall A. Berry, Michael L. Honig. 139-145 [doi]
• A coded-feedback construction of locally minimum-cost multicast network codesChih-Chun Wang. 146-153 [doi]
• Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networksSukwon Kim, Tracey Ho, Michelle Effros. 154-161 [doi]
• Toward an optimal 1+N protection strategyAhmed E. Kamal 0001, Osameh M. Al-Kofahi. 162-169 [doi]
• M-Perf: An available bandwidth estimation tool for multicast applicationsNiveditha Sundaram, Parameswaran Ramanathan. 170-176 [doi]
• A simple algebraic formulation for the scalar linear network coding problemAbhay T. Subramanian, Andrew Thangaraj. 177-184 [doi]
• Cayley's hyperdeterminant, the principal minors of a symmetric matrix and the entropy region of 4 Gaussian random variablesSormeh Shadbakht, Babak Hassibi. 185-190 [doi]
• Spectral clustering in high-dimensions: Necessary and sufficient conditions for dense and sparse mixturesMartin J. Wainwright. 191 [doi]
• Random projection trees for vector quantizationSanjoy Dasgupta, Yoav Freund. 192-197 [doi]
• Practical near-optimal sparse recovery in the L1 normRadu Berinde, Piotr Indyk, Milan Ruzic. 198-205 [doi]
• Recent results on processing random-order streams and space-efficient samplingAndrew McGregor. 206-208 [doi]
• Counter Braids: Asymptotic optimality of the message passing decoding algorithmYi Lu 0001, Andrea Montanari, Balaji Prabhakar. 209-216 [doi]
• Common Randomness, Multiuser Secrecy and Tree PackingSirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik. 217-220 [doi]
• Fading broadcast channels with state information at the receiversDavid Tse, Roy D. Yates, Zang Li. 221-227 [doi]
• The two-tap input-earasure Gaussian channel and its application to cellular communicationsOren Somekh, Osvaldo Simeone, H. Vincent Poor, Shlomo Shamai. 228-235 [doi]
• Crime and Punishment for Cognitive RadiosKristen Ann Woyach, Anant Sahai, George K. Atia, Venkatesh Saligrama. 236-243 [doi]
• Security games for vehicular networksSonja Buchegger, Tansu Alpcan. 244-251 [doi]
• Security investment games of interdependent organizationsReiko Ann Miura-Ko, Benjamin Yolken, Nicholas Bambos, John Mitchell. 252-260 [doi]
• Dynamic network security deployment under partial informationGeorge Theodorakopoulos 0001, John S. Baras, Jean-Yves Le Boudec. 261-267 [doi]
• Privacy-security tradeoffs in biometric security systemsLifeng Lai, Siu-Wai Ho, H. Vincent Poor. 268-273 [doi]
• Performance evaluation of code-spread OFDMMuthanna Al-Mahmoud, Michael D. Zoltowski. 274-278 [doi]
• Linear-programming receiversMark F. Flanagan. 279-285 [doi]
• On the information capacity of Gaussian channels under small peak power constraintsMaxim Raginsky. 286-293 [doi]
• Efficient maximum-likelihood noncoherent orthogonal STBC detectionDimitris S. Papailiopoulos, George N. Karystinos. 294-300 [doi]
• An outer bound to the admissible source region of broadcast channels with arbitrarily correlated sources and channel variationsAmin Aminzadeh Gohari, Venkat Anantharam. 301-308 [doi]
• Single-user MIMO vs. Multiuser MIMO in the broadcast channel with CSIT constraintsJun Zhang 0004, Jeffrey G. Andrews, Robert W. Heath Jr.. 309-314 [doi]
• On capacity of deterministic relay networksMohammad Ali Khojastepour, Alireza Keshavarz-Haddad. 315-318 [doi]
• Effects of delay and links between relays on the min-cut capacity in a wireless relay networkHakan Topakkaya, Zhengdao Wang. 319-323 [doi]
• Distributed design of network codes for wireless multiple unicastsSukwon Kim, Michelle Effros, Tracey Ho. 324-331 [doi]
• Random linear coding for multicast over a time-varying channelRandy Cogill, Brooke Shrader, Anthony Ephremides. 332-338 [doi]
• Network codes with deadlinesElona Erez, Michelle Effros, Tracey Ho. 339-346 [doi]
• A partial order approach to decentralized control of spatially invariant systemsParikshit Shah, Pablo A. Parrilo. 347-352 [doi]
• Convergence analysis of distributed subgradient methods over random networksIlan Lobel, Asuman E. Ozdaglar. 353-360 [doi]
• Distributed sensor localization in Euclidean spaces: Dynamic environmentsUsman A. Khan, Soummya Kar, Bruno Sinopoli, José M. F. Moura. 361-366 [doi]
• Rates of convergence for greedy gossip with eavesdroppingDeniz Üstebay, Boris N. Oreshkin, Mark Coates, Michael G. Rabbat. 367-374 [doi]
• Efficient energy management policies for networks with energy harvesting sensor nodesVinod Sharma, Utpal Mukherji, Vinay Joseph. 375-383 [doi]
• Networking sensors using belief propagationSujay Sanghavi, Dmitry Malioutov, Alan S. Willsky. 384-391 [doi]
• Multidimensional flash codesEitan Yaakobi, Alexander Vardy, Paul H. Siegel, Jack K. Wolf. 392-399 [doi]
• Weight distribution of codes on hypergraphsAlexander Barg, Arya Mazumdar, Gilles Zémor. 400-401 [doi]
• Efficient implementation of linear programming decodingMohammad H. Taghavi, Amin Shokrollahi, Paul H. Siegel. 402-409 [doi]
• Achievable flows on orthogonal information networksDinkar Vasudevan. 410-417 [doi]
• On a class of optimal rateless codesVijay G. Subramanian, Douglas J. Leith. 418-425 [doi]
• On asymptotics of Tomlinson-Harashima precoding with channel uncertaintyAlon Shalev Housfater, Teng Joon Lim. 426-431 [doi]
• A Stieltjes transform approach for analyzing the RLS adaptive FilterAli Vakili, Babak Hassibi. 432-437 [doi]
• Tracking in the presence of a time-varying uncertain gainJulie R. Vale, Daniel E. Miller. 438-445 [doi]
• A Bayesian network approach to control of networked Markov decision processesSachin Adlakha, Sanjay Lall, Andrea Goldsmith. 446-451 [doi]
• Mixed norm low order multirate filterbank design: Relaxed commutant lifting approachDzung Du, Wisuwat Bhosri, Arthur E. Frazho. 452-459 [doi]
• The capacity region of large wireless networksUrs Niesen, Piyush Gupta, Devavrat Shah. 460-466 [doi]
• Transmission techniques for relay-interference networksSoheil Mohajer, Suhas N. Diggavi, Christina Fragouli, David Tse. 467-474 [doi]
• Modeling distributed beamforming in wireless networksKery Hardwick, Dennis Goeckel, Don Towsley. 475-482 [doi]
• On the delay performance of in-network aggregation in lossy wireless sensor networksChanghee Joo, Ness B. Shroff. 483-490 [doi]
• N-player Bertrand-Cournot games in queues: Existence of equilibriumParijat Dube, Rahul Jain 0002. 491-498 [doi]
• Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resourcesAna Radovanovic, Cliff Stein 0001. 499-503 [doi]
• An ergodic result for queue length processes of state-dependent queueing networks in the heavy-traffic diffusion limitFrancisco J. Piera, Ravi R. Mazumdar. 504-507 [doi]
• Effective resource allocation in a queue: How much control is necessary?Krishna Jagannathan 0001, Eytan H. Modiano, Lizhong Zheng. 508-515 [doi]
• Reduced dimension equalizer and interference canceller for MIMO-OFDMChad C. Lau, Michael D. Zoltowski. 516-522 [doi]
• Encoding against an interferer's codebookIvana Maric, Nan Liu 0001, Andrea Goldsmith. 523-530 [doi]
• A layered lattice coding scheme for a class of three user Gaussian interference channelsSriram Sridharan, Amin Jafarian, Sriram Vishwanath, Syed Ali Jafar, Shlomo Shamai. 531-538 [doi]
• Distributed interference pricing with MISO channelsChangxin Shi, Randall A. Berry, Michael L. Honig. 539-546 [doi]
• Interference channels with correlated receiver side informationNan Liu 0001, Deniz Gündüz, Andrea J. Goldsmith, H. Vincent Poor. 547-554 [doi]
• Uniform approximation of functions with random basesAli Rahimi, Benjamin Recht. 555-561 [doi]
• Compressed sensing over the Grassmann manifold: A unified analytical frameworkWeiyu Xu, Babak Hassibi. 562-567 [doi]
• Generalized binary searchRobert Nowak 0001. 568-574 [doi]
• Learning sparse doubly-selective channelsWaheed U. Bajwa, Akbar M. Sayeed, Robert Nowak 0001. 575-582 [doi]
• Overcoming SNR walls through macroscale featuresRahul Tandra, Anant Sahai. 583-590 [doi]
• Local interference can accelerate gossip algorithmsBobak Nazer, Alexandros G. Dimakis, Michael Gastpar. 591-598 [doi]
• Optimal sensor density for remote estimation over Wireless Sensor NetworksRoberto Ambrosino, Bruno Sinopoli, Kameshwar Poolla, Shankar Sastry 0001. 599-606 [doi]
• On Kalman filtering with faded measurementsSubhrakanti Dey, Alex S. Leong, Jamie S. Evans. 607-614 [doi]
• The price of anarchy in competing differentiated services networksJohn Musacchio, Shuang Wu. 615-622 [doi]
• Distributed consensus with link failures as a structured stochastic uncertainty problemStacy Patterson, Bassam Bamieh. 623-627 [doi]
• Distributed Kalman filter via Gaussian Belief PropagationDanny Bickson, Ori Shental, Danny Dolev. 628-635 [doi]
• Guaranteed bounds for traffic flow parameters estimation using mixed Lagrangian-Eulerian sensingChristian G. Claudel, Alexandre M. Bayen. 636-645 [doi]
• Capacity region of the permutation channelJohn MacLaren Walsh, Steven Weber 0001. 646-652 [doi]
• Worst-case asymmetric distributed source codingSamar Agnihotri, H. S. Jamadagni. 653-660 [doi]
• Low-density linear IED schemes for lossless source coding with decoder only side informationJin Meng 0001, En-Hui Yang, Da-ke He. 661-668 [doi]
• Large deviations for many server networks with long range dependent and batch arrivalsSoummya Kar, José M. F. Moura, Kavita Ramanan. 669-674 [doi]
• General stability conditions in wireless broadcast channelsChan Zhou, Gerhard Wunder. 675-682 [doi]
• Delay analysis for max weight opportunistic scheduling in wireless systemsMichael J. Neely. 683-691 [doi]
• Incentivizing anonymous "peer-to-peer" reviewsParv Venkitasubramaniam, Anant Sahai. 692-699 [doi]
• On the capacity of MIMO interference channelsXiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor. 700-707 [doi]
• Asymptotically optimal transmit strategies for the multiple antenna interference channelErik G. Larsson, Danyo Danev, Eduard A. Jorswieck. 708-714 [doi]
• Gaussian interference channels with multiple receive antennas: Capacity and generalized degrees of freedomI-Hsiang Wang, David N. C. Tse. 715-722 [doi]
• Ergodic two-user interference channels: Is separability optimal?Lalitha Sankar, Xiaohu Shang, Elza Erkip, H. Vincent Poor. 723-729 [doi]
• Multiuser MIMO downlink with limited inter-cell cooperation: Approximate interference alignment in time, frequency and spaceGiuseppe Caire, Sean A. Ramprashad, Haralabos C. Papadopoulos, Christine Pépin, Carl-Erik W. Sundberg. 730-737 [doi]
• Relay networks with orthogonal componentsWooseok Nam, Sae-Young Chung. 738-745 [doi]
• Broadcasting with receiver message side information: A deterministic approachJae Won Yoo, Tie Liu 0002, Feng Xue. 746-752 [doi]
• Wireless network secrecy with public feedbackEtienne Perron, Suhas N. Diggavi, Emre Telatar. 753-760 [doi]
• Precoding methods for multi-user TDD MIMO systemsJubin Jose, Alexei Ashikhmin, Phil Whiting, Sriram Vishwanath. 761-767 [doi]
• A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networksPeter Marbach, Atilla Eryilmaz. 768-775 [doi]
• Optimality and large deviations of queues under the pseudo-Log rule opportunistic schedulingBilal Sadiq, Gustavo de Veciana. 776-783 [doi]
• Medium access control for multicast traffic in ad-hoc networksMatthew Andrews, Brooke Shrader. 784-790 [doi]
• Neighbor discovery in wireless ad hoc networks based on group testingJun Luo, Dongning Guo. 791-797 [doi]
• Combining geometry and combinatorics: A unified approach to sparse signal recoveryRadu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss. 798-805 [doi]
• Exact low-rank matrix completion via convex optimizationEmmanuel J. Candès, Benjamin Recht. 806-812 [doi]
• The secrecy of compressed sensing measurementsYaron Rachlin, Dror Baron. 813-817 [doi]
• On the secrecy capacity of arbitrary wiretap channelsMatthieu R. Bloch, J. Nicholas Laneman. 818-825 [doi]
• On the secure degrees of freedom of wireless X networksTiangao Gou, Syed Ali Jafar. 826-833 [doi]
• Secure broadcasting : The secrecy rate regionGhadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani. 834-841 [doi]
• Tree search for digital fingerprintingMohammad Shahmohammadi, Hesham El Gamal. 842-849 [doi]
• Privacy leakage in biometric secrecy systemsTanya Ignatenko, Frans M. J. Willems. 850-857 [doi]
• Transmission of correlated sources over a fading multiple access channelRamachandran Rajesh, Vinod Sharma. 858-864 [doi]
• Compound multiple access channels with conferencing decodersOsvaldo Simeone, Deniz Gündüz, H. Vincent Poor, Andrea Goldsmith, Shlomo Shamai. 865-872 [doi]
• Transmission of correlated sources over Gaussian multiple-access channels with phase shiftsFadi Abi Abdallah, Raymond Knopp, Giuseppe Caire. 873-878 [doi]
• On ergodic sum capacity of fading cognitive multiple-access channelRui Zhang 0006, Shuguang Cui, Ying-Chang Liang. 879-886 [doi]
• Compound Gaussian multiple access channels with noisy feedbackAshutosh Sabharwal, Debashis Dash, Suhas N. Diggavi. 887-894 [doi]
• Polynomial Linear Programming with Gaussian belief propagationDanny Bickson, Yoav Tock, Ori Shental, Danny Dolev. 895-901 [doi]
• Volume of geodesic balls in the complex Stiefel manifoldRajesh T. Krishnamachari, Mahesh K. Varanasi. 902-909 [doi]
• Asymptotic weight enumerators of randomly punctured, expurgated, and shortened code ensemblesElette C. Boyle, Robert J. McEliece. 910-917 [doi]
• s-t paths using the min-sum algorithmNicholas Ruozzi, Sekhar Tatikonda. 918-921 [doi]
• On the growth rate of the weight distribution of irregular doubly-generalized LDPC codesMark F. Flanagan, Enrico Paolini, Marco Chiani, Marc P. C. Fossorier. 922-929 [doi]
• Generalized quantity competition for multiple products and loss of efficiencyL. Jonathan Kluberg, Georgia Perakis. 930-936 [doi]
• Local dynamics for network formation gamesEsteban Arcaute, Ramesh Johari, Shie Mannor. 937-938 [doi]
• Stability of supply function equilibrium in electricity markets under piecewise linear function perturbationsLin Xu, Ross Baldick. 939-944 [doi]
• Convergence of optimal values past critical thresholdSteven Jaslar, Sekhar Tatikonda. 945-951 [doi]
• Design and analysis of ISP-friendly file distribution protocolsMinghong Lin, John C. S. Lui, Dah-Ming Chiu. 952-959 [doi]
• Analysis of load balancing algorithms in P2P streamingYongzhi Wang, Tom Z. J. Fu, Dah-Ming Chiu. 960-967 [doi]
• P2P streaming capacity for heterogeneous users with degree boundsShao Liu, Mung Chiang, Sudipta Sengupta, Jin Li 0001, Philip A. Chou. 968-976 [doi]
• Turbo MIMO equalization and decoding in fast fading mobile coded OFDMDaniel N. Liu, Michael P. Fitz. 977-982 [doi]
• Entropy coding using equiprobable partitioningYuxing Han 0001, Jiangtao Wen, John D. Villasenor. 983-990 [doi]
• A low-latency and error-resilient Video-on-Demand broadcasting protocol using UEP-rateless codesAli Talari, Nazanin Rahnavard. 991-995 [doi]
• New rate distortion bounds for natural videos based on a texture dependent correlation model in the spatial-temporal domainJing Hu, Jerry D. Gibson. 996-1003 [doi]
• Opportunistic relaying through amplify-and-forward distributed space-time codes with partial statistical CSI at relaysBehrouz Maham, Are Hjørungnes. 1004-1008 [doi]
• Source information transmission over MIMO systems with transmitter side informationMarco Zoffoli, Jerry D. Gibson, Marco Chiani. 1009-1013 [doi]
• On the secrecy of multiple access wiretap channelErsen Ekrem, Sennur Ulukus. 1014-1021 [doi]
• System level optimization in wireless networks with uncertain customer arrival ratesSungho Yun, Constantine Caramanis. 1022-1029 [doi]
• Uplink sum-rate analysis of a multicell system with feedbackOsvaldo Simeone, Oren Somekh, Gerhard Kramer, H. Vincent Poor, Shlomo Shamai. 1030-1036 [doi]
• Interference Alignment for Cellular NetworksChangho Suh, David Tse. 1037-1044 [doi]
• Large on the capacity of indecomposable finite-state channels with feedbackRon Dabora, Andrea Goldsmith. 1045-1052 [doi]
• Optimized puncturing and shortening distributions for nonbinary LDPC codes over the binary erasure channelDemijan Klinc, Jeongseok Ha, Steven W. McLaughlin. 1053-1058 [doi]
• Matching graph connectivity of LDPC codes to high-order modulation by bit interleavingJing Lei 0005, Wen Gao. 1059-1064 [doi]
• Bounds on the MMSE of "bad" LDPC codes at rates above capacityAmir Bennatan, A. Robert Calderbank, Shlomo Shamai. 1065-1072 [doi]
• Asymptotic distance and convergence analysis of braided protograph convolutional codesMarcos B. S. Tavares, Michael Lentmaier, Gerhard P. Fettweis, Kamil Sh. Zigangirov. 1073-1080 [doi]
• Approximate fair bandwidth allocation: A method for simple and flexible traffic managementRong Pan, Balaji Prabhakar, Flavio Bonomi, Bob Olsen. 1081-1085 [doi]
• Network neutrality: Avoiding the extremesGalina Schwartz, Nikhil Shetty, Jean C. Walrand. 1086-1093 [doi]
• The shapley value: Its use and implications on internet economicsRichard T. B. Ma, John C. S. Lui, Dah-Ming Chiu, Vishal Misra, Dan Rubenstein. 1094-1096 [doi]
• A learning scheme for stationary probabilities of large markov chains with examplesVivek S. Borkar, D. J. Das, A. Datta Banik, D. Manjunath. 1097-1099 [doi]
• Efficient global optimization for exponential family PCA and low-rank matrix factorizationYuhong Guo, Dale Schuurmans. 1100-1107 [doi]
• Query-level learning to rank using isotonic regressionZhaohui Zheng, Hongyuan Zha, Gordon Sun. 1108-1115 [doi]
• New error bounds for approximations from projected linear equationsHuizhen Yu, Dimitri P. Bertsekas. 1116-1123 [doi]
• Stable networking gamesHamidou Tembine, Eitan Altman, Rachid El Azouzi, Yezekael Hayel. 1124-1131 [doi]
• Secure wireless communications via cooperationLun Dong, Zhu Han 0001, Athina P. Petropulu, H. Vincent Poor. 1132-1138 [doi]
• Cooperative protocols for random access networksGeorg Bocherer, Alexandre de Baynast, Rudolf Mathar. 1139-1145 [doi]
• Spectum sharing as congestion gamesMingyan Liu, Yunnan Wu. 1146-1153 [doi]
• A coalitional game framework for cooperative secondary spectrum accessAlireza Aram, Saswati Sarkar, Chandramani Kishore Singh, Anurag Kumar 0001. 1154-1160 [doi]
• Unicast throughput analysis of finite-buffer sparse mobile networks using Markov chainsRamanan Subramanian, Faramarz Fekri. 1161-1168 [doi]
• Capacity scaling laws of information dissemination modalities in wireless ad hoc networksZheng Wang 0006, Hamid R. Sadjadpour, J. J. Garcia-Luna-Aceves. 1169-1176 [doi]
• A geometrical analysis of Vehicular Ad-Hoc Networks for safety applicationsMohammad Nekoui, Hossein Pishro-Nik. 1177-1183 [doi]
• Finding the K largest metrics in a noisy broadcast networkChengzhi Li, Huaiyu Dai, Husheng Li. 1184-1190 [doi]
• Distributed sensor calibration and least-square parameter identification in WSNs using consensus algorithmsSaverio Bolognani, Simone Del Favero, Luca Schenato 0001, Damiano Varagnolo. 1191-1198 [doi]
• Providing secrecy with lattice codesXiang He, Aylin Yener. 1199-1206 [doi]
• A characterization of the error exponent for the Byzantine CEO problemOliver Kosut, Lang Tong. 1207-1214 [doi]
• Unconditionally secure conference key distribution: Security definitions and their relationsReihaneh Safavi-Naini, Shaoquan Jiang. 1215-1220 [doi]
• Modeling node capture attacks in wireless sensor networksPatrick Tague, Radha Poovendran. 1221-1224 [doi]
• Multi-receiver authentication code for network codingFrédérique E. Oggier, Hanane Fathi. 1225-1231 [doi]
• Sample complexity of determining structures of graphical modelsNarayana Santhanam, Martin J. Wainwright. 1232-1237 [doi]
• Girth of the Tanner graph and error correction capability of LDPC codesShashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin. 1238-1245 [doi]
• Adversarial error correction for network coding: Models and metricsDanilo Silva 0001, Frank R. Kschischang. 1246-1253 [doi]
• On codes designed via algebraic lifts of graphsChristine A. Kelley. 1254-1261 [doi]
• Lower bound and optimality in switched networksDevavrat Shah, Damon Wischik. 1262-1269 [doi]
• Data center transport mechanisms: Congestion control theory and IEEE standardizationMohammad Alizadeh, Berk Atikoglu, Abdul Kabbani, Ashvin Lakshmikantha, Rong Pan, Balaji Prabhakar, Mick Seaman. 1270-1277 [doi]
• Stochastic analysis of power-aware schedulingAdam Wierman, Lachlan L. H. Andrew, Ao Tang. 1278-1283 [doi]
• On the performance of multiple choice hash tables with moves on deletes and insertsAdam Kirsch, Michael Mitzenmacher. 1284-1290 [doi]
• Robust dimensionality reduction for high-dimension dataHuan Xu, Constantine Caramanis, Shie Mannor. 1291-1298 [doi]
• Sparse algorithms are not stable: A no-free-lunch theoremHuan Xu, Shie Mannor, Constantine Caramanis. 1299-1303 [doi]
• Oblivious equilibrium for stochastic games with concave utilitySachin Adlakha, Ramesh Johari, Gabriel Y. Weintraub, Andrea Goldsmith. 1304-1308 [doi]
• Cooperative strategies for the half-duplex Gaussian parallel relay channel: Simultaneous relaying versus successive relayingSeyed Saeed Changiz Rezaei, Shahab Oveis Gharan, Amir K. Khandani. 1309-1316 [doi]
• Achievable rates and optimal schedules for half duplex multiple-relay networksLawrence Ong, Wei Wang 0002, Mehul Motani. 1317-1324 [doi]
• Capacity results for certain wireless relay networks with erasure linksSrinath Puducheri, Thomas E. Fuja. 1325-1332 [doi]
• Rate regions for the separated two-way relay channelDeniz Gündüz, Ertem Tuncel, Jayanth Nayak. 1333-1340 [doi]
• Trading off coding complexity and feedback requirements for the packet erasure channelSrinath Puducheri, Thomas E. Fuja. 1341-1346 [doi]
• Beamforming codebook design for temporally correlated fading channelsHong Wan, Rong-Rong Chen. 1347-1353 [doi]
• Adaptive soft-output detection in MIMO systemsHossein Najafi, Mohammad Erfan Danesh Jafari, Mohamed Oussama Damen. 1354-1358 [doi]
• Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexityPetros Elia, Joakim Jaldén. 1359-1364 [doi]
• Learning low rank matrices from O(n) entriesRaghunandan H. Keshavan, Andrea Montanari, Sewoong Oh. 1365-1372 [doi]
• Anonymity under light traffic conditions using a network of mixesParv Venkitasubramaniam, Venkat Anantharam. 1373-1380 [doi]
• Analyzing brain signals by combinatorial optimizationJustin Dauwels, François B. Vialatte, Theophane Weber, Andrzej Cichocki. 1381-1388 [doi]
• Designing floating codes for expected performanceHilary K. Finucane, Zhenming Liu, Michael Mitzenmacher. 1389-1396 [doi]
• A game-theoretic approach to coding for information networksJennifer Price, Tara Javidi. 1397-1402 [doi]
• Perturbation codesAdi Akavia, Ramarathnam Venkatesan. 1403-1409 [doi]
• On the minimum trapping distance of repeat accumulate accumulate codesJörg Kliewer, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 1410-1415 [doi]
• Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimizationPascal O. Vontobel. 1416 [doi]
• Equivalence of two inner bounds on the capacity region of the broadcast channelYingbin Liang, Gerhard Kramer, H. Vincent Poor. 1417-1421 [doi]
• The case for structured random codes: Beyond linear modelsBobak Nazer, Michael Gastpar. 1422-1425 [doi]
• Capacity of a class of diamond channelsWei Kang 0002, Sennur Ulukus. 1426-1431 [doi]
• Rate-achievability strategies for two-hop interference flowsP. S. Chandrashekhar Thejaswi, Amir Bennatan, Junshan Zhang, A. Robert Calderbank, Douglas Cochran. 1432-1439 [doi]
• Identifying tractable decentralized control problems on the basis of information structureAditya Mahajan, Ashutosh Nayyar, Demosthenis Teneketzis. 1440-1449 [doi]
• Convex synthesis of distributed controllers for spatio-temporal systems with subadditive support functionsMichael Rotkowitz, Randy Cogill. 1450-1456 [doi]
• Power-delay analysis of consensus algorithms on wireless networks with interferenceSundaram Vanka, Vijay Gupta 0001, Martin Haenggi. 1457-1464 [doi]
• Stochastic nestedness and information analysis of tractability in decentralized controlSerdar Yüksel. 1465-1472 [doi]
• Anytime reliable transmission of real-valued information through digital noisy channelsGiacomo Como, Fabio Fagnani, Sandro Zampieri. 1473-1480 [doi]
• Continuous-model communication complexity with application in distributed resource allocation in wireless Ad hoc networksHusheng Li, Huaiyu Dai. 1481-1486 [doi]
• Min-min times in peer-to-peer file sharing networksG. Matthew Ezovski, Animashree Anandkumar, Ao Kevin Tang, Lachlan L. H. Andrew. 1487-1494 [doi]
• Many-sources large deviations for max-weight schedulingSomsak Kittipiyakul, Tara Javidi, Vijay G. Subramanian. 1495-1502 [doi]
• A cross-layer view of wireless multicast optimizationAnna Pantelidou, Anthony Ephremides. 1503-1510 [doi]
• A distributed CSMA algorithm for throughput and utility maximization in wireless networksLibin Jiang, Jean C. Walrand. 1511-1519 [doi]
• Multiuser scheduling in a Markov-modeled downlink environmentSugumar Murugesan, Philip Schniter, Ness B. Shroff. 1520-1526 [doi]
• A continuity theory for lossless source coding over networksWei-Hsin Gu, Michelle Effros, Mayank Bakshi. 1527-1534 [doi]
• Multiterminal rate-distortion theory revisitedToby Berger. 1535-1537 [doi]
• Distributed source coding using Abelian group codes: Extracting performance from structureDinesh Krithivasan, S. Sandeep Pradhan. 1538-1545 [doi]
• On distributed compression of linear functionsAaron B. Wagner. 1546-1553 [doi]
• The joint gaussian CEO/MAC problem and relayingYuval Kochman, Ram Zamir. 1554-1561 [doi]
• A new upper bound on the capacity of a class of primitive relay channelsRavi Tandon, Sennur Ulukus. 1562-1569 [doi]
• Joint communication and channel estimation: the two hop caseSatish Vedantam, Wenyi Zhang 0006, Urbashi Mitra. 1570-1577 [doi]
• The degrees of freedom of wireless networks: information-theoretic and physical limitsMassimo Franceschetti, Marco Donald Migliore, Paolo Minero. 1578-1581 [doi]
• Approximate capacity of the two-way relay channel: A deterministic approachAmir Salman Avestimehr, Aydin Sezgin, David N. C. Tse. 1582-1589 [doi]