Marco Bressan, Ph.D.Postdoctoral Student |
What I do:
|
Research and Projects
| psort, a fast sorting library for large datasets | Lead developer
of psort, a C++ sorting library
for large datasets on external memory
(see http://psort.dei.unipd.it/). psort was the fastest sorting library for PC-class machines according to the PennySort benchmark 2008, 2009, 2010 (tied) and 2011, categories Indy and Daytona (see http://sortbenchmark.org/). We are collaborating with research institutions and the industry. |
|
| Social networks and mechanisms | Theory of mechanisms in economic, peer-to-peer, and social networks. Small-world phenomenon. Efficient condivision of private trasportation with local or global information, with published results and a business plan presented at the ``StartCup Veneto 2009'' competition. | |
| Link analysis, ranking, and IR | Algorithmical and mathematical aspects of graph ranking as a general problem. Robustness of ranking algorithms (i.e. PageRank) to variations in graph-independent factors. Efficient local (considering only small subgraphs) ranking of nodes. These research lines constituted my Ph.D. thesis ``Ranking Robustly''. |
Contact Information
Marco Bressan
Advanced Computing Group
Dept. of Information Engineering
University of Padova
Mail: bressanm@dei.unipd.it
Phone: +39 049 8277954
Fax: +39 049 8277799
Postal address:
via Gradenigo, 6/B
I-35131 Padova, Italy
University of Padova
