Name
Affiliation
Papers
SANTOSH S. VENKATESH
university of pennsylvania
45
Collaborators
Citations 
PageRank 
45
381
71.80
Referers 
Referees 
References 
764
592
427
Search Limit
100764
Title
Citations
PageRank
Year
Modeling the Impact of Traffic Signals on V2V Information Flow.00.342020
Modeling Information Propagation in General V2V-enabled Transportation Networks.00.342019
Visibility-Aware Optimal Contagion of Malware Epidemics30.402015
Optimal Energy-Aware Epidemic Routing in DTNs90.522015
Taming epidemic outbreaks in mobile adhoc networks.10.352015
Optimal Patching in Clustered Malware Epidemics.130.712014
Spin glasses with attitude: Opinion formation in a partisan Erdős-Rényi world00.342014
Opinion formation in Ising networks00.342013
Closing the Pandora's Box: defenses for thwarting epidemic outbreaks in mobile adhoc networks10.352012
Optimal energy-aware epidemic routing in DTNs311.102012
Adaptive selective verification: an efficient adaptive countermeasure to thwart DoS attacks130.612012
Market-based control of epidemics20.362011
Adaptive SelectiveVerification.90.572008
Correction to “Linear and Logarithmic Capacities in Associative Neural Networks”00.342007
Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks91.572006
DoS Protection for Reliably Authenticated Broadcast251.372004
Learning finite binar sequences from half-space data00.341999
Pilot Symbol Assisted Diversity Reception For A Fading Channel10.481998
An adaptive diversity receiver for OFDM in fading channels82.571998
The capacity of majority rule30.481998
Learning pattern classification-a survey425.431998
A Threshold Function for Harmonic Update10.361997
Learning binary perceptrons perfectly efficiently40.671996
On edge-colored interior planar graphs on a circle and the expected number of RNA secondary structures10.361996
Learning from a mixture of labeled and unlabeled examples with parametric side information392.941995
Criteria for specifying machine complexity in learning00.341995
Temporal Dynamics of Generalization in Neural Networks60.691994
On the finite sample performance of the nearest neighbor classifier111.061994
On the minimum expected duration of a coin tossing game00.341993
On the average tractability of binary integer programming and the curious transition to perfect generalization in learning majority functions53.021993
Random interactions in higher order neural networks30.541993
Optimal Stopping And Effective Machine Complexity In Learning323.631993
Directed drift: a new linear threshold algorithm for learning binary weights on-line141.251993
Robustness in neural computation: random graphs and sparsity103.221992
On reliable computation with formal neurons31.701992
Bellman strikes again!: the growth rate of sample complexity with dimension for the nearest neighbor classifier40.621992
Programmed interactions in higher-order neural networks: Maximal capacity152.601991
On learning binary weights for majority functions157.061991
Shaping attraction basins in neural networks10.371990
Asymptotic slowing down of the nearest-neighbor classifier20.751990
The Devil and the Network00.341990
Binary filters for pattern classification30.821989
Linear and logarithmic capacities in associative neural networks3818.401989
Composite algorithms for shaping attraction basins00.341988
On Properties of Networks of Neuron-Like Elements41.521987