Sarang Aravamuthan

According to our database, Sarang Aravamuthan authored at least 12 papers between 1994 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Network Intrusion Detection via Flow-to-Image Conversion and Vision Transformer Classification.

Chi Mai Kim Ho, Kin Choong Yow, Zhongwen Zhu, Sarang Aravamuthan

IEEE Access, 2022

2012

e-Valuate: A Two-player Game on Arithmetic Expressions

Sarang Aravamuthan, Biswajit Ganguly

CoRR, 2012

2010

Separable Hash Functions.

Sarang Aravamuthan

IACR Cryptol. ePrint Arch., 2010

2007

Identification of compositionally distinct regions in genomes using the centroid method.

Issaac Rajan, Sarang Aravamuthan, Sharmila S. Mande

Bioinform., 2007

2006

A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks.

Sarang Aravamuthan, Viswanatha Rao Thumparthy

IACR Cryptol. ePrint Arch., 2006

The Average Transmission Overhead of Broadcast Encryption.

Sarang Aravamuthan, Sachin Lodha

IACR Cryptol. ePrint Arch., 2006

Covering Codes for Hats-on-a-line.

Sarang Aravamuthan, Sachin Lodha

Electron. J. Comb., 2006

2005

An Optimal Subset Cover for Broadcast Encryption.

Sarang Aravamuthan, Sachin Lodha

Proceedings of the Progress in Cryptology, 2005

1997

A Lower Bound for Adjacencies on the Traveling Salesman Polytope.

Aravamuthan Sarangarajan

SIAM J. Discret. Math., 1997

Extremal Properties of 0/1-Polytopes.

Ulrich Kortenkamp, Jürgen Richter-Gebert, Aravamuthan Sarangarajan, Günter M. Ziegler

Discret. Comput. Geom., 1997

1996

All 0-1 Polytopes are Traveling Salesman Polytopes.

Louis J. Billera, Aravamuthan Sarangarajan

Comb., 1996

1994

The Combinatorics of Permutation Polytopes.

Louis J. Billera, Aravamuthan Sarangarajan

Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994