Computing Frequent Elements Using Gossip. - Bibudh Lahiri; Srikanta Tirthapura (SIROCCO, 2008)

Finding correlated heavy-hitters over data streams. - Bibudh Lahiri; Srikanta Tirthapura (IPCCC, 2009)

Stream Sampling. - Bibudh Lahiri; Srikanta Tirthapura (Encyclopedia of Database Systems, 2009)

Identifying frequent items in a network using gossip. - Bibudh Lahiri; Srikanta Tirthapura (J. Parallel Distributed Comput., 2010)

Finding Critical Thresholds for Defining Bursts. - Bibudh Lahiri; Ioannis Akrotirianakis; Fabian Moerchen (DaWaK, 2011)

Space-efficient tracking of persistent items in a massive data stream. - Bibudh Lahiri; Jaideep Chandrashekar; Srikanta Tirthapura (DEBS, 2011)

Finding Critical Thresholds for Defining Bursts in Event Logs. - Bibudh Lahiri; Ioannis Akrotirianakis; Fabian Moerchen (Trans. Large Scale Data Knowl. Centered Syst., 2013)

Identifying correlated heavy-hitters in a two-dimensional data stream. - Bibudh Lahiri; Arko Provo Mukherjee; Srikanta Tirthapura (Data Min. Knowl. Discov., 2016)

Stream Sampling. - Bibudh Lahiri; Srikanta Tirthapura (Encyclopedia of Database Systems (2nd ed.), 2018)