Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models

By R. Chitnis, Fedor V. Fomin, Daniel Lokshtanov, P. c, Saket Saurabh. Journal of computer and system sciences (Print), 2008

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Escaping From Saddle Points - Online Stochastic Gradient for Tensor Decomposition (2015, methodology): “As aresult we get the first online algorithm for orthogonal tensor decomposition with global convergence guarantee.”
Path lengths, correlations, and centrality in temporal networks (2011, background): “…additional constraints can be placed on allowed transmission paths: e.g., for the susceptibleinfectious-recovered (SIR) spreading dynamics where an infected node remains infectious for a limited period of time only, there is a waiting time threshold between consecutive events spanning a path.”
Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way postprocessing. (2007, background): “This is typically done by two-universal hashing [24].”
Combining Search, Social Media, and Traditional Data Sources to Improve Influenza Surveillance (2015, background): “Adaptive Boosting (AdaBoost) regression [33] fits a sequence of weak learners (in this case decision trees) on sequentially reweighted versions of the training data.”
Temporal motifs in time-dependent networks (2011, neutral): “(2011) P 11005 Contents”