Inducing Suffix and LCP Arrays in External Memory.

Vitaly Osipov

Timo Bingmann Johannes Fischer 0001 Vitaly Osipov Inducing Suffix and LCP Arrays in External Memory. 2.3:1-2.3:27 2016 21 ACM J. Exp. Algorithmics 1 https://doi.org/10.1145/2975593 db/journals/jea/jea21.html#Bingmann0O16

Vitaly Osipov Algorithm Engineering for fundamental Sorting and Graph Problems. 2014 Karlsruhe Institute of Technology http://digbib.ubka.uni-karlsruhe.de/volltexte/1000042377 https://nbn-resolving.org/urn:nbn:de:swb:90-423777 https://d-nb.info/1058625500 Timo Bingmann Johannes Fischer 0001 Vitaly Osipov Inducing Suffix and Lcp Arrays in External Memory. 88-102 2013 ALENEX https://doi.org/10.1137/1.9781611972931.8 conf/alenex/2013 db/conf/alenex/alenex2013.html#BingmannFO13 Marcel Birn Vitaly Osipov Peter Sanders 0001 Christian Schulz 0003 Nodari Sitchinava Efficient Parallel and External Matching. 659-670 2013 Euro-Par https://doi.org/10.1007/978-3-642-40047-6_66 conf/europar/2013 db/conf/europar/europar2013.html#BirnOSSS13

Marcel Birn Vitaly Osipov Peter Sanders 0001 Christian Schulz 0003 Nodari Sitchinava Efficient Parallel and External Matching http://arxiv.org/abs/1302.4587 2013 CoRR abs/1302.4587 db/journals/corr/corr1302.html#abs-1302-4587

Vitaly Osipov Parallel Suffix Array Construction for Shared Memory Architectures. 379-384 2012 SPIRE https://doi.org/10.1007/978-3-642-34109-0_40 conf/spire/2012 db/conf/spire/spire2012.html#Osipov12 Vitaly Osipov Peter Sanders 0001 Christian Schulz 0003 Engineering Graph Partitioning Algorithms. 18-26 2012 SEA https://doi.org/10.1007/978-3-642-30850-5_3 conf/wea/2012 db/conf/wea/sea2012.html#OsipovSS12

Siegfried Benkner Sabri Pllana Jesper Larsson Träff Philippas Tsigas Uwe Dolinsky Cédric Augonnet Beverly Bachmayer Christoph W. Kessler David Moloney Vitaly Osipov PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems. 28-41 2011 31 IEEE Micro 5 https://doi.org/10.1109/MM.2011.67 http://doi.ieeecomputersociety.org/10.1109/MM.2011.67 https://www.wikidata.org/entity/Q56784189 db/journals/micro/micro31.html#BenknerPTTDABKMO11

Vitaly Osipov Peter Sanders 0001 <i>n</i>-Level Graph Partitioning. 278-289 2010 ESA (1) https://doi.org/10.1007/978-3-642-15775-2_24 conf/esa/2010-1 db/conf/esa/esa2010-1.html#OsipovS10 Nikolaj Leischner Vitaly Osipov Peter Sanders 0001 GPU sample sort. 1-10 2010 IPDPS https://doi.org/10.1109/IPDPS.2010.5470444 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2010.5470444 conf/ipps/2010 db/conf/ipps/ipdps2010.html#LeischnerOS10

Vitaly Osipov Peter Sanders 0001 n-Level Graph Partitioning http://arxiv.org/abs/1004.4024 2010 CoRR abs/1004.4024 db/journals/corr/corr1004.html#abs-1004-4024

Vitaly Osipov Peter Sanders 0001 Johannes Singler The Filter-Kruskal Minimum Spanning Tree Algorithm. 52-61 2009 ALENEX https://doi.org/10.1137/1.9781611972894.5 conf/alenex/2009 db/conf/alenex/alenex2009.html#OsipovSS09 Ulrich Meyer 0001 Vitaly Osipov Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. 85-96 2009 ALENEX https://doi.org/10.1137/1.9781611972894.9 conf/alenex/2009 db/conf/alenex/alenex2009.html#MeyerO09

Nikolaj Leischner Vitaly Osipov Peter Sanders 0001 GPU sample sort http://arxiv.org/abs/0909.5649 2009 CoRR abs/0909.5649 db/journals/corr/corr0909.html#abs-0909-5649

Deepak Ajwani Ulrich Meyer 0001 Vitaly Osipov Improved External Memory BFS Implementation. 2007 conf/alenex/2007 ALENEX https://doi.org/10.1137/1.9781611972870.1 db/conf/alenex/alenex2007.html#AjwaniMO07 Deepak Ajwani Ulrich Meyer 0001 Vitaly Osipov Breadth First Search on Massive Graphs. 291-307 2006 The Shortest Path Problem conf/dimacs/dimacs74 db/conf/dimacs/dimacs74.html#AjwaniMO06 https://doi.org/10.1090/dimacs/074/11 Deepak Ajwani Cédric Augonnet Beverly Bachmayer Siegfried Benkner Timo Bingmann Marcel Birn Uwe Dolinsky Johannes Fischer 0001 Christoph W. Kessler Nikolaj Leischner Ulrich Meyer 0001 David Moloney Sabri Pllana Peter Sanders 0001 Christian Schulz 0003 Johannes Singler Nodari Sitchinava Jesper Larsson Träff Philippas Tsigas