ผลต่างระหว่างรุ่นของ "ผู้ใช้:Jittat"
ไปยังการนำทาง
ไปยังการค้นหา
Twitter
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 34: | แถว 34: | ||
** '''Routing.''' Valiant. A scheme for fast parallel communication. ''SIAM Journal on Computing,'' 11:350-361, 1982. (Should be available at AIT Library) | ** '''Routing.''' Valiant. A scheme for fast parallel communication. ''SIAM Journal on Computing,'' 11:350-361, 1982. (Should be available at AIT Library) | ||
** '''Paging.''' Fiat, Karp, Luby, McGeoch, Sleator, and Young. Competitive paging algorithms. ''Journal of Algorithms,'' 12:685-699, 1991. | ** '''Paging.''' Fiat, Karp, Luby, McGeoch, Sleator, and Young. Competitive paging algorithms. ''Journal of Algorithms,'' 12:685-699, 1991. | ||
| − | ** '''Byzantine | + | ** '''Byzantine agreement.''' Rabin. Randomized Byzantine generals. In ''Proceedings of the 24th Annual Symposium on Foundations of Computer Science,'' page 403-409, 1983. (Also, see Chor and Dwork. Randomization in Byzantine agreement. In ''Randomness and Computing'' pages 433-497. JAI Press, 1989) |
** '''Isolating Lemma.''' Mulmuley, Vazirani, and Vazirani. Matching is as Easy as Matrix Inversion. in ''Proceedings of Symposium on the Theory of Computing,'' 1987. ''Combinatorica,'' Vol. 7, No. 1, 1987. [http://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf] | ** '''Isolating Lemma.''' Mulmuley, Vazirani, and Vazirani. Matching is as Easy as Matrix Inversion. in ''Proceedings of Symposium on the Theory of Computing,'' 1987. ''Combinatorica,'' Vol. 7, No. 1, 1987. [http://www.cs.berkeley.edu/~vazirani/pubs/matching.pdf] | ||
** '''Lovasz Local Lemma.''' | ** '''Lovasz Local Lemma.''' | ||
รุ่นแก้ไขเมื่อ 11:14, 15 พฤศจิกายน 2550
เนื้อหา
My bookmarks
- 204512
- Software Testing Course
- ตารางอบรมกลางคืน ค่ายโอลิมปิครอบ 2
- New platform สำหรับ สอวน./โอลิมปิครอบแรก
Dynamic Programming Languages Bookmark
- Dynamic Programming Language (wikipedia), DLR
- Dynamic Language Group at MIT
- IEEE Computer article
- course on dynamic prog lang
Teen and Tech bookmark
- CBS GenTech June 2006
- Teen technology: it's really very simple TimesOnline uk Nov 2005
Media & Interactive
News
Blogs
Reading groups
- Randomized Algorithms. Focus on classic results. Some of the papers and references below are from Motwani and Raghavan.
- Routing. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982. (Should be available at AIT Library)
- Paging. Fiat, Karp, Luby, McGeoch, Sleator, and Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
- Byzantine agreement. Rabin. Randomized Byzantine generals. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, page 403-409, 1983. (Also, see Chor and Dwork. Randomization in Byzantine agreement. In Randomness and Computing pages 433-497. JAI Press, 1989)
- Isolating Lemma. Mulmuley, Vazirani, and Vazirani. Matching is as Easy as Matrix Inversion. in Proceedings of Symposium on the Theory of Computing, 1987. Combinatorica, Vol. 7, No. 1, 1987. [1]
- Lovasz Local Lemma.
- Primality testing.
Other possible topics:
