• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
Iowa State University
College of Engineering

Srikanta Tirthapura

  • Home
  • Research Group
  • Publications
  • Teaching
  • Professional Service
  • News

“Work-Efficient Parallel and Incremental Graph Connectivity” accepted to Euro-Par 2016 Conference

April 26, 2016 By snt

Our work titled “Work-Efficient Parallel and Incremental Graph Connectivity”, authored by Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu has been accepted to appear in the Euro-Par 2016 Conference, to be help in Grenoble, France. This presents efficient methods implement the popular “Union Find” data structure in parallel, with an application to incremental graph connectivity. EuroPar is a high quality conference on parallel processing, held in Europe each year.

Filed Under: Uncategorized

Recent News

  • Tutorial at the Web Conference “Subgraph counting: the methods behind the madness” May 15, 2019
  • “Parallel Streaming Random Sampling” accepted to Europar 2019 May 8, 2019
  • “Incremental Maintenance of Maximal Cliques in a Dynamic Graph” accepted to the VLDB Journal April 2, 2019
  • Congrats, Dr. Apurba Das March 15, 2019
  • “Weighted Reservoir Sampling from Distributed Streams” accepted to PODS 2019 March 11, 2019
  • Tutorial on Subgraph Counting at The Web Conference 2019 February 12, 2019
  • “Stratified Random Sampling over Streaming and Stored Data” accepted to EDBT 2019 November 26, 2018
  • “Enumerating Top-k Quasi-Cliques” accepted to IEEE Bigdata 2018 October 22, 2018
  • “Shared-Memory Parallel Maximal Clique Enumeration” accepted to HiPC 2018 September 9, 2018
  • “Variance-Reduced Stochastic Gradient Descent on Streaming Data” accepted to NIPS 2018 September 7, 2018

Copyright © 2025 · Iowa State University of Science and Technology. All rights reserved. · Log in