Randomizirani algoritam (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Randomizirani algoritam" in Serbian language version.

refsWebsite

Global rank Serbian rank

2semanticscholar.org

11^th place

23^rd place

2^nd place

4^th place

580^th place

551^st place

1,185^th place

1,193^rd place

acm.org (Global: 1,185^th place; Serbian: 1,193^rd place)

portal.acm.org

Dyer, M.; Frieze, A.; Kannan, R. (1991), „A random polynomial-time algorithm for approximating the volume of convex bodies”, Journal of the ACM, 38 (1): 1—17, S2CID 13268711, doi:10.1145/102782.102783

berkeley.edu (Global: 580^th place; Serbian: 551^st place)

cs.berkeley.edu

Seidel R. Backwards Analysis of Randomized Geometric Algorithms.

doi.org (Global: 2^nd place; Serbian: 4^th place)

Dyer, M.; Frieze, A.; Kannan, R. (1991), „A random polynomial-time algorithm for approximating the volume of convex bodies”, Journal of the ACM, 38 (1): 1—17, S2CID 13268711, doi:10.1145/102782.102783
Füredi, Z.; Bárány, I. (1986), „Computing the volume is difficult”, Proc. 18th ACM Symposium on Theory of Computing (Berkeley, California, May 28–30, 1986), New York, NY: ACM, стр. 442—447, ISBN 0-89791-193-8, S2CID 17867291, doi:10.1145/12130.12176

semanticscholar.org (Global: 11^th place; Serbian: 23^rd place)

api.semanticscholar.org

Dyer, M.; Frieze, A.; Kannan, R. (1991), „A random polynomial-time algorithm for approximating the volume of convex bodies”, Journal of the ACM, 38 (1): 1—17, S2CID 13268711, doi:10.1145/102782.102783
Füredi, Z.; Bárány, I. (1986), „Computing the volume is difficult”, Proc. 18th ACM Symposium on Theory of Computing (Berkeley, California, May 28–30, 1986), New York, NY: ACM, стр. 442—447, ISBN 0-89791-193-8, S2CID 17867291, doi:10.1145/12130.12176