203 citations · 296 across the 21 of their papers we have counts for
6 papers · 1 filter
An Exact, Linear Time Barabási-Albert Algorithm
Giorgos Stamatelatos, Pavlos S. Efraimidis
This paper presents the development of a new class of algorithms that accurately implement the preferential attachment mechanism of the Barabási-Albert (BA) model to generate scale…
About Weighted Random Sampling in Preferential Attachment Models
Giorgos Stamatelatos, Pavlos S. Efraimidis
The Barabási-Albert model is a popular scheme for creating scale-free graphs but has been previously shown to have ambiguities in its definition. In this paper we discuss a new amb…
On Money as a Means of Coordination between Network Packets
Pavlos S. Efraimidis, Remous-Aris Koutsiamanis
In this work, we apply a common economic tool, namely money, to coordinate network packets. In particular, we present a network economy, called PacketEconomy, where each flow is mo…
An exact and O(1) time heaviest and lightest hitters algorithm for sliding-window data streams
Remous-Aris Koutsiamanis, Pavlos S. Efraimidis
In this work we focus on the problem of finding the heaviest-k and lightest-k hitters in a sliding window data stream. The most recent research endeavours have yielded an epsilon-a…
(α, β) Fibonacci Search
Pavlos S. Efraimidis
Knuth [12, Page 417] states that "the (program of the) Fibonaccian search technique looks very mysterious at first glance" and that "it seems to work by magic". In this work, we sh…
Weighted Random Sampling over Data Streams
Pavlos S. Efraimidis
In this work, we present a comprehensive treatment of weighted random sampling (WRS) over data streams. More precisely, we examine two natural interpretations of the item weights,…