Get started
Author

Meher Chaitanya

Observed names: Chaitanya Meher, Chaitanya, Meher, Meher Chaitanya Pindiprolu, Pindiprolu, Meher Chaitanya
ORCID: 0009-0004-5763-8862
Observed ORCIDs: 0009-0004-5763-8862, 0000-0002-9496-7452
OpenAlex ID: A5066246307
Efficient Multicore Algorithms For Identifying Biconnected Components
2016 · Meher Chaitanya, Kishore Kothapalli · International Journal of Networking and Computing · 13
PDF
Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality
2016 · Charudatt Pachorkar, Meher Chaitanya, et al. · IEEE International Conference on High Performance Computing, Data, and Analytics · 10
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures
2014 · Dip Sankar Banerjee, Ashutosh Kumar, et al. · Journal of Parallel and Distributed Computing · 9
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems
2017 · Debarshi Dutta, Meher Chaitanya, et al. · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · 4
A Simple Parallel Algorithm for Biconnected Components in Sparse Graphs
2015 · Meher Chaitanya, Kishore Kothapalli · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · 3
Decentralized Discourse: Interaction Dynamics on Mastodon
2025 · Michael Brauweiler, Meher Chaitanya Pindiprolu, et al. · ACM Web Science Conference (WebSci) · 2
PDF
Tight Sampling in Unbounded Networks
2024 · Kshitijaa Jaglan, Meher Chaitanya Pindiprolu, et al. · Proceedings of the International AAAI Conference on Web and Social Media · 2
PDF
Hardness Results for Seeding Complex Contagion with Neighborhoods
2022 · Meher Chaitanya, Ulrik Brandes · Studies in computational intelligence · 1
Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems
2018 · Debarshi Dutta, Meher Chaitanya, et al. · International Journal of Networking and Computing · 1
PDF
Does Muon Need Fine-Grained Spectral Shaping?
2026 · Chaitanya, Meher, Zhou, Tianyi, et al. · arXiv (Cornell University)
PDF
CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs
2026 · Chaitanya, Meher, Musco, Cameron, et al. · arXiv (Cornell University)
PDF
Thresholded Local Hyper-Flow Diffusion
2026 · Chaitanya, Meher, Dalleiger, Sebastian, et al. · arXiv (Cornell University)
PDF
Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning
2026 · Chaitanya, Meher, Le, My, et al. · arXiv (Cornell University)
PDF
Adjacency Search Embeddings
2025 · Chaitanya, Meher, Jaglan, Kshitijaa, et al.
An SDP Formulation for Minimizing p-th Order Controversy with Unknown Initial Opinions
2025 · Meher Chaitanya, Adarsh Barik, et al. · Studies in computational intelligence
媒介中心性への応用を持つグラフの効率的並列耳分解【Powered by NICT】
2016 · Pachorkar Charudatt, Chaitanya Meher, et al. · IEEE Conference Proceedings
Works count: 17
Citation count: 45
H-index: 4
I10-index: 2
Year
Topic
Type