default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 17 matches
- 2018
- Sai Antantapantula, Christopher Melekian, Eddie Cheng:
Matching Preclusion for the Shuffle-Cubes. Parallel Process. Lett. 28(3): 1850012:1-1850012:9 (2018) - Lali Barrière, Xavier Muñoz, Janosch Fuchs, Walter Unger:
Online Matching in Regular Bipartite Graphs. Parallel Process. Lett. 28(2): 1850008:1-1850008:13 (2018) - Alexandros V. Gerbessiotis:
A Study of Integer Sorting on Multicores. Parallel Process. Lett. 28(4): 1850014:1-1850014:26 (2018) - Chen Hao, Weihua Yang:
A Remark on Rainbow 6-Cycles in Hypercubes. Parallel Process. Lett. 28(2): 1850007:1-1850007:5 (2018) - Siegfried Höfinger, Thomas Ruh, Ernst J. Haunschmid:
Fast Approximate Evaluation of Parallel Overhead from a Minimal Set of Measured Execution Times. Parallel Process. Lett. 28(1): 1850003:1-1850003:12 (2018) - Tripti Jain, Klaus Schneider:
The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks. Parallel Process. Lett. 28(1): 1850001:1-1850001:14 (2018) - Stefan Kronawitter, Sebastian Kuckuk, Harald Köstler, Christian Lengauer:
Automatic Data Layout Transformations in the ExaStencils Code Generator. Parallel Process. Lett. 28(3): 1850009:1-1850009:18 (2018) - Miao Lu, Shurong Zhang, Weihua Yang:
Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks. Parallel Process. Lett. 28(4): 1850013:1-1850013:6 (2018) - Mengjie Lv, Shuming Zhou, Xueli Sun, Guanqin Lian, Jiafei Liu:
Reliability Evaluation of Data Center Network DCell. Parallel Process. Lett. 28(4): 1850015:1-1850015:10 (2018) - Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional Matching Preclusion for (n, k)-Star Graphs. Parallel Process. Lett. 28(4): 1850017:1-1850017:15 (2018) - Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Process. Lett. 28(2): 1850006:1-1850006:9 (2018) - Christian Schmitt, Moritz Schmid, Sebastian Kuckuk, Harald Köstler, Jürgen Teich, Frank Hannig:
Reconfigurable Hardware Generation of Multigrid Solvers with Conjugate Gradient Coarse-Grid Solution. Parallel Process. Lett. 28(4): 1850016:1-1850016:21 (2018) - Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees. Parallel Process. Lett. 28(1): 1850002:1-1850002:15 (2018) - Joseph Tassone, Mike Biocchi:
The Importance of Applying Security Practices in Wireless Communication: Bluetooth Low Energy and RFID. Parallel Process. Lett. 28(3): 1850010:1-1850010:22 (2018) - Peizhi Yan, Yi Feng:
Using Convolution and Deep Learning in Gomoku Game Artificial Intelligence. Parallel Process. Lett. 28(3): 1850011:1-1850011:13 (2018) - Hector Zenil, Narsis Aftab Kiani, Ming-Mei Shang, Jesper Tegnér:
Algorithmic Complexity and Reprogrammability of Chemical Structure Networks. Parallel Process. Lett. 28(1): 1850005:1-1850005:18 (2018) - Weijian Zheng, Fengguang Song, Lan Lin, Zizhong Chen:
Scaling Up Parallel Computation of Tiled QR Factorizations by a Distributed Scheduling Runtime System and Analytical Modeling. Parallel Process. Lett. 28(1): 1850004:1-1850004:17 (2018)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-14 08:45 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint