Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/pc/pc101.bht:"
@article{DBLP:journals/pc/AteskanED21, author = {Esra Ruzgar Ateskan and Kayhan Erciyes and Mehmet Emin Dalkili{\c{c}}}, title = {Parallelization of network motif discovery using star contraction}, journal = {Parallel Comput.}, volume = {101}, pages = {102734}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102734}, doi = {10.1016/J.PARCO.2020.102734}, timestamp = {Wed, 07 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/AteskanED21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/BencharaY21, author = {Fatema Zahra Benchara and Mohamed Youssfi}, title = {A new scalable distributed k-means algorithm based on Cloud micro-services for High-performance computing}, journal = {Parallel Comput.}, volume = {101}, pages = {102736}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102736}, doi = {10.1016/J.PARCO.2020.102736}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/BencharaY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/FallahF21, author = {Mohammad K. Fallah and Mahmood Fazlali}, title = {Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesis}, journal = {Parallel Comput.}, volume = {101}, pages = {102722}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102722}, doi = {10.1016/J.PARCO.2020.102722}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/FallahF21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/GaoCH21, author = {Jiaquan Gao and Qi Chen and Guixia He}, title = {A thread-adaptive sparse approximate inverse preconditioning algorithm on multi-GPUs}, journal = {Parallel Comput.}, volume = {101}, pages = {102724}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102724}, doi = {10.1016/J.PARCO.2020.102724}, timestamp = {Wed, 07 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/GaoCH21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/TongLCZB21, author = {Qianqian Tong and Guannan Liang and Xingyu Cai and Chunjiang Zhu and Jinbo Bi}, title = {Asynchronous parallel stochastic Quasi-Newton methods}, journal = {Parallel Comput.}, volume = {101}, pages = {102721}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102721}, doi = {10.1016/J.PARCO.2020.102721}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pc/TongLCZB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/XunZYQ21, author = {Yaling Xun and Jifu Zhang and Haifeng Yang and Xiao Qin}, title = {{HBPFP-DC:} {A} parallel frequent itemset mining using Spark}, journal = {Parallel Comput.}, volume = {101}, pages = {102738}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102738}, doi = {10.1016/J.PARCO.2020.102738}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/XunZYQ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/ZhaS21, author = {Benbo Zha and Hong Shen}, title = {Improved probabilistic {I/O} scheduling for limited-size Burst-Buffers deployed {HPC}}, journal = {Parallel Comput.}, volume = {101}, pages = {102708}, year = {2021}, url = {https://doi.org/10.1016/j.parco.2020.102708}, doi = {10.1016/J.PARCO.2020.102708}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pc/ZhaS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.