Prof. Carlos Martinhon -  IC/UFF

Links Interessantes: Algoritmos Randômicos
   
     1) Alguns Pesquisadores:
  1. David Karger (Stanford University);
  2. Rajeev Motwani (Stanford University);
  3. Prabhakar Raghavan (Stanford University);
  4. Aravind Srinivasan  (University of Maryland);
  5. Richard Karp (Berkeley University);
  6. Viggo Kann (Royal Institute of Technology - Sweden);
  7. Michael Goemans (MIT Computer Science);
  8. David Willianson (IBM);
  9. Marek Karpinski (University of Bonn);
  10. Anupam Gupta (Carnegie Mellon University);
  11. Alan Frieze (Carnegie Mellon University).
  12. Dimitris Bertsimas (MIT)
  13. Alessandro Panconesi (La Sapienza - Itália)
  14. Eli Upfal (Brown University)
  15. Michael Mitzenmacher (Havard University)
  16. Joel Spencer (New York University)
      2)  Alguns Artigos
    1. Approximation Algorithms  via Randomized Rouding: a survey, PDF;
    2. Semidefinite Programming and Combinatorial Optimization, PDF;
    3. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, PDF;
    4. Proof Verification and the Hardness of Approximation Problems, PDF;
      3) Outros links interessantes
    1. Geração de Números Aleatórios;
    2. Probabilidade