Efficient random walk sampling in distributed networks-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Efficient random walk sampling in distributed networks

Published:2015-03 Issue: Volume:77 Page:84-94
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Das Sarma Atish,Molla Anisur Rahaman,Pandurangan Gopal

Funder

Nanyang Technological University

Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 2

Singapore MOE AcRF Tier 1

US–Israel Binational Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference47 articles.

1. Search in power-law networks;Adamic;Phys. Rev. E,2001

2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. of IEEE Symposium on Foundations of Computer Science, FOCS, 1979, pp. 218–223.

3. Many random walks are faster than one;Alon;Combin. Probab. Comput.,2011

4. J. Augustine, A.R. Molla, E. Morsy, G. Pandurangan, P. Robinson, E. Upfal, Search and storage in dynamic peer-to-peer networks, in: Proc. of 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, 2013, pp. 53–62.

5. J. Augustine, G. Pandurangan, P. Robinson, Fast byzantine agreement in dynamic networks, in: Proc. of 32nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC, 2013, pp. 74–83.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MMF Clustering: A On-demand One-hop Cluster Management in MANET Services Executing Perspective;Wireless Personal Communications;2022-03-13

2. Time and Position Aware Resource Search (TPARS) Algorithm for the Mobile Peer-to-Peer Network using Ant Colony Optimization (ACO);International Journal of Communication Networks and Distributed Systems;2022

3. Mean First-Passage Time on Scale-Free Networks Based on Rectangle Operation;Frontiers in Physics;2021-06-09

4. Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs;The VLDB Journal;2021-05-07

5. UniNet: Scalable Network Representation Learning with Metropolis-Hastings Sampling;2021 IEEE 37th International Conference on Data Engineering (ICDE);2021-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3