5 citations · 8 across the 4 of their papers we have counts for
4 papers
On certain topological indices of graphs
Arber Avdullahu, Slobodan Filipovski
In this paper we give new bounds for a several vertex-based and edge-based topological indices of graphs: Albertson irregularity index, degree variance index, Mostar and the first…
Compact Merkle Multiproofs
Lum Ramabaja, Arber Avdullahu
The compact Merkle multiproof is a new and significantly more memory-efficient way to generate and verify sparse Merkle multiproofs. A standard sparse Merkle multiproof requires to…
The Bloom Tree
Lum Ramabaja, Arber Avdullahu
We introduce a data structure that allows for efficient (probabilistic) presence proofs and non-probabilistic absence proofs in a bandwidth efficient and secure way. The Bloom tree…
The Distributed Bloom Filter
Lum Ramabaja, Arber Avdullahu
The Distributed Bloom Filter is a space-efficient, probabilistic data structure designed to perform more efficient set reconciliations in distributed systems. It guarantees eventua…