49 citations · 263 across the 36 of their papers we have counts for
5 papers · 1 filter
Approximate Maximum Matching in Random Streams
Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai +2
In this paper, we study the problem of finding a maximum matching in the semi-streaming model when edges arrive in a random order. In the semi-streaming model, an algorithm receive…
Coding for Sunflowers
Anup Rao
A sunflower is a family of sets that have the same pairwise intersections. We simplify a recent result of Alweiss, Lovett, Wu and Zhang that gives an upper bound on the size of eve…
Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs
Ryan A. Rossi, Anup Rao, Sungchul Kim +3
In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. Th…
Efficient Second-Order Shape-Constrained Function Fitting
David Durfee, Yu Gao, Anup B. Rao +1
We give an algorithm to compute a one-dimensional shape-constrained function that best fits given data in weighted- norm. We give a single algorithm that works for a va…
Heterogeneous Network Motifs
Ryan A. Rossi, Nesreen K. Ahmed, Aldo Carranza +4
Many real-world applications give rise to large heterogeneous networks where nodes and edges can be of any arbitrary type (e.g., user, web page, location). Special cases of such he…