Netcod 2006 Schedule of Paper Presentations
April 7, 2006

  SESSION 1
9:00

Can Network Coding Help in P2P Networks?
Dah Ming Chiu, Raymond W Yeung, Jiaqing Huang and Bin Fan – invited paper

9:30

Distributed Algorithms for Minimum Cost Multicast with Network Coding in Wireless NetworksY. Xi and E. Yeh

9:55

Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut ApproachY. Wu, M. Chiang, S. Kung

  SESSION 2
Break  
10:50

Information Flows, Graphs and their Guessing Numbers
S. Riis

11:15

On the Benefits of Network Coding for Wireless Applications
C. Fragouli J.G. Widmer J. Le Boudec

11:40

The Vamos Network
R. Dougherty, C.Freiling, and K. Zeger

lunch break  
  SESSION 3
2:15

On Minimizing Network Coding Resources: An Evolutionary Approach
M. Kim, C. Wook Ahn, M. Medard and M. Effros

2:40

Network Information Flow in Navigable Small-World Networks
R. Costa, J. Barros

3:05

Min-cost Selfish Multicast with Network Coding
Sandeep Bhadra, Sanjay Shakkottai, Piyush Gupta

break  
  SESSION 4
4:00

In the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks
X. Zhang, G. Neglia , J. Kurose, D. Towsley

4:25

An Analysis of Finite-Memory Random Linear Coding on Packet Streams
Lun, Pakzad, Fragouli, Medard, Koetter

4:50

Secure Network Coding with a Cost Criterion
Jianlong Tan, Muriel Medard