'Annual acm symposium' diaporamas de présentation

Near Space-Optimal Perfect Hashing Algorithms

Near Space-Optimal Perfect Hashing Algorithms. Nivio Ziviani Fabiano C. Botelho Department of Computer Science Federal University of Minas Gerais, Brazil. 23rd Annual ACM Symposium on Applied Computing Fortaleza, Brazil, March 19, 2008. Objective of the Presentation.

909 views • 80 slides

Quantum random walks of interacting particles and the graph isomorphism problem

Quantum random walks of interacting particles and the graph isomorphism problem. Susan N. Coppersmith University of Wisconsin, Madison collaborators: Shiue-Yuan Shiau, Robert Joynt, John Gamble S.-Y. Shiau et al., Quantum Information and Computation 5, 492-506 (2005) Funding: NSF, ARO/NSA.

576 views • 21 slides

Computer Science Day 2008

312 views • 20 slides

Cloud Computing Security

434 views • 11 slides

Functional Data S tructures

Functional Data S tructures. [C. Okasaki , Simple and efficient purely functional queues and deques , J. of Functional Programming, 5(4), 583-592, 1995] [H. Kaplan, R. Tarjan , Purely functional, real-time deques with catenation , Journal of the ACM, 46(5), 577-603, 1999].

176 views • 8 slides