default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Processing Letters, Volume 26
Volume 26, Number 1, March 2016
- Selim G. Akl:
Editorial Note. 1601001:1-1601001:1 - Guillaume Aupy, Anne Benoit
:
Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems. 1650001:1-1650001:23 - Abhishek Mishra, Pramod Kumar Mishra:
A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search. 1650002:1-1650002:17 - Alexandre Maurer, Sébastien Tixeuil:
Tolerating Random Byzantine Failures in an Unbounded Network. 1650003:1-1650003:12 - Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, Adi Rosén:
Clique Here: On the Distributed Complexity in Fully-Connected Networks. 1650004:1-1650004:12 - Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. 1650005:1-1650005:18
Volume 26, Number 2, June 2016
- Selim G. Akl:
Editorial Note. 1601002:1-1601002:1 - Christian Trefftz, Hugh McGuire, Zachary Kurmas, Jerry Scripps:
Exhaustive Community Enumeration in Parallel. 1650006:1-1650006:16 - Jing Wu, Joseph F. JáJá:
Achieving Native GPU Performance for Out-of-Card Large Dense Matrix Multiplication. 1650007:1-1650007:17 - Lisa Higham, Jalal Kawash:
Pitfalls in Memory Consistency Modelling. 1650008:1-1650008:18 - Yang Wang, Wei Shi, Kenneth B. Kent:
On Optimal Scheduling Algorithms for Well-Structured Workows in the Cloud with Budget and Deadline Constraints. 1650009:1-1650009:15 - Soumyadip Bandyopadhyay, Dipankar Sarkar, Chittaranjan A. Mandal, Kunal Banerjee, Krishnam Raju Duddu:
A Path Construction Algorithm for Translation Validation Using PRES+ Models. 1650010:1-1650010:18
Volume 26, Number 3, September 2016
- Selim G. Akl:
Editorial Note. 1601003:1-1601003:1 - Pavel Zaichenkov, Olga Tveretina, Alex Shafarenko, Bert Gijsbers, Clemens Grelck:
The Cost and Benefits of Coordination Programming: Two Case Studies in Concurrent Collections and S-NET. 1650011:1-1650011:24 - Stefan D. Bruda, Mary Sarah Ruth Wilkin:
Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space. 1650012:1-1650012:14 - Omar Abdelkafi, Lhassane Idoumghar, Julien Lepagnot:
A Survey on the Metaheuristics Applied to QAP for the Graphics Processing Units. 1650013:1-1650013:20 - Markus Flatz, Marián Vajtersic:
Parallel Nonnegative Matrix Factorization via Newton Iteration. 1650014:1-1650014:22 - Tyler Crain, Vincent Gramoli, Michel Raynal:
A Fast Contention-Friendly Binary Search Tree. 1650015:1-1650015:17
Volume 26, Number 4, December 2016
- Selim G. Akl:
Editorial Note. 1601004:1-1601004:2 - Jiaquan Gao, Yuanshen Zhou, Kesong Wu:
A Novel Multi-GPU Parallel Optimization Model for The Sparse Matrix-Vector Multiplication. 1640001:1-1640001:17 - Jianbin Fang, Peng Zhang, Zhaokui Li, Tao Tang, Xuhao Chen, Cheng Chen, Canqun Yang:
Evaluating Multiple Streams on Heterogeneous Platforms. 1640002:1-1640002:18
- Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, Laurence Pilard, Devan Sohier:
A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks. 1650016:1-1650016:17 - Damien Imbs, Michel Raynal:
Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast. 1650017:1-1650017:8 - Manoj Kumar Chande, Cheng-Chi Lee, Chun-Ta Li:
A New Self-Certified Convertible Authenticated Encryption Scheme Based on Discrete Logarithm Problem. 1650018:1-1650018:10 - John Michalakes, Michael J. Iacono, Elizabeth R. Jessup:
Optimizing Weather Model Radiative Transfer Physics for Intel's Many Integrated Core (MIC) Architecture. 1650019:1-1650019:16
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.
last updated on 2026-08-06 22:40 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
