Computational capabilities of small-world Boolean networks. - Joseph T. Lizier; Siddharth Pritam; Mikhail Prokopenko (ECAL, 2011)

Information Dynamics in Small-World Boolean Networks. - Joseph T. Lizier; Siddharth Pritam; Mikhail Prokopenko (Artif. Life, 2011)

"Infographics" team: Selecting Control Parameters via Maximal Fisher Information. - Siddharth Pritam (CoRR, 2014)

Strong Collapse for Persistence. - Jean-Daniel Boissonnat; Siddharth Pritam; Divyansh Pareek (ESA, 2018)

Computing Persistent Homology of Flag Complexes via Strong Collapses. - Jean-Daniel Boissonnat; Siddharth Pritam (SoCG, 2019)

Edge Collapse and Persistence of Flag Complexes. - Jean-Daniel Boissonnat; Siddharth Pritam (SoCG, 2020)

Collapses and Persistent Homology. (Effondrements et homologie persistante). - Siddharth Pritam (2020)

Swap, Shift and Trim to Edge Collapse a Filtration. - Marc Glisse; Siddharth Pritam (SoCG, 2022)

Filtration-Domination in Bifiltered Graphs. - Ángel Javier Alonso; Michael Kerber; Siddharth Pritam (ALENEX, 2023)

Strong Collapse of Random Simplicial Complexes. - Jean-Daniel Boissonnat; Kunal Dutta; Soumik Dutta; Siddharth Pritam (CoRR, 2023)

On Edge Collapse of Random Simplicial Complexes. - Jean-Daniel Boissonnat; Kunal Dutta; Soumik Dutta; Siddharth Pritam (SoCG, 2024)

Classification of Temporal Graphs using Persistent Homology. - Siddharth Pritam; Rohit Roy; Madhav Cherupilil Sajeev (CoRR, 2025)