 | 2008 |
|---|
| 10 |       | Adam L. Buchsbaum,
Raffaele Giancarlo,
Balázs Rácz:
New results for finding common neighborhoods in massive graphs in the data stream model.
Theor. Comput. Sci. 407(1-3): 302-309 (2008) |
| 2007 |
|---|
| 9 | | Dániel Fogaras,
Balázs Rácz:
Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs.
IEEE Trans. Knowl. Data Eng. 19(5): 585-598 (2007) |
| 2006 |
|---|
| 8 | | Balázs Rácz,
Csaba István Sidló,
András Lukács,
András A. Benczúr:
Two-Phase Data Warehouse Optimized for Data Mining.
BIRTE 2006: 63-76 |
| 7 | | Tamás Sarlós,
András A. Benczúr,
Károly Csalogány,
Dániel Fogaras,
Balázs Rácz:
To randomize or not to randomize: space optimal summaries for hyperlink analysis.
WWW 2006: 297-306 |
| 2005 |
|---|
| 6 | | Dániel Fogaras,
Balázs Rácz:
Scaling link-based similarity search.
WWW 2005: 641-650 |
| 5 |  | Dániel Fogaras,
Balázs Rácz,
Károly Csalogány,
Tamás Sarlós:
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments.
Internet Mathematics 2(3): (2005) |
| 2004 |
|---|
| 4 | | Balázs Rácz,
András Lukács:
High Density Compression of Log Files.
Data Compression Conference 2004: 557 |
| 3 | | Dániel Fogaras,
Balázs Rácz:
A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph.
EDBT Workshops 2004: 557-567 |
| 2 | | Balázs Rácz:
nonordfp: An FP-growth variation without rebuilding the FP-tree.
FIMI 2004 |
| 1 | | Dániel Fogaras,
Balázs Rácz:
Towards Scaling Fully Personalized PageRank.
WAW 2004: 105-117 |
