ผลต่างระหว่างรุ่นของ "Research reading list"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
 
(ไม่แสดง 11 รุ่นระหว่างกลางโดยผู้ใช้ 3 คน)
แถว 1: แถว 1:
 +
รายชื่อบทความวิจัยสำหรับสมาชิกแต่ละคน (เรียงตามตัวอักษร)
 +
 +
==จอร์ด==
 +
* [http://www.acm.org/sigs/sigkdd/kdd2006/program.html 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. ([http://www.springerlink.com/content/pvqv26dm8x40885h/ link])
 +
* Gavoille and Paul. ''Distance labeling scheme and split decomposition'' ([http://dept-info.labri.fr/~gavoille/article/GP03b link])
  
 
==ณัฐ==
 
==ณัฐ==
 
'''papers:'''
 
'''papers:'''
−
* John R. Douceur. 'The Sybil Attack.' ([http://www.cs.rice.edu/Conferences/IPTPS02/101.pdf link])
+
* John R. Douceur. ''The Sybil Attack.'' ([http://www.cs.rice.edu/Conferences/IPTPS02/101.pdf 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. ([http://sparrow.ece.cmu.edu/group/pub/newsome_shi_song_perrig_sybil.pdf link])
+
 
 +
* Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman. ''SybilGuard: defending against sybil attacks via social networks''. SIGCOMM'06 ([http://portal.acm.org/citation.cfm?id=1151659.1159945 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. ([http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=34117&arnumber=1625383&count=143&index=102 link])
 +
 
 +
* Alice Cheng and Eric Friedman. ''Sybilproof reputation mechanisms''. SIGCOMM 2005 workshop on Economics of peer-to-peer systems. ([http://portal.acm.org/citation.cfm?id=1080202 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. ([http://sparrow.ece.cmu.edu/group/pub/newsome_shi_song_perrig_sybil.pdf link])
 +
 
 +
==ทอป==
 +
'''Conferences:''' [http://www.informatik.uni-trier.de/~ley/db/conf/recomb/index.html RECOMB], [http://www.informatik.uni-trier.de/~ley/db/conf/wabi/index.html WABI],[http://www.informatik.uni-trier.de/~ley/db/conf/cpm/index.html CPM]
 +
 
 +
Papers
 +
* Ozery-Flato and Shamir, ''An O(n^3/2\sqrt{log(n)}) Algorithm for Sorting by Reciprocal Translocations''. CPM'06. ([http://www.springerlink.com/content/u045886216pl2336/ link])
 +
 
 +
* Eric Tannier and Marie-France Sagot, ''Sorting by Reversals in Subquadratic Time.'' CPM'06. ([http://springerlink.metapress.com/content/37u8ckke7jkj7ha5/?p=30b488e6c3954bae92d9db4a2e5d24ba&pi=0 link])
 +
 
 +
==บัณฑิต==
 +
: ''ดูที่ [[ผู้ใช้:Bundit]]''
  
 
==เป้==
 
==เป้==
แถว 13: แถว 36:
 
* theory: [http://www.informatik.uni-trier.de/~ley/db/conf/colt/index.html COLT], [http://www.informatik.uni-trier.de/~ley/db/conf/alt/index.html ALT]
 
* theory: [http://www.informatik.uni-trier.de/~ley/db/conf/colt/index.html COLT], [http://www.informatik.uni-trier.de/~ley/db/conf/alt/index.html ALT]
  
−
==ทอป==
+
'''Resources:'''
−
'''Conferences:''' [http://www.informatik.uni-trier.de/~ley/db/conf/recomb/index.html RECOMB], [http://www.informatik.uni-trier.de/~ley/db/conf/wabi/index.html WABI],[http://www.informatik.uni-trier.de/~ley/db/conf/cpm/index.html CPM]
+
* [http://hunch.net/~jl/projects/reductions/reductions.html 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. ([http://ttic.uchicago.edu/~harry/ps/optimal_oblivious.ps link])
 +
 
 +
* David Applegate and Edith Cohen ''Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs''. SIGCOMM 2003. ([http://www.research.att.com/~edith/Papers/sigcomm03.ps link])
  
−
Papers
+
* Harald Räcke. ''Minimizing Congestion in General Networks.'' FOCS'02 ([http://ttic.uchicago.edu/~harry/pdf/min_congestion.pdf link])
−
* Ozery-Flato and Shamir, 'An O(n^3/2\sqrt{log(n)}) Algorithm for Sorting by Reciprocal Translocations'. CPM'06. ([http://www.springerlink.com/content/u045886216pl2336/ link])
 
  
−
* Eric Tannier and Marie-France Sagot, 'Sorting by Reversals in Subquadratic Time' CPM'06. ([http://springerlink.metapress.com/content/37u8ckke7jkj7ha5/?p=30b488e6c3954bae92d9db4a2e5d24ba&pi=0 link])
+
* Need to look at:
 +
** [http://cnet.fi.uba.ar/ignacio.alvarez-hamelin/msda5RR.ps.gz 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.

รุ่นแก้ไขปัจจุบันเมื่อ 07:31, 5 มกราคม 2554

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

จอร์ด

จุ่ง

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:

Resources:

โย

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)

อ๋อย

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.
ดึงข้อมูลจาก "http://158.108.32.49/wiki/index.php?title=Research_reading_list&oldid=10542"