DBLP and Google Scholar records.

To Appear

2011

1. D.A. Bader, C.E. Heitsch, and K. Madduri.
   Large-scale network analysis.
   In J. Kepner and J. Gilbert, editors, Graph Algorithms in the Language of Linear Algebra. SIAM, 2011.

2010

1. A. Chandramowlishwaran, K. Madduri, and R. Vuduc.
   Diagnosis, tuning, and redesign for multicore performance: A case study of the fast multipole method.
   In Proc. ACM/IEEE Conf. on High Performance Computing (SC 2010), New Orleans, LA, November 2010. ACM/IEEE.
2. K. Wu, K. Madduri, and S. Canon.
   Multi-level bitmap indexes for flash memory storage
   . In Proc. 14th Int'l. Database Engineering & Applications Symposium (IDEAS '10), pages 114–116, Montreal, Canada, August 2010. ACM.
3. A. Kaiser, S. Williams, K. Madduri, K. Ibrahim, D.H. Bailey, J. Demmel, and E. Strohmaier.
   A case for a testbed of kernels for software/hardware co-design research
   . In Proc. 2nd USENIX Workshop on Hot Topics in Parallelism, Berkeley, CA, June 2010. USENIX.
4. J.B. Orlin, K. Madduri, K. Subramani, and M. Williamson.
   A faster algorithm for the single source shortest path problem with few distinct positive lengths.
   Journal of Discrete Algorithms, 8(2):189--198, 2010.

2009

1. K. Madduri, S. Williams, S. Ethier, L. Oliker, J. Shalf, E. Strohmaier, and K. Yelick.
   Memory-efficient optimization of gyrokinetic particle-to-grid interpolation for multicore processors.
   In Proc. ACM/IEEE Conf. on High Performance Computing (SC 2009), Portland, OR, November 2009. ACM/IEEE.
2. K. Madduri and K. Wu.
   Efficient joins with compressed bitmap indices.
   In Proc. 18th ACM Conf. on Information and Knowledge Management (CIKM 2009), pages 1017--1026, Hong Kong, China, November 2009. ACM.
3. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak.
   Parallel shortest path algorithms for solving large-scale instances.
   In C. Demetrescu, A.V. Goldberg, and D. Johnson, editors, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74, pages 249--290. American Mathematical Society, 2009.
4. X. Gu, K. Madduri, K. Subramani, and H-J. Lai.
   Improved algorithms for detecting negative cost cycles in undirected graphs.
   In X. Deng, J.E. Hopcroft, and J. Xue, editors, Proc. 3rd Int'l. Frontiers of Algorithmics Workshop (FAW 2009), volume 5598 of LNCS, pages 40--50, Hefei, China, June 2009. Springer.
5. K. Subramani and K. Madduri.
   Two-level heaps: a new priority queue structure with applications to the single source shortest path problem.
   In D-Z. Du, X. Hu, and P.M. Pardalos, editors, Proc. 3rd Int'l. Conf. on Combinatorial Optimization and Applications (COCOA 2009), volume 5573 of LNCS, pages 186--196, Huangshan, China, June 2009. Springer.
   
6. K. Madduri, D. Ediger, K. Jiang, D.A. Bader, and D. Chavarria-Miranda.
   A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets.
   In Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP 2009), Rome, Italy, May 2009. IEEE Computer Society.
7. K. Madduri and D.A. Bader.
   Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis.
   In Proc. 23rd IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS 2009), Rome, Italy, May 2009. IEEE Computer Society.

2008

1. D.A. Bader and K. Madduri.
   A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms.
   Parallel Computing, 34(11):627--639, 2008.
2. K. Subramani and K. Madduri.
   A Randomized Queueless Algorithm for Breadth-First Search.
   Int'l. Journal of Computers and their Applications, 15(3):177--186, 2008.
3. K. Madduri, D.A. Bader, J.W. Berry, J.R. Crobak, and B.A. Hendrickson. Multithreaded algorithms for processing massive graphs. In D.A. Bader, editor, Petascale Computing: Algorithms and Applications, chapter 12, pages 237--262. Chapman and Hall/CRC, 2008.
4. D.A. Bader and K. Madduri.
   SNAP: Small-world Network Analysis and Partitioning: an open-source parallel graph framework for the exploration of large-scale networks.
   In Proc. 22nd IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS 2008), Miami, FL, April 2008. IEEE.

2007

