activity
20062026
most citedOn Performance of Event-to-Sink Transport in Transmit-Only Sensor Networks

35 citations · 69 across the 9 of their papers we have counts for

collaborators

9 papers

cs.RO2026

Kairos: A Scalable Serving System for Physical AI

Yinwei Dai, Ganesh Ananthanarayanan, Landon Cox +3

Physical AI is experiencing rapid growth with frontier foundation models increasing its capabilities across general environments. Physical AI tasks are characterized by inference p…

cs.RO2026

Offload or Overload: A Platform Measurement Study of Mobile Robotic Manipulation Workloads

Sara Pohland, Xenofon Foukas, Ganesh Ananthanarayanan +4

Mobile robotic manipulation--the ability of robots to navigate spaces and interact with objects--is a core capability of physical AI. Foundation models have led to breakthroughs in…

cs.NI2025

Hades: Hierarchical Adaptable Decoding for Efficient and Elastic vRAN

Jincao Zhu, Kobus Van Der Merwe, Xenofon Foukas +1

In cellular networks, virtualized Radio Access Networks (vRANs) enable replacing traditional specialized hardware at cell sites with software running on commodity servers distribut…

cs.NI2024

Distributed AI Platform for the 6G RAN

Ganesh Ananthanarayanan, Matthew Balkwill, Xenofon Foukas +4

Cellular Radio Access Networks (RANs) are rapidly evolving towards 6G, driven by the need to reduce costs and introduce new revenue streams for operators and enterprises. In this c…

cs.DC2021★ 20 cited

Zeus: Locality-aware Distributed Transactions

Antonios Katsarakis, Yijun Ma, Zhaowei Tan +6

State-of-the-art distributed in-memory datastores (FaRM, FaSST, DrTM) provide strongly-consistent distributed transactions with high performance and availability. Transactions in t…

cs.DS2017

Communication complexity of approximate maximum matching in the message-passing model

Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic +1

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is…