default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarang Aravamuthan
Person information
- unicode name: ஸாரங் ஆராவமுதன்
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Chi Mai Kim Ho, Kin Choong Yow
, Zhongwen Zhu, Sarang Aravamuthan:
Network Intrusion Detection via Flow-to-Image Conversion and Vision Transformer Classification. IEEE Access 10: 97780-97793 (2022)
2010 – 2019
- 2012
- [i4]Sarang Aravamuthan, Biswajit Ganguly:
e-Valuate: A Two-player Game on Arithmetic Expressions. CoRR abs/1202.0862 (2012) - 2010
- [i3]Sarang Aravamuthan:
Separable Hash Functions. IACR Cryptol. ePrint Arch. 2010: 253 (2010)
2000 – 2009
- 2007
- [j6]Issaac Rajan, Sarang Aravamuthan, Sharmila S. Mande:
Identification of compositionally distinct regions in genomes using the centroid method. Bioinform. 23(20): 2672-2677 (2007) - [j5]Sarang Aravamuthan, Sachin Lodha:
The average transmission overhead for broadcast encryption. J. Math. Cryptol. 1(4): 373 (2007) - [c3]Sarang Aravamuthan, Viswanatha Rao Thumparthy:
A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks. COMSWARE 2007 - 2006
- [j4]Sarang Aravamuthan, Sachin Lodha:
Covering Codes for Hats-on-a-line. Electron. J. Comb. 13(1) (2006) - [i2]Sarang Aravamuthan, Viswanatha Rao Thumparthy:
A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks. IACR Cryptol. ePrint Arch. 2006: 316 (2006) - [i1]Sarang Aravamuthan, Sachin Lodha:
The Average Transmission Overhead of Broadcast Encryption. IACR Cryptol. ePrint Arch. 2006: 324 (2006) - 2005
- [c2]Sarang Aravamuthan, Sachin Lodha:
An Optimal Subset Cover for Broadcast Encryption. INDOCRYPT 2005: 221-231
1990 – 1999
- 1997
- [j3]Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler:
Extremal Properties of 0/1-Polytopes. Discret. Comput. Geom. 17(4): 439-448 (1997) - [j2]Aravamuthan Sarangarajan:
A Lower Bound for Adjacencies on the Traveling Salesman Polytope. SIAM J. Discret. Math. 10(3): 431-435 (1997) - 1996
- [j1]Louis J. Billera, Aravamuthan Sarangarajan:
All 0-1 Polytopes are Traveling Salesman Polytopes. Comb. 16(2): 175-188 (1996) - 1994
- [c1]Louis J. Billera, Aravamuthan Sarangarajan:
The Combinatorics of Permutation Polytopes. Formal Power Series and Algebraic Combinatorics 1994: 1-23
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-10-07 22:19 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:
