default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVitaly Osipov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j2]Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and LCP Arrays in External Memory. ACM J. Exp. Algorithmics 21(1): 2.3:1-2.3:27 (2016)- 2014
- [b1]Vitaly Osipov:
Algorithm Engineering for fundamental Sorting and Graph Problems. Karlsruhe Institute of Technology, 2014 - 2013
- [c10]Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and Lcp Arrays in External Memory. ALENEX 2013: 88-102 - [c9]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz
, Nodari Sitchinava:
Efficient Parallel and External Matching. Euro-Par 2013: 659-670 - [i3]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava:
Efficient Parallel and External Matching. CoRR abs/1302.4587 (2013) - 2012
- [c8]Vitaly Osipov:
Parallel Suffix Array Construction for Shared Memory Architectures. SPIRE 2012: 379-384 - [c7]Vitaly Osipov, Peter Sanders, Christian Schulz:
Engineering Graph Partitioning Algorithms. SEA 2012: 18-26 - 2011
- [j1]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. IEEE Micro 31(5): 28-41 (2011) - 2010
- [c6]Vitaly Osipov, Peter Sanders:
n-Level Graph Partitioning. ESA (1) 2010: 278-289 - [c5]Nikolaj Leischner, Vitaly Osipov, Peter Sanders:
GPU sample sort. IPDPS 2010: 1-10 - [i2]Vitaly Osipov, Peter Sanders:
n-Level Graph Partitioning. CoRR abs/1004.4024 (2010)
2000 – 2009
- 2009
- [c4]Vitaly Osipov, Peter Sanders, Johannes Singler:
The Filter-Kruskal Minimum Spanning Tree Algorithm. ALENEX 2009: 52-61 - [c3]Ulrich Meyer, Vitaly Osipov:
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX 2009: 85-96 - [i1]Nikolaj Leischner, Vitaly Osipov, Peter Sanders:
GPU sample sort. CoRR abs/0909.5649 (2009) - 2007
- [c2]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Improved External Memory BFS Implementation. ALENEX 2007 - 2006
- [c1]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Breadth First Search on Massive Graphs. The Shortest Path Problem 2006: 291-307
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
