Research reading list

รายชื่อบทความวิจัยสำหรับสมาชิกแต่ละคน (เรียงตามตัวอักษร)

จอร์ด

• KDD'06 web/graph mining track

จุ่ง

Distance labelings

• Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg. Approximate Distance Labeling Schemes. ESA'01. (link)
• Gavoille and Paul. Distance labeling scheme and split decomposition (link)

ณัฐ

papers:

• John R. Douceur. The Sybil Attack. (link)

• Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman. SybilGuard: defending against sybil attacks via social networks. SIGCOMM'06 (link)

• Dinger, J. Hartenstein, H. Defending the Sybil attack in P2P networks: taxonomy, challenges, and a proposal for self-registration. Availability, Reliability and Security, 2006. (link)

• Alice Cheng and Eric Friedman. Sybilproof reputation mechanisms. SIGCOMM 2005 workshop on Economics of peer-to-peer systems. (link)

• Newsome, James, Elaine Shi, Dawn Song, and Adrian Perrig. The Sybil Attack in Sensor Networks: Analysis and Defenses. In the Third International Symposium on Information Processing in Sensor Networks (IPSN), April, 2004. (link)

ทอป

Conferences: RECOMB, WABI,CPM

Papers

• Ozery-Flato and Shamir, An O(n^3/2\sqrt{log(n)}) Algorithm for Sorting by Reciprocal Translocations. CPM'06. (link)

• Eric Tannier and Marie-France Sagot, Sorting by Reversals in Subquadratic Time. CPM'06. (link)

บัณฑิต

ดูที่ ผู้ใช้:Bundit

เป้

Conferences:

• practice:
• theory: COLT, ALT

Resources:

• Learning Reductions by John Langford

โย

Papers:

• Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Räcke. Optimal Oblivious Routing in Polynomial Time. STOC'03. (link)

• David Applegate and Edith Cohen Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs. SIGCOMM 2003. (link)

• Harald Räcke. Minimizing Congestion in General Networks. FOCS'02 (link)

• Need to look at:
  • A Distributed Algorithm for Multicast Scheduling

อ๋อย

Papers:

• G. Even, N. Garg, j. Konemann, R. Ravi, and A. Sinha. Covering Graphs using Trees and Stars.APPROX'03.
• David B. Shmoys, Eva Tardos, and Karen Aardal. Approximation algorithms for facility location problems. STOC'97.