Читать «Кому нужна математика? Понятная книга о том, как устроен цифровой мир» онлайн - страница 80

20

Heule Stefan, Nunkesser Marc and Hall Alexander. Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm // Proceedings of the 16th International Conference on Extending Database Technology, pp. 683–692. ACM, 2013.

21

Sketch of the day: Hyperloglog – cornerstone of a big data infrastructure. . Accessed: 2015-11-22.

22

Flajolet Philippe, Fusy Eric, Olivier G. and Meunier Frederic. Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm // Philippe Jacquet, editor, Analysis of Algorithms 2007 (AofA07), volume AH of Discrete Mathematics and Theoretical Computer Science Proceedings, p. 127–146, 2007.

23

Sketch of the day: Hyperloglog – cornerstone of a big data infrastructure. . Accessed: 2015-11-22.

24

Heule Stefan, Nunkesser Marc and Hall Alexander. Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm // Proceedings of the 16th International Conference on Extending Database Technology, pp. 683–692. ACM, 2013.

25

Backstrom Lars, Boldi Paolo, Rosa Marco, Ugander Johan and Vigna Sebastiano. Four degrees of separation // Proceedings of the 4th Annual ACM Web Science Conference, p. 33–42. ACM, 2012.

26

Sketch of the day: Hyperloglog – cornerstone of a big data infrastructure. . Accessed: 2015-11-22.

27

Backstrom Lars, Boldi Paolo, Rosa Marco, Ugander Johan and Vigna Sebastiano. Four degrees of separation // Proceedings of the 4th Annual ACM Web Science Conference, p. 33–42. ACM, 2012.

28

Heule Stefan, Nunkesser Marc and Hall Alexander. Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm // Proceedings of the 16th International Conference on Extending Database Technology, pp. 683–692. ACM, 2013.

29

Sketch of the day: Hyperloglog – cornerstone of a big data infrastructure. . Accessed: 2015-11-22.

30

Vickrey William. Counterspeculation, auctions, and competitive sealed tenders // The Journal of finance, 16(l):8–37, 1961.

31

Easley David and Kleinberg Jon. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2010.

32

Stokes Donald E. Pasteur’s quadrant: Basic science and technological innovation. Brookings Institution Press, 2011.

33

Райгородский A. M. Модели случайных графов. 2-е изд. М.: МЦНМО, 2016.

34

Введенская Н. Д. Система обслуживания с выбором наименьшей из двух очередей – асимптотический подход / Н. Д. Введенская, Р. Л. Добрушин, Ф. И. Карпелевич // Проблемы передачи информации. – 1996. – № 32 (1). – С. 20–34.