Nothing Special   »   [go: up one dir, main page]

skip to main content
article

On spreading a rumor

Published: 01 March 1987 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2023)Robust Multi-Agent Bandits Over Undirected GraphsACM SIGMETRICS Performance Evaluation Review10.1145/3606376.359356751:1(67-68)Online publication date: 27-Jun-2023
  • (2023)Robust Multi-Agent Bandits Over Undirected GraphsAbstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems10.1145/3578338.3593567(67-68)Online publication date: 19-Jun-2023
  • (2023)Continuous-Time Stochastic Analysis of Rumor Spreading with Multiple OperationsMethodology and Computing in Applied Probability10.1007/s11009-023-10058-725:4Online publication date: 23-Oct-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Applied Mathematics
SIAM Journal on Applied Mathematics  Volume 47, Issue 1
Feb. 1987
223 pages

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 March 1987

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Robust Multi-Agent Bandits Over Undirected GraphsACM SIGMETRICS Performance Evaluation Review10.1145/3606376.359356751:1(67-68)Online publication date: 27-Jun-2023
  • (2023)Robust Multi-Agent Bandits Over Undirected GraphsAbstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems10.1145/3578338.3593567(67-68)Online publication date: 19-Jun-2023
  • (2023)Continuous-Time Stochastic Analysis of Rumor Spreading with Multiple OperationsMethodology and Computing in Applied Probability10.1007/s11009-023-10058-725:4Online publication date: 23-Oct-2023
  • (2022)Robust Multi-Agent Bandits Over Undirected GraphsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35706146:3(1-57)Online publication date: 8-Dec-2022
  • (2022)Timely Gossiping with File Slicing and Network Coding2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834557(928-933)Online publication date: 26-Jun-2022
  • (2022)Stochastic Analysis of Rumor Spreading with Multiple Pull OperationsMethodology and Computing in Applied Probability10.1007/s11009-021-09911-424:3(2195-2211)Online publication date: 1-Sep-2022
  • (2021)Asymptotics for Push on the Complete GraphLATIN 2020: Theoretical Informatics10.1007/978-3-030-61792-9_36(451-463)Online publication date: 5-Jan-2021
  • (2020)Can Rumor Clarification Eliminate the Effects of Rumors?International Journal of Asian Business and Information Management10.4018/IJABIM.202001010311:1(48-62)Online publication date: 1-Jan-2020
  • (2020)Probabilistic Analysis of Rumor-Spreading TimeINFORMS Journal on Computing10.1287/ijoc.2018.084532:1(172-181)Online publication date: 1-Jan-2020
  • (2020)An implicit crowdsourcing approach to rumor identification in online social networksProceedings of the 12th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining10.1109/ASONAM49781.2020.9381339(174-182)Online publication date: 7-Dec-2020
  • Show More Cited By

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media