Deterministic rendezvous problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Deterministic rendezvous problem" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

1,624^th place

1,592^nd place

doi.org (Global: 2^nd place; English: 2^nd place)

Ta-Shma, Amnon; Zwick, Uri (April 2014). "Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences". ACM Transactions on Algorithms. 10 (3). 12. doi:10.1145/2601068. S2CID 10718957.
Dessmark, A.; Fraingnaud, P.; Kowalski, D.; Pelc, A. (2006). "Deterministic rendezvous in graphs". Algorithmica. 46 (1): 69–96. doi:10.1007/s00453-006-0074-2. S2CID 22236305.
Kowalski, D.; Malinowski, A. (2008). "How to meet in anonymous network". Theoretical Computer Science. 399 (1–2): 144–156. doi:10.1016/j.tcs.2008.02.010.
Aleliunas, R.; Karp, R.; Lipton, R.; Lovász, L.; Rackoff, C. (1979). "Random walks, universal traversal sequences, and the complexity of maze problems". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979). pp. 218–223. doi:10.1109/SFCS.1979.34. S2CID 18719861.

Dessmark, A.; Fraingnaud, P.; Kowalski, D.; Pelc, A. (2006). "Deterministic rendezvous in graphs". Algorithmica. 46 (1): 69–96. doi:10.1007/s00453-006-0074-2. S2CID 22236305.

Ta-Shma, Amnon; Zwick, Uri (April 2014). "Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences". ACM Transactions on Algorithms. 10 (3). 12. doi:10.1145/2601068. S2CID 10718957.
Dessmark, A.; Fraingnaud, P.; Kowalski, D.; Pelc, A. (2006). "Deterministic rendezvous in graphs". Algorithmica. 46 (1): 69–96. doi:10.1007/s00453-006-0074-2. S2CID 22236305.
Aleliunas, R.; Karp, R.; Lipton, R.; Lovász, L.; Rackoff, C. (1979). "Random walks, universal traversal sequences, and the complexity of maze problems". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979). pp. 218–223. doi:10.1109/SFCS.1979.34. S2CID 18719861.