| Title | Author | Source |
|---|---|---|
| Breadth First Search on Massive Graphs | D. Ajwani, U. Meyer and V. Osipov |
DIMACS Book Series |
| Title | Author | Conference | Date |
|---|---|---|---|
| Efficient Parallel and External Matching |
Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava |
Euro-Par 2013 | August 2013 |
| Inducing Suffix and LCP Arrays in External Memory | Timo Bingmann, Johannes Fischer, Vitaly Osipov |
Workshop on Algorithm Engineering and Experiments (ALENEX 2013) |
January 2013 |
| Parallel Suffix Array Construction for Shared Memory Architectures | Vitaly Osipov | SPIRE 2013 | October 2013 |
| Engineering Graph Partitioning Algorithms | Vitaly Osipov, Peter Sanders, Christian Schulz | 11'th International Symposium on Experimental Algorithms (SEA'2012) | Jun 7-9, 2012 |
| n-Level Graph Partitioning | V. Osipov and P. Sanders |
ESA 2010 |
September 2010 |
| GPU Sample Sort | Nikolaj Leischner, Vitaly Osipov and Peter Sanders |
IPDPS 2010 |
April 2010 |
| The Filter-Kruskal Minimum Spanning Tree Algorithm | V. Osipov, P. Sanders, J. Singler |
ALENEX 2009 |
January 2009 |
| Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm | U. Meyer, V.Osipov |
ALENEX 2009 |
January 2009 |
| Improved External Memory BFS Implementation | D. Ajwani, U. Meyer, V. Osipov |
ALENEX 2007 |
January 2007 |