Vitaly Osipov

According to our database, Vitaly Osipov authored at least 13 papers between 2006 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Inducing Suffix and LCP Arrays in External Memory.

Timo Bingmann, Johannes Fischer, Vitaly Osipov

ACM J. Exp. Algorithmics, 2016

2014

Algorithm Engineering for fundamental Sorting and Graph Problems.

Vitaly Osipov

PhD thesis, 2014

2013

Efficient Parallel and External Matching.

Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012

Engineering Graph Partitioning Algorithms.

Vitaly Osipov, Peter Sanders, Christian Schulz

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Parallel Suffix Array Construction for Shared Memory Architectures.

Vitaly Osipov

Proceedings of the String Processing and Information Retrieval, 2012

2011

PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems.

Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Philippas Tsigas, Uwe Dolinsky, Cédric Augonnet, Beverly Bachmayer, Christoph W. Kessler, David Moloney, Vitaly Osipov

IEEE Micro, 2011

2010

n-Level Graph Partitioning

Vitaly Osipov, Peter Sanders

CoRR, 2010

GPU sample sort.

Nikolaj Leischner, Vitaly Osipov, Peter Sanders

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

<i>n</i>-Level Graph Partitioning.

Vitaly Osipov, Peter Sanders

Proceedings of the Algorithms, 2010

2009

The Filter-Kruskal Minimum Spanning Tree Algorithm.

Vitaly Osipov, Peter Sanders, Johannes Singler

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm.

Ulrich Meyer, Vitaly Osipov

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2007

Improved External Memory BFS Implementation.

Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Breadth First Search on Massive Graphs.

Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Proceedings of the Shortest Path Problem, 2006