Algoritmos e complexidade Notas de aula - Arquivo Escolar

Bibliografia
[28] Martin Fürer e Balaji Raghavachari. “Approximating the minimudegree
steiner tree to within one of optimal”. Em: Journal of Algorithms
(1994).
[29] H. N. Gabow. “Data structures for weighted matching and nearest common
ancestors with linking”. Em: Proc. of the 1st Annual ACM-SIAM
Symposium on Discrete Algorithms (1990), pp. 434–443.
[30] Ashish Goel, Michael Kapralov e Sanjeev Khanna. “Perfect Matchings in
O(n log n) Time in Regular Bipartite Graphs”. Em: STOC 2010. 2010.
[31] A. V. Goldberg e A. V. Karzanov. “Maximum skew-symmetric flows and
matchings”. Em: Mathematical Programming A 100 (2004), pp. 537–568.
[32] Ronald Lewis Graham, Donald Ervin Knuth e Oren Patashnik. Concrete
Mathematics: a foundation for computer science. Addison-Wesley, 1988.
[33] Yuri Gurevich e Saharon Shelah. “Expected computation time for Hamiltonian
Path Problem”. Em: SIAM J. on Computing 16.3 (1987),
pp. 486–502.
[34] Ken Habgood e Itamar Arel. “Revisiting Cramer’s rule for solving dense
linear systems”. Em: Proceedings of the 2010 Spring Simulation Multiconference.
2010. doi: 10.1145/1878537.1878623.
[35] Juris Hartmanis e Richard E. Stearns. “On the Computational Complexity
of Algorithms”. Em: Transactions of the American Mathematical
Society 117 (1965), pp. 285–306.
[36] Dan S. Hirschberg. “A linear space algorithm for computing maximal
common subsequences”. Em: Comm. of the ACM 18.6 (1975), pp. 341–
343.
[37] C. A. R. Hoare. “Quicksort”. Em: Computer Journal 5 (1962), pp. 10–
15.
[38] J. E. Hopcroft e R. Karp. “An n 5/2 algorithm for maximum matching
in bipartite graphs”. Em: SIAM J. Comput. 2 (1973), pp. 225–231.
[39] Michael J. Jones e James M. Rehg. Statistical Color Models with Application
to Skin Detection. Rel. téc. CRL 98/11. Cambridge Research
Laboratory, 1998.
[40] Erich Kaltofen e Gilles Villard. “On the complexity of computing determinants”.
Em: Computational complexity 13 (2004), pp. 91–130.
[41] Anatolii Alekseevich Karatsuba e Yu Ofman. “Multiplication of Many-
Digital Numbers by Automatic Computers”. Em: Doklady Akad. Nauk
SSSR 145.2 (1962). Translation in Soviet Physics-Doklady 7 (1963), pp.
595–596, pp. 293–294.
329