Vitaly Osipov

15 papers A 5B 1C 1Journal 5Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
Inducing Suffix and LCP Arrays in External Memory.
ACM J. Exp. Algorithmics
Timo Bingmann, Johannes Fischer, Vitaly Osipov
2014 — —
Algorithm Engineering for fundamental Sorting and Graph Problems.
Vitaly Osipov
2013 J jnl
Efficient Parallel and External Matching
CoRR
Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
2013 — conf
Efficient Parallel and External Matching.
Euro-Par
Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
2013 A conf
Inducing Suffix and Lcp Arrays in External Memory.
ALENEX
Timo Bingmann, Johannes Fischer, Vitaly Osipov
2012 B conf
Engineering Graph Partitioning Algorithms.
SEA
Vitaly Osipov, Peter Sanders, Christian Schulz
2012 C conf
Parallel Suffix Array Construction for Shared Memory Architectures.
SPIRE
Vitaly Osipov
2011 J jnl
PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems.
IEEE Micro
Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Philippas Tsigas, Uwe Dolinsky, Cédric Augonnet, Beverly Bachmayer, Christoph W. Kessler, David Moloney, Vitaly Osipov
2010 A conf
GPU sample sort.
IPDPS
Nikolaj Leischner, Vitaly Osipov, Peter Sanders
2010 J jnl
n-Level Graph Partitioning
CoRR
Vitaly Osipov, Peter Sanders
2009 A conf
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm.
ALENEX
Ulrich Meyer, Vitaly Osipov
2009 J jnl
GPU sample sort
CoRR
Nikolaj Leischner, Vitaly Osipov, Peter Sanders
2009 A conf
The Filter-Kruskal Minimum Spanning Tree Algorithm.
ALENEX
Vitaly Osipov, Peter Sanders, Johannes Singler
2007 A conf
Improved External Memory BFS Implementation.
ALENEX
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
2006 — conf
Breadth First Search on Massive Graphs.
The Shortest Path Problem
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov