ผลต่างระหว่างรุ่นของ "ผู้ใช้:Jittat"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 31: แถว 31:
  
 
== Reading groups ==
 
== Reading groups ==
Possible topics:
+
* '''Randomized Algorithms.'''  Focus on classic results.  Might follow parts of [http://www.cs.berkeley.edu/~jfc/cs174/lecs/index.html].  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:
 
* Algorithmic Game Theory:
 
** Probably following [http://www.cs.cornell.edu/courses/cs684/2004sp/]
 
** Probably following [http://www.cs.cornell.edu/courses/cs684/2004sp/]
* Randomized Algorithms: try to focus more on papers with applications
 
** Might follow second part of [http://www.cs.berkeley.edu/~jfc/cs174/lecs/index.html]
 
** Topics include: Byzantine Agreement, Online Paging, Zero-Knowledge Proofs, Electronic Voting, Digital Cash
 
 
* Distributed Computing: selection from [http://www.nada.kth.se/kurser/kth/2D5340/]
 
* Distributed Computing: selection from [http://www.nada.kth.se/kurser/kth/2D5340/]

รุ่นแก้ไขเมื่อ 11:01, 15 พฤศจิกายน 2550

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]