Table of Contents

• Efficient data access in hybrid cloud storageIslam Samy, Onur Ozan Koyluoglu, Ankit Singh Rawat. 1-8 [doi]
• Correcting bursty and localized deletions using guess & check codesSerge Kas Hanna, Salim El Rouayheb. 9-16 [doi]
• On the service capacity region of accessing erasure coded contentMehmet Aktas, Sarah E. Anderson, Ann Johnston, Gauri Joshi, Swanand Kadhe, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin. 17-24 [doi]
• Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codesSwanand Kadhe, Alex Sprintson. 25-30 [doi]
• Fundamental limits of universal variable-to-fixed length coding of parametric sourcesNematollah Iri, Oliver Kosut. 31-37 [doi]
• Data-driven distributed optimization using Wasserstein ambiguity setsAshish Cherukuri, Jorge Cortés. 38-44 [doi]
• Load balancing in hypergraphsPayam Delgosha, Venkat Anantharam. 45-52 [doi]
• The primal versus the dual ising modelMehdi Molkaraie. 53-60 [doi]
• On the spectral norms of pseudo-wigner and related matricesIlya Soloveychik, Vahid Tarokh, John A. Paulson. 61-66 [doi]
• Integer-forcing architectures for uplink cloud radio access networksIslam El Bakoury, Bobak Nazer. 67-75 [doi]
• Physical layer deep learning of encodings for the MIMO fading channelTimothy J. O'Shea, Tugba Erpek, T. Charles Clancy. 76-80 [doi]
• Joint uplink-downlink cell associations for interference networks with local connectivityManik Singhal, Aly El Gamal. 81-88 [doi]
• Half-duplex routing is NP-hardYahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti. 89-96 [doi]
• The multiple-access collision channel without feedback: Capacity region and a mutual information gameMarcos M. Vasconcelos, Urbashi Mitra. 97-102 [doi]
• Two-transmitter two-receiver channel with confidential messagesHassan ZivariFard, Matthieu Bloch, Aria Nosratinia. 103-110 [doi]
• Simultaneous information and energy transmission in Gaussian interference channels with feedbackNizar Khalfet, Samir Medina Perlaza. 111-117 [doi]
• On α-decodability and α-likelihood decoderJingbo Liu, Paul Cuff, Sergio Verdú. 118-124 [doi]
• Capacity of a two-way function multicast channelSeiyun Shin, Changho Suh. 125-133 [doi]
• The effect of removing a network communication edge: Group network codesFei Wei, Michael Langberg. 134-141 [doi]
• Calculating and calibrating a persistence measure for use in monitoring power system vulnerabilityBernard C. Lesieutre, Sandip Roy. 142-148 [doi]
• The impact of load models in an algorithm for improving voltage stability via demand responseMengqi Yao, Daniel K. Molzahn, Johanna L. Mathieu. 149-156 [doi]
• Network-cognizant model reduction of grid-tied three-phase invertersVictor Purba, Sairaj V. Dhople, Saber Jafarpour, Francesco Bullo, Brian B. Johnson. 157-164 [doi]
• Distributed flow balancing over unreliable communication linksApostolos I. Rikos, Christoforos N. Hadjicostis. 165-172 [doi]
• Killing death spiral softly with a small connection chargeTao Sun, Lang Tong. 173-179 [doi]
• Disentangled representations via synergy minimizationGreg Ver Steeg, Rob Brekelmans, Hrayr Harutyunyan, Aram Galstyan. 180-187 [doi]
• Optimal convergence and adaptation for utility optimal opportunistic schedulingMichael J. Neely. 188-195 [doi]
• Learning from randomly arriving agentsTho Ngoc Le, Vijay G. Subramanian, Randall A. Berry. 196-197 [doi]
• On stochastic proximal-point method for convex-composite optimizationAngelia Nedic, Tatiana Tatarenko. 198-203 [doi]
• Supermajority sentiment detection with external influence in large social networksTian Tong, Rohit Negi. 204-211 [doi]
• Testing for directed information graphsSina Molavipour, Germán Bassi, Mikael Skoglund. 212-219 [doi]
• Inferring link changes in dynamic networks through power spectral density variationsJohn A. W. B. Costanzo, Donatello Materassi, Bruno Sinopoli. 220-227 [doi]
• Nonlinear sequential accepts and rejects for identification of top arms in stochastic banditsShahin Shahrampour, Vahid Tarokh. 228-235 [doi]
• A semidefinite programming relaxation under false data injection attacks against power grid AC state estimationMing Jin, Javad Lavaei, Karl Johansson. 236-243 [doi]
• Reconstruction of gene regulatory networks using an error filtering learning schemeIoannis Tzortzis, Christoforos N. Hadjicostis, Laurent Mombaerts. 244-251 [doi]
• Dynamic game-theoretic defense approach against stealthy Jamming attacks in wireless networksAhmed H. Anwar, George K. Atia, Mina Guirguis. 252-258 [doi]
• Learning dynamics in stochastic routing gamesEmily Meigs, Francesca Parise, Asuman E. Ozdaglar. 259-266 [doi]
• A stochastic flow network model with almost-fractional routingMengran Xue, Sandip Roy. 267-274 [doi]
• On the exponential rate of convergence of fictitious play in potential gamesBrian Swenson, Soummya Kar. 275-279 [doi]
• On the uniqueness and stability of equilibria of network gamesParinaz Naghizadeh, Mingyan Liu. 280-286 [doi]
• A dynamic colonel blotto game model for spectrum sharing in wireless networksMohammad Hajimirsadeghi, Narayan B. Mandayam. 287-294 [doi]
• Identifying security vulnerabilities of weakly detectable network parameter errorsYuzhang Lin, Ali Abur. 295-301 [doi]
• Time-varying injection shift factors to predict post-contingency dynamic line flowsAbdullah Al-Digs, Sairaj V. Dhople, Yu Christine Chen. 302-306 [doi]
• Convex relaxation for mixed-integer optimal power flow problemsChin-Yao Chang, Sonia Martínez, Jorge Cortés. 307-314 [doi]
• Sparse tableau relaxation for the optimal power flow problemByungkwon Park, Christopher L. DeMarco. 315-323 [doi]
• Global performance metrics for synchronization of heterogeneously rated power systems: The role of machine models and inertiaFernando Paganini, Enrique Mallada. 324-331 [doi]
• Robust PCA with concurrent column and element-wise outliersMostafa Rahmani, George K. Atia. 332-337 [doi]
• Decentralized exact coupled optimizationSulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed. 338-345 [doi]
• Non-parametric active target localization: Exploiting unimodality and separabilityDhruva Mokhasunavisu, Urbashi Mitra. 346-353 [doi]
• A dynamical systems perspective to convergence rate analysis of proximal algorithmsMahyar Fazlyab, Alejandro Ribeiro, Manfred Morari, Victor M. Preciado. 354-360 [doi]
• Novel inner bounds with uncoded cache placement for combination networks with end-user-cachesKai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti. 361-368 [doi]
• A fast single-pass algorithm for compressive sensing based on binary measurement matricesMahsa Lotfi, Mathukumalli Vidyasagar. 369-373 [doi]
• Generalized geometric programming for rate allocation in consensusRyan Pilgrim, Junan Zhu, Dror Baron, Waheed U. Bajwa. 374-381 [doi]
• Bounded phase synchronization of multirate kuramoto networks through decentralised or distributed controlLiang Wu, Hemanshu Roy Pota, Ian R. Petersen. 382-389 [doi]
• Two-party function computation on the reconciled dataIvo Kubjas, Vitaly Skachek. 390-396 [doi]
• Delay comparison of delivery and coding policies in data clustersVirag Shah, Anne Bouillard, François Baccelli. 397-404 [doi]
• Longest alignment with edits in data streamsElena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. 405-412 [doi]
• Distributed leader selection in switching networks of high-order integratorsAnastasios Tsiamis, Sergio Pequito, George J. Pappas. 413-420 [doi]
• Cooperative data exchange with weighted cost based on d-basis constructionSu Li, Abhin Shah, Michael Gastpar. 421-428 [doi]
• Joint decoding of RAID-ECC solutions for SSDsNing Zheng, Qing Li. 429-436 [doi]
• Coded caching with multiple file requestsYi-Peng Wei, Sennur Ulukus. 437-442 [doi]
• On error-correction performance and implementation of polar code list decoders for 5GFurkan Ercan, Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross. 443-449 [doi]
• Transcoding: A new strategy for relay channelsChih-Chun Wang, David J. Love, Dennis Ogbe. 450-454 [doi]
• Cloud-based resource allocation and cooperative transmission in large cellular networksJing Li, Dongning Guo. 455-462 [doi]
• Status updates through multicast networksJing Zhong, Emina Soljanin, Roy D. Yates. 463-469 [doi]
• An information theoretic framework for active de-anonymization in social networks based on group membershipsFarhad Shirani, Siddharth Garg, Elza Erkip. 470-477 [doi]
• Stability and fracture of social groupsSoheil Eshghi, Grace-Rose Williams, Gualtiero B. Colombo, Liam D. Turner, David G. Rand, Roger M. Whitaker, Leandros Tassiulas. 478-485 [doi]
• Minimizing age-of-information in multi-hop wireless networksRajat Talak, Sertac Karaman, Eytan Modiano. 486-493 [doi]
• Coded fourier transformQian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 494-501 [doi]
• Spatial mean-field limits for CSMA networksFabio Cecchi, Sem C. Borst, Johan S. H. van Leeuwaarden, Philip A. Whiting. 502-509 [doi]
• Community detection on euclidean random graphsAbishek Sankararaman, François Baccelli. 510-517 [doi]
• Multi-agent constrained optimization of a strongly convex function over time-varying directed networksErfan Yazdandoost Hamedani, Necdet Serhat Aybat. 518-525 [doi]
• Curvature-aided incremental aggregated gradient methodHoi-To Wai, Wei Shi, Angelia Nedic, Anna Scaglione. 526-532 [doi]
• Bayesian function optimization with adaptive discretizationShubhanshu Shekhar, Tara Javidi. 533-540 [doi]
• Generalized partial orders for polar code bit-channelsWei Wu, Bing Fan, Paul H. Siegel. 541-548 [doi]
• On the construction of polar codes for achieving the capacity of marginal channelsAmirsina Torfi, Sobhan Soleymani, Siamak Aram, Vahid Tabataba Vakili. 549-556 [doi]
• On iterative decoding of polar codes: Schedule-dependent performance and constructionsChristopher Schnelling, Yassine Amraue, Anke Schmeink. 557-564 [doi]
• Polar coding for multiple descriptions using monotone chain rulesAlankrita Bhatt, Nadim Ghaddar, Lele Wang. 565-571 [doi]
• Polar codes for channels with deletionsKuangda Tian, Arman Fazeli, Alexander Vardy, Rongke Liu. 572-579 [doi]
• Joint coordination-channel coding for strong coordination over noisy channels based on polar codesSarah A. Obead, Jörg Kliewer, Badri N. Vellambi. 580-587 [doi]
• Learning mixtures of sparse linear regressions using sparse graph codesDong Yin, Ramtin Pedarsani, Yudong Chen, Kannan Ramchandran. 588-595 [doi]
• Scalable kernel-based learning via low-rank approximation of lifted dataFatemeh Sheikholeslami, Georgios B. Giannakis. 596-603 [doi]
• An approximation of the CP-rank of a partially sampled tensorMorteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal. 604-611 [doi]
• If it ain't broke, don't fix it: Sparse metric repairAnna C. Gilbert, Lalit Jain. 612-619 [doi]
• Restless streaming bandits: Scheduling scalable video in wireless networksS. Amir Hosseini, Shivendra S. Panwar. 620-628 [doi]
• An FDR-oriented approach to multiple sequential fault detection and isolationJie Chen, Wenyi Zhang, H. Vincent Poor. 629-633 [doi]
• Anomaly detection under a nonlinear system cost objective functionAndrey Gurevich, Kobi Cohen, Qing Zhao. 634-638 [doi]
• A game theoretic approach to promotion design in two-sided platformsAmir Ajorlou, Ali Jadbabaie. 639-641 [doi]
• On the zero-error capacity of channels with noisy feedbackMeysam Asadi, Natasha Devroye. 642-649 [doi]
• Gaussian variable packet-error codingXiaoqing Fan, Aaron B. Wagner. 650-657 [doi]
• Sparse group testing codes for low-energy massive random accessHuseyin A. Inan, Peter Kairouz, Ayfer Özgür. 658-665 [doi]
• Belief propagation, bethe approximation and polynomialsDamian Straszak, Nisheeth K. Vishnoi. 666-671 [doi]
• A generalized algebraic approach to optimizing SC-LDPC codesAllison Beemer, Salman Habib, Christine A. Kelley, Jörg Kliewer. 672-679 [doi]
• On LDPC decoding with natural redundancyPulakesh Upadhyaya, Anxiao Andrew Jiang. 680-687 [doi]
• Serial concatenation of reed muller and LDPC codes with low error floorXin Xiao, Mona Nasseri, Bane Vasic, Shu Lin. 688-693 [doi]
• Lower bounds for quantized LDPC min-sum decoders based on absorbing setsHomayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja. 694-699 [doi]
• Stopping set elimination for LDPC codesAnxiao Andrew Jiang, Pulakesh Upadhyaya, Ying Wang, Krishna R. Narayanan, Hongchao Zhou, Jin Sima, Jehoshua Bruck. 700-707 [doi]
• Economic inefficiency in resource allocation gamesPraneeth Tota, Sanjiv Kapoor, Benjamin Grimmer. 708-715 [doi]
• Evolution of social power for opinion dynamics networksSusana Iglesias Rey, Patricio Reyes, Alonso Silva. 716-723 [doi]
• On the geometry of nash and correlated equilibria with cumulative prospect theoretic preferencesSoham R. Phade, Venkat Anantharam. 724-731 [doi]
• A distributed, dynamical system view of finite, static gamesYuke Li, Fengjiao Liu, A. Stephen Morse. 732-738 [doi]
• Optimal pricing policy of network goodsAli Makhdoumi, Azarakhsh Malekian, Asuman E. Ozdaglar. 739-743 [doi]
• DeepCodec: Adaptive sensing and recovery via deep convolutional neural networksAli Mousavi, Gautam Dasarathy, Richard G. Baraniuk. 744 [doi]
• Self-programming networks: Architecture and algorithmsYilong Geng, Shiyu Liu, Feiran Wang, Zi Yin, Balaji Prabhakar, Mendel Rosenblum. 745-752 [doi]
• Adaptive matching for expert systems with uncertain task typesVirag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic. 753-760 [doi]
• Networked cournot competition in platform marketsWeixuan Lin, John Z. F. Pang, Eilyan Bitar, Adam Wierman. 761 [doi]
• Congestion control and pricing in a network of electric vehicle public charging stationsPhilip Wong, Mahnoosh Alizadeh. 762-769 [doi]
• A dynamic ride-sourcing game with many driversRabih Salhab, Jerome Le Ny, Roland P. Malhamé. 770-775 [doi]
• The merits of sharing a ridePooyan Ehsani, Jia Yuan Yu. 776-782 [doi]
• Finite sample guarantees for PCA in non-isotropic and data-dependent noiseNamrata Vaswani, Praneeth Narayanamurthy. 783-789 [doi]
• Low algebraic dimension matrix completionDaniel L. Pimentel-Alarcón, Gregory Ongie, Laura Balzano, Rebecca Willett, Robert D. Nowak. 790-797 [doi]
• Relations among different privacy notionsJun Zhao. 798-805 [doi]
• Improved algorithms for distributed boostingJeff Cooper, Lev Reyzin. 806-813 [doi]
• Composition properties of inferential privacy for time-series dataShuang Song, Kamalika Chaudhuri. 814-821 [doi]
• Exact recovery in the binary stochastic block model with binary side informationHussein Saad, Ahmed Attia Abotabl, Aria Nosratinia. 822-829 [doi]
• On the sample complexity of learning graphical gamesJean Honorio. 830-836 [doi]
• Communications over a state dependent channel, when the channel state and message are dependentEric Graves. 837-843 [doi]
• A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphereLeighton Pate Barnes, Xiugang Wu, Ayfer Özgür. 844-851 [doi]
• On very noisy channels with feedbackNirmal V. Shende, Aaron B. Wagner. 852-859 [doi]
• Capacity achieving input distribution to the generalized inverse Gaussian neuron modelMustafa Sungkar, Toby Berger, William B. Levy. 860-869 [doi]
• Interactive coding for Markovian protocolsAssaf Ben-Yishai, Ofer Shayevitz, Young Han Kim. 870-877 [doi]
• Towards the exact rate-memory trade-off for uncoded caching with secure deliveryMohsen Bahrami, Mohamed Adel Attia, Ravi Tandon, Bane Vasic. 878-885 [doi]
• An estimation-theoretic view of privacyHao Wang, Flávio du Pin Calmon. 886-893 [doi]
• Achieving the secrecy capacity of the AWGN wiretap channel via multilevel codingAhmed Attia Abotabl, Aria Nosratinia. 894-901 [doi]
• Towards a theory of free-lunch privacy in cyber-physical systemsRuoxi Jia, Roy Dong, Prashanth Ganesh, Shankar Sastry, Costas J. Spanos. 902-910 [doi]
• The securable subspace of a linear stochastic system with malicious sensors and actuatorsBharadwaj Satchidanandan, P. R. Kumar. 911-917 [doi]
• Monotonicity properties and spectral characterization of power redistribution in cascading failuresLinqi Guo, Chen Liang, Steven H. Low. 918-925 [doi]
• Embracing risk dependency in designing cyber-insurance contractsMohammad Mahdi Khalili, Parinaz Naghizadeh, Mingyan Liu. 926-933 [doi]
• Exact-repair trade-off for (n, k = d - 1, d) regenerating codesMehran Elyasi, Soheil Mohajer. 934-941 [doi]
• A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon codeWeiqi Li, Zhiying Wang, Hamid Jafarkhani. 942-949 [doi]
• Improved schemes for asymptotically optimal repair of MDS codesAmeera Chowdhury, Alexander Vardy. 950-957 [doi]
• The risks and rewards of conditioning noncooperative designs to additional informationDario Paccagnan, Jason R. Marden. 958-965 [doi]
• A Bernoulli-Gaussian physical watermark for detecting integrity attacks in control systemsSean Weerakkody, Omur Ozel, Bruno Sinopoli. 966-973 [doi]
• Transition-based versus state-based reward functions for MDPs with Value-at-RiskShuai Ma, Jia Yuan Yu. 974-981 [doi]
• Structured state space realizations for SLS distributed controllersJames Anderson, Nikolai Matni. 982-987 [doi]
• A model predictive control approach to flow pacing for TCPDavid Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, Claire J. Tomlin, Matthew K. Farrens, Dipak Ghosal. 988-994 [doi]
• Controllability of stochastic differential equations with Markovian switchingGuangliang Zhao, Zhixin Yang, Quan Yuan, Le Yi Wang. 995-999 [doi]
• Mean estimation from adaptive one-bit measurementsAlon Kipnis, John C. Duchi. 1000-1007 [doi]
• Guesswork subject to a total entropy budgetArman Rezaee, Ahmad Beirami, Ali Makhdoumi, Muriel Médard, Ken Duffy. 1008-1015 [doi]
• Lower bounds for two-sample structural change detection in ising and Gaussian modelsAditya Gangrade, Bobak Nazer, Venkatesh Saligrama. 1016-1025 [doi]
• On composite binary hypothesis testing with training dataMichael Bell, Yuval Kochman. 1026-1033 [doi]
• On the equality condition for the I-MMSE proof of the entropy power inequalityAlex Dytso, Ronit Bustin, H. Vincent Poor, Shlomo Shamai Shitz. 1034-1039 [doi]
• Algebraic properties of solutions to common information of Gaussian vectors under sparse graphical constraintsAli Moharrer, Shuangqing Wei. 1040-1047 [doi]
• Streaming Bayesian inference: Theoretical limits and mini-batch approximate message-passingAndre Manoel, Florent Krzakala, Eric W. Tramel, Lenka Zdeborová. 1048-1055 [doi]
• The layered structure of tensor estimation and its mutual informationJean Barbier, Nicolas Macris, Léo Miolane. 1056-1063 [doi]
• Additivity of information in multilayer networks via additive Gaussian noise transformsGalen Reeves. 1064-1070 [doi]
• Phase retrieval via linear programming: Fundamental limits and algorithmic improvementsOussama Dhifallah, Christos Thrampoulidis, Yue M. Lu. 1071-1077 [doi]
• The capacity of cache aided private information retrievalRavi Tandon. 1078-1082 [doi]
• Secure symmetric private information retrieval from colluding databases with adversariesQiwen Wang, Mikael Skoglund. 1083-1090 [doi]
• Private information retrieval from Byzantine and colluding databasesKarim A. Banawan, Sennur Ulukus. 1091-1098 [doi]
• Private information retrieval with side information: The single server caseSwanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson. 1099-1106 [doi]
• Efficiently finding all power flow solutions to tree networksAlisha Zachariah, Zachary Charles. 1107-1114 [doi]
• Maximally recoverable codes: The bounded caseVenkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu. 1115-1122 [doi]
• Multi-erasure locally recoverable codes over small fieldsPengfei Huang, Eitan Yaakobi, Paul H. Siegel. 1123-1130 [doi]
• Limitations of piggybacking codes with low substripingReyna Hulett, Mary Wootters. 1131-1138 [doi]
• Reconciling similar setsRyan Gabrys, Farzad Farnoud Hassanzadeh. 1139-1144 [doi]
• Repairing multiple failures for scalar MDS codesBurak Bartan, Mary Wootters. 1145-1152 [doi]
• Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimizationRoman Pogodin, Mikhail Krechetov, Yury Maximov. 1153-1159 [doi]
• Distributed stochastic optimization in networks with low informational exchangeWenjie Li, Mohamad Assaad, Pierre Duhamel. 1160-1167 [doi]
• Privacy preserving cloud-based quadratic optimizationAndreea B. Alexandru, Konstantinos Gatsis, George J. Pappas. 1168-1175 [doi]
• Sequential smoothing framework for convex-concave saddle point problems with application to large-scale constrained optimizationLe Thi Khanh Hien, William B. Haskell. 1176-1183 [doi]
• Inexact iteration of averaged operators for non-strongly convex stochastic optimizationWilliam B. Haskell, Rahul Jain 0002. 1184-1191 [doi]
• Asynchronous primal updates in dual subgradient methods via approximate lagrange multipliersVíctor Valls, Douglas J. Leith. 1192-1197 [doi]
• Control of unknown linear systems with Thompson samplingYi Ouyang, Mukul Gagrani, Rahul Jain 0002. 1198-1205 [doi]
• Robust convergence analysis of distributed optimization algorithmsAkhil Sundararajan, Bin Hu, Laurent Lessard. 1206-1212 [doi]
• On exploiting spectral properties for solving MDP with large state spaceLibin Liu, Arpan Chattopadhyay, Urbashi Mitra. 1213-1219 [doi]
• Vaidya walk: A sampling algorithm based on the volumetric barrierYuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu 0001. 1220-1227 [doi]
• Potential conditional mutual information: Estimators and propertiesArman Rahimzamani, Sreeram Kannan. 1228-1235 [doi]
• Viral quasispecies reconstruction via tensor factorizationSoyeon Ahn, Ziqi Ke, Haris Vikalo. 1236-1239 [doi]
• A sequential approximation framework for coded distributed optimizationJingge Zhu, Ye Pu, Vipul Gupta, Claire Tomlin, Kannan Ramchandran. 1240-1247 [doi]
• Coded machine learning: Joint informed replication and learning for linear regressionShahroze Kabir, Frederic Sala, Guy Van den Broeck, Lara Dolecek. 1248-1255 [doi]
• Latency analysis of coded computation schemes over wireless networksAmirhossein Reisizadeh, Ramtin Pedarsani. 1256-1263 [doi]
• On the optimal recovery threshold of coded matrix multiplicationMohammad Fahim, Haewon Jeong, Farzin Haddadpour, Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover. 1264-1270 [doi]
• Matrix sparsification for coded matrix multiplicationGeewon Suh, Kangwook Lee, Changho Suh. 1271-1278 [doi]
• Reducing congestion through information designSanmay Das, Emir Kamenica, Renee Mirka. 1279-1284 [doi]
• Informational incentives for congestion gamesHamidreza Tavafoghi, Demosthenis Teneketzis. 1285-1292 [doi]
• Resource allocation with population dynamicsJonathan Epperlein, Jakub Marecek. 1293-1300 [doi]