ผู้ใช้:Jittat

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา

My bookmarks

Dynamic Programming Languages Bookmark

Teen and Tech bookmark

Media & Interactive

News

Blogs

Twitter

Reading groups

  • Randomized Algorithms. Focus on classic results. Might follow parts of [1]. Topics include: Byzantine Agreement, Online Paging, Zero-Knowledge Proofs, Electronic Voting, Digital Cash. 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)


Other possible topics:

  • Algorithmic Game Theory:
    • Probably following [2]
  • Distributed Computing: selection from [3]