ITA @ UCSD - ITA Workshop

Year

Monday

8:00	Continental breakfast

	Complex, Societal, and Large Networks	Error-Correcting Codes for Flash Memories	Interference Channels and Alignment	MIMO Communications
	Chair: Yingbin Liang, Syracuse University	Chair: Anxiao (Andrew) Jiang, Texas A&M	Chair: Robert Heath, UT Austin	Chair: Urbashi Mitra, USC
8:30	Information dynamics in complex networks Robert Bonneau, AFOSR	Systematic single limited magnitude error correcting codes for flash memories Torleiv Klove, Bella Bose, Oregon State, and Noha Elarief	Minimum mean squared error interference alignment David Schmidt, TU Munich, Changxin Shi, Randall Berry, Michael Honig, Northwestern, and Wolfgang Utschick, TU Munich	Fundamental rate-reliability-complexity limits in MIMO communications Petros Elia, Eurecom, and Joakim Jalden, KTH
8:50	It pays to do the right thing: Incentive mechanisms for Societal Networks B. Prabhakar, Stanford	Correcting limited-magnitude errors in the rank-modulation scheme Itzhak Tamo and Moshe Schwartz, Ben-Gurion University	Interference alignment with no CSIT Syed A. Jafar, Chenwei Wang, and Tiangao Gou, UC Irvine	Multi-Cellular wireless with base stations employing unlimited numbers of antennas Thomas L. Marzetta, Bell Laboratories, Alcatel-Lucent
9:10	Linear capacity scaling in wireless networks: Beyond physical limits? Olivier Leveque (EPFL), Ayfer Özgür (EPFL), David Tse (UC Berkeley)	Codes in permutations and error correction for rank-modulation Alexander Barg and Arya Mazumdar, University of Maryland	Capacity bounds for the Poisson interference channel Lifeng Lai, Yingbin Liang and Shlomo Shamai (Shiz)	Multi-antenna communication in ad hoc networks: Achieving MIMO gains with SIMO transmission Nihar Jindal, Minnesota, Jeff Andrews, UT Austin, and Steven Weber, Drexel
9:30	Break

	Sampling and Representation	Coding for Memories	Interference Networks	Cognitive Radio
		Chair: Paul Siegel, UCSD	Chair: Syed Jafar, UC Irvine	Chair: Ivana Maric, Stanford
9:45	Xampling: Analog-to-digital at sub-Nyquist rates Yonina C. Eldar, Technion and Stanford	Efficient rewriting codes for solid-state memories Anxiao (Andrew) Jiang, Texas A&M	Gaussian interference relay channel with an out-of-band relay Onur Sahin, Osvaldo Simeone, and Elza Erkip	Opportunistic broadcast cognitive radio: asymptotic performance Aria Nosratinia and Yang Li, UT Dallas
10:05	Mutual information and time-interleaved analog-to-digital conversion Andrew C. Singer, Andrew J. Bean, and Jun Won Choi, University of Illinois at Urbana Champaign	Information theory-based design of phase-change memories Michele M. Franceschini, Luis A. Lastras Montano, John P. Karidis, and Ashish Jagmohan, IBM Research	Oblivious and out-of-band relaying for interference networks O. Simeone, E. Erkip and S. Shamai (Shitz)	Distributed cognitive radio network management via message passing algorithms Yingbin Liang (Syracuse University), Lifeng Lai (Princeton) and John Halloran
10:25	High-dimensional linear speech representations for robust recognition Matthew Ager, Zoran Cvetkovic, and Peter Sollich, King\\\\\\\'s College London	Superposition coding in rewritable channels Luis A. Lastras-Montano, Thomas Mittelholzer, Michele M. Franceschini, IBM Research	Multiple stream information transmission over K-User interference networks Dmitri Trukhachev, University of Alberta	Asynchronous modulation classification and SNR estimation of PSK/QAM modulated signals in flat-fading channels William C. Headley and Claudio R. C. M. da Silva, Virginia Tech
10:45	Break

	Cellular Communications	Network Coding and Distributed Storage	Broadcast Channels	Spectrum Sensing
	Chair: Hamid Jafarkhani, UC Irvine	Chair: Muriel Medard, MIT	Chair: Tom Cover, Stanford	Chair: John Proakis, UCSD
11:00	Should I share my femtocell? Ping Xia, Vikram Chandrasekhar, and Jeffrey G. Andrews, UT Austin	New results on network error correction: capacities and upper bounds Sukwon Kim, Tracey Ho, Michelle Effros, Caltech, and Salman Avestimehr, Cornell	MIMO Gaussian Broadcast Channels with Common Messages Ruoheng Liu, Princeton, Tie Liu, Texas A&M, Vincent H. Poor, Princeton, Shlomo (Shitz) Shamai, Technion,
11:20	Cooperative interference management in multi-cell downlink beamforming Rui Zhang, A-Star, Singapore, and Shuguang Cui, Texas A&M	Array codes for distributed storage: Results and open problems Zhiying Wang (Caltech), Robert Mateescu (Caltech), Alex Dimakis (USC), and Jehoshua Bruck (Caltech)	On capacity outer bounds for a simple family of wireless networks Michelle Effros, Caltech	Adaptive spectrum sensing Stephen Shellhammer, Qualcomm, Wenyi Zhang, University of Science and Technology China, Ahmed K. Sadek, Qualcomm, and Cong Shen, Qualcomm
11:40	Information theoretic reflections on constrained base station cooperation in the uplink S. Shamai, O. Simeone, M. Gastpar, A. Lapidoth, N. Levy, B. Nazer, V. Poor, A. Sanderovich, O. Somekh, M. Wigger and B. Zaidel	Explicit and Optimal Codes for Distributed Storage K. V. Rashmi (IISc), N. B. Shah (IISc), P. V. Kumar, (IISc and USC) and K. Ramchandran (UC Berkeley)	An information inequality for the BSSC broadcast channel Varun Jog, IIT-Bombay, and Chandra Nair, CUHK	Multiuser cognitive access of continuous-time Markov channels: maximum throughput and effective bandwidth regions Shiyao Chen and Lang Tong, Cornell University
12:00	Lunch and Graduation-Day Poster Session

	Poster Session	Poster Session	Poster Session	Poster Session

12:30	MAC Polar Codes and Matroids Emmanuel Abbe and Emre Telatar, EPFL	Secret-key generation for fading wireless channels Xiaojun Tang, Rutgers, Ruoheng Liu, Princeton, Predrag Spasojevic, Rutgers, and H. Vincent Poor, Princeton	Coordinated beamforming and common message decoding for intercell interference mitigation Hayssam Dahrouj and Wei Yu, University of Toronto	LDPC decoder with a limited-precision FPGA-based floating-point multiplication coprocessor Raymond Moberly, Michael O\'Sullivan, Khurram Waheed, SDSU
12:30	Agile spectrum sensing for cognitive radio Ali Tajer, Rui Castro, and Xiaodong Wang, Columbia University	Corruption, justice, and democracy in compressive sensing Mark Davenport, Rice	Coding for high density magnetic recording Arya Mazumdar (University of Maryland), Alexander Barg (University of Maryland), Navin Kashyap (Queen\\\'s University)	Feedback concepts for multicell cooperation Ramya Bhagavatula and Robert W. Heath, Jr., UT Austin
12:30	Delay performance of CSMA policies in multihop wireless networks: A new perspective Mahdi Lotfinezhad and Peter Marbach, University of Toronto	Parity forwarding for multiple-relay and interference-relay networks Peyman Razaghi and Wei Yu, University of Toronto	Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks Bike Xie, Mihaela van der Schaar and Richard D. Wesel, UCLA	Backpressure routing made practical Scott Moeller, Avinash Sridharan, Bhaskar Krishnamachari, Omprakash Gnawali, USC
12:30	Distributed power control for cognitive user access based on primary link outage feedback Senhua Huang, Xin Liu, and Zhi Ding, UC Davis	Cutset based processing and compression of Markov random fields Matt Reyes, University of Michigan	Reliability-efficiency trade-off in distributed coding Awlok Josan and David L. Neuhoff, University of Michigan	Application-aware network coding Hulya Seferoglu and Athina Markopoulou, UCI
12:30	Fading Z-Interference channels without state information at transmitters Yan Zhu, Northwestern University	On the distortion exponent of block-fading Gaussian channels Songqing Zhao, Daniela Tuninetti, Rashid Ansari, and Dan Schonfeld, University of Illinois at Chicago	Information Theoretic Security in Interference Networks O. Ozan Koyluoglu and Hesham El Gamal
1:15	Two Presentation Tracks and Continued Poster Session

	Compression	Topics in Communication and Signal Processing
	Chair: Jorma Rissanen, Helsinki Institute for Information Technology	Chair: Babak Hassibi, Caltech
1:15	On interactive encoding and decoding for distributed lossless coding of individual sequences En-hui Yang and Jin Meng, University of Waterloo	Computing with Things Small, Wet, and Random: Designing Stochastic Logic and Biological Processes Marc Riedel, University of Minnesota
1:35	Markov types again revisited Charles Knessl (UIC), Philippe Jacquet (INRIA), and Wojciech Szpankowski (Purdue)	Capacity of frequecy-selective and time-selective fading channel Antonia. M. Tulino (Bell Labs Alcatel-Lucent), Giuseppe Caire (USC), Shlomo Shamai (Technion) and Sergio Verdu (Princeton)
1:55	On quantization of discrete probability distributions Yuriy Reznik, Qualcomm	Grassmannian predictive frequency domain compression for limited feedback beamforming Takao Inoue, National Instruments, and Robert W. Heath Jr., UT Austin
2:15	Break

	Computing Market Equilibria	Relaying Strategies	When Coding Theory Meets Other Fields	Coding for Heterogeneous Networks
	Chair: Vijay Vazirani, Georgia Tech	Chair: Bobak Nazer, University of Wisconsin	Chair: Tuvi Etzion, Technion	Chair: Christina Fragouli, EPFL
2:30	A perfect price discrimination market, its welfare theorems, and an efficient algorithm for computing its equilibria Gagan Goel and Vijay V. Vazirani, Georgia Tech	When is compress-and-forward optimal? Si-Hyeon Lee and Sae-Young Chung, KAIST	When Huffman meets Hamming: a class of optimal variable-length error-correcting codes Serap A. Savari, Texas A&M University, and Joerg Kliewer, New Mexico State University	Optimal error control coding for iterative cancellation systems Christian Schlegel, University of Alberta, and Marat Burnashev, Russian Academy of Sciences
2:50	Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria Xi Chen and Shang-Hua Teng, USC	Universal relaying for the interference channel Peyman Razaghi and Wei Yu, University of Toronto	On the limitations of 3-query linear locally decodable codes Anna Gal and Andrew Mills, UT Austin	Optimizing fountain codes for multicast in heterogeneous networks Yao Li, Rutgers, and Emina Soljanin, Bell Labs
3:10	Local dynamics for linear Fisher markets: Proportional response as gradient descent Ben Birnbaum (University of Washington), Nikhil R Devanur (Microsoft Research), and Lin Xiao (Microsoft Research)	An analytical expression of the probability of error for relaying with decode-and-forward Alexandre Graell i Amat, ENST Bretagne, and Ingmar Land, University of South Australia	Integer codes for coding and computing Ulrich Tamm, University of Bielefeld and Marmara University	Achievable Strategies for General Secure Network Coding Tao Cui, Tracey Ho, Caltech, and Joerg Kliewer, New Mexico State
3:30	Break

	Networks and Queues	Analog Network Coding	Multidimensional Codes and Sequences	Coding for Sensor Networks
	Chair: Balaji Prabhakar, Stanford	Chair: Young-Han Kim, UCSD	Chair: Ido Tal, UCSD	Chair: Nihar Jindal, University of Minnesota
3:45	The asymptotic behavior of minimum buffer size requirements in large P2P streaming networks Lei Ying, Iowa State University, R. Srikant, University of Illinois and Srinivas Shakkottai, Texas A&M University	Analog network coding in the high-SNR regime Ivana Maric, Stanford, Andrea Goldsmith, Stanford, and Muriel Medard, MIT	Lower bounds of capacity of 2D constraints Hiroshi Kamabe	Maximization of sample gathering in clusters with Slepian-Wolf coding T. Wang, W. Heinzelman, A. Seyedi and A. Vosoughi, University of Rochester
4:05	Randomized load balancing with general service time distributions Maury Bramson (University of Minnesota), Yi Lu (Microsoft Research), Balaji Prabhakar (Stanford)	On analyzing and improving COPE performance Fang Zhao and Muriel Medard, MIT	Sequence folding, lattice tiling, and multidimensional coding Tuvi Etzion, Technion	Coding for cooperative data exchange Alex Sprintson, Texas A&M University, College Station , Texas, Parastoo Sadeghi, Australian National University, Graham Booker, Texas A&M University, College Station, Texas, Salim El Rouayheb, University of California, Berkeley,
4:25	Optimal buffer partitioning on a multiuser wireless link Omur Ozel and Elif Uysal-Biyikoglu, METU, Tolga Girici, TOBB ETU	Analytical framework for network coding for intermittently-connected mobile ad-hoc networks Ramanan Subramanian and Faramarz Fekri, Georgia Tech	On generalized bent functions Tor Helleseth and Alexander Kholosha	Joint identity-message coding for sensor networks Lorenzo Keller, Mahdi Jafari Siavoshani, Christina Fragouli, Katerina Argyraki, and Suhas Diggavi
4:45	Break

	Revisiting Random Access	Network Coding	Reed-Solomon Codes and Soft Decoding	Relay Networks
	Chair: Elif Uysal-Biyikoglu, METU	Chair: Emina Soljanin, Bell Labs	Chair: Shu Lin, UC Davis	Chair: Sae-Young Chung, KAIST
5:00	Self-synchronizing properties of CSMA wireless multi-hop networks Kuang Xu, MIT, Olivier Dousse, Nokia, and Patrick Thiran, EPFL	On optimal design of network codes Babak Hassibi, Sormeh Shadbakht, and Matthew Thill	Hardware complexity of algebraic soft-decision Reed-Solomon decoders and comparisons Xinmiao Zhang and Jiangli Zhu	Inner and outer bounds on multi-pair bi-directional relay networks Sang Joon Kim, Samsung, Besma Smida, Purdue, and Natasha Devroye, UI Chicago
5:20	Ellipsoid bounds on an Aloha-like stability region Nan Xie, Steven Weber, and John M. Walsh	Polymatroids with network coding Te Sun Han, Waseda University, Japan	A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes Phong S. Nguyen, Henry D. Pfister, and Krishna R. Narayanan	Optimal power allocation for training based amplify-and-forward relay systems Yupeng Jia and Azadeh Vosoughi
5:40	Delay performance of CSMA policies in multihop wireless networks: A new perspective Mahdi Lotfinezhad and Peter Marbach, University of Toronto	Network Coding Delay: A Brute-Force Analysis Maricica Nistor, João Barros, Fausto Vieira, Tiago T. V. Vinhoza, Instituto de Telecomunicações, Universidade do Porto, Joerg Widmer, Docomo Euro-labs	Error exponents for linear codes under maximum likelihood decoding at low rates Hideki Yagi, H. Vincent Poor	Coding for deterministic relay networks Elona Erez, Yun Xu, and Edmund Yeh
6:00	Relax and enjoy the company

Tuesday

8:00	Continental breakfast

	Topics in Information Theory	Unequal Error Potection and Rateless Codes	Distributed Source Coding	Multiuser MIMO
	Chair: Elza Erkip, Polytechnic Institute, NYU	Chair: Khaled Abdel-Ghaffar, UC Davis	Chair: Vinod Prabhakaran, UIUC	Chair: Shlomo Shamai , Technion
8:30	On coding for channels with insertions/deletions Tolga M. Duman, Dario Fertonani, and Feng Wang	Some fundamental coding theoretic limits of unequal error protection Shashi Borade and Sujay Sanghavi, UT Austin	A new sufficient condition for sum-rate tightness of quadratic Gaussian MT source coding Yang Yang, Yifu Zhang, and Zixiang Xiong, Texas A&M University	Gain from antenna correlation in multi-user MIMO systems Hao Wang, Li Ping and Xiaokang Li
8:50	Cyclic coding for ISI channels with integer-forcing equalization Or Ordentlich and Uri Erez	Distributed rateless codes with unequal error protection property Ali Talari and Nazanin Rahnavard	An optimal hybrid digital/analog scheme for Wyner-Ziv coding over broadcast channels Yang Gao, UC Riverside, and Ertem Tuncel, UC Riverside	Rethinking Network MIMO: Cost of CSIT, Performance Analysis, and Architecture Comparisons Giuseppe Caire, USC, Haralabos C. Papadopoulos, DoCoMo Labs, Sean A. Ramprashad, DoCoMo Labs
9:10	Polarization degrees of freedom Ada S. Y. Poon, Stanford, and David N. C. Tse, UC Berkeley		Distributed compression of vectors: Gaussian results and discrete counterexamples Aaron Wagner, Md. Saifur Rahman, Benjamin Kelly, and Yucel Altug	Random linear coded multiple-access relay network: MIMO mode tradeoffs Young Jin Chun and Sang Wu Kim, Iowa State Univ.
9:30	Break

	Inequalities and Estimation	Convolutional Codes Revisited	Source Coding	Communications and Channel Estimation
	Chair: Narayana Prasad Santhanam, University of Hawaii at Manoa	Chair: Daniel Costello, Notre Dame	Chair: Ofer Shayevitz, UCSD	Chair: Michael Honig, Northwestern
9:45	Tunable inner bounds for the region of entropy vectors John MacLaren Walsh & Steven Patrick Weber, Drexel University	Is feedback a performance equalizer of classic (convolutional) and modern (turbo, LDPC) codes? Tsung-Yi Chen, UCLA, Bazhong Shen and N.Seshadri, Broadcom	Kaspi's two-way source coding question resolved Nan Ma and Prakash Ishwar, BU	Single sensor radio scene analysis for packet based signals G. Ivkovic, P. Spasojevic, and I. Seskar, WINLAB, Rutgers University
10:05	Counterexamples to a proposed Stam inequality on finite groups Venkat Anantharam, UC Berkeley	Signal codes revisited: Convolutional lattice codes Meir Feder, Ofir Shalvi, and Naftali Sommer	Distortion abstraction with side information Richard E. Blahut and Soumya Jana, UIUC	Towards the practical use of channel output and CSI feedback Zac Chance and David J. Love, Purdue University
10:25	MDL Interval Estimation Jorma Rissanen and Petri Myllymaki, Helsinki Institute for Information Technology	On weight enumerators and MacWilliams Identity for convolutional codes Irina E. Bocharova, Florian Hug, Rolf Johannesson, and Boris D. Kudryashov	Korner-Marton theorem as special case of canonical theory Soumya Jana, UIUC	A new iterative sparse channel estimation technique Feng Wan, University of Southern California Urbashi Mitra, University of Southern California Andreas Molisch, University of Southern California
10:45	Break

	Secrecy Generation	Belief-Propagation and Linear-Programming Decoding	Joint Source-Channel Coding	Interference Management
	Chair: Mehul Motani, National University of Singapore	Chair: Jack Wolf, UCSD	Chair: Serap Savari, Texas A&M	Chair: Azadeh Vosoughi, University of Rochester
11:00	On the MISO compound wiretap channel Ashish Khisti, Univ of Toronto	Difference-map belief propagation decoders of LDPC codes Jonathan S. Yedidia, MERL, Yige Wang, MERL, and Stark C. Draper, U. Wisconsin	Separation and approximate separation of source and channel coding in networks Chao Tian, Jun Chen, Suhas Diggavi and Shlomo Shamai	Advanced interference coordination techniques in heterogeneous cellular networks Naga Bhushan, Mohammad Jaber Borran, Tingfang Ji, Aamod Khandekar, Ritesh Maden, and Ashwin Sampath
11:20	Channel intrinsic randomness Matthieu Bloch, Georgia Tech	A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization Pascal O. Vontobel, Hewlett-Packard Laboratories, Palo Alto, CA, USA	How analog should communication be made? Yuval Kochman and Gregory W. Wornell, MIT	Pilot contamination reduction in multi-user TDD systems Kumar Appaiah, University of Texas, Alexei Ashikhmin, and Thomas Marzetta, Bell Labs
11:40	Impact of channel sparsity and correlated eavesdropping on secret key generation from multipath channel randomness T.-H. Chou, A. M. Sayeed, and S. C. Draper	On the connection between channel coding LP decoding and compressed sensing LP decoding Alex G. Dimakis, Roxana Smarandache, Pascal O. Vontobel	An Outer Bound Region for Interference Channels with Generalized Feedback Daniela Tuninetti	Limited feedback codebook design for interference management Vasanthan Raghavan and Stephen Hanly
12:00	Lunch

1:15	Senseless Decompression Urbashi Mitra, USC, and Ruediger Urbanke, EPFL

2:15	Break

	Secrecy and Cooperation	Analysis of LDPC Codes	MIMO Channels	Beamforming
	Chair: Aylin Yener, Penn State	Chair: Pascal Vontobel, HP Labs	Chair: Antonia Maria Tulino, Bell Labs Alcatel-Lucent	Chair: Jeffrey Andrews, UT Austin
2:30	Secret sharing and non-Shannon information inequalities Amos Beimel and Ilan Orlov, BGU	Trapping Set Enumerators for Specific LDPC Codes Shadi Abu-Surra, David DeClerq, Dariush Divsalar, and William Ryan	Sum-rate capacity of correlated multi-user MIMO channels Jin-Woo Lee, Hee-Nam Cho, Han-Jun Park and Yong-Hwan Lee, Seoul National University	Multiple beamforming with constellation precoding: Diversity analysis and sphere decoding Hong Ju Park, Boyu Li, and Ender Ayanoglu, UC Irvine
2:50	On the characterization of the secrecy region of a simple cooperative system Ninoslav Marina	On the existence of typical minimum distance for protograph-based LDPC codes Shadi Abu-Surra, Samsung Telecom, Dariush Divsalar, JPL/Caltech, and William Ryan, Univ. of Arizona	Team decision for the cooperative MIMO channel with imperfect CSIT sharing David Gesbert and Randa Zakhour, EURECOM	Statistical distributions that arise in constrained beamforming with incomplete channel information Bertrand Hochwald and Louay Jalloul
3:10	Optimal power allocation for secure communication over fading MACs Ruoheng Liu, Princeton University, Yingbin Liang, Syracuse University, and H. Vincent Poor, Princeton	Density evolution-based analysis and design of LDPC codes with a priori information M. Martalò, A. Abrardo, G. Ferrari, M. Franceschini, and R. Raheli	Transmitter optimization for distributed Gaussian MIMO channels H.F. Chong, M. Motani, and F. Nan, NUS	Beamforming in wireless relay-interference networks with quantized feedback Erdem Koyuncu and Hamid Jafarkhani, UCI
3:30	Break

	Secrecy and Cooperation	Iterative Decoding of LDPC Codes	Databases and Broadcast	Resource Management in Wireless
	Chair: Hesham El Gamal, Ohio State	Chair: Jonathan Yedidia, Mitsubishi Electric Research Laboratories	Chair: Anand Sarwate, UCSD	Chair: Alireza Seyedi, University of Rochester
3:45	On secure distributed storage under repair dynamics Sameer Pawar, Salim ElRouayheb and Kannan Ramchandran, UC Berkeley	Iterative decoding beyond belief propagation Shiva K. Planjery, Shashi Kiran Chilappagari, Ludovic Danjean, David Declercq, Bane Vasic, University of Arizona	Statistical Modeling and Analysis of Content Identification Pierre Moulin	Markov chain monte carlo detection for underwater acoustic channels Hong Wan, Rong-Rong Chen, Jun Won Choi, Andrew Singer, James Preisig, and Behrouz Farhang-Boroujeny
4:05	Ergodic secret alignment Raef Bassily and Sennur Ulukus, University of Maryland	Error correction capability of column-weight-three LDPC codes: New results Shashi Kiran Chilappagari, Bane Vasic, and Alex Dimakis	Utility and Privacy of Data Sources: Can Shannon Help Conceal and Reveal Information? Lalitha Sankar, Princeton University, S. Raj Rajagopalan, HP Labs, H. Vincent Poor, Princeton University	Power allocation strategy for soft-decision-and-forward protocol with Alamouti code based on ML decoding Kyoung-Young Song, Jong-Seon No, Seoul National University, and Habong Chung, Hongik University
4:25	On secrecy capacity scaling in wireless networks O. Ozan Koyluoglu, C. Emre Koksal, and Hesham El Gamal, Ohio State	Optimal non-uniform quantization of LDPC decoders Brian Kurkoski and Hideki Yagi	A Deterministic Approach to Rate-Compatible Fountain Communication Richard Wesel and Thomas Courtade	Universal pricing mechanisms for wireless systems Holger Boche, Siddharth Naik, and Tansu Alpcan, TU Berlin
4:45	Break

	Secrecy and Compressive Sensing	Design of LDPC Codes	Applications of Feedback	Statistical Physics in Communications
	Chair: Sennur Ulukus, University of Maryland	Chair: Bane Vasic, University of Arizona	Chair: Suhas Diggavi, EPFL	Chair: Michael Chertkov, Los Alamos National Laboratory
5:00	Recent results on the theory and practice of information theoretic security Hesham El Gamal, Ohio State	Iterative decoding of a class of cyclic codes Li Zhang, UCD, Qin Huang, UCD, Shu Lin, UCD	Capacity, feedback, delay, and ARQ Andrea Goldsmith, Stanford	Signal estimation in Gaussian noise: a statistical physics perspective Neri Merhav, Technion, Dongning Guo, Northwestern University, and Shlomo Shamai (Shitz), Technion
5:20	A new outer bound for the secrecy capacity region of the gaussian two-way wiretap channel Xiang He and Aylin Yener, Penn State	Quasi-cyclic LDPC codes on latin squares and the ranks of their parity-check matrices Li Zhang, Qin Huang, Shu Lin, Khaled Abdel-Ghaffar (UC Davis), and Ian F. Blake (University of British Columbia)	Energy-distortion tradeoff with multiple sources and feedback Aman Jain, Deniz Gunduz, Sanjeev R. Kulkarni, H. Vincent Poor, and Sergio Verdu	Medium access control via nearest neighbor interactions Ka Hung Hui, Dongning Guo, Randall A. Berry, and Martin Haenggi
5:40	On compressive sensing for positive semidefinite matrices Weiyu Xu, Ao Tang Cornell University	Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity Michael Lentmaier, David G. M. Mitchell, Gerhard P. Fettweis, and Daniel J. Costello, Jr.	Opportunistic interference management in MIMO broadcast channels with limited feedback Zheng Wang, Lemonia Dritsoula, Hamid Sadjadpour, JJ Garcia-luna-aceves	Analyzing the Maxwell decoder for LDPC codes in binary erasure channels Pablo M. Olmos, Juan Jose Murillo-Fuentes and Fernando Perez-Cruz
6:00	Trip the light fantastic

Wednesday

8:00	Continental breakfast

8:30	Graduation Day

	Coping with Uncertainty	Coding Theory	Feedback and Control	Interference Networks
	Chair: Sujay Sanghavi, UT Austin	Chair: Pascal Vontobel, HP Labs	Chair: Todd Coleman, UIUC	Chair: Natasha Devroye, UI Chicago
8:30	Asymptotic analysis of large scale stochastic games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub, and Andrea Goldsmith, Stanford	Analysis of protograph-based LDPC convolutional codes David G. M. Mitchell, University of Notre Dame	Upper bounds to error probability with feedback B. Nakiboglu and L. Zheng, MIT	On interference alignment and the noisy-interference capacity of a class of interference networks Viveck R. Cadambe and Syed A. Jafar, UC Irvine
8:55	Communication with unreliable receivers Lav R. Varshney, Massachusetts Institute of Technology	Error correction for codeword-stabilized quantum codes Yunfan Li,Ilya Dumer,Leonid Pryadko, University of California at Riverside, Markus Grassl, National University of Singapore, Singapore	Distributed control: a new frontier of information theory Pulkit Grover, Anant Sahai, Se Yong Park, UC Berkeley, and Aaron Wagner, Cornell	Transmission and error control in interference networks Marco Levorato
9:20	Break

	Source Coding, Side Information, and Distributed Computation	Multiuser and ISI Channels	Practical Aspects of Networks	Communication and Detection
	Chair: Ofer Shayevitz, UCSD	Chair: Gerhard Kramer, USC	Chair: James Zeidler, UCSD	Chair: Giuseppe Caire, USC
9:35	On feedback and side information: A network source coding perspective Mayank Bakshi and Michelle Effros	Two results on the discrete memoryless broadcast channel Chandra Nair, Zizhou Vincent Wang, Yanlin, Geng, CUHK	Scheduling for small delay in multi-channel wireless networks Shreeshankar Bodas, Sanjay Shakkottai, UT Austin, Lei Ying, Iowa State, and R. Srikant, UIUC	OFDM, PAPR and RIP Jovana Ilic and Thomas Strohmer, UC Davis
10:00	Dynamical models for source coding Ofer Shayevitz	The approximate capacity of the Gaussian cognitive interference channel S. Rini, D. Tuninetti, and N. Devroye	Optimal malware attack and defense in mobile wireless networks M.H.R. Khouzani, Upenn	Minimax robust quickest change detection Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli, and Sean Meyn, UIUC
10:25	Interactive distributed source coding for network function computation Nan Ma, Boston University	Ordered statistics decoding for intersymbol interference channels Fabian Lim and Aleksandar Kavcic, University of Hawaii Marc Fossorier, ETIS	Service guarantees in communication networks Parimal Parag and Jean-Francois Chamberland, TAMU	On the improved path metric for soft-input soft-output tree detection Jun Won Choi, Byonghyo Shim, and Andrew C. Singer
10:50	Break

	Secrecy and Privacy	Sparsity and Completion	Information Theory and Networks	Interference Meets Source Coding
	Chair: Anand Sarwate, UCSD	Chair: Maxim Raginsky, Duke	Chair: Salman Avestimehr, Cornell	Chair: Olivier Leveque, EPFL
11:10	Perfect omniscience, perfect secrecy and Steiner tree packing Sirin Nitinawarat and Prakash Narayan, Department of Electrical and Computer Engineering and Institute for Systems Research University of Maryland, College Park	Compressed sensing and LDPC Codes: A scaling law for very sparse vectors Fan Zhang and Henry D. Pfister	Large wireless networks, fundamental limits and design issues Paolo Minero	Approximation results in lossy data compression and interference networks Soheil Mohajer, EPFL
11:35	Inference, learning, and optimization under privacy constraints Anand D. Sarwate, UCSD	Matrix completion: fundamental limits and efficient algorithms Sewoong Oh, Raghunandan H. Keshavan, and Andrea Montanari, Stanford	An information theoretic approach to adversaries in networks Oliver Kosut, Lang Tong, and David Tse	Interference nulling in distributed lossy source coding Mohammad Ali Maddah-Ali, David Tse, University of California -- Berkeley
12:00	Lunch

1:15	Keynote Presentation Cascading Behavior in Complex Networks Jon Kleinberg , Cornell University

2:20	Break

	Tutorial	Tutorial
	Chair: Jon Kleinberg, Cornell	Chair: Tara Javidi, UCSD
2:35	Random graphs and large networks Dmitris Achlioptas, UC Santa Cruz and RACTI	Scheduling in server farms: approaches and open problems Mor Harchol-Balter, CMU
4:00	Break

	Tutorial	Tutorial
	Chair: Young-Han Kim, UCSD	Chair: Massimo Franceschetti, UCSD
4:15	Multisource network coding Raymond Yeung, CUHK	Fundamentals of continuum percolation Mathew Penrose, University of Bath
5:40	Banquet (Transportation details TBA)

Thursday

8:00	Continental breakfast

	Pricing, Utililization, and Caching in Networks	Learning and Optimization	Applications of Information Theory and Statistical Mechanics to Complex Networks	Ad Hoc and Peer-Peer Networks
	Chair: Marc Lelarge, INRIA-ENS	Chair: Yoav Freund, UCSD	Chair: Zoltan Toroczkai, University of Notre Dame	Chair: Greg Pottie, UCLA
8:30	Psephology of impatience: Optimal caching for P2P mobile network Josh Reich, Columbia U., Stratis Ioannidis, Augustin Chaintreau, and Laurent Massouliï, Technicolor	Graph clustering via convex optimization Ali Jalali and Sujay Sanghavi	Entropy measures for networks: toward an information theory of complex topologies Ginestra Bianconi	Fighting censorship with algorithms Mohammad Mahdian
8:50	Approximately optimal utility maximization Angelia Nedic, UIUC and Vijay G. Subramanian, Hamilton Institute, NUIM.	Guaranteed rank minimization via singular value projection Raghu Meka, Prateek Jain, and Inderjit Dhillon, UT Austin	Entropy-pruning algorithm for the inverse Ising problem Simona Cocco, Remi Monasson	Asymptotic outage analysis of general motion-invariant ad hoc networks Riccardo Giacomelli, Radha Krishna Ganti, and Martin Haenggi
9:10	Random capture algorithms: fluid limits and stability Alexandre Proutiere, Microsoft Research, and Mathieu Feuillet, INRIA, and Philippe Robert, INRIA	A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers S. Negahban, P. Ravikumar, M. Wainwright and B. Yu.	Approximate counting of large subgraphs in random graphs with statistical mechanics methods Guilhem Semerjian	Barrage relay networks Thomas R. Halford and Keith M. Chugg, TrellisWare Technologies
9:30	Break

	Applied Probability in Networks	Probabilistic Models	Social and Human Interaction Networks, and Network Classification	Probability and Graphs
	Chair: Fan Chung-Graham, UCSD	Chair: Lawrence Saul, UCSD	Chair: Jake Hofman, Yahoo! Research	Chair: Ron Graham, UCSD
9:45	Are reflected random walks hard to simulate? Ken R. Duffy, Hamilton Institute, and Sean P. Meyn, UIUC	Two Self-supervised Learning Techniques for Speech Recognition Damianos Karakos, Haolang Zhou, Puyang Xu, Sanjeev Khudanpur, and Andreas Andreou, Johns Hopkins University	Dynamics of person-to-person interactions from distributed RFID sensor networks Ciro Cattuto, Wouter Van den Broeck, Alain Barrat, Vittoria Colizza, Jean-Francois Pinton, and Alessandro Vespignani	Probability models for connected spatial networks David Aldous, UC Berkeley
10:05	Probabilistic consensus via polling and majority rules James Cruise and Ayalvadi Ganesh, University of Bristol	Forest density estimation Anupam Gupta, John Lafferty, Han Liu, Larry Wasserman, Min Xu	Linking on-line social networks and real-world human proximity J. Stehle, L. Isella, H. Alani, A. Barrat, C. Cattuto, G. Correndo, M. Quaggiotto, M. Szomsor, and W. Van den Broeck	Patterns, probability and graphs Narayana Santhanam
10:25	Matchings on random diluted graphs: the cavity method at positive temperature Charles Bordenave, CNRS-Univ. Toulouse, and Marc Lelarge, INRIA-ENS, and Justin Salez, INRIA-ENS	Adaptive algorithms for inference and learning Umut Acar, TTI, Alexander Ihler, UC Irvine, Ramgopal Mettu, UMass Amherst, and Ozgur Sumer, U. Chicago	Visual analytics for discovering complex group structures in networks Takashi Nishikawa and Adilson E. Motter	Hitting times of a randomly moving Hanoi tower Toby Berger, University of Virginia
10:45	Break

	Channel Access and Scheduling	Learning Theory	Modular Structure of Complex Networks	Communication Systems
	Chair: Mingyan Liu, University of Michigan	Chair: Sanjoy Dasgupta, UCSD	Chair: Alain Barrat, CPT, CNRS, France	Chair: Alhussein Abouzeid, RPI
11:00	Round robin policies for dynamic multichannel access Changmian Wang, Bhaskar Krishnamachari, Qing Zhao, and Geir E. Øien	Learning Gaussian mixture distributions with no separation conditions Mikhail Belkin and Kaushik Sinha	Inferring the structure and scale of modular networks Jake M. Hofman, Yahoo! Research, and Chris H. Wiggins, Columbia	The sensitive side of communication: Queueing, coding and finite block-lengths Jean-Francois Chamberland, Srinivas Shakkottai, Henry Pfister, and Krishna Narayanan Texas A&M
11:20	On scheduling over multi-server wireless systems Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R. Srikant	Distributed computing with full information Valerie King, Steven Lonergan, and Jared Saia	The performance of modularity maximization in practical contexts Benjamin H. Good, Yves-Alexandre de Montjoye, and Aaron Clauset	On sum capacity of continuous-time overloaded CDMA systems Yeo Hun Yun and Joon Ho Cho, POSTECH
11:40	MAC protocols with memory Jaeok Park and Mihaela van der Schaar	Linear classifiers are nearly optimal when hidden variables have diverse effects Nader Bshouty and Phil Long	Statistical significance of communities in networks Jose J. Ramasco	Capacity limits of optical fiber networks R.-J. Essiambre, G.-J. Foschini, B. Goebel, G. Kramer, and P. J. Winzer
12:20	Lunch

1:00	Panel: What Is Network Science? Where Has It Been and Where Is It Going?

2:15	Break

	Cognitive Networks	Compressed Sensing	Biological Networks	Combinatorics
	Chair: Qing Zhao, UC Davis	Chair: Andrea Montanari, Stanford	Chair: Takashi Nishikawa, Clarkson University, Northwestern	Chair: David Aldous, UC Berkeley
2:30	Detecting weak and distributed network activations Aarti Singh, Carnegie Mellon University	Performance bounds of list colluder identification algorithms via compressive sensing Vin Pham Hoa, Wei Dai, and Olgica Milenkovic	Form, function, and information processing in stochastic regulatory networks Chris Wiggins	Non-adaptive combinatorial group testing Pak Hou Che, Kwok Siu Man, and Sidharth Jaggi, CUHK
2:50	Channel estimation for opportunistic spectrum access: uniform and random sensing Quanquan Liang and Mingyan Liu	Single-letter characterization of signal estimation from linear measurements Dongning Guo, Northwestern, Dror Baron, and Shlomo Shamai, Technion	Heterogeneity of connection strengths and a distance rule specify cortical networks Zoltan Toroczkai, Maria M. Ercsey-Ravasz, Notre Dame, N. T. Markov, M. A. Gariel, J. Vezoli, R. Quilodran, A. Falchier, C. Huissoud, S. Clavagnier, J. Sallet, P. Giroud, C. Lamy, P. Barone, C. Dehay,K. Knoblauch and H. Kennedy, INSERM, Lyon	Coefficient properties of irreducible polynomials Thomas J. Dorsey and Alfred W. Hales, IDA/CCR
3:10	Distributed secondary spectrum access based on primary user feedback Fabio E. Lapiccirella, Zhi Ding and Xin Liu, UC Davis	Compressive sensing in filtered sparse processes Venkatesh Saligrama, Manqi Zhao	Towards the inference of a protein-protein interaction code in bacterial signaling Martin Weigt	Facebrowsing: Search and Navigation through Comparisons Dominique Tschopp and Suhas Diggavi, EPFL
3:30	Break

	Cross-Layer Network Design	Machine Learning	Learning Algorithms for Networks	Universal Algorithms
	Chair: R. Srikant, UIUC	Chair: Gary Cottrell, UCSD	Chair: Ashutosh Sabharwal, Rice University	Chair: Dror Baron, Technion, Israel
3:45	Layered sequential decision policies for cross-layer design of multihop wireless networks Zhenzhen Ye and Alhussein A. Abouzeid, RPI	Feature learning with distributed representations Kevin Swersky, Bo Chen, Ben Marlin and Nando de Freitas, UBC	Learning on large informatics graphs Michael W. Mahoney	Sequential classification in noisy environments with applications to detecting REM stage sleep in mice Abraham Wyner, Blake McShane
4:05	On cross-layer optimization for wireless networks Ziyu Shao, Minghua Chen, Salman Avestimehr, and Shuo-Yen Robert Li, Cornell	Learning and compression with weakly chaotic systems M. Welling and Y. Chen, UCI	Predictive blacklisting as a recommendation system Fabio Soldo, Anh Le, Athina Markopoulou	On the optimality of universal classifiers for finite-length individual test sequences Jacob Ziv,Technion
4:25	File fragmentation over an unreliable channel Jayakrishnan Nair, Caltech, Martin Andreasson, KTH, Sweden, Lachlan L. H. Andrew, Swinburne University, Australia, Steven H. Low and John C. Doyle, Caltech	MAP estimation via message passing on perfect graphs Tony Jebara, Columbia	On the value of coordination and delayed queue information in multicellular scheduling Aditya Gopalan, Constantine Caramanis, and Sanjay Shakkottai, UT Austin	MDL hierarchical clustering with incomplete data Po-Hsiang Lai and Joseph A. O'Sullivan
4:45	Break

	Distributed Computation and Decision	Algorithms and Complexity	Information Dynamics and Networks	Sparsity and Completion
	Chair: Steven Low, Caltech	Chair: Venkatesh Saligrama, Boston University	Chair: Martin Haenggi, Notre Dame	Chair: Olgica Milenkovic, UIUC
5:00	Synchronization of coupled oscillators Enrique Mallada and Kevin Tang, Cornell University	Revisiting bipartite graph matching Kamal Jain, Microsoft	Generalized information, entropy and state concepts for distributed dynamic networked systems John S. Baras, University of Maryland	Message passing algorithms for compressed sensing David L. Donoho, Arian Maleki, Andrea Montanari
5:20	Local view in networks: How good are distributed decisions? Vaneet Aggarwal, Princeton, Salman Avestimehr, Cornell, and Ashutosh Sabharwal, Rice	On the conductance of random inner product graphs Milena Mihail, Georgia Tech, and Stephen Young, UCSD	Connectivity, Mobility, and Information Dissemination Zhenning Kong and Edmund M. Yeh	Fear in mediation, exploiting the windfall of malice Josep Diaz, Dieter Mitsche, Navin Rustagi, Jared Saia
5:40	Mixing time of Glauber dynamics with parallel updates Mathieu Leconte, Jian Ni and R. Srikant, University of Illinois	Dynamic Malware Attack in Energy-Constrained Mobile Wireless Networks M. H. R Khouzani, Saswati Sarkar	Revenue maximization under social learning Nicole Immorlica, Sham Kakade, and Ilan Lobel	Tracking particles by passing messages between images Michael Chertkov, Lukas Kroc, Florent Krzakala, Massimo Vergassola, and Lenka Zdeborova
6:00	Some well-deserved rest

Friday

8:00	Continental breakfast

	Rate Allocation and Congestion Control	Sparsity in Learning	Control in Harsh Realities	Topics in Source Coding
	Chair: Sanjay Shakkottai, UT Austin	Chair: Kenneth Kreutz-Delgado, UCSD	Chair: Nuno Martins, University of Maryland	Chair: Pamela Cosman, UCSD
8:30	Bridging networking and information theory: rate allocation in wireless networks Jubin Jose, UT Austin & Lei Ying, Iowa State & Sriram Vishwanath, UT Austin	Sparse signal recovery with exponential-family noise Irina Rish, IBM, and Genady Grabarnik, CUNY	Sequential decision aggregation: Accuracy and decision time for decentralized SPRT algorithms Sandra H. Dandach, Ruggero Carli, and Francesco Bullo, UCSB	On generalizing common information with applications to secure multi-party computation Vinod Prabhakaran and Manoj Prabhakaran, UIUC
8:50	Optimization of metabolic network flows Desmond S. Lun	The Lasso under heteroscedasticity Jinzhu Jia, Karl Rohe and Bin Yu, UC Berkeley	On effect of stochastic delay on control and estimation Vijay Gupta, Notre Dame	Independent source coding for control over noiseless channels E. I. Silva, Universidad Tecnica Federico Santa Maria, M. S. Derpich, Universidad Tecnica Federico Santa Maria, Jan Ostergaard, Aalborg University
9:10	Rate allocation under imperfect channel estimation Wenzhuo Ouyang, Atilla Eryilmaz, and Ness Shroff	Finding structure with randomness: stochastic algorithms for constructing approximate matrix decompositions N. Halko, P.-G. Martinsson, J. A. Tropp	Secure control against replay attacks Yilin Mo and Bruno Sinopoli, Carnegie Mellon.	New rate distortion bounds for speech coding based on composite source models Jerry Gibson, UCSB
9:30	Break

	Network Economics: Competition and Contracts	Sampling and Compressed Sensing	Decentralized Control	Computing
	Chair: John Baras, University of Maryland	Chair: Bhaskar Rao, UCSD	Chair: Serdar Yuksel, Queen's University	Chair: Prakash Ishwar, Boston University
9:45	On complementaries in spectrum markets Hang Zhou, Randall A. Berry, Michael L. Honig, and Rakesh Vohra, Northwestern University	Quantization alternatives for compressive sampling C. Sinan Gunturk, Courant Institute NYU, Alexander Powell, Vanderbilt U., Rayan Saab and Ozgur Yilmaz, UBC	Stochastic teams, games, and non-classical information Tamer Başar, UIUC	Fading as implicit computation Bobak Nazer, UW - Madison, Jiening Zhan, and Michael Gastpar, UC - Berkeley
10:05	The concert queueing game: To wait or to be Late Rahul Jain, Sandeep Juneja and Nahum Shimkin	Sampling, interpolation, and MMSE estimation of continuous-time signals using factor graphs Lukas Bolliger, Hans-Andrea Loeliger, and Christian Vogel	On the stabilization of sparsity constrained, LTI systems Serban Sabau and Nuno C. Martins	Distributed Lossy computing Abbas El Gamal, Han-I Su, Stanford University
10:25	Network platform competition in a two-sided market: implications to the net neutrality issue John Musacchio, U.C. Santa Cruz, and Dohoon Kim, Kyung Hee University	Compressed sensing-based pooling experiments using next generation sequencing Noam Shental, The Open University of Israel, Amnon Amir, The Weizmann Institute of Science, and Or Zuk, Broad Institute of MIT and Harvard.	Scaling limits for continuous opinion dynamics systems with an external influential field Giacomo Como, MIT	Communicating the sum of sources in a 3-sources/3-terminals network Aditya Ramamoorthy and Michael Langberg
10:45	Break

	Resource Allocation in Wireless Networks	Stochastic Optimization and Approximation	Channel Coding with Feedback as an MDP	Matrix Completion and Streaming
	Chair: Don Towsley, UMass Amherst	Chair: Ramesh Johari, Stanford	Chair: Tamer Basar, UIUC	Chair: Joel Tropp, Caltech
11:00	End-to-end delay-performance in multi-hop wireless networks V.J. Venkataramanan, Xiaojun Lin, Lei Ying and Sanjay Shakkottai	Stochastic network optimization with non-convex utilities and costs Michael J. Neely, University of Southern California	The role of reversible Markov chains in feedback information theory and decentralized control S. K. Gorantla and T. P. Coleman, UIUC	Numerical linear algebra in the streaming model Ken Clarkson, David Woodruff, IBM Almaden
11:20	Wireless network trunking and load adaptation Christopher Lott, Rashid Attar, Donna Ghosh, Radhika Gowaikar, Kambiz Azarian, Qualcomm	Distributed stochastic optimization and its application to estimation in sensor networks S. Sundhar Ram, Venu Veeravalli, and Angelia Nedich, University of Illinois at Urbana-Champaign	The capacity of Markov channels with noiseless output and state feedback Jung Hyun Bae and Achilleas Anastasopoulos, University of Michigan	Robust principal component analysis? Emmanuel Candes, Xiadong Li, Stanford, Yi Ma, and John Wright, MSRA
11:40	Optimization of power and channel allocation using the deterministic channel model Yue Zhao and Gregory J Pottie, UCLA	Asynchronous stochastic optimization over networks: error bounds Behrouz Touri, Angelia Nedich, and Sundhar Ram Srinivasan, UIUC	Structure of optimal block Markov superposition coding for multiple access channel with feedback Aditya Mahajan	Consistent matrix completion and optimization on manifolds Wei Dai, UIUC
12:00	Lunch

	Uncertainty in Games, Connectivity, Channel, and Outcomes	Machine Learning and Biology	Communication and Control	Combinatorial Topics in Coding and Information Theory
	Chair: Randall Berry, Northwestern	Chair: Eleazar Eskin, UCLA	Chair: Aditya Mahajan, Yale
1:00	Network connectivity with a family of group mobility models – one-dimensional cases Eunyoung Seo and Richard J. La, University of Maryland	Decentralized multi-armed bandit with multiple distributed players Keqin Liu and Qing Zhao, UC Davis	Optimization and convergence of information channels in stochastic control problems Serdar Yuksel, Queen's University	On absorbing sets of structured sparse graph codes Lara Dolecek, UCLA
1:20	Asymptotic analysis of large-scale supermodular stochastic games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub, and Andrea Goldsmith	The offset tree for learning with bandit feedback Alina Beygelzimer and John Langford	Information-based complexity in optimization and control: a new look via feedback information theory Maxim Raginsky, Duke	Menger's paths with minimum mergings: A generalization of Menger's theorem Guangyue Han, University of Hong Kong
1:40		High resolution models of transcription factor-DNA affinities improve in vitro and in vivo binding predictions Christina Leslie, Memorial Sloan-Kettering Cancer Center	An optimization perspective on spectrum zoning Anant Sahai, Hari Palaiyanur, Kristen Ann Woyach, and Rahul Tandra	Recursive structure of Hanoi tower with more than three poles Kingo Kobayashi, NICT
2:00	On the MIMO interference channel Francesco Negro, Shakti Shenoy, Irfan Ghauri, Infineon, and Dirk Slock, EURECOM	Leveraging joint test status distribution for an optimal significance testing Buhm Han, Chun Ye, Ted Choi, and Eleazar Eskin	How much training is needed for opportunistic relay selection? Ramesh Annavajjala, Mitsubishi Electric	Inference of stratified structure via Laplacian Eigenmaps embedding Paul Bendich, Bei Wang, Herbert Edelsbrenner, John Harer, Sayan Mukherjee
2:20	Break

	Stochastic Scheduling and Optimization	Search, Secrecy, and Security	Consensus, Voting, and Censorship	Topics in Communication and CS Theory
	Chair: Srinivas Shakkottai, Texas A&M	Chair: Anant Sahai, UC Berkeley	Chair: Francesco Bullo, UCSB	Chair: Larry Milstein, UCSD
2:40	Performance Bounds of Distributed CSMA Scheduling Libin Jiang, Jian Ni, R. Srikant, and Jean Walrand	What can search predict? Sharad Goel, Jake M. Hofman, Sebastien Lahaie, David M. Pennock, and Duncan J. Watts	From quantized average consensus to voting Florence Benezit, Patrick Thiran and Martin Vetterli, EPFL.	On the equivalence of sum-rate maximization and max-min fair design for distributed beamforming in two-way relay networks Shahram Shahbazpanahi and Min Dong
3:00	Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics Shihuan Liu, Lei Ying and R. Srikant	Information-theoretic methods in cryptographic protocol design Amit Sahai	Voting models in random networks Mehmet Ercan Yildiz, Cornell University, Roberto Pagliari, Cornell University, Asuman Ozdaglar, MIT and Anna Scaglione, UC Davis	Modeling the millimeter wave MIMO channel Eric Torkildson, Hong Zhang, and Upamanyu Madhow, University of California, Santa Barbara
3:20	Ergodic stochastic optimization algorithms for wireless communication and networking Alejandro Ribeiro, UPenn	A low-cost side channel traffic analysis attack in packet networks Sachin Kadloor, Xun Gong, and Negar Kiyavash	Faster distributed averaging with memory B. Oreshkin, M. Coates, and M. Rabbat, McGill	Update on IMT-Advanced air interface evolution Byung K. Yi
3:40	Coordinated joint transmission in wide area networks Alan Barbieri, Stefan Geirhofer, Sid Mallik, and Alex Gorokhov	Multi-user diversity for secrecy in wireless networks S. Vasudevan, S. Adams, D. Goeckel, Z. Ding, D. Towsley, K. Leung	Learning from logged data Sham Kakade, John Langford, Alex Strehl	Better gap-hamming lower bounds via better round elimination Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, and Ronald de Wolf
4:00	Recuperate