A BiCMOS low-distortion 8-MHz low-pass filter. - Scott D. Willingham; Kenneth W. Martin; Ashwin Ganesan (IEEE J. Solid State Circuits, 1993)

A virtual input-output framework for transceiver analysis and design for multipath fading channels. - Ashwin Ganesan; Akbar M. Sayeed (IEEE Trans. Commun., 2003)

An Explicit Construction of Universally Decodable Matrices - Pascal O. Vontobel; Ashwin Ganesan (CoRR, 2005)

On universally decodable matrices for space-time coding. - Pascal O. Vontobel; Ashwin Ganesan (Des. Codes Cryptogr., 2006)

On the Existence of Universally Decodable Matrices. - Ashwin Ganesan; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2007)

On Some Sufficient Conditions for Distributed Quality-of-Service Support in Wireless Networks. - Ashwin Ganesan (NetCoM, 2009)

The performance of an upper bound on the fractional chromatic number of weighted graphs. - Ashwin Ganesan (Appl. Math. Lett., 2010)

On some upper bounds on the fractional chromatic number of weighted graphs - Ashwin Ganesan (CoRR, 2010)

Minimal resolving sets for the hypercube - Ashwin Ganesan (CoRR, 2011)

On some sufficient conditions for distributed QoS support in wireless networks - Ashwin Ganesan (CoRR, 2011)

On a bound for the diameter of Cayley networks of symmetric groups generated by transposition trees - Ashwin Ganesan (CoRR, 2011)

The regular number of a graph - Ashwin Ganesan; Radha R. Iyer (CoRR, 2011)

Diameter of Cayley graphs generated by transposition trees - Ashwin Ganesan (CoRR, 2012)

The automorphism group of Cayley graphs generated by connected transposition sets. - Ashwin Ganesan (CoRR, 2012)

Automorphism groups of graphs - Ashwin Ganesan (CoRR, 2012)

Automorphisms of Cayley graphs generated by transposition sets - Ashwin Ganesan (CoRR, 2013)

Automorphism groups of Cayley graphs generated by connected transposition sets. - Ashwin Ganesan (Discret. Math., 2013)

A direct product decomposition of the automorphism group of Cayley graphs generated by transposition sets. - Ashwin Ganesan (CoRR, 2014)

Performance of sufficient conditions for distributed quality-of-service support in wireless networks. - Ashwin Ganesan (Wirel. Networks, 2014)

Structure of the automorphism group of the augmented cube graph. - Ashwin Ganesan (CoRR, 2015)

On the automorphism group of Cayley graphs generated by transpositions. - Ashwin Ganesan (Australas. J Comb., 2016)

Edge-transitivity of Cayley graphs generated by transpositions. - Ashwin Ganesan (Discuss. Math. Graph Theory, 2016)

Cayley graphs and symmetric interconnection networks. - Ashwin Ganesan (CoRR, 2017)

On the automorphism group of a Johnson graph. - Ashwin Ganesan (Ars Comb., 2018)

Performance of distributed algorithms for QoS in wireless ad hoc networks: arbitrary networks under the primary interference model, and line networks under the protocol interference model. - Ashwin Ganesan (CoRR, 2018)

Fault tolerant supergraphs with automorphisms. - Ashwin Ganesan (Discret. Appl. Math., 2019)

Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks. - Ashwin Ganesan (IEEE/ACM Trans. Netw., 2020)

Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model. - Ashwin Ganesan (ICDCN, 2021)

On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models. - Ashwin Ganesan (IEEE Trans. Inf. Theory, 2021)

Structured Hypergraphs in Cellular Mobile Communication Systems. - Ashwin Ganesan (ICDCN, 2023)

Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model. - Ashwin Ganesan (Theor. Comput. Sci., 2023)

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems. - Ashwin Ganesan (IEEE Trans. Mob. Comput., 2025)

The Amazon Nova Family of Models: Technical Report and Model Card. - Amazon AGI; Aaron Langford; Aayush Shah; Abhanshu Gupta; Abhimanyu Bhatter; Abhinav Goyal 004; Abhinav Mathur; Abhinav Mohanty; Abhishek Kumar; Abhishek Sethi; Abi Komma; Abner Pena; et al. (CoRR, 2025)