Карлин, Анна (Russian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Карлин, Анна" in Russian language version.

refsWebsite

Global rank Russian rank

1^st place

2^nd place

3^rd place

1,697^th place

3,012^th place

451^st place

2,245^th place

702^nd place

1,031^st place

179^th place

213^th place

6^th place

9^th place

1,067^th place

1,530^th place

1,185^th place

1,832^nd place

3,464^th place

low place

low place

acm.org

Newly Elected Members, American Academy of Arts and Sciences, April 2016, Архивировано 9 мая 2017, Дата обращения: 20 апреля 2016 Источник (неопр.). Дата обращения: 2 декабря 2016. Архивировано 9 мая 2017 года.

Dietzfelbinger, Karlin, Mehlhorn, Meyer auf der Heide, 1994. Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. (1994), "Dynamic perfect hashing: upper and lower bounds", SIAM Journal on Computing, 23 (4): 738—761, doi:10.1137/S0097539791194094, MR 1283572.

Ambrose, Susan A. Journeys of women in science and engineering : no universal constants (англ.). — Philadelphia: Temple Univ. Press, 1997. — P. 247. — ISBN 1-56639-527-5.

Feeley, Morgan, Pighin, Karlin, 1995. Feeley, M. J.; Morgan, W. E.; Pighin, E. P.; Karlin, A. R.; Levy, H. M.; Thekkath, C. A. (1995), "Implementing global memory management in a workstation cluster", Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP '95), pp. 201—212, doi:10.1145/224056.224072.
Wolman, Voelker, Sharma, Cardwell, 1999. Wolman, Alec; Voelker, M.; Sharma, Nitin; Cardwell, Neal; Karlin, Anna; Levy, Henry M. (1999), "On the scale and performance of cooperative Web proxy caching", Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP '99), pp. 16—31, doi:10.1145/319151.319153.
Dietzfelbinger, Karlin, Mehlhorn, Meyer auf der Heide, 1994. Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. (1994), "Dynamic perfect hashing: upper and lower bounds", SIAM Journal on Computing, 23 (4): 738—761, doi:10.1137/S0097539791194094, MR 1283572.