default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Wimmer 0003
Person information
- affiliation: University of Vienna, Austria
Other persons with the same name
- Martin Wimmer 0001
![[0009-0009-2716-8886]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0009-2716-8886")
— Siemens AG, Munich, Germany (and 1 more) - Martin Wimmer 0002 — University of Regensburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c10]Jakob Gruber, Jesper Larsson Träff, Martin Wimmer:
Brief Announcement: Benchmarking Concurrent Priority Queues. SPAA 2016: 361-362- [i6]Jakob Gruber, Jesper Larsson Träff, Martin Wimmer:
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures. CoRR abs/1603.05047 (2016) - 2015
- [c9]Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas:
The lock-free k-LSM relaxed priority queue. PPoPP 2015: 277-278 - [i5]Martin Wimmer, Jakob Gruber, Jesper Larsson Träff, Philippas Tsigas:
The Lock-free k-LSM Relaxed Priority Queue. CoRR abs/1503.05698 (2015) - 2014
- [c8]Martin Wimmer, Francesco Versaci, Jesper Larsson Träff, Daniel Cederman, Philippas Tsigas:
Data structures for task-based priority scheduling. PPoPP 2014: 379-380 - [i4]Jesper Larsson Träff, Martin Wimmer:
An improved, easily computable combinatorial lower bound for weighted graph bipartitioning. CoRR abs/1410.0462 (2014) - 2013
- [c7]Martin Wimmer:
Wait-free Hyperobjects for Task-Parallel Programming Systems. IPDPS 2013: 803-812 - [c6]Martin Wimmer, Manuel Pöter, Jesper Larsson Träff:
The Pheet Task-Scheduling Framework on the Intel® Xeon Phi Coprocessor and other Multicore Architectures. IPDPS Workshops 2013: 1587-1596 - [c5]Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas:
Work-stealing with configurable scheduling strategies. PPoPP 2013: 315-316 - [i3]Martin Wimmer, Daniel Cederman, Jesper Larsson Träff, Philippas Tsigas:
Configurable Strategies for Work-stealing. CoRR abs/1305.6474 (2013) - [i2]Martin Wimmer, Daniel Cederman, Francesco Versaci, Jesper Larsson Träff, Philippas Tsigas:
Data Structures for Task-based Priority Scheduling. CoRR abs/1312.2501 (2013) - 2012
- [c4]Christoph W. Kessler, Usman Dastgeer, Mudassar Majeed, Nathalie Furmento, Samuel Thibault, Raymond Namyst, Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Martin Wimmer:
Abstract: Leveraging PEPPHER Technology for Performance Portable Supercomputing. SC Companion 2012: 1395-1396 - [c3]Christoph W. Keßler, Usman Dastgeer, Mudassar Majeed, Nathalie Furmento, Samuel Thibault, Raymond Namyst, Siegfried Benkner, Sabri Pllana, Jesper Larsson Träff, Martin Wimmer:
Poster: Leveraging PEPPHER Technology for Performance Portable Supercomputing. SC Companion 2012: 1397 - 2011
- [c2]Martin Wimmer, Jesper Larsson Träff:
An Extended Work-Stealing Framework for Mixed-Mode Parallel Applications. IPDPS Workshops 2011: 1683-1690 - [c1]Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. SPAA 2011: 105-116 - 2010
- [i1]Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. CoRR abs/1012.5030 (2010)
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-06-21 22:30 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:
