Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Venkatesh 0001
- > Home > Persons > S. Venkatesh 0001
Publications
- 2020
[i24]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs. CoRR abs/2010.05407 (2020)- [i23]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. CoRR abs/2010.05415 (2020) - 2019
- [j31]Khodakhast Bibak
, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. Discret. Math. 342(11): 3057-3061 (2019) - 2018
- [j29]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. Des. Codes Cryptogr. 86(9): 1893-1904 (2018) - [j28]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth:
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. Int. J. Found. Comput. Sci. 29(3): 357-376 (2018) - [r5]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Venkatesh Srinivasan, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2017
- [i19]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
A generalization of Schönemann's theorem via a graph theoretic method. CoRR abs/1712.06770 (2017) - 2016
- [j25]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH⁎ with arbitrary modulus is always almost-universal. Inf. Process. Lett. 116(7): 481-483 (2016) - [j23]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. IEEE Trans. Inf. Theory 62(11): 6355-6358 (2016) - [c30]Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, László Tóth:
On a variant of multilinear modular hashing with applications to authentication and secrecy codes. ISITA 2016: 320-324 - [c29]Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh Srinivasan:
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. Public Key Cryptography (2) 2016: 129-158 - 2015
- [j15]Bruce M. Kapron, Lior Malka, S. Venkatesh:
A framework for non-interactive instance-dependent commitment schemes (NIC). Theor. Comput. Sci. 593: 1-15 (2015) - [i18]Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences and an authenticated encryption scheme. CoRR abs/1503.01806 (2015) - [i17]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh:
On almost-universal multilinear modular hashing with composite moduli. CoRR abs/1507.02331 (2015) - [i16]Mohammad Hajiabadi, Bruce M. Kapron, S. Venkatesh:
On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. IACR Cryptol. ePrint Arch. 2015: 741 (2015) - [i15]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, Roberto Tauraso, László Tóth:
Restricted linear congruences. IACR Cryptol. ePrint Arch. 2015: 1186 (2015) - [i14]Khodakhast Bibak, Bruce M. Kapron, S. Venkatesh, László Tóth:
On an almost-universal hash function family with applications to authentication and secrecy codes. IACR Cryptol. ePrint Arch. 2015: 1187 (2015) - 2014
- [r3]Sean Chester, Bruce M. Kapron, Gautam Srivastava, Srinivasan Venkatesh, Alex Thomo:
Anonymization and De-anonymization of Social Network Data. Encyclopedia of Social Network Analysis and Mining 2014: 48-56 - 2013
- [j13]Sean Chester, Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Complexity of social network anonymization. Soc. Netw. Anal. Min. 3(2): 151-166 (2013) - [j12]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Soc. Netw. Anal. Min. 3(3): 381-399 (2013) - 2011
- [c19]Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo, S. Venkatesh:
k-Anonymization of Social Networks by Vertex Addition. ADBIS (2) 2011: 107-116 - [c18]Bruce M. Kapron, Gautam Srivastava, S. Venkatesh:
Social Network Anonymization via Edge Addition. ASONAM 2011: 155-162 - 2009
- [i4]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC). IACR Cryptol. ePrint Arch. 2009: 461 (2009) - 2007
- [c10]Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh:
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). ICALP 2007: 328-339
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-04-25 01:59 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:
