default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Singler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j5]Peter Sanders, Johannes Singler, Rob van Stee:
Real-time integrated prefetching and caching. J. Sched. 16(1): 47-58 (2013)- 2011
- [j4]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. 1(2): 151-163 (2011) - [p3]Peter Sanders, Johannes Singler:
Shortest Paths. Algorithms Unplugged 2011: 317-324 - 2010
- [b1]Johannes Singler:
Algorithm libraries for multi-core processors. Karlsruhe Institute of Technology, 2010 - [j3]Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. Comput. Geom. 43(8): 663-677 (2010) - [c13]Marcel Birn, Manuel Holtgrewe, Peter Sanders, Johannes Singler:
Simple and Fast Nearest Neighbor Search. ALENEX 2010: 43-54 - [c12]Roman Dementiev, Johannes Singler:
Libraries. Algorithm Engineering 2010: 290-324 - [c11]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Green Computing Conference 2010: 191-202 - [c10]Mirko Rahn, Peter Sanders, Johannes Singler:
Scalable distributed-memory external sorting. ICDE 2010: 685-688 - [p2]Johannes Singler:
Algorithmenbibliotheken für Mehrkern-Prozessoren. Ausgezeichnete Informatikdissertationen 2010: 341-350
2000 – 2009
- 2009
- [j2]Felix Putze, Peter Sanders, Johannes Singler:
Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics 14 (2009) - [c9]Vitaly Osipov, Peter Sanders, Johannes Singler:
The Filter-Kruskal Minimum Spanning Tree Algorithm. ALENEX 2009: 52-61 - [c8]Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. SCG 2009: 217-226 - [c7]Andreas Beckmann, Roman Dementiev, Johannes Singler:
Building a parallel pipelined external memory algorithm library. IPDPS 2009: 1-10 - [i1]Mirko Rahn, Peter Sanders, Johannes Singler:
Scalable Distributed-Memory External Sorting. CoRR abs/0910.2582 (2009) - 2008
- [j1]Leonor Frias, Johannes Singler, Peter Sanders:
Single-Pass List Partitioning. Scalable Comput. Pract. Exp. 9(3) (2008) - [c6]Leonor Frias, Johannes Singler, Peter Sanders:
Single-Pass List Partitioning. CISIS 2008: 817-821 - [c5]Johannes Singler, Benjamin Konsik:
The GNU libstdc++ parallel mode: software engineering considerations. IWMSE@ICSE 2008: 15-22 - [p1]Peter Sanders, Johannes Singler:
Kürzeste Wege. Taschenbuch der Algorithmen 2008: 345-352 - 2007
- [c4]Leonor Frias, Johannes Singler:
Parallelization of Bulk Operations for STL Dictionaries. Euro-Par Workshops 2007: 49-58 - [c3]Johannes Singler, Peter Sanders, Felix Putze:
MCSTL: The Multi-core Standard Template Library. Euro-Par 2007: 682-694 - [c2]Felix Putze, Peter Sanders, Johannes Singler:
MCSTL: the multi-core standard template library. PPoPP 2007: 144-145 - [c1]Felix Putze, Peter Sanders, Johannes Singler:
Cache-, Hash- and Space-Efficient Bloom Filters. WEA 2007: 108-121
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-04-24 22:51 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:
