Keval Vora
Impact in
- Hardware and Architecture top 5%
- Parallel Computing and Optimization Techniques
-
- Graph Theory and Algorithms
Papers in
-
- Parallel Computing and Optimization Techniques 13
-
- Graph Theory and Algorithms 23
- Co-authors
- Rajiv GuptaGuoqing XuFarzad KhorasaniLaxmi N. BhuyanZiang HuChen TianIulian NeamtiuKartik Nayak
- Journals
- ACM SIGPLAN Notices (3 papers)Proceedings of the ACM on Programming Languages (2 papers)ACM SIGOPS Operating Systems Review (3 papers)ACM Transactions on Architecture and Code Optimization (1 paper)USENIX Annual Technical Conference (3 papers)
- Partner nations
- United StatesCanadaUnited Kingdom
In The Last Decade
Keval Vora
31 papers receiving 643 citations
Peers
Comparison fields: 5 of 29
- Hardware and Architecture 213
- Computer Vision and Pattern Recognition 552
- Information Systems 263
- Computer Networks and Communications 252
- Artificial Intelligence 338
Countries citing papers authored by Keval Vora
This map shows the geographic impact of Keval Vora's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Keval Vora with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Keval Vora more than expected).
Fields of papers citing papers by Keval Vora
This network shows the impact of papers produced by Keval Vora. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Keval Vora. The network helps show where Keval Vora may publish in the future.
Co-authorship network
The 24 scholars most cited alongside Keval Vora, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Controlling Memory Footprint of Stateful Streaming Graph Processing | 2021 | 3 |
| 2 | 2021 | 7 | |
| 3 | 2021 | 26 | |
| 4 | LUMOS: Dependency-Driven Disk-based Graph Processing. | 2019 | 17 |
| 5 | 2019 | 0 | |
| 6 | 2019 | 3 | |
| 7 | 2019 | 62 | |
| 8 | 2019 | 12 | |
| 9 | 2018 | 2 | |
| 10 | 2017 | 4 | |
| 11 | Exploiting Asynchrony for Performance and Fault Tolerance in Distributed Graph Processing | 2017 | 1 |
| 12 | 2017 | 4 | |
| 13 | 2017 | 6 | |
| 14 | 2017 | 1 | |
| 15 | 2017 | 87 | |
| 16 | Load the edges you need: a generic I/O optimization for disk-based graph processing | 2016 | 57 |
| 17 | 2016 | 40 | |
| 18 | 2016 | 20 | |
| 19 | 2015 | 1 | |
| 20 | 2014 | 9 |
About Keval Vora
Keval Vora is a scholar working on Hardware and Architecture, Computer Vision and Pattern Recognition, Computer Networks and Communications, Information Systems and Artificial Intelligence, having authored 32 papers that have together received 660 indexed citations. Recurring topics across this work include Graph Theory and Algorithms (23 papers), Parallel Computing and Optimization Techniques (13 papers), Cloud Computing and Resource Management (12 papers), Advanced Graph Neural Networks (10 papers), Distributed systems and fault tolerance (7 papers), Advanced Data Storage Technologies (5 papers), Caching and Content Delivery (4 papers) and Advanced Database Systems and Queries (3 papers). The work is most often cited by research in Hardware and Architecture (213 citations), Computer Vision and Pattern Recognition (552 citations), Information Systems (263 citations), Computer Networks and Communications (252 citations) and Artificial Intelligence (338 citations). Keval Vora has collaborated with scholars based in United States, Canada and United Kingdom. Frequent co-authors include Rajiv Gupta, Guoqing Xu, Farzad Khorasani, Laxmi N. Bhuyan, Ziang Hu, Chen Tian, Iulian Neamtiu, Kartik Nayak, Amit Chavan and Xiangyu Zhang. Their work appears in journals such as ACM SIGPLAN Notices, Proceedings of the ACM on Programming Languages, ACM SIGOPS Operating Systems Review, ACM Transactions on Architecture and Code Optimization and USENIX Annual Technical Conference.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.