{"id":45,"date":"2022-07-31T07:21:48","date_gmt":"2022-07-31T06:21:48","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?page_id=45"},"modified":"2025-11-20T10:16:21","modified_gmt":"2025-11-20T10:16:21","slug":"publications","status":"publish","type":"page","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/publications\/","title":{"rendered":"Articles"},"content":{"rendered":"\n<p><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paragrapher-a-parallel-and-distributed-graph-loading-library-for-large-scale-compressed-graphs-bigdata25\/\" data-type=\"link\" data-id=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paragrapher-a-parallel-and-distributed-graph-loading-library-for-large-scale-compressed-graphs-bigdata25\/\">ParaGrapher: A Parallel and Distributed Graph Loading Library for Large-Scale Compressed Graphs<\/a> | BigData\u201925 (Short Paper)<\/li>\n\n\n\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/10847799\">Software-Defined Number Formats for High-Speed Belief Propagation<\/a> | IEEE TETC 2025<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/PoTra\" target=\"_blank\" rel=\"noreferrer noopener\">On Optimizing Locality of Graph Transposition on Modern Architectures<\/a> | arXiv 2025<\/li>\n\n\n\n<li><a href=\"https:\/\/pure.qub.ac.uk\/en\/publications\/waveletmixer-a-multi-resolution-wavelets-based-mlp-mixer-for-mult\">WaveletMixer: a multi-resolution wavelets based MLP-mixer for multivariate long-term time series forecasting<\/a> | AAAI 2025<\/li>\n\n\n\n<li><a href=\"https:\/\/pure.qub.ac.uk\/en\/publications\/intedisux-intepretation-guided-discriminative-user-centric-explan\">InteDisUX: intepretation-guided discriminative user-centric explanation for time series<\/a> | AAAI 2025<\/li>\n\n\n\n<li><a href=\"https:\/\/arxiv.org\/abs\/2408.10945\">HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models in Resource-Constrained Environments<\/a> | AAAI 2025<\/li>\n\n\n\n<li><a href=\"https:\/\/pure.qub.ac.uk\/en\/publications\/software-defined-number-formats-bridging-the-gap-between-accuracy\">Software-defined number formats: bridging the gap between accuracy, performance and security<\/a> | NANDA 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/arxiv.org\/abs\/2409.01062\">Defending against Model Inversion Attacks via Random Erasing<\/a> | arXiv 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/qclique-optimizing-performance-and-accuracy-in-maximum-weighted-clique-euro-par-2024\/\" target=\"_blank\" rel=\"noreferrer noopener\">QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique<\/a> | Euro-Par 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11012-024-01867-2\">Navigating speed\u2013accuracy trade-offs for multi-physics simulations<\/a> | Meccanica 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3650200.3656607\">Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size<\/a> | ICS 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3634737.3656292\">Exploiting Data Redundancy in CKKS Encoding for High-Speed Homomorphic Encryption<\/a> | AsiaCCS 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/Selective-Parallel-Loading-of-Large-Scale-compressed-Graphs-with-ParaGrapher\/\" target=\"_blank\" rel=\"noreferrer noopener\">Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher<\/a> | arXiv 2024<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/on-overcoming-hpc-challenges-of-trillion-scale-real-world-graph-datasets\/\" target=\"_blank\" rel=\"noreferrer noopener\">On Overcoming HPC Challenges of Trillion-Scale Real-World Graph Datasets<\/a> | BigData\u201923 (Short Paper)<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/MS-BioGraphs-Sequence-Similarity-Graph-Datasets\/\" target=\"_blank\" rel=\"noreferrer noopener\">Dataset Announcement: MS-BioGraphs, Trillion-Scale Public Real-World Sequence Similarity Graphs<\/a> | IISWC\u201923 (Poster)<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/MS-BioGraphs-Sequence-Similarity-Graph-Datasets\/\" target=\"_blank\" rel=\"noreferrer noopener\">MS-BioGraphs: Sequence Similarity Graph Datasets<\/a> | arXiv 2023<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/software-defined-floating-point-number-formats-and-their-application-to-graph-processing\/\">Software-Defined Floating-Point Number Formats and Their Application to Graph Processing<\/a> | ICS 2022<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/MASTIFF-Structure-Aware-Minimum-Spanning-Tree-Forest\/\">MASTIFF: Structure-Aware Minimum Spanning Tree\/Forest<\/a> | ICS 2022<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/SAPCo-Sort-Optimizing-Degree-Ordering-for-Power-Law-Graphs\">SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs<\/a> | ISPASS 2022 (Poster)<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/LOTUS-locality-optimizing-triangle-counting\/\">LOTUS: Locality Optimizing Triangle Counting<\/a> | PPoPP 2022<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/locality-analysis-of-graph-reordering-algorithms\" target=\"_blank\" rel=\"noreferrer noopener\">Locality Analysis of Graph Reordering Algorithms<\/a> | IISWC 2021<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/thrifty-label-propagation-fast-connected-components-for-skewed-degree-graphs\/\" target=\"_blank\" rel=\"noreferrer noopener\">Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs<\/a> | IEEE CLUSTER 2021<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/Exploiting-in-Hub-Temporal-Locality-in-SpMV-based-Graph-Processing\" target=\"_blank\" rel=\"noreferrer noopener\">Exploiting in-Hub Temporal Locality in SpMV-based Graph Processing<\/a> | ICPP 2021<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/scheduling-fine-grain-loops-in-graph-processing-workloads\/\" target=\"_blank\" rel=\"noreferrer noopener\">Reducing The Burden of Parallel Loop Schedulers for Many\u2010Core Processors [Open Access]<\/a> | CCPE 2021<\/li>\n\n\n\n<li><a href=\"https:\/\/blogs.qub.ac.uk\/DIPSA\/How-Do-Graph-Relabeling-Algorithms-Improve-Memory-Locality-ISPASS21\/\" target=\"_blank\" rel=\"noreferrer noopener\">How Do Graph Relabeling Algorithms Improve Memory Locality?<\/a> | ISPASS 2021 (Poster)<\/li>\n\n\n\n<li><a href=\"https:\/\/arxiv.org\/pdf\/2012.10271\">Understood in Translation, Transformers for Domain Understanding<\/a> | SDU@AAAI 2021<\/li>\n\n\n\n<li><a href=\"https:\/\/doi.org\/10.1016\/j.future.2020.06.005\">Fast load balance parallel graph analytics with an automatic graph data structure selection algorithm<\/a> | FGCS 2020<\/li>\n\n\n\n<li><a href=\"https:\/\/doi.org\/10.1109\/HPEC43674.2020.9286179\">Half-Precision Floating-Point Formats for PageRank: Opportunities and Challenges<\/a> | HPEC 2020<\/li>\n\n\n\n<li><a href=\"https:\/\/doi.org\/10.1145\/3392717.3392753\">Graptor: Efficient Pull and Push Style Vectorized Graph Processing<\/a> [<a href=\"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3392717.3392753\">ACM<\/a>] | ICS 2020<\/li>\n\n\n\n<li><a href=\"http:\/\/arxiv.org\/abs\/1806.06576\">VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing (Poster)<\/a> [<a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3293883.3295703?cid=81100012252\">ACM<\/a>] | PPOPP 2019 (Poster)<\/li>\n\n\n\n<li><a href=\"http:\/\/arxiv.org\/abs\/1806.06576\">VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing<\/a> | arXiv 2018<\/li>\n\n\n\n<li><a href=\"http:\/\/dx.doi.org\/10.1109\/ICPP.2017.27\">Accelerating Graph Analytics by Utilising the Memory Locality of Graph Partitioning<\/a> | ICPP 2017<\/li>\n\n\n\n<li><a href=\"http:\/\/dx.doi.org\/10.1145\/3079079.3079097\">GraphGrind: Addressing Load Imbalance of Graph Partitioning<\/a> [<a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3079079.3079097?cid=81100012252\">ACM<\/a>] | ICS 2017<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":975,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-45","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/45","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/975"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=45"}],"version-history":[{"count":20,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/45\/revisions"}],"predecessor-version":[{"id":3647,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/45\/revisions\/3647"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=45"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}