default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSantosh S. Venkatesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Jungyeol Kim
, Rohan Saraogi, Saswati Sarkar, David Starobinski, Santosh S. Venkatesh:
Capturing the Spread of Information in Heterogeneous V2X Through Scalable Computation. IEEE/ACM Trans. Netw. 32(2): 1540-1555 (2024)- 2020
- [j31]Soheil Eshghi, Victor M. Preciado, Saswati Sarkar, Santosh S. Venkatesh, Qing Zhao, Raissa M. D'Souza, Ananthram Swami:
Spread, Then Target, and Advertise in Waves: Optimal Budget Allocation Across Advertising Channels. IEEE Trans. Netw. Sci. Eng. 7(2): 750-763 (2020) - [c25]Jungyeol Kim, Rohan Saraogi, Saswati Sarkar, Santosh S. Venkatesh:
Modeling the Impact of Traffic Signals on V2V Information Flow. VTC Spring 2020: 1-7
2010 – 2019
- 2019
- [i5]Jungyeol Kim, Saswati Sarkar, Santosh S. Venkatesh, Megan Smirti Ryerson, David Starobinski:
Modeling Information Propagation in General V2V-enabled Transportation Networks. CoRR abs/1901.00527 (2019) - 2018
- [j30]Mohammad Hadi Afrasiabi, Roch Guérin, Santosh S. Venkatesh:
Opinion formation in Ising networks. Online Soc. Networks Media 5: 1-22 (2018) - 2017
- [j29]Soheil Eshghi, Saswati Sarkar, Santosh S. Venkatesh:
Visibility-Aware Optimal Contagion of Malware Epidemics. IEEE Trans. Autom. Control. 62(10): 5205-5212 (2017) - [c24]Soheil Eshghi, Victor M. Preciado, Saswati Sarkar, Santosh S. Venkatesh, Qing Zhao, Raissa M. D'Souza, Ananthram Swami:
Spread, then target, and advertise in waves: Optimal capital allocation across advertising channels. ITA 2017: 1-10 - [i4]Soheil Eshghi, Victor M. Preciado, Saswati Sarkar, Santosh S. Venkatesh, Qing Zhao, Raissa M. D'Souza, Ananthram Swami:
Spread, then Target, and Advertise in Waves: Optimal Capital Allocation Across Advertising Channels. CoRR abs/1702.03432 (2017) - 2016
- [j28]Soheil Eshghi, M. H. R. Khouzani, Saswati Sarkar, Santosh S. Venkatesh:
Optimal Patching in Clustered Malware Epidemics. IEEE/ACM Trans. Netw. 24(1): 283-298 (2016) - 2015
- [j27]Md. Endadul Hoque, Rahul Potharaju, Cristina Nita-Rotaru, Saswati Sarkar, Santosh S. Venkatesh:
Taming epidemic outbreaks in mobile adhoc networks. Ad Hoc Networks 24: 57-72 (2015) - [j26]Soheil Eshghi, M. H. R. Khouzani, Saswati Sarkar, Ness B. Shroff, Santosh S. Venkatesh:
Optimal Energy-Aware Epidemic Routing in DTNs. IEEE Trans. Autom. Control. 60(6): 1554-1569 (2015) - [i3]Soheil Eshghi, Saswati Sarkar, Santosh S. Venkatesh:
Visibility-Aware Optimal Contagion of Malware Epidemics. CoRR abs/1507.03528 (2015) - 2014
- [c23]Mohammad Hadi Afrasiabi, Roch Guérin, Santosh S. Venkatesh:
Spin glasses with attitude: Opinion formation in a partisan Erdős-Rényi world. ITA 2014: 1-5 - [i2]Soheil Eshghi, M. H. R. Khouzani, Saswati Sarkar, Santosh S. Venkatesh:
Optimal Patching in Clustered Malware Epidemics. CoRR abs/1403.1639 (2014) - [i1]Soheil Eshghi, M. H. R. Khouzani, Saswati Sarkar, Ness B. Shroff, Santosh S. Venkatesh:
Optimal Energy-Aware Epidemic Routing in DTNs. CoRR abs/1403.1642 (2014) - 2013
- [c22]Mohammad Hadi Afrasiabi, Roch Guérin, Santosh S. Venkatesh:
Opinion formation in Ising networks. ITA 2013: 1-10 - 2012
- [j25]Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter:
Adaptive Selective Verification: An Efficient Adaptive Countermeasure to Thwart DoS Attacks. IEEE/ACM Trans. Netw. 20(3): 715-728 (2012) - [c21]Rahul Potharaju, Md. Endadul Hoque, Cristina Nita-Rotaru, Saswati Sarkar, Santosh S. Venkatesh:
Closing the Pandora's box: Defenses for thwarting epidemic outbreaks in mobile adhoc networks. MASS 2012: 200-208 - [c20]M. H. R. Khouzani, Soheil Eshghi, Saswati Sarkar, Ness B. Shroff, Santosh S. Venkatesh:
Optimal energy-aware epidemic routing in DTNs. MobiHoc 2012: 175-182 - 2011
- [c19]M. H. R. Khouzani, Santosh S. Venkatesh, Saswati Sarkar:
Market-based control of epidemics. Allerton 2011: 314-320
2000 – 2009
- 2008
- [c18]Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter:
Adaptive SelectiveVerification. INFOCOM 2008: 529-537 - 2007
- [j24]Santosh S. Venkatesh, Demetri Psaltis:
Correction to "Linear and Logarithmic Capacities in Associative Neural Networks". IEEE Trans. Inf. Theory 53(2): 854 (2007) - 2006
- [j23]Srisankar S. Kunniyur, Santosh S. Venkatesh:
Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks. IEEE Trans. Inf. Theory 52(12): 5352-5372 (2006) - 2004
- [c17]Srisankar S. Kunniyur, Santosh S. Venkatesh:
Sensor network devolution and breakdown in survivor connectivity. ISIT 2004: 82 - [c16]Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh:
DoS Protection for Reliably Authenticated Broadcast. NDSS 2004 - 2000
- [j22]Selaka B. Bulumulla, Saleem A. Kassam, Santosh S. Venkatesh:
A systematic approach to detecting OFDM signals in a fading channel. IEEE Trans. Commun. 48(5): 725-728 (2000) - [c15]Joel Ratsaby, Santosh S. Venkatesh:
On partially blind learning complexity. ISCAS 2000: 765-768
1990 – 1999
- 1999
- [j21]Shao C. Fang, Santosh S. Venkatesh:
Learning finite binary sequences from half-space data. Random Struct. Algorithms 14(4): 345-381 (1999) - 1998
- [j20]Shao C. Fang, Santosh S. Venkatesh:
The capacity of majority rule. Random Struct. Algorithms 12(1): 83-109 (1998) - [j19]Sanjeev R. Kulkarni, Gábor Lugosi, Santosh S. Venkatesh:
Learning Pattern Classification - A Survey. IEEE Trans. Inf. Theory 44(6): 2178-2206 (1998) - [c14]Selaka B. Bulumulla, Saleem A. Kassam, Santosh S. Venkatesh:
Pilot symbol assisted diversity reception for a fading channel. ICASSP 1998: 3417-3420 - [c13]Selaka B. Bulumulla, Saleem A. Kassam, Santosh S. Venkatesh:
An adaptive diversity receiver for OFDM in fading channels. ICC 1998: 1325-1329 - 1997
- [j18]Shao C. Fang, Santosh S. Venkatesh:
A Threshold Function for Harmonic Update. SIAM J. Discret. Math. 10(3): 482-498 (1997) - 1996
- [j17]Alon Orlitsky, Santosh S. Venkatesh:
On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. Discret. Appl. Math. 64(2): 151-178 (1996) - [j16]Shao C. Fang, Santosh S. Venkatesh:
Learning Binary Perceptrons Perfectly Efficiently. J. Comput. Syst. Sci. 52(2): 374-389 (1996) - 1995
- [c12]Changfeng Wang, Santosh S. Venkatesh:
Criteria for Specifying Machine Complexity in Learning. COLT 1995: 273-280 - [c11]Joel Ratsaby, Santosh S. Venkatesh:
Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information. COLT 1995: 412-417 - [c10]Shao C. Fang, Santosh S. Venkatesh:
Learning Finite Binary Sequences from Half-Space Data. ICNN 1995: 2955-2959 - 1994
- [j15]Demetri Psaltis, Robert R. Snapp, Santosh S. Venkatesh:
On the finite sample performance of the nearest neighbor classifier. IEEE Trans. Inf. Theory 40(3): 820-837 (1994) - [c9]Robert R. Snapp, Santosh S. Venkatesh:
Asymptotic predictions of the finite-sample risk of the k-nearest-neighbor classifier. ICPR (2) 1994: 1-6 - [c8]Changfeng Wang, Santosh S. Venkatesh:
Temporal Dynamics of Generalization in Neural Networks. NIPS 1994: 263-270 - 1993
- [j14]Santosh S. Venkatesh:
Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line. J. Comput. Syst. Sci. 46(2): 198-217 (1993) - [j13]Pierre Baldi, Santosh S. Venkatesh:
Random interactions in higher order neural networks. IEEE Trans. Inf. Theory 39(1): 274-283 (1993) - [j12]Inchi Hu, Santosh S. Venkatesh:
On the minimum expected duration of a coin tossing game. IEEE Trans. Inf. Theory 39(2): 581-593 (1993) - [c7]Shao C. Fang, Santosh S. Venkatesh:
On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions. COLT 1993: 310-316 - [c6]Changfeng Wang, Santosh S. Venkatesh, J. Stephen Judd:
Optimal Stopping and Effective Machine Complexity in Learning. NIPS 1993: 303-310 - 1992
- [j11]Santosh S. Venkatesh, Demetri Psaltis:
On Reliable Computation With Formal Neurons. IEEE Trans. Pattern Anal. Mach. Intell. 14(1): 87-91 (1992) - [j10]Santosh S. Venkatesh:
Robustness in neural computation: Random graphs and sparsity. IEEE Trans. Inf. Theory 38(3): 1114-1119 (1992) - [j9]Santosh S. Venkatesh:
The Science of Making ERORS: What Error Tolerance Implies for Capacity in Neural Networks. IEEE Trans. Knowl. Data Eng. 4(2): 135-144 (1992) - [c5]Santosh S. Venkatesh, Robert R. Snapp, Demetri Psaltis:
Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier. COLT 1992: 93-102 - 1991
- [j8]Santosh S. Venkatesh, Pierre Baldi:
Programmed interactions in higher-order neural networks: Maximal capacity. J. Complex. 7(3): 316-337 (1991) - [j7]Santosh S. Venkatesh, Pierre Baldi:
Programmed interactions in higher-order neural networks: The outer-product algorithm. J. Complex. 7(4): 443-479 (1991) - [j6]Santosh S. Venkatesh, Joel Franklin:
How much information can one bit of memory retain about a Bernoulli sequence? IEEE Trans. Inf. Theory 37(6): 1595-1604 (1991) - [c4]Santosh S. Venkatesh:
On Learning Binary Weights for Majority Functions. COLT 1991: 257-266 - 1990
- [j5]Santosh S. Venkatesh, Girish Pancha, Demetri Psaltis, Gabriel Sirat:
Shaping attraction basins in neural networks. Neural Networks 3(6): 613-623 (1990) - [c3]Sanjay Biswas, Santosh S. Venkatesh:
The Devil and the Network. NIPS 1990: 883-889 - [c2]Robert R. Snapp, Demetri Psaltis, Santosh S. Venkatesh:
Asymptotic Slowing Down of the Nearest-Neighbor Classifier. NIPS 1990: 932-938
1980 – 1989
- 1989
- [j4]Santosh S. Venkatesh, Demetri Psaltis:
Linear and logarithmic capacities in associative neural networks. IEEE Trans. Inf. Theory 35(3): 558-568 (1989) - [j3]Santosh S. Venkatesh, Demetri Psaltis:
Binary filters for pattern classification. IEEE Trans. Acoust. Speech Signal Process. 37(4): 604-611 (1989) - 1988
- [j2]Santosh S. Venkatesh, Girish Pancha, Demetri Psaltis:
Composite algorithms for shaping attraction basins. Neural Networks 1(Supplement-1): 56-59 (1988) - 1987
- [j1]Robert J. McEliece, Edward C. Posner, Eugene R. Rodemich, Santosh S. Venkatesh:
The capacity of the Hopfield associative memory. IEEE Trans. Inf. Theory 33(4): 461-482 (1987) - [c1]Pierre Baldi, Santosh S. Venkatesh:
On Properties of Networks of Neuron-Like Elements. NIPS 1987: 41-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-20 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
