Abstract is missing.
- Non-asymptotic achievability bounds in multiuser information theorySergio Verdú. 1-8 [doi]
- Simultaneous nonunique decoding is rate-optimalBernd Bandemer, Abbas El Gamal, Young Han Kim. 9-16 [doi]
- On the performance of random block codes over finite-state fading channelsFatemeh Hamidi-Sepehr, Jean-François Chamberland, Henry D. Pfister. 17-25 [doi]
- Energy management of dense wireless heterogeneous networks over slow timescalesBinnan Zhuang, Dongning Guo, Michael L. Honig. 26-32 [doi]
- Lattices over Eisenstein integers for compute-and-forwardNihat Engin Tunali, Krishna R. Narayanan, Joseph J. Boutros, Yu-Chih Huang. 33-40 [doi]
- A decentralized coordination strategy for networked multiagent systemsKarla Kvaternik, Jaime Llorca, Daniel C. Kilper, Lacra Pavel. 41-47 [doi]
- Optimal control of a fully decentralized quadratic regulatorLaurent Lessard. 48-54 [doi]
- Distributed control with dynamic dissipation constraintsCarsten W. Scherer. 55-62 [doi]
- Distributed solution for a Maximum Variance Unfolding Problem with sensor and robotic network applicationsAndrea Simonetto, Tamás Keviczky, Dimos V. Dimarogonas. 63-70 [doi]
- Parallel nonlinear predictive controlAnthony Kelman, Francesco Borrelli. 71-78 [doi]
- Distributed model predictive consensus via the Alternating Direction Method of MultipliersTyler H. Summers, John Lygeros. 79-84 [doi]
- Identification of sparse communication graphs in consensus networksFu Lin, Makan Fardad, Mihailo R. Jovanovic. 85-89 [doi]
- Incentive design for efficient building quality of serviceAnil Aswani, Claire Tomlin. 90-97 [doi]
- A hybrid scheduling protocol to improve quality of service in networked control systemsAhmed Elmahdi, Ahmad F. Taha, Stefen Hui, Stanislaw H. Zak. 98-105 [doi]
- Design of string stable adaptive cruise controllers for highway and urban missionsIsmail Bayezit, Tjalling Veldhuizen, Baris Fidan, Jan Paul Huissoon, Henk Lupker. 106-113 [doi]
- Robust tunable in vitro transcriptional oscillator networksVishwesh V. Kulkarni, Theerachai Chanyaswad, Marc Riedel, Jongmin Kim. 114-119 [doi]
- Network optimization with dynamic demands and link pricesStacy Patterson, Mike P. Wittie, Kevin C. Almeroth, Bassam Bamieh. 120-127 [doi]
- Wireless network design under service constraintsMartin Kasparick, Gerhard Wunder. 128-135 [doi]
- Migration in a small world: A network approach to modeling immigration processesBabak Fotouhi, Michael G. Rabbat. 136-143 [doi]
- The Factorization Theorem and new algebraic insights into the theory of linear trellisesDavid Conti, Nigel Boston. 144-151 [doi]
- On the capacity of the one-bit deletion and duplication channelHamed Mirghasemi, Aslan Tchamkerten. 152-159 [doi]
- Weak flip codes and applications to optimal code design on the binary erasure channelPo-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser. 160-167 [doi]
- The periodicity transform in algebraic decoding of Reed-Solomon codesChristian Senger. 168-175 [doi]
- A proof of threshold saturation for spatially-coupled LDPC codes on BMS channelsSanthosh Kumar, Andrew J. Young, Nicolas Macris, Henry D. Pfister. 176-184 [doi]
- Compressed Rank ModulationQing Li. 185-192 [doi]
- Secure degrees of freedom of the Gaussian wiretap channel with helpersJianwei Xie, Sennur Ulukus. 193-200 [doi]
- Condorcet voting methods avoid the paradoxes of voting theoryTiance Wang, John Sturm, Paul W. Cuff, Sanjeev R. Kulkarni. 201-203 [doi]
- The interference wiretap channel with an arbitrarily varying eavesdropper: Aligning interference with artificial noiseXiang He, Aylin Yener. 204-211 [doi]
- Security games for voltage control in smart gridYee Wei Law, Tansu Alpcan, Marimuthu Palaniswami. 212-219 [doi]
- Studying dynamic equilibrium of cloud computing adoption with application of Mean Field GamesSingRu (Celine) Hoe, Murat Kantarcioglu, Alain Bensoussan. 220-224 [doi]
- Improving the energy efficiency of contention-based synchronization of (O)FDMA networksGiacomo Bacci, Luca Sanguinetti, Marco Luise, H. Vincent Poor. 225-232 [doi]
- Exploiting the non-commutativity of nonlinear operators for information-theoretic security in disadvantaged wireless environmentsAzadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik. 233-240 [doi]
- On α-proportional fair packet scheduling in OFDMA downlinkOlav Tirkkonen, Riku Jäntti. 241-245 [doi]
- Optimal tuning of analog self-interference cancellers for full-duplex wireless communicationJoseph G. McMichael, Kenneth E. Kolodziej. 246-251 [doi]
- Cost of proportional fairness in multiuser networksAli Tajer, H. Vincent Poor. 252-257 [doi]
- Transport density vs. channel access time in wireless networks: Power control and efficient mac designTong Zhen, Martin Haenggi. 258-263 [doi]
- Cognitive radio sensing through belief propagation and distributed consensusPhisan Kaewprapha, Tiffany Jing Li, Nattakan Puttarak. 264-271 [doi]
- Transmission of correlated sources over a MAC: A Gaussian approximation-based analysisVincent Y. F. Tan. 272-277 [doi]
- Channel capacity in the non-asymptotic regime: Taylor-type expansion and computable benchmarksEn-Hui Yang, Jin Meng. 278-285 [doi]
- A random coding approach to Gaussian multiple access channels with finite blocklengthEbrahim MolavianJazi, J. Nicholas Laneman. 286-293 [doi]
- ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codesYury Polyanskiy. 294-301 [doi]
- Converse bounds for finite-length joint source-channel codingAdrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Alfonso Martinez. 302-307 [doi]
- Writing cosets of a convolutional code to increase the Lifetime of Flash memoryAdam N. Jacobvitz, A. Robert Calderbank, Daniel J. Sorin. 308-318 [doi]
- Codes on graphs: Past, present and futureG. David Forney. 319-325 [doi]
- Coding for fast content downloadGauri Joshi, Yanpei Liu, Emina Soljanin. 326-333 [doi]
- Controlled collaboration for linear coherent estimation in wireless sensor networksSwarnendu Kar, Pramod K. Varshney. 334-341 [doi]
- On the optimality of a myopic policy in multi-state channel probingYi Ouyang, Demosthenis Teneketzis. 342-349 [doi]
- Optimal sampling control with quickest change detectionVikram Krishnamurthy. 350-357 [doi]
- Sensor management via riemannian geometryWilliam Moran, Stephen D. Howard, Douglas Cochran, Sofia Suvorova. 358-362 [doi]
- Controlled sensing for classification using image-based sensor networksDavid A. Castanon. 363-370 [doi]
- Collective ratings for online labor marketsYu Zhang, Mihaela van der Schaar. 371-378 [doi]
- Merging opinions by social sampling of posteriorsAnand D. Sarwate. 379-385 [doi]
- An empirical game-theoretic analysis of credit network formationMichael P. Wellman, Bryce Wiedenbeck. 386-393 [doi]
- Similarity-based network formationFelix Ming, Fai Wong, Peter Marbach. 394-399 [doi]
- A novel Q-learning algorithm with function approximation for constrained Markov decision processesK. Lakshmanan, Shalabh Bhatnagar. 400-405 [doi]
- Optimization of computationally expensive simulations with Gaussian processes and parameter uncertainty: Application to cardiovascular surgeryJing Xie, Peter I. Frazier, Sethuraman Sankaran, Alison L. Marsden, Saleh Elmohamed. 406-413 [doi]
- Splash: Simulation optimization in complex systems of systemsPeter J. Haas, Nicole C. Barberis, Piyaphol Phoungphol, Ignacio G. Terrizzano, Wang Chiew Tan, Patricia G. Selinger, Paul P. Maglio. 414-425 [doi]
- Diffusion of innovation in two-sided marketsKa-Hung Hui, Vijay G. Subramanian, Dongning Guo, Randall Berry. 426-433 [doi]
- Learning in linear games over networksCeyhun Eksin, Pooya Molavi, Alejandro Ribeiro, Ali Jadbabaie. 434-440 [doi]
- The price of insecurity: Public information transmission in zero-sum gamesVijay Kamble, Jean C. Walrand. 441-448 [doi]
- Time asymptotic behavior of the HJB equation associated with a class of mean-field gamesAri Arapostathis. 449-451 [doi]
- Repeated resource sharing among selfish players with imperfect binary feedbackYuanzhang Xiao, Mihaela van der Schaar. 452-459 [doi]
- Who is the fairest of them all?Vivek S. Borkar, Rahul M. Makhijani. 460-465 [doi]
- Jointly Optimal LQG quantization and control policies for multi-dimensional linear Gaussian sourcesSerdar Yüksel. 466-473 [doi]
- Efficient solution of Markov decision problems with multiscale representationsJake V. Bouvrie, Mauro Maggioni. 474-481 [doi]
- An equipartition property for high-dimensional log-concave distributionsSergey Bobkov, Mokshay M. Madiman. 482-488 [doi]
- Universal algorithms: Building a case for pointwise convergenceNarayana P. Santhanam, Venkat Anantharam. 489-493 [doi]
- Group model selection using marginal correlations: The good, the bad and the UglyWaheed U. Bajwa, Dustin G. Mixon. 494-501 [doi]
- Efficient algorithms for the data exchange problem under fairness constraintsNebojsa Milosavljevic, Sameer Pawar, Michael Gastpar, Kannan Ramchandran. 502-508 [doi]
- An Edge Reduction Lemma for linear network coding and an application to two-unicast networksWeifei Zeng, Viveck R. Cadambe, Muriel Médard. 509-516 [doi]
- Toward sustainable networking: Storage area networks with network codingUlric J. Ferner, Muriel Médard, Emina Soljanin. 517-524 [doi]
- Peer-to-peer anonymous networking using codingChristopher S. Chang, Tracey Ho, Michelle Effros. 525-532 [doi]
- New parameters of linear codes expressing security performance of universal secure network codingJun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto. 533-540 [doi]
- Reliability guarantees for lossy network coding subgraph constructionThomas Stahlbuhk, Brooke Shrader. 541-548 [doi]
- Faulty Gallager-B decoding with optimal message repetitionFrançois Leduc-Primeau, Warren J. Gross. 549-556 [doi]
- Coding of Brownian motion by quantization of exit timesFelix Poloczek, Florin Ciucu. 557-564 [doi]
- Strong coordination with polar codesMatthieu R. Bloch, Laura Luzzi, Jörg Kliewer. 565-571 [doi]
- Performance of polar codes for quantum and private classical communicationZachary Dutton, Saikat Guha, Mark M. Wilde. 572-579 [doi]
- Polar codes for sources with finite reconstruction alphabetsAria Ghasemian Sahebi, S. Sandeep Pradhan. 580-586 [doi]
- On decompositions of finite horizon DP Problems with linear dynamicsManolis C. Tsakiris, Danielle C. Tarraf. 587-592 [doi]
- Distributed strongly convex optimizationKonstantinos I. Tsianos, Michael G. Rabbat. 593-600 [doi]
- A fast distributed proximal-gradient methodAnnie I. Chen, Asuman E. Ozdaglar. 601-608 [doi]
- Global optimization of Optimal Power Flow using a branch & bound algorithmAjit Gopalakrishnan, Arvind U. Raghunathan, Daniel Nikovski, Lorenz T. Biegler. 609-616 [doi]
- Revenue and reputation: A stochastic control approach to profit maximizationAvhishek Chatterjee, Lei Ying, Sriram Vishwanath. 617-623 [doi]
- Dispersion of infinite constellations in fast fading channelsShlomi Vituri, Meir Feder. 624-631 [doi]
- Dynamic shift-map coding with side information at the decoderYongseok Yoo, Onur Ozan Koyluoglu, Sriram Vishwanath, Ila Fiete. 632-639 [doi]
- Non-asymptotic fixed-rate Slepian-Wolf coding theoremDuo Xu, Jin Meng, En-Hui Yang. 640-647 [doi]
- On non-causal side information at the encoderChiranjib Choudhuri, Urbashi Mitra. 648-655 [doi]
- Intermittent communication and partial divergenceMostafa Khoshnevisan, J. Nicholas Laneman. 656-662 [doi]
- A refinement of the random coding boundYücel Altug, Aaron B. Wagner. 663-670 [doi]
- How far are LDPC codes from fundamental limits on total power consumption?Karthik Ganesan, Pulkit Grover, Andrea Goldsmith. 671-678 [doi]
- Data mapping for unreliable memoriesChristoph Roth, Christian Benkeser, Christoph Studer, Georgios Karakonstantis, Andreas Burg. 679-685 [doi]
- Glue factors, likelihood computation, and filtering in state space modelsChristoph Reller, Murthy V. Devarakonda, Hans-Andrea Loeliger. 686-689 [doi]
- Compressive tracking with 1000-element arrays: A framework for multi-Gbps mm wave cellular downlinksDinesh Ramasamy, Sriram Venkateswaran, Upamanyu Madhow. 690-697 [doi]
- Joint sparsity with different measurement matricesReinhard Heckel, Helmut Bölcskei. 698-702 [doi]
- A recommender system based on Belief Propagation over Pairwise Markov Random FieldsErman Ayday, Jun Zou, Arash Einolghozati, Faramarz Fekri. 703-707 [doi]
- Uncertain price competition in a duopoly: Impact of heterogeneous availability of the commodity under saleMohammad Hassan Lotfi, Saswati Sarkar. 708-715 [doi]
- Filter bank representation of complementary sequence pairsSrdjan Budisin Budisin, Predrag Spasojevic. 716-723 [doi]
- Products of stochastic matrices: Large deviation rate for Markov chain temporal dependenciesDragana Bajovic, João Xavier, Bruno Sinopoli. 724-729 [doi]
- On a critical regime for linear finite-buffer networksYoojin Choi, Petar Momcilovic. 730-737 [doi]
- The A(i)/GI/l Queue: A new model of transitory queueingHarsha Honnappa, Rahul Jain, Amy R. Ward. 738-745 [doi]
- Online load balancing and correlated randomnessSharayu Moharir, Sujay Sanghavi. 746-753 [doi]
- On reducing delay and temporal starvation of queue-length-based CSMA algorithmsDongyue Xue, Eylem Ekici. 754-761 [doi]
- Generalized network tomographyGugan Thoppe. 762-769 [doi]
- On the capacity of bufferless Networks-on-ChipAlexander Shpiner, Erez Kantor, Pu Li, Israel Cidon, Isaac Keslassy. 770-777 [doi]
- Compressive sensing off the gridGongguo Tang, Badri Narayan Bhaskar, Parikshit Shah, Benjamin Recht. 778-785 [doi]
- SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bitsMayank Bakshi, Sidharth Jaggi, Sheng Cai, Minghua Chen. 786-793 [doi]
- On robust phase retrieval for sparse signalsKishore Jaganathan, Samet Oymak, Babak Hassibi. 794-799 [doi]
- Compressed sensing of approximately-sparse signals: Phase transitions and optimal reconstructionJean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová. 800-807 [doi]
- Compressed sensing with sparse, structured matricesMaria Chiara Angelini, Federico Ricci-Tersenghi, Yoshiyuki Kabashima. 808-814 [doi]
- Compressive phase retrieval via generalized approximate message passingPhilip Schniter, Sundeep Rangan. 815-822 [doi]
- Control of Fork-Join Networks in heavy trafficRami Atar, Avishai Mandelbaum, Asaf Zviran. 823-830 [doi]
- Resource allocation: Realizing mean-variability-fairness tradeoffsVinay Joseph, Gustavo de Veciana, Ari Arapostathis. 831-838 [doi]
- Performance analysis of energy harvesting sensors with time-correlated energy supplyNicolò Michelusi, Kostas Stamatiou, Michele Zorzi. 839-846 [doi]
- The thinnest path problem for secure communications: A directed hypergraph approachJianhang Gao, Qing Zhao, Ananthram Swami. 847-852 [doi]
- Multi-player multi-armed bandits: Decentralized learning with IID rewardsDileep M. Kalathil, Naumaan Nayyar, Rahul Jain. 853-860 [doi]
- Stochastic optimization for PCA and PLSRaman Arora, Andrew Cotter, Karen Livescu, Nathan Srebro. 861-868 [doi]
- On the Belgian chocolate problem and output feedback stabilization: Efficacy of algebraic methodsNigel Boston. 869-870 [doi]
- Quickest change point detection with sampling right constraintsJun Geng, Lifeng Lai, Erhan Bayraktar. 874-881 [doi]
- New results on large sample performance of counting rulesBabak Ahsant, R. Viswanathan, Sakthivel Jeyaratnam, Sudharman K. Jayaweera. 882-885 [doi]
- Fault diagnosis of water distribution networks based on state-estimation and hypothesis testingFrancesco Fusco, Amadou Ba. 886-892 [doi]
- Sequential decentralized detection under noisy channelsYasin Yilmaz, George V. Moustakides, Xiaodong Wang. 893-900 [doi]
- Hypothesis testing for partial sparse recoveryAli Tajer, H. Vincent Poor. 901-908 [doi]
- On identifying the causative network of an epidemicChris Milling, Constantine Caramanis, Shie Mannor, Sanjay Shakkottai. 909-914 [doi]
- Stable, distributed P2P protocols based on random peer samplingBarlas Oguz, Venkat Anantharam, Ilkka Norros. 915-919 [doi]
- The price of privacy in untrusted recommendation enginesSiddhartha Banerjee, Nidhi Hegde, Laurent Massoulié. 920-927 [doi]
- Achievable performance in product-form networksJaron Sanders, Sem C. Borst, Johan van Leeuwaarden. 928-935 [doi]
- Toward a memory model for autonomous topological mapping and navigation: The case of binary sensors and discrete actionsDan P. Guralnik, Daniel E. Koditschek. 936-945 [doi]
- Hierarchically clustered navigation of distinct Euclidean particlesOmur Arslan, Dan P. Guralnik, Daniel E. Koditschek. 946-953 [doi]
- Secure multiplex coding with dependent and non-uniform multiple messagesMasahito Hayashi, Ryutaroh Matsumoto. 954-959 [doi]
- Network equivalence in the presence of an eavesdropperTheodoros K. Dikaliotis, Hongyi Yao, Tracey Ho, Michelle Effros, Jörg Kliewer. 960-967 [doi]
- Source-channel secrecy with causal disclosureCurt Schieler, Eva C. Song, Paul Cuff, H. Vincent Poor. 968-973 [doi]
- Increasing the information-theoretic secrecy by cooperative relaying and jammingNinoslav Marina, Toni Draganov Stojanovski, H. Vincent Poor. 974-981 [doi]
- On multiaccess channel with unidirectional cooperation and security constraintsZohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe. 982-987 [doi]
- Capacity region and optimum power allocation strategies for fading cognitive relay multiple access channelsMohammad Kazemi, Azadeh Vosoughi. 988-995 [doi]
- Participation in crowd systemsLav R. Varshney. 996-1001 [doi]
- Online learning in wireless networks via directed graph lifting transformApostol T. Gjika, Marco Levorato, Antonio Ortega, Urbashi Mitra. 1002-1009 [doi]
- Low rank matrix completion: A smoothed l0-searchGuangyu Zhou, Xiaochen Zhao, Wei Dai. 1010-1017 [doi]
- On a relation between the minimax risk and the phase transitions of compressed recoverySamet Oymak, Babak Hassibi. 1018-1025 [doi]
- Covariance sketchingGautam Dasarathy, Parikshit Shah, Badri Narayan Bhaskar, Robert Nowak. 1026-1033 [doi]
- Non-asymptotic information theoretic bound for some multi-party scenariosNaresh Sharma, Naqueeb Ahmad Warsi. 1034-1041 [doi]
- Computation over mismatched channelsNikhil Karamchandani, Urs Niesen, Suhas N. Diggavi. 1042-1048 [doi]
- Computation in multicast networks: Function alignment and converse theoremsChangho Suh, Naveen Goela, Michael Gastpar. 1049-1056 [doi]
- Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbonSudeep Kamath, Venkat Anantharam. 1057-1064 [doi]
- Interactive hypothesis testing with communication constraintsYu Xiang, Young Han Kim. 1065-1072 [doi]
- Reduced MIP formulation for transmission topology controlPablo A. Ruiz, Aleksandr Rudkevich, Michael C. Caramanis, Evgenyi Goldis, Elli Ntakou, C. Russ Philbrick. 1073-1079 [doi]
- A nodal capacity market for co-optimization of generation and transmission expansionAleksandr Rudkevich. 1080-1088 [doi]
- Power market reform in the presence of flexible schedulable distributed loads. New bid rules, equilibrium and tractability issuesMichael C. Caramanis, Evgenyi Goldis, Pablo A. Ruiz, Aleksandr Rudkevich. 1089-1096 [doi]
- Prediction markets for electricity demandLuciano I. de Castro, Peter Cramton. 1097-1104 [doi]
- Harnessing demand flexibility to match renewable production using localized policiesMahdi Kefayati, Ross Baldick. 1105-1109 [doi]
- Mean field equilibria of multi armed bandit gamesRamki Gummadi, Ramesh Johari, Jia Yuan Yu. 1110 [doi]
- Targeted marketing and seeding products with positive externalityArastoo Fazeli, Ali Jadbabaie. 1111-1117 [doi]
- Peeling arguments and double hashingMichael Mitzenmacher, Justin Thaler. 1118-1125 [doi]
- The complexity of object reconciliation, and open problems related to set difference and codingMichael Mitzenmacher, George Varghese. 1126-1132 [doi]
- Non-homogeneous distributed storage systemsVo Tam Van, Chau Yuen, Jing (Tiffany) Li. 1133-1140 [doi]
- Probabilistic performance of write-once memory with Linear Wom codes - Analysis and insightsAmit Berman, Yitzhak Birk, Ori Rottenstreich. 1141-1149 [doi]
- Error resilience in distributed storage via rank-metric codesNatalia Silberstein, Ankit Singh Rawat, Sriram Vishwanath. 1150-1157 [doi]
- An update model for network coding in cloud storage systemsMohammad Reza Zakerinasab, Mea Wang. 1158-1165 [doi]
- A repair framework for scalar MDS codesKarthikeyan Shanmugam, Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Giuseppe Caire. 1166-1173 [doi]
- Repairable replication-based storage systems using resolvable designsOktay Olmez, Aditya Ramamoorthy. 1174-1181 [doi]
- ×Matthew Thill, Babak Hassibi. 1182-1189 [doi]
- Effect of oscillator phase noise on uplink performance of large MU-MIMO systemsAntonios Pitarokoilis, Saif Khan Mohammed, Erik G. Larsson. 1190-1197 [doi]
- A lower bound on the noncoherent capacity pre-log for the MIMO channel with temporally correlated fadingGünther Koliander, Erwin Riegler, Giuseppe Durisi, Veniamin I. Morgenshtern, Franz Hlawatsch. 1198-1205 [doi]
- Characterization of equilibria for the degraded Gaussian broadcast and sum power MAC channelsSrinivas Yerramalli, Rahul Jain, Urbashi Mitra. 1206-1212 [doi]
- Convex optimization for precoder design in MIMO interference networksYue Zhao, Suhas N. Diggavi, Andrea Goldsmith, H. Vincent Poor. 1213-1219 [doi]
- Cellular systems with many antennas: Large system analysis under pilot contaminationNarayanan Krishnan, Roy D. Yates, Narayan B. Mandayam. 1220-1224 [doi]
- Capacity results for a class of Z channels with degraded message setsNan Liu, Wei Kang. 1225-1231 [doi]
- The sum-capacity of the symmetric linear deterministic Complete K-user Z-Interference ChannelAlex Dytso, Natasha Devroye, Daniela Tuninetti. 1232-1237 [doi]
- Bounds on the sum-rate capacity of the Gaussian MIMO X channelRanga Prasad, N. Srinidhi, A. Chockalingam. 1238-1245 [doi]
- Capacity of distributed opportunistic scheduling in heterogeneous networksDor-Joseph Kampeas, Asaf Cohen, Omer Gurewitz. 1246-1253 [doi]
- Can imperfect delayed CSIT be as useful as perfect delayed CSIT? DoF analysis and constructions for the BCJinyuan Chen, Petros Elia. 1254-1261 [doi]
- Not too delayed CSIT achieves the optimal degrees of freedomNamyoon Lee, Robert W. Heath. 1262-1269 [doi]
- Signal representations with minimum ℓ∞-normChristoph Studer, Wotao Yin, Richard G. Baraniuk. 1270-1277 [doi]
- Blind estimation of bit and block error probabilities using soft informationAndreas Winkelbauer, Gerald Matz. 1278-1285 [doi]
- Least-squares based adaptive source localization by mobile agentsBans Fidan, Ahmet Camlica. 1286-1291 [doi]
- On information, estimation and lookaheadKartik Venkat, Tsachy Weissman, Yair Carmon, Shlomo Shamai. 1292-1299 [doi]
- Confidentiality-preserving optimal power flow for cloud computingAlex R. Borden, Daniel K. Molzahn, Parmeswaran Ramanathan, Bernard C. Lesieutre. 1300-1307 [doi]
- Integrating Demand Response into agent-based models of electricity marketsEfthymios Karangelos, Francois Bouffard. 1308-1315 [doi]
- Price and capacity competition in zero-mean storage and demand response marketsJoshua A. Taylor, Johanna L. Mathieu, Duncan S. Callaway, Kameshwar Poolla. 1316-1323 [doi]
- Generation cost and system risk trade-off with corrective power flow controlGabriela Hug. 1324-1331 [doi]
- An enhanced MPC-based strategy for non-disruptive load sheddingMengran Xue, Ian A. Hiskens. 1332-1337 [doi]
- Estimating power flow conditioning from phasor measurement dataJong Min Lim, Christopher L. DeMarco. 1338-1346 [doi]
- An optimized distributed video-on-demand streaming system: Theory and designKangwook Lee, Hao Zhang, Ziyu Shao, Minghua Chen, Abhay Parekh, Kannan Ramchandran. 1347-1354 [doi]
- Anternet: The regulation of harvester ant foraging and Internet congestion controlBalaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon. 1355-1359 [doi]
- Characterizing spectrum goodness for dynamic spectrum accessAakanksha Chowdhery, Ranveer Chandra, Paul Garnett, Paul Mitchell. 1360-1367 [doi]
- Quantifying the security of physical facilities: A game theoretic frameworkRajdeep Singh, Kartik B. Ariyur. 1368-1373 [doi]
- Interactive secret key generation over reciprocal fading channelsAshish Khisti. 1374-1381 [doi]
- Compressing encrypted data: A permutation approachWei Kang, Nan Liu. 1382-1386 [doi]
- Lists that are smaller than their parts: A coding approach to tunable secrecyFlávio du Pin Calmon, Muriel Médard, Linda M. Zeger, João Barros, Mark M. Christiansen, Ken R. Duffy. 1387-1394 [doi]
- Multipath flow allocation in anonymous wireless networks with dependent sourcesChouchang Yang, Basel Alomair, Radha Poovendran. 1395-1400 [doi]
- Privacy against statistical inferenceFlávio du Pin Calmon, Nadia Fawaz. 1401-1408 [doi]
- Incentives for P2P-assisted content distribution: If you can't beat 'em, join 'emVinod Ramaswamy, Sachin Adlakha, Srinivas Shakkottai, Adam Wierman. 1409-1416 [doi]
- Impacts of peer churn on P2P streaming networksXiaohan Kang, Juan José Jaramillo, Lei Ying. 1417-1424 [doi]
- Theorems about ergodicity and class-ergodicity of chains with applications in known consensus modelsSadegh Bolouki, Roland P. Malhamé. 1425-1431 [doi]
- A theoretical framework for analysis of communication pathways in random networksMohammad N. Sefat, Abdul Bais, Nima Sarshar, Christine W. Chan. 1432-1437 [doi]
- Extracting influential information sources for gossipingWenxiang Dong, Wenyi Zhang, Guo Wei. 1438-1444 [doi]
- A distributed self-clustering algorithm for autonomous multi-agent systemsVictor L. Minden, Clifford C. Youn, Usman A. Khan. 1445-1448 [doi]
- A fundamental limitation to the reduction of Markov chains via aggregationGeorgios Kotsalis, Jeff S. Shamma. 1449-1454 [doi]
- Distributed nonuniform coverage with limited scalar measurementsPeter Davison, Michael Schwemmer, Naomi Ehrich Leonard. 1455-1460 [doi]
- A novel application of mixing coefficients for reverse-engineering gene interaction networksNitin K. Singh, Mehmet Eren Ahsen, Shiva Mankala, M. Vidyasagar, Michael A. White. 1461-1466 [doi]
- Identification of binary gene networksJean-Camille Birget, Desmond S. Lun, Anthony Wirth, Dawei Hong. 1467-1474 [doi]
- Demand dynamics aggregation using hybrid systemsWei Zhang, Chao Xu, Chin-Yao Chang. 1475-1481 [doi]
- Continuous-time constrained distributed convex optimizationThinh Thanh Doan, Choon Yik Tang. 1482-1489 [doi]
- Trajectory smoothing as a linear optimal control problemBiswadip Dey, P. S. Krishnaprasad. 1490-1497 [doi]
- Structured stochastic uncertaintyBassam Bamieh. 1498-1503 [doi]
- Constructing ρ/μ approximations from input/output snapshots for systems over finite alphabetsDanielle C. Tarraf. 1504-1509 [doi]
- Adapting first order nonlinear systems using extremum seekingPoorya Haghi, Kartik B. Ariyur. 1510-1516 [doi]
- Millimeter-wave mobile broadband with large scale spatial processing for 5G mobile communicationFarooq Khan, Zhouyue Pi, Sridhar Rajagopal. 1517-1523 [doi]
- HARQ over correlated fadingVignesh Sethuraman, Hairuo Zhuang, Shahab Sanayei. 1524-1528 [doi]
- Opportunistic interference alignment in cellular downlinkJubin Jose, Sundar Subramanian, Xinzhou Wu, Junyi Li. 1529-1534 [doi]
- On the limiting behavior of distributed optimization strategiesJianshu Chen, Ali H. Sayed. 1535-1542 [doi]
- Consensus-based distributed optimization: Practical issues and applications in large-scale machine learningKonstantinos I. Tsianos, Sean Lawlor, Michael G. Rabbat. 1543-1550 [doi]
- Pulse Coupled Discrete Oscillators dynamics for network schedulingSaman Ashkiani, Anna Scaglione. 1551-1558 [doi]
- Consensus+innovations detection: Phase transition under communication noiseDusan Jakovetic, José M. F. Moura, João Xavier. 1559-1563 [doi]
- Dual averaging for distributed optimizationJohn C. Duchi, Alekh Agarwal, Martin J. Wainwright. 1564-1565 [doi]
- Convergent message-passing algorithms in the presence of erasuresNicholas Ruozzi. 1566-1571 [doi]
- The l1 penalized decoder and its reweighted LPXishuo Liu, Stark C. Draper, Benjamin Recht. 1572-1579 [doi]
- A computational approach for determining rate regions and codes using entropic vector boundsCongduan Li, John MacLaren Walsh, Steven Weber. 1580-1587 [doi]
- Large violations of the Ingleton inequalityNigel Boston, Ting-Ting Nan. 1588-1593 [doi]
- Convergence proofs for Simulated Annealing falsification of safety propertiesHoussam Abbas, Georgios E. Fainekos. 1594-1601 [doi]
- Foundations for approximation based analysis of stability properties of hybrid systemsPavithra Prabhakar. 1602-1609 [doi]
- A model-based approach to synthesizing insulin infusion pump usage parameters for diabetic patientsSriram Sankaranarayanan, Christopher Miller, Rangarajan Raghunathan, Hadi Ravanbakhsh, Georgios E. Fainekos. 1610-1617 [doi]
- Differentially private Kalman filteringJerome Le Ny, George J. Pappas. 1618-1625 [doi]
- Noisy Bayesian active learningMohammad Naghshvar, Tara Javidi, Kamalika Chaudhuri. 1626-1633 [doi]
- When does CSMA become ALOHA?Tien V. Nguyen, François Baccelli, Kai Zhu, Sundar Subramanian, Xinzhou Wu. 1634-1636 [doi]
- Delay asymptotics for heavy-tailed MapReduce jobsJian Tan, Shicong Meng, Xiaoqiao Meng, Li Zhang. 1637-1639 [doi]
- Achieving socially optimal solution through payments in a dynamic game for the relay channelDeepanshu Vasal, Achilleas Anastasopoulos. 1640-1644 [doi]
- Outer bounds for the capacity region of a Gaussian two-way relay channelK. Ishaque Ashar, V. Prathyusha, Srikrishna Bhashyam, Andrew Thangaraj. 1645-1652 [doi]
- Two-level MMSE relay strategy for an AF wireless relay networkKanghee Lee, Hyuck M. Kwon, Wenhao Xiong, Hyunggi Kim, Shuang Feng, Hyuncheol Park, Yong-Hoon Lee. 1653-1658 [doi]
- Max-flow min-cut outage characterization of dual-hop relay channelsYing Liu, K. D. Prathapasinghe Dharmawansa, Matthew R. McKay. 1659-1665 [doi]
- SLIC equalizer for ISIAli S. Khayrallah. 1666-1671 [doi]
- CSI dissemination for MU-MIMO schemes based on outdated CSIAnsuman Adhikary, Mari Kobayashi, Pablo Piantanida, Haralabos C. Papadopoulos, Giuseppe Caire. 1672-1679 [doi]
- Achieving high capacity with small cells in LTE-AYufei W. Blankenship. 1680-1687 [doi]
- Modelling and analysis of New Coolstreaming for P2P IPTVVarada Potnis, Vinod Sharma. 1688-1696 [doi]
- Spotting trendsetters: Inference for network gamesRandall Berry, Vijay G. Subramanian. 1697-1704 [doi]
- Energy-delay tradeoffs in a load-balanced routerMatthew Andrews, Lisa Zhang. 1705-1712 [doi]
- An infinite server system with customer-to-server packing constraintsAlexander L. Stolyar. 1713-1720 [doi]
- Performance analysis of work-conserving schedulers for minimizing total flow-time with phase precedenceYousi Zheng, Prasun Sinha, Ness B. Shroff. 1721-1728 [doi]
- Coordinated randomness in sparse graphsUsman A. Khan. 1729-1733 [doi]
- A simple median-based resilient consensus algorithmHaotian Zhang, Shreyas Sundaram. 1734-1741 [doi]
- Resilient asymptotic consensus in asynchronous robust networksHeath LeBlanc, Xenofon D. Koutsoukos. 1742-1749 [doi]
- Linear bandits in high dimension and recommendation systemsYash Deshpande, Andrea Montanari. 1750-1754 [doi]
- Degrees of freedom in vector interference channelsDavid Stotz, Helmut Bölcskei. 1755-1760 [doi]
- Cyclic Interference Alignment by propagation delayHenning Maier, Johannes Schmitz, Rudolf Mathar. 1761-1768 [doi]
- The capacity of less noisy cognitive interference channelsMojtaba Vaezi. 1769-1774 [doi]
- Symmetric K-user Gaussian interference channels: Approximate sum-capacity via deterministic modelingSuvarup Saha, Randall A. Berry. 1775-1782 [doi]
- On constant gaps for the two-way Gaussian interference channelZhiyu Cheng, Natasha Devroye. 1783-1789 [doi]
- The Nash equilibrium region of the linear deterministic interference channel with feedbackSamir Medina Perlaza, Ravi Tandon, H. Vincent Poor, Zhu Han. 1790-1797 [doi]
- Pricing in linear-quadratic dynamic gamesLillian J. Ratliff, Samuel Coogan, Daniel Calderone, S. Shankar Sastry. 1798-1805 [doi]
- Revealing stealthy attacks in control systemsAndré Teixeira, Iman Shames, Henrik Sandberg, Karl Henrik Johansson. 1806-1813 [doi]
- A passivity-based framework for composing attacks on networked control systemsAndrew Clark, Linda Bushnell, Radha Poovendran. 1814-1821 [doi]
- Game theory for security: Key algorithmic principles, deployed systems, lessons learnedMilind Tambe, Manish Jain, James Adam Pita, Albert Xin Jiang. 1822-1829 [doi]
- A game theory model for electricity theft detection and privacy-aware control in AMI systemsAlvaro A. Cárdenas, Saurabh Amin, Galina Schwartz, Roy Dong, Shankar Sastry. 1830-1837 [doi]
- The zero-undetected-error capacity of discrete memoryless channels with feedbackChristoph Bunte, Amos Lapidoth. 1838-1842 [doi]
- A lower bound on feedback capacity of colored Gaussian relay channelsMayur Agrawal, David J. Love, Venkataramanan Balakrishnan. 1843-1849 [doi]
- Feedback increases the degrees of freedom of two unicast Gaussian networksI-Hsiang Wang, Changho Suh. 1850-1855 [doi]
- Noisy feedback communications with side information at the decoderChong Li, Nicola Elia. 1856-1863 [doi]
- The capacity region of the symmetric linear deterministic interference channel with partial feedbackSy-Quoc Le, Ravi Tandon, Mehul Motani, H. Vincent Poor. 1864-1871 [doi]
- Performance loss minimization in cooperative networks based on quantized channel feedbackEhsan Karamad, Raviraj S. Adve. 1872-1878 [doi]
- Optimal pricing for residential demand response: A stochastic optimization approachLiyan Jia, Lang Tong. 1879-1884 [doi]
- Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphsIman Shames, Themistoklis Charalambous, Christoforos N. Hadjicostis, Mikael Johansson. 1885-1892 [doi]
- Equivalence of branch flow and bus injection modelsSubhonmesh Bose, Steven H. Low, K. Mani Chandy. 1893-1899 [doi]
- Risk limiting dispatch in congested networksRam Rajagopal, David Tse, Baosen Zhang. 1900-1907 [doi]
- How demand response from commercial buildings will provide the regulation needs of the gridHe Hao, Timothy Middelkoop, Prabir Barooah, Sean P. Meyn. 1908-1913 [doi]
- Coding for interactive computation: Progress and challengesMark Braverman. 1914-1921 [doi]
- Decomposition of discrete memoryless sourcesSae-Young Chung. 1922-1927 [doi]
- Optimizing quantize-map-and-forward in slow fading relay networksAyan Sengupta, I-Hsiang Wang, Christina Fragouli. 1928-1934 [doi]
- Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake"Ilan Shomorony, Amir Salman Avestimehr. 1935-1942 [doi]
- A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensingSameer Pawar, Kannan Ramchandran. 1943-1950 [doi]
- Ensemble-tight error exponents for mismatched decodersJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 1951-1958 [doi]
- How much rate splitting is required for a random coding scheme?: A new achievable rate region for the Broadcast Channel with Cognitive RelaysReza Khosravi-Farsani. 1959-1965 [doi]
- Sparse regression codes for multi-terminal source and channel codingRamji Venkataramanan, Sekhar Tatikonda. 1966-1974 [doi]
- An achievable error exponent for the mismatched multiple-access channelJonathan Scarlett, Albert Guillen i Fabregas. 1975-1982 [doi]
- Uncoded transmission in MAC channels achieves arbitrarily small error probabilityMainak Chowdhury, Andrea Goldsmith, Tsachy Weissman. 1983-1990 [doi]
- A coding theorem for the discrete memoryless compound multiple access channel with common message and generalized feedbackSaeed Hajizadeh, Mostafa Monemizadeh, Ghosheh Abed Hodtani. 1991-1996 [doi]
- Asymmetric Broadcast ChannelsSaeed Hajizadeh, Ghosheh Abed Hodtani. 1997-2002 [doi]
- Coherence-based performance guarantees of Orthogonal Matching PursuitYuejie Chi, A. Robert Calderbank. 2003-2009 [doi]
- Rate of learning in hierarchical social networksZhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki, William Moran, Stephen D. Howard. 2010-2017 [doi]
- Growing a network on a given substrateBabak Fotouhi, Michael G. Rabbat. 2018-2023 [doi]
- Greedy learning of graphical models with small girthAvik Ray, Sujay Sanghavi, Sanjay Shakkottai. 2024-2031 [doi]
- Learning sparse Boolean polynomialsSahand Negahban, Devavrat Shah. 2032-2036 [doi]
- Real-time coding of Gauss-Markov sources over burst erasure channelsFarrokh Etezadi, Ashish Khisti. 2037-2044 [doi]
- Chatting in distributed quantization networksJohn Z. Sun, Vivek K. Goyal. 2045-2052 [doi]
- Network Compression: Memory-assisted universal coding of sources with correlated parametersAhmad Beirami, Faramarz Fekri. 2053-2059 [doi]
- Causal coding of multiple jointly Gaussian sourcesMehdi Torbatian, En-Hui Yang. 2060-2067 [doi]
- On distributed source coding using Abelian group codesAria Ghasemian Sahebi, S. Sandeep Pradhan. 2068-2074 [doi]
- Covering arbitrary point patternsArya Mazumdar, Ligong Wang. 2075-2080 [doi]
- Noise tolerant image authentication with error localization and correctionObaid Ur Rehman, Natasa Zivic. 2081-2087 [doi]
- On the energy-throughput tradeoffs for relay networks with transmit power controlSanghoon Kim, Wayne E. Stark. 2088-2095 [doi]
- Energy-efficient decode and forward relaying in diamond networksJörg Bühler, Slawomir Stanczak. 2096-2103 [doi]
- Relay computation: Managing interference with structure and cooperationMatthew S. Nokleby, Bobak Nazer, Behnaam Aazhang. 2104-2111 [doi]
- A decoding procedure for compress-and-forward and quantize-and-forward relayingKevin Luo, Ramy H. Gohary, Halim Yanikomeroglu. 2112-2119 [doi]
- An auction-based mechanism for dynamic spectrum allocation in participatory cognitive radio networksV. Sriram Siddhardh Nadendla, Swastik Brahma, Pramod K. Varshney. 2120-2126 [doi]