1. D.A. Bader, V. Agarwal, K. Madduri, and S. Kang.
   High performance combinatorial algorithm design on the Cell Broadband Engine processor.
   Parallel Computing, 33(10-11):720--740, 2007.
2. D.A. Bader, K. Madduri, G. Cong, and J. Feo.
   Design of multithreaded algorithms for combinatorial problems
   . In S. Rajasekaran and J. Reif, editors, Parallel Computing: Models, Algorithms, and Applications, chapter 31, pages 1--29. Chapman and Hall/CRC, 2007.
3. D.A. Bader, K. Madduri, J.R. Gilbert, V. Shah, J. Kepner, T. Meuse, and A. Krishnamurthy.
   Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems.
   CTWatch Quarterly, 2(4B):41--51, 2006.
4. K. Subramani and K. Madduri.
   Accomplishing Approximate FCFS fairness without queues.
   In S. Aluru, M. Parashar, R. Badrinath, and V.K. Prasanna, editors, Proc. 14th Int'l. Conf. on High Performance Computing (HiPC 2007), volume 4873 of LNCS, pages 540--551, Goa, India, December 2007. Springer.
5. D.A. Bader, S. Kintali, K. Madduri, and M. Mihail.
   Approximating betweenness centrality.
   In A. Bonato and F.R.K. Chung, editors, Proc. 5th Int'l. Workshop on Algorithms and Models for the Web-Graph (WAW 2007), volume 4863 of LNCS, pages 124--137, San Diego, CA, December 2007. Springer.
6. J.R. Crobak, J. Berry, K. Madduri, and D.A. Bader.
   Advanced shortest paths algorithms on a massively-multithreaded architecture.
   In Proc. 1st Workshop on Multithreaded Architectures and Applications (MTAAP 2007), Long Beach, CA, March 2007. IEEE.
7. D.A. Bader, V. Kanade, and K. Madduri.
   SWARM: A Parallel Programming Framework for Multicore Processors.
   In Proc. 1st Workshop on Multithreaded Architectures and Applications (MTAAP 2007), Long Beach, CA, March 2007. IEEE.
8. D.A. Bader, V. Agarwal, and K. Madduri.
   On the design and analysis of irregular algorithms on the Cell processor: A case study of list ranking.
   In Proc. 21st IEEE Int'l. Parallel and Distributed Processing Symposium (IPDPS 2007), Long Beach, CA, March 2007. IEEE.
9. D.A. Bader and K. Madduri.
   A graph-theoretic analysis of the human protein-interaction network using multi-core parallel algorithms.
   In Proc. 6th IEEE Int'l. Workshop on High-Performance Computational Biology (HiCOMB 2007), Long Beach, CA, March 2007. IEEE.
10. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak.
    An experimental study of a parallel shortest path algorithm for solving large-scale graph instances.
    In Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), New Orleans, LA, January 2007. SIAM.

2006

1. D.A. Bader and K. Madduri.
   Parallel algorithms for evaluating centrality indices in real-world networks.
   In Proc. 35th Int'l. Conf. on Parallel Processing (ICPP 2006), pages 539--550, Columbus, OH, August 2006. IEEE Computer Society.
2. D.A. Bader and K. Madduri.
   Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2.
   In Proc. 35th Int'l. Conf. on Parallel Processing (ICPP 2006), pages 523--530, Columbus, OH, August 2006. IEEE Computer Society.

2005

1. D.A. Bader and K. Madduri.
   Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors.
   In D.A. Bader, M. Parashar, S. Varadarajan, and V.K. Prasanna, editors, Proc. 12th Int'l. Conf. on High Performance Computing (HiPC 2005), volume 3769 of LNCS, pages 465--476, Goa, India, December 2005. Springer.
   

2004

1. D.A. Bader and K. Madduri.
   A parallel state assignment algorithm for finite state machines.
   In L. Bouge and V.K. Prasanna, editors, Proc. 11th Int'l. Conf. on High Performance Computing (HiPC 2004), volume 3296 of LNCS, pages 297--308, Goa, India, December 2004. Springer.
2. K. Madduri, K.H. Aparna, and V.S. Chakravarthy.
   PATRAM: A handwritten word processor for indian languages.
   In Proc. 9th Int'l. Workshop on Frontiers in Handwriting Recognition (IWFHR 2004), pages 557--562, Tokyo, Japan, August 2004. IEEE Computer Society.