Thejaka Amila Kanewala
Computer Science · Indiana University
Publications
30
Citations
122
Est. group size
—
Recurring co-author estimate
Active years
11
Publishing since 2014
Thejaka Amila Kanewala studies how to run large graph algorithms efficiently across many computers and processors working together. The work focuses on parallel and distributed computing techniques—such as counting triangles, finding shortest paths, and computing independent sets in graphs—while reducing the coordination bottlenecks that slow such systems down. This research connects graph algorithms with high-performance and cloud computing platforms.
Publication activity peaked around 2017 and has generally slowed in recent years, averaging under one paper per year over the last five years.
Generated by claude-opus-4-8 from public bibliographic data · Jul 11, 2026
- A Parallel Graph Environment for Real-World Data Analytics Workflows
2019
- Synchronization-Avoiding Graph Algorithms
2018
- Distributed, Shared-Memory Parallel Triangle Counting
2018
- POSTER
2017
- Families of Graph Algorithms: SSSP Case Study
Lecture notes in computer science · 2017
- Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering
2017
- Distributed-memory fast maximal independent set
2017
- Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study
arXiv (Cornell University) · 2017
- POSTER
ACM SIGPLAN Notices · 2017
- Abstract Graph Machine
arXiv (Cornell University) · 2016
- Context Matters
2016
- arXiv (Cornell University)×6
- Lecture notes in computer science×2
- Frontiers in High Performance Computing×1
- Frontiers in Big Data×1
- ACM SIGPLAN Notices×1
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 11, 2026.
Claim or correct this profile