Simple graph algorithms such as PageRank have been the target of numerous hardware
accelerators. Yet, there also exist much more complex graph mining algorithms for problems …

There has been a growing interest in the graph-streaming setting where a continuous
stream of graph updates is mixed with graph queries. In principle, purely-functional trees are …

The problem of computing (α, β α, β)-core in a bipartite graph for given α α and β β is a
fundamental problem in bipartite graph analysis and can be used in many applications such …

ParlayLib is a C++ library for develo** efficient parallel algorithms and software on shared-
memory multicore machines. It provides additional tools and primitives that go beyond what …

Various applications model problems as streaming graphs, which need to quickly apply a
stream of updates and run algorithms on the updated graph. Furthermore, many dynamic …

Differentially private algorithms allow large-scale data analytics while preserving user
privacy. Designing such algorithms for graph data is gaining importance with the growth of …

Intel Optane DC Persistent Memory (Optane PMM) is a new kind of byte-addressable
memory with higher density and lower cost than DRAM. This enables the design of …

Mathematical Selection is a method in which we select a particular choice from a set of such.
It have always been an interesting field of study for mathematicians. Accordingly …

Approximate nearest-neighbor search (ANNS) algorithms are a key part of the modern deep
learning stack due to enabling efficient similarity search over high-dimensional vector space …

Due to the limited capacity of GPU memory, the majority of prior work on graph applications
on GPUs has been restricted to graphs of modest sizes that fit in memory. Recent hardware …