High Density Compression of Log Files. - Balázs Rácz; András Lukács (Data Compression Conference, 2004)

A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph. - Dániel Fogaras; Balázs Rácz (EDBT Workshops, 2004)

nonordfp: An FP-growth variation without rebuilding the FP-tree. - Balázs Rácz (FIMI, 2004)

Towards Scaling Fully Personalized PageRank. - Dániel Fogaras; Balázs Rácz (WAW, 2004)

Scaling link-based similarity search. - Dániel Fogaras; Balázs Rácz (WWW, 2005)

Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments. - Dániel Fogaras; Balázs Rácz; Károly Csalogány; Tamás Sarlós (Internet Math., 2005)

Two-Phase Data Warehouse Optimized for Data Mining. - Balázs Rácz; Csaba István Sidló; András Lukács; András A. Benczúr (BIRTE, 2006)

To randomize or not to randomize: space optimal summaries for hyperlink analysis. - Tamás Sarlós; András A. Benczúr; Károly Csalogány; Dániel Fogaras; Balázs Rácz (WWW, 2006)

Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs. - Dániel Fogaras; Balázs Rácz (IEEE Trans. Knowl. Data Eng., 2007)

New results for finding common neighborhoods in massive graphs in the data stream model. - Adam L. Buchsbaum; Raffaele Giancarlo; Balázs Rácz (Theor. Comput. Sci., 2008)