Table of Contents

• ForewordAngelia Nedich, Minh Do. [doi]
• On the rate of learning in distributed hypothesis testingAnusha Lalitha, Tara Javidi. 1-8 [doi]
• Fundamental limitations for anonymous distributed systems with broadcast communicationsJulien M. Hendrickx, John N. Tsitsiklis. 9-16 [doi]
• Distributed proportional stochastic coordinate descent with social samplingMohsen Ghassemi, Anand D. Sarwate. 17-24 [doi]
• Shared hidden state and network representations of interconnected dynamical systemsSean Warnick. 25-32 [doi]
• When can two unlabeled networks be aligned under partial overlap?Ehsan Kazemi, Lyudmila Yartseva, Matthias Grossglauser. 33-42 [doi]
• Polling one's friends: A graph theoretic viewChenguang Zhu, Hossein Karkeh Abadi, Balaji Prabhakar. 43-50 [doi]
• Epidemic spread over networks with agent awareness and social distancingKeith Paarporn, Ceyhun Eksin, Joshua S. Weitz, Jeff S. Shamma. 51-57 [doi]
• Provision of non-excludable public goods on networks: From equilibrium to centrality measuresParinaz Naghizadeh, Mingyan Liu. 58-65 [doi]
• Spectral detection on sparse hypergraphsMaria Chiara Angelini, Francesco Caltagirone, Florent Krzakala, Lenka Zdeborová. 66-73 [doi]
• Distributed load management in anycast-based CDNsAbhishek Sinha, Pradeepkumar Mani, Jie Liu, Ashley Flavel, David A. Maltz. 74-82 [doi]
• Blocking avoidance in transportation systemsShanyu Zhou, Hulya Seferoglu. 83-90 [doi]
• Queueing analysis of service deferrals for load management in power systemsAndrés Ferragut, Fernando Paganini. 91-98 [doi]
• On scheduling redundant requests with cancellation overheadsKangwook Lee, Ramtin Pedarsani, Kannan Ramchandran. 99-106 [doi]
• Efficient replication of queued tasks for latency reduction in cloud systemsGauri Joshi, Emina Soljanin, Gregory W. Wornell. 107-114 [doi]
• Concentration to zero bit-error probability for regular LDPC codes on the binary symmetric channel: Proof by loop calculusMarc Vuffray, Theodor Misiakiewicz. 115-124 [doi]
• Spatially-coupled codes for write-once memoriesSanthosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister. 125-131 [doi]
• Energy-adaptive codesHaewon Jeong, Pulkit Grover. 132-139 [doi]
• Inactivation decoding analysis for LT codesFrancisco Lazaro Blasco, Gianluigi Liva, Gerhard Bauch. 140-146 [doi]
• Linear code duality between channel coding and Slepian-Wolf codingLele Wang, Young Han Kim. 147-152 [doi]
• Rare events of marked finite point processesHarsha Honnappa. 153-159 [doi]
• The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraintOron Sabag, Haim H. Permuter, Navin Kashyap. 160-164 [doi]
• On Kelly betting: Some limitationsChung-Han Hsieh, B. Ross Barmish. 165-172 [doi]
• Pseudo-gradient based local voltage control in distribution networksXinyang Zhou, Masoud Farivar, Lijun Chen. 173-180 [doi]
• Bounded stability in networked systems with parameter mismatch and adaptive decentralized estimationSaeed Manaffam, Alireza Seyedi, Azadeh Vosoughi, Tara Javidi. 181-186 [doi]
• Inferring the behavior of distributed energy resources with online learningGregory S. Ledva, Laura Balzano, Johanna L. Mathieu. 187-194 [doi]
• Enabling renewable resource integration: The balance between robustness and flexibilityMaria Gabriela Martinez, Jialin Liu, Bowen Li, Johanna L. Mathieu, C. Lindsay Anderson. 195-202 [doi]
• On the design of wholesale electricity markets under uncertaintySubhonmesh Bose. 203-210 [doi]
• Linear approximations to AC power flow in rectangular coordinatesSairaj V. Dhople, Swaroop S. Guggilam, Yu Christine Chen. 211-217 [doi]
• Online learning for demand responseDileep Kalathil, Ram Rajagopal. 218-222 [doi]
• Cluster-and-Connect: An algorithmic approach to generating synthetic electric power network graphsJiale Hu, Lalitha Sankar, Darakhshan J. Mir. 223-230 [doi]
• Applications of polymatroid theory to distributed storage systemsThomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti. 231-237 [doi]
• On observability in networked control systems with packet lossesRaphaël M. Jungers, Atreyee Kundu, W. P. M. H. Heemels. 238-243 [doi]
• Consensus-based distributed optimization with malicious nodesShreyas Sundaram, Bahman Gharesifard. 244-249 [doi]
• Distributed estimation of betweenness centralityWei Wang 0069, Choon Yik Tang. 250-257 [doi]
• Exploiting memory in dynamic average consensusBryan Van Scoy, Randy A. Freeman, Kevin M. Lynch. 258-265 [doi]
• Optimizing large-scale MIMO cellular downlink: Multiplexing, diversity, or interference nulling?Kianoush Hosseini, Wei Yu 0001, Raviraj S. Adve. 266-270 [doi]
• Adaptive CSMA under the SINR model: Fast convergence through local gibbs optimizationPeruru Subrahmanya Swamy, Radha Krishna Ganti, Krishna Jagannathan. 271-278 [doi]
• Mean-field hard-core model of interference in ad-hoc wireless networksToshiyuki Tanaka, K. Shashi Prabh. 279-285 [doi]
• Improving MIMO detection performance in presence of phase noise using norm difference criterionTanumay Datta, Sheng Yang. 286-292 [doi]
• A primal-dual approach to delay minimizing user association in cellular networksJeffrey Wildman, Yusuf Osmanlioglu, Steven Weber, Ali Shokoufandeh. 293-300 [doi]
• Energy harvesting communication using limited battery with efficiencyMehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang. 301-306 [doi]
• Finite-SNR regime analysis of the Gaussian wiretap multiple-access channelParisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos. 307-314 [doi]
• Rate splitting is approximately optimal for fading Gaussian interference channelsJoyson Sebastian, Can Karakus, Suhas N. Diggavi, I-Hsiang Wang. 315-321 [doi]
• Degrees of freedom of bursty multiple access channels with a relaySunghyun Kim, Changho Suh. 322-328 [doi]
• Robust regularized ZF in decentralized Broadcast Channel with correlated CSI noiseQianrui Li, Paul de Kerret, David Gesbert, Nicolas Gresset. 329-336 [doi]
• Decentralized scheduling with data locality for data-parallel computation on peer-to-peer networksWeina Wang, Matthew Barnard, Lei Ying. 337-344 [doi]
• Simple high-performance algorithms for scheduling jobs in the cloudJavad Ghaderi. 345-352 [doi]
• Network flow routing under strategic link disruptionsMathieu Dahan, Saurabh Amin. 353-360 [doi]
• A non-zero-sum, sequential detection gameBraden Soper, John Musacchio. 361-371 [doi]
• Controlled matching game for user association and resource allocation in multi-rate WLANs?Mikael Touati, Rachid El Azouzi, Marceau Coupechoux, Eitan Altman, Jean Marc Kelif. 372-380 [doi]
• An efficient method to locate all the load flow solutions - revisitedBernard C. Lesieutre, Dan Wu. 381-388 [doi]
• Large scale charging of electric vehicles: A multi-armed bandit approachZhe Yu, Yunjian Xu, Lang Tong. 389-395 [doi]
• Dispatching thermal power plants under water constraintsDariush Fooladivanda, Joshua A. Taylor. 396-401 [doi]
• Fast power system analysis via implicit linearization of the power flow manifoldSaverio Bolognani, Florian Dörfler. 402-409 [doi]
• Precise high-dimensional error analysis of regularized M-estimatorsChristos Thrampoulidis, Ehsan Abbasi, Babak Hassibi. 410-417 [doi]
• Data-driven learning of the number of states in multi-state autoregressive modelsJie Ding, Mohammad Noshad, Vahid Tarokh. 418-425 [doi]
• Distributed information-theoretic biclustering of two memoryless sourcesGeorg Pichler, Pablo Piantanida, Gerald Matz. 426-433 [doi]
• Adder MAC and estimates for Rényi entropyGanesh Ajjanagadde, Yury Polyanskiy. 434-441 [doi]
• On the communication complexity of greater-thanSivaramakrishnan Natarajan Ramamoorthy, Makrand Sinha. 442-444 [doi]
• Information dissipation in noiseless lossy in-network function computationYaoqing Yang, Pulkit Grover, Soummya Kar. 445-452 [doi]
• A simple algorithm for approximation by nomographic functionsSteffen Limmer, Jafar Mohammadi, Slawomir Stanczak. 453-458 [doi]
• Simple learning in weakly acyclic games and convergence to Nash equilibriaSiddharth Pal, Richard J. La. 459-466 [doi]
• Mechanism design for fair allocationAbhinav Sinha, Achilleas Anastasopoulos. 467-473 [doi]
• A game-theoretic approach to quality control for collecting privacy-preserving dataWeina Wang, Lei Ying, Junshan Zhang. 474-479 [doi]
• Convergence of heterogeneous distributed learning in stochastic routing gamesSyrine Krichene, Walid Krichene, Roy Dong, Alexandre M. Bayen. 480-487 [doi]
• A consensus algorithm for networks with process noise and quantization errorFrancisco F. C. Rego, Ye Pu, Andrea Alessandretti, A. Pedro Aguiar, Colin Neil Jones. 488-495 [doi]
• Cooperative data exchange with unreliable clientsAnoosheh Heidarzadeh, Alex Sprintson. 496-503 [doi]
• On the representability of integer polymatroids: Applications in linear code constructionAmir Salimi, Muriel Médard, Shuguang Cui. 504-508 [doi]
• Revisiting the multiplicity codes: A new class of high-rate locally correctable codesLiyasi Wu. 509-513 [doi]
• Coding schemes for discrete memoryless multicast networks with and without feedbackYoulong Wu. 514-521 [doi]
• An alternative proof of channel polarization for channels with arbitrary input alphabetsJing Guo, Jossy Sayir, Minghai Qin, Albert Guillen i Fabregas. 522-529 [doi]
• Algorithms for scheduling deadline-sensitive malleable tasksXiaohu Wu, Patrick Loiseau. 530-537 [doi]
• Car-following models with delayed feedback: Local stability and Hopf bifurcationGopal Krishna Kamath, Krishna Jagannathan, Gaurav Raina. 538-545 [doi]
• Design of linear & nonlinear observers for a turning process with implicit State-Dependent DelayAftab Ahmed, Erik I. Verriest. 546-551 [doi]
• The ISO problem: Decentralized stochastic control via bidding schemesRahul Singh, Panganamala Ramana Kumar, Le Xie. 552-559 [doi]
• Interaction variables for distributed numerical integration of nonlinear power system dynamicsMilos Cvetkovic, Marija D. Ilic. 560-566 [doi]
• Finite-state approximations to constrained Markov decision processes with Borel spacesNaci Saldi, Serdar Yüksel, Tamás Linder. 567-572 [doi]
• Enabling service function chaining through routing optimization in software defined networksAndrey Gushchin, Anwar Walid, Ao Tang. 573-581 [doi]
• Utility fair RAT selection in multi-homed LTE/802.11 networksBahar Partov, Douglas J. Leith. 582-589 [doi]
• Robust estimation using context-aware filteringRadoslav Ivanov, Nikolay Atanasov, Miroslav Pajic, George J. Pappas, Insup Lee. 590-597 [doi]
• Finite-time analysis of the distributed detection problemShahin Shahrampour, Alexander Rakhlin, Ali Jadbabaie. 598-603 [doi]
• Event-triggered stabilization of linear systems under channel blackoutsPavankumar Tallapragada, Massimo Franceschetti, Jorge Cortés. 604-611 [doi]
• Sparse covariance estimation based on sparse-graph codesRamtin Pedarsani, Kangwook Lee, Kannan Ramchandran. 612-619 [doi]
• Second-order coding rate for m-class source-channel codesYanina Y. Shkel, Vincent Y. F. Tan, Stark C. Draper. 620-626 [doi]
• Reverse hypercontractivity using information measuresSudeep Kamath. 627-633 [doi]
• Non-isomorphic distribution supports for calculating entropic vectorsYunshu Liu, John MacLaren Walsh. 634-641 [doi]
• Variable-length channel codes with probabilistic delay guaranteesYucel Altug, H. Vincent Poor, Sergio Verdú. 642-649 [doi]
• An information-theoretic measure of dependency among variables in large datasetsAli Mousavi, Richard G. Baraniuk. 650-657 [doi]
• Statistical and computational guarantees for the Baum-Welch algorithmFanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright. 658-665 [doi]
• Group-invariant Subspace ClusteringShuchin Aeron, Eric Kernfeld. 666-671 [doi]
• Is the direction of greater Granger causal influence the same as the direction of information flow?Praveen Venkatesh, Pulkit Grover. 672-679 [doi]
• MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channelThibault Lesieur, Florent Krzakala, Lenka Zdeborová. 680-687 [doi]
• Stochastic optimization for deep CCA via nonlinear orthogonal iterationsWeiran Wang, Raman Arora, Karen Livescu, Nathan Srebro. 688-695 [doi]
• Masking trapped charge in flash memoriesAntonia Wachter-Zeh, Eitan Yaakobi. 696-703 [doi]
• Balanced codes for data retention of multi-level flash memories with fast page readMinghai Qin, Robert Mateescu, Cyril Guyot, Zvonimir Bandic. 704-711 [doi]
• Joint decoding of content-replication codes for flash memoriesQing Li, Huan Chang, Anxiao Jiang, Erich F. Haratsch. 712-719 [doi]
• Polar codes for Secure Write-Efficient MemoriesQing Li, Anxiao Jiang. 720-727 [doi]
• Near-optimal multi-version codesMajid Khabbazian. 728-732 [doi]
• Efficiency of supply function equilibrium in networked marketsYuanzhang Xiao, Chaithanya Bandi, Ermin Wei. 733-735 [doi]
• Distributed optimization decomposition for joint economic dispatch and frequency regulationDesmond W. H. Cai, Enrique Mallada, Adam Wierman. 736 [doi]
• Representations of information structuresSanmay Das, Emir Kamenica. 737-743 [doi]
• Investment and competition with positive externalities in open networksChang Liu, Yuanzhang Xiao, Ermin Wei, Randall A. Berry. 744-746 [doi]
• Identifying trust in social networks with stubborn agents, with application to market decisionsHoi-To Wai, Anna Scaglione, Amir Leshem. 747-754 [doi]
• Convex formulations of dynamic network traffic assignment for control of freeway networksGiacomo Como, Enrico Lovisari, Ketan Savla. 755-762 [doi]
• Architecture and implementation of an information-centric device-to-device networkYu Wu, Matthew Barnard, Lei Ying. 763-771 [doi]
• Robust temporal logic model predictive controlSadra Sadraddini, Calin Belta. 772-779 [doi]
• Optimal multi-vehicle adaptive search with entropy objectivesHuanyu Ding, David A. Castañón. 780-785 [doi]
• Unlabeled sensing: Solving a linear system with unordered measurementsJayakrishnan Unnikrishnan, Saeid Haghighatshoar, Martin Vetterli. 786-793 [doi]
• Design of transmit-diversity schemes in detection networks under secrecy constraintsV. Sriram Siddhardh Nadendla, Sijia Liu, Pramod K. Varshney. 794-801 [doi]
• A decentralized approach to robust subspace recoveryMostafa Rahmani, George K. Atia. 802-807 [doi]
• Quickest detection of Gauss-Markov random fieldsJavad Heydari, Ali Tajer, H. Vincent Poor. 808-814 [doi]
• Change-point estimation in high dimensional linear regression models via sparse group LassoBingwen Zhang, Jun Geng, Lifeng Lai. 815-821 [doi]
• Optimum Shewhart tests for Markovian dataGeorge V. Moustakides. 822-826 [doi]
• Multi-sensor gradual change detectionYang Cao, Yao Xie. 827-834 [doi]
• Weight enumerators and higher support weights of maximally recoverable codesV. Lalitha, Satyanarayana V. Lokam. 835-842 [doi]
• Three stories on a two-sided coin: Index coding, locally recoverable distributed storage, and guessing games on graphsFatemeh Arbabjolfaei, Young Han Kim. 843-850 [doi]
• Durable network coded distributed storageVitaly Abdrashitov, Muriel Médard. 851-856 [doi]
• Subset source codingEbrahim MolavianJazi, Aylin Yener. 857-864 [doi]
• A probabilistic approach towards exact-repair regeneration codesMehran Elyasi, Soheil Mohajer. 865-872 [doi]
• Compressive and collaborative mobile sensing for scalar field mapping in robotic networksMinh Tuan Nguyen, Hung M. La, Keith A. Teague. 873-880 [doi]
• The absence of isolated node in geometric random graphsJun Zhao. 881-886 [doi]
• On the resilience to node capture attacks of secure wireless sensor networksJun Zhao. 887-893 [doi]
• Scaling laws for reliable data dissemination in shared loss multicast treesRon Yadgar, Asaf Cohen 0001, Omer Gurewitz. 894-900 [doi]
• An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEGPulkit Grover, Jeffrey A. Weldon, Shawn K. Kelly, Praveen Venkatesh, Haewon Jeong. 901-908 [doi]
• Privacy-preserving deep learningReza Shokri, Vitaly Shmatikov. 909-910 [doi]
• Information-theoretic private interactive mechanismBahman Moraffah, Lalitha Sankar. 911-918 [doi]
• Memoryless sampling rate distortionVinay Praneeth Boda, Prakash Narayan. 919-923 [doi]
• The price of uncertainty in communicationMark Braverman, Brendan Juba. 924-927 [doi]
• Excess distortion in lossy compression: Beyond one-shot analysisYuval Kochman, Gregory W. Wornell. 928-934 [doi]
• Single letter characterization of average-case strong redundancy of compressing memoryless sequencesMaryam Hosseini, Narayana Santhanam. 935-940 [doi]
• A geometric perspective on guessworkAhmad Beirami, A. Robert Calderbank, Mark M. Christiansen, Ken R. Duffy, Ali Makhdoumi, Muriel Médard. 941-948 [doi]
• Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fieldsSon Hoang Dau, Wentu Song, Alex Sprintson, Chau Yuen. 949-955 [doi]
• When do the availability codes make the stored data more available?Swanand Kadhe, Emina Soljanin, Alex Sprintson. 956-963 [doi]
• Coded MapReduceSongze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 964-971 [doi]
• An efficient algorithm for information decomposition and extractionAnuran Makur, Fabian Kozynski, Shao-Lun Huang, Lizhong Zheng. 972-979 [doi]
• Measuring secrecy by the probability of a successful guessIbrahim Issa, Aaron B. Wagner. 980-987 [doi]
• On Shannon capacity and causal estimationRahul Kidambi, Sreeram Kannan. 988-992 [doi]
• Clustering by multivariate mutual information under Chow-Liu tree approximationChung Chan, Tie Liu. 993-999 [doi]
• Maximizing profit of Cloud Brokers under Quantized Billing Cycles: a Dynamic pricing strategy based on ski-rental problemGourav Saha, Ramkrishna Pasumarthy. 1000-1007 [doi]
• Scheduling, pricing, and efficiency of non-preemptive flexible loads under direct load controlAbhishek Gupta, Rahul Jain, Ram Rajagopal. 1008-1015 [doi]
• Dual subgradient methods using approximate multipliersVíctor Valls, Douglas J. Leith. 1016-1021 [doi]
• Directed-Distributed Gradient DescentChenguang Xi, Usman A. Khan. 1022-1026 [doi]
• Systems of quadratic equations: Efficient solution algorithms and conditions for solvabilityKrishnamurthy Dvijotham. 1027-1031 [doi]
• Lossless secure source coding: Yamamoto's settingShahab Asoodeh, Fady Alajaji, Tamás Linder. 1032-1037 [doi]
• Control approach to computing the feedback capacity for stationary finite dimensional Gaussian channelsChong Li, Nicola Elia. 1038-1045 [doi]
• Covert communications on Poisson packet channelsRamin Soltani, Dennis Goeckel, Don Towsley, Amir Houmansadr. 1046-1052 [doi]
• Dirty-paper integer-forcingWenbo He, Bobak Nazer, Shlomo Shamai. 1053-1060 [doi]
• Erasure adversarial wiretap channelsPengwei Wang, Reihaneh Safavi-Naini, Fuchun Lin. 1061-1068 [doi]
• An empirical comparison of sampling techniques for matrix column subset selectionYining Wang, Aarti Singh. 1069-1074 [doi]
• A characterization of deterministic sampling patterns for low-rank matrix completionDaniel L. Pimentel-Alarcón, Nigel Boston, Robert D. Nowak. 1075-1082 [doi]
• Optimal trade-off between sampling rate and quantization precision in A/D conversionAlon Kipnis, Yonina C. Eldar, Andrea J. Goldsmith. 1083-1090 [doi]
• Efficient object detection for high resolution imagesYongxi Lu, Tara Javidi. 1091-1098 [doi]
• Coded caching for reducing CSIT-feedback in wireless communicationsJingjing Zhang, Felix Engelmann, Petros Elia. 1099-1105 [doi]
• Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximationMengke Lian, Henry D. Pfister. 1106-1113 [doi]
• Phase retrieval using iterative projections: Dynamics in the large systems limitGen Li, Yuantao Gu, Yue M. Lu. 1114-1118 [doi]
• Information theory and polyhedral combinatoricsSebastian Pokutta. 1119-1126 [doi]
• Data compression with low distortion and finite blocklengthVictoria Kostina. 1127-1134 [doi]
• Cut-set bound is loose for Gaussian relay networksXiugang Wu, Ayfer Özgür. 1135-1142 [doi]
• Optimal scheduling of real-time traffic in wireless networks with delayed feedbackKyu Seob Kim, Chih-Ping Li, Igor Kadota, Eytan Modiano. 1143-1149 [doi]
• Distortion-memory tradeoffs in cache-aided wireless video deliveryP. Hassanzadeh, Elza Erkip, Jaime Llorca, Antonia Maria Tulino. 1150-1157 [doi]
• Database-aided distributed channel assignment in spectrum sharingMingming Cai, J. Nicholas Laneman. 1158-1165 [doi]
• On the distribution and mean of received power in stochastic cellular networkFengming Cao, Ayalvadi Ganesh, Simon Armour, Mahesh Sooriyabandara. 1166-1173 [doi]
• On proactive caching with demand and channel uncertaintiesL. Srikar Muppirisetty, John Tadrous, Atilla Eryilmaz, Henk Wymeersch. 1174-1181 [doi]
• Sharp transitions in random key graphsJun Zhao. 1182-1188 [doi]
• Absence of isolated nodes in inhomogeneous random key graphsOsman Yagan. 1189-1196 [doi]
• Data dissemination problem in wireless networksIvo Kubjas, Vitaly Skachek. 1197-1204 [doi]
• On the computational complexity of the solvability of information flow problem with hierarchy constraintYuki Takeda, Yuichi Kaji, Minoru Ito. 1205-1210 [doi]
• Optimal large-MIMO data detection with transmit impairmentsRamina Ghods, Charles Jeon, Arian Maleki, Christoph Studer. 1211-1218 [doi]
• On pathwise convergence of particle & grid based nonlinear filters: Feller vs conditional regularityDionysios S. Kalogerias, Athina P. Petropulu. 1219-1226 [doi]
• New guarantees for Blind Compressed SensingMohammad Aghagolzadeh, Hayder Radha. 1227-1234 [doi]
• Bounds on variance for symmetric unimodal distributionsHye Won Chung, Brian M. Sadler, Alfred O. Hero III. 1235-1240 [doi]
• Quantile search: A distance-penalized active learning algorithm for spatial samplingJohn Lipor, Laura Balzano, Branko Kerkez, Don Scavia. 1241-1248 [doi]
• Are Slepian-Wolf rates necessary for distributed parameter estimation?Mostafa El Gamal, Lifeng Lai. 1249-1255 [doi]
• Informational bottlenecks in two-unicast wireless networks with delayed CSITAlireza Vahid, Ilan Shomorony, A. Robert Calderbank. 1256-1263 [doi]
• Partial compute-compress-and-forward for limited backhaul uplink multicell processingInaki Estella Aguerri, Abdellatif Zaidi. 1264-1271 [doi]
• Asymptotically optimal distributed channel allocation: A competitive game-theoretic approachIlai Bistritz, Amir Leshem. 1272-1279 [doi]
• Fundamental relationships between energy and delay in streamingMirza Uzair Baig, Anders Høst-Madsen. 1280-1285 [doi]
• Anywhere decoding: Low-overhead basestation cooperation for interference- and fading-limited wireless environmentsHamed Pezeshki, J. Nicholas Laneman. 1286-1293 [doi]
• A joint typicality approach to compute-forwardSung-Hoon Lim, Chen Feng, Bobak Nazer, Michael Gastpar. 1294-1301 [doi]
• Extracting semantic information without linguistic cues from generic sentencesMokshay M. Madiman, Ashwini Deo. 1302-1307 [doi]
• Recovering communities in weighted stochastic block modelsVarun Jog, Po-Ling Loh. 1308-1315 [doi]
• Vector control systems with unpredictable actuationEna Hariyoshi, Gireeja Ranade, Anant Sahai. 1316-1322 [doi]
• Cost effective algorithms for spectral banditsManjesh Kumar Hanawal, Venkatesh Saligrama. 1323-1329 [doi]
• Mean-variance and value at risk in multi-armed bandit problemsSattar Vakili, Qing Zhao. 1330-1335 [doi]
• A deep learning approach to structured signal recoveryAli Mousavi, Ankit B. Patel, Richard G. Baraniuk. 1336-1343 [doi]
• Inferning treesMina Karzand, Guy Bresler. 1344-1351 [doi]
• Active learning from noisy and abstention feedbackSongbai Yan, Kamalika Chaudhuri, Tara Javidi. 1352-1357 [doi]
• Threshold functions in random s-intersection graphsJun Zhao. 1358-1365 [doi]
• Exploring connections between Sparse Fourier Transform computation and decoding of product codesNagaraj Thenkarai Janakiraman, Santosh K. Emmadi, Krishna R. Narayanan, Kannan Ramchandran. 1366-1373 [doi]
• Linear superposition coding for the Gaussian MAC with quantized feedbackStefan Farthofer, Gerald Matz. 1374-1379 [doi]
• Using deterministic decisions for low-entropy bits in the encoding and decoding of polar codesRemi A. Chou, Matthieu R. Bloch. 1380-1385 [doi]
• Graph reconstruction from the observation of diffused signalsBastien Pasdeloup, Michael G. Rabbat, Vincent Gripon, Dominique Pastor, Grégoire Mercier. 1386-1390 [doi]
• Distributed signal processing with graph spectral dictionariesDorina Thanou, Pascal Frossard. 1391-1398 [doi]
• Markov chain sparsification with independent sets for approximate value iterationEduardo Pavez, Nicolò Michelusi, Aamir Anis, Urbashi Mitra, Antonio Ortega. 1399-1405 [doi]
• Distributed implementation of linear network operators using graph filtersSantiago Segarra, Antonio G. Marques, Alejandro Ribeiro. 1406-1413 [doi]
• Energy-efficient route planning for autonomous aerial vehicles based on graph signal recoveryTianxi Ji, Siheng Chen, Rohan Varma, Jelena Kovacevic. 1414-1421 [doi]
• Bounds between contraction coefficientsAnuran Makur, Lizhong Zheng. 1422-1429 [doi]
• Are generalized cut-set bounds tight for the deterministic interference channel?Mehrdad Kiamari, Amir Salman Avestimehr. 1430-1437 [doi]
• Achievable sum-rate of the two-user Gaussian interference channel through rate-splitting and successive decodingAli Haghi, Amir K. Khandani. 1438-1445 [doi]
• Cache-enabled broadcast packet erasure channels with state feedbackAsma Ghorbel, Mari Kobayashi, Sheng Yang. 1446-1453 [doi]
• Statistical and information-theoretic optimization and performance bounds of video steganographyMehdi Sharifzadeh, Dan Schonfeld. 1454-1457 [doi]
• Optimization theory of Hebbian/anti-Hebbian networks for PCA and whiteningCengiz Pehlevan, Dmitri B. Chklovskii. 1458-1465 [doi]
• Scalable inference of neural dynamical systemsAlyson K. Fletcher. 1466-1469 [doi]
• Metric structures on networks and applicationsSamir Chowdhury, Facundo Mémoli. 1470-1472 [doi]
• Individualized rank aggregation using nuclear norm regularizationYu Lu, Sahand N. Negahban. 1473-1479 [doi]
• Performance analysis for multi-user systems under distributed opportunistic schedulingOri Shmuel, Asaf Cohen 0001, Omer Gurewitz. 1480-1485 [doi]
• Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmittersAli Haghi, Neda Mohammadizadeh, Amir K. Khandani. 1486-1493 [doi]
• On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodesArmand M. Makowski, Osman Yagan. 1494-1501 [doi]
• Linear-feedback MAC-BC duality for correlated BC-noises, and iterative codingSelma Belhadj Amor, Michele A. Wigger. 1502-1509 [doi]
• A low-latency algorithm for stochastic decoding of LDPC codesKuo-Lun Huang, Vincent C. Gaudet, Masoud Salehi. 1510-1515 [doi]
• A hybrid Petri net formalism and resource allocation in distributed control systemsNaim Bajçinca, Elham Almodaresi, Minfeng Ruan. 1516-1524 [doi]