Reading Group Seminar: Summer 2008
|
Tentative Schedule:
meet on Thursdays 1:30pm-4:00pm ITE 201A but
some talks may be at a different place and time.
|
Date |
Discussion
Leader |
Paper |
|
Jun
12th |
Yoo-Ah Kim |
Redundant Trees for Preplanned Recovery in Arbitrary
Vertex-Redundant or Edge-Redundant Graphs |
|
Jun
19th |
Chadi Kari |
|
|
Jun
26th |
Matthew
Coolbeth |
On Maintaining Sensor-Actor Connectivity in Wireless
Sensor and Actor Networks |
|
July
3rd |
Hieu Dinh |
|
|
July
10th |
Hieu Dinh |
continued |
|
July
16th |
Jiho Ryu |
Efficient Broadcast in MANETs Using Network Coding and Directional
Antennas |
|
July
24th |
Sixia Chen |
|
|
|
|
|
|
|
|
|
For additional information send email to Yoo-Ah Kim.
Graph
Connectivity, Reliable Broadcast
1.
Redundant Trees for Preplanned Recovery in Arbitrary
Vertex-Redundant or Edge-Redundant Graphs, Muriel M¢¥edard, Member, IEEE, Steven G. Finn, Member, IEEE,
Richard A. Barry, and Robert G. Gallager.
2.
J. Wu, S. Yang, and M. Cardei, "On Maintaining Sensor-Actor Connectivity in Wireless
Sensor and Actor Networks,"
IEEE INFOCOM, 2008.
3.
J. Wu, S. Yang, and M. Cardei, "Efficient
Broadcast in MANETs Using Network Coding and Directional Antennas," IEEE INFOCOM, 2008.
4.
Yiwei
Wu and Yingshu Li, Construction Algorithms for k-Connected
m-Dominating Sets in Wireless Sensor Networks, 9th
ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2008), Hong Kong, China, May 26-30, 2008. [PDF]
5.
Christian Scheideler,
Andrea W. Richa, and Paolo Santi.
An O(log n) Dominating Set
Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.
To appear in Proceedings of the 9th ACM Symposium on Mobile Ad Hoc Networking
and Computing (MobiHoc), 2008
6. Harold N. Gabow, Suzanne Gallagher: Iterated rounding algorithms for the
smallest k-edge connected spanning subgraph,
SODA 2008
7.
Bhavani
Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan:
Unconditionally reliable message transmission in directed networks. 1048-1055
SODA 2008 Electronic Edition
8.
Cedric Florens,
Robert McEliece, Packets Distribution Algorithms for Sensor Networks ,
Infocom 2003
9.
Peter Sanders, Roberto Solis-Oba How Helpers Hasten h-Relations , ESA 2000
Additional
Papers
1.
Guy E. Blelloch,
Rezaul A. Chowdhury,
Phillip B. Gibbons, Vijaya Ramachandran,
Shimin Chen, Michael Kozuch.
"Provably Good Multicore Cache Performance
for Divide-and-Conquer Algorithms"(pdf).
In proceedings of the 2008 ACM-SIAM Symposium on Discrete Algorithms (SODA'08).
2.
Shimin
Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, Chris
Wilkerson. "Scheduling Threads for Constructive Cache Sharing on CMPs" (ps, pdf).
In proceedings of the 19th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA'07).
3.
Anycast CDNs Revisited, Hussein A. Alzoubi,
Seungjoon Lee, Michael Rabinovich,
Oliver Spatscheck, Jacobus
Van der Merwe, WWW
2008 [pdf]
4. Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi:
Robust cost colorings. 1204-1212 Electronic Edition
SODA 2008
Mario Mense, Christian Scheideler:
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems. 1135-1144 Electronic Edition
SODA 2008
Archives from previous semesters