activity
20052026
most citedAutomorphism group of the complete transposition graph

34 citations · 135 across the 24 of their papers we have counts for

collaborators

27 papers

cs.LG2026

A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management

Ashwin Ganesan

Entity resolution -- identifying database records that refer to the same real-world entity -- is naturally modelled on bipartite graphs connecting entity nodes to their attribute v…

cs.AI2025★ 2 cited

The Amazon Nova Family of Models: Technical Report and Model Card

Amazon AGI, Aaron Langford, Aayush Shah +783

We present Amazon Nova, a new generation of state-of-the-art foundation models that deliver frontier intelligence and industry-leading price performance. Amazon Nova Pro is a highl…

cs.NI2022

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems

Ashwin Ganesan

An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees h…

cs.IT2020

Performance analysis of a distributed algorithm for admission control in wireless networks under the -hop interference model

Ashwin Ganesan

A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node…

cs.IT2019★ 16 cited

On some distributed scheduling algorithms for wireless networks with hypergraph interference models

Ashwin Ganesan

It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previ…

cs.IT2018★ 11 cited

Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks

Ashwin Ganesan

Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to b…