2 citations · 2 across the 6 of their papers we have counts for
6 papers
Linear Consistency for Proof-of-Stake Blockchains
Erica Blum, Aggelos Kiayias, Cristopher Moore +2
The blockchain data structure maintained via the longest-chain rule---popularized by Bitcoin---is a powerful algorithmic tool for consensus algorithms. Such algorithms achieve cons…
Small-Support Uncertainty Principles on over Finite Fields
Saad Quader, Alexander Russell, Ravi Sundaram
We establish an uncertainty principle for functions with constant support (where ). In particular, we show that for any const…
How to Realize a Graph on Random Points
Saad Quader, Alexander Russell
We are given an integer , a graph , and a uniformly random embedding of the vertices. We are interested in the probability that can be…
A (Somewhat Dated) Comparative Study of Betweenness Centrality Algorithms on GPU
Saad Quader
The problem of computing the Betweenness Centrality (BC) is important in analyzing graphs in many practical applications like social networks, biological networks, transportation n…
A Beginner's Guide to Counting Spanning Trees in a Graph
Saad Quader
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors…
Some New Equiprojective Polyhedra
Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz +3
A convex polyhedron is -equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of are -gon for some fixed value of …