Kasimir Gabert

According to our database1, Kasimir Gabert authored at least 12 papers between 2018 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Finding Dense Regions of Rapidly Changing Graphs.
PhD thesis, 2022

Auditable, Available and Resilient Private Computation on the Blockchain via MPC.
IACR Cryptol. ePrint Arch., 2022

Batch Dynamic Algorithm to Find k-Cores and Hierarchies.
CoRR, 2022

Batch dynamic algorithm to find <i>k</i>-core hierarchies.
Proceedings of the GRADES-NDA '22: Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2022

2021
A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores.
Proceedings of the WSDM '21, 2021

EIGA: elastic and scalable dynamic graph analysis.
Proceedings of the International Conference for High Performance Computing, 2021

Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

PIGO: A Parallel Graph Input/Output Library.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

Parallel graph algorithms by blocks: from I/O to algorithms.
Proceedings of the CF '21: Computing Frontiers Conference, 2021

2019
Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
Logarithmic Radix Binning and Vectorized Triangle Counting.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Fast and Adaptive List Intersections on the GPU.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018


  Loading...