Jesmin Jahan Tithi

Orcid: 0000-0002-2861-8393

According to our database1, Jesmin Jahan Tithi authored at least 41 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis.
CoRR, 2024

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation.
CoRR, 2024

2023
Lessons Learned from Assessing Trustworthy AI in Practice.
Digit. Soc., December, 2023

The Intel Programmable and Integrated Unified Memory Architecture Graph Analytics Processor.
IEEE Micro, 2023

Large Language Models Based Automatic Synthesis of Software Specifications.
CoRR, 2023

Characterizing the Scalability of Graph Convolutional Networks on Intel<sup>®</sup> PIUMA.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2023

Dynamic Tensor Linearization and Time Slicing for Efficient Factorization of Infinite Data Streams.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022
An Optimal Level-synchronous Shared-memory Parallel BFS Algorithm with Optimal parallel Prefix-sum Algorithm and its Implications for Energy Consumption.
CoRR, 2022

Ridgeline: A 2D Roofline Model for Distributed Systems.
CoRR, 2022

How to Assess Trustworthy AI in Practice.
CoRR, 2022

SU3_Bench on a Programmable Integrated Unified Memory Architecture (PIUMA) and How that Differs from Standard NUMA CPUs.
Proceedings of the High Performance Computing - 37th International Conference, 2022

Efficient, out-of-memory sparse MTTKRP on massively parallel architectures.
Proceedings of the ICS '22: 2022 International Conference on Supercomputing, Virtual Event, June 28, 2022

Using Sentence Embeddings and Semantic Similarity for Seeking Consensus when Assessing Trustworthy AI.
Proceedings of the Workshop on Imagining the AI Landscape after the AI Act (IAIL 2022) co-located with 1st International Conference on Hybrid Human-Artificial Intelligence (HHAI 2022), 2022

2021
A New Parallel Algorithm for Sinkhorn Word-Movers Distance and Its Performance on PIUMA and Xeon CPU.
CoRR, 2021

Performance Optimization of SU3_Bench on Xeon and Programmable Integrated Unified Memory Architecture.
CoRR, 2021

Lessons Learned from Accelerating Quicksilver on Programmable Integrated Unified Memory Architecture (PIUMA) and How That's Different from CPU.
Proceedings of the High Performance Computing - 36th International Conference, 2021

ALTO: adaptive linearized storage of sparse tensors.
Proceedings of the ICS '21: 2021 International Conference on Supercomputing, 2021

2020
Mapping Stencils on Coarse-grained Reconfigurable Spatial Architecture.
CoRR, 2020

PIUMA: Programmable Integrated Unified Memory Architecture.
CoRR, 2020

MISIM: An End-to-End Neural Code Similarity System.
CoRR, 2020

An Efficient Shared-memory Parallel Sinkhorn-Knopp Algorithm to Compute the Word Mover's Distance.
CoRR, 2020

Online and Real-time Object Tracking Algorithm with Extremely Small Matrices.
CoRR, 2020

Context-Aware Parse Trees.
CoRR, 2020

Prune the Unnecessary: Parallel Pull-Push Louvain Algorithms with Automatic Edge Pruning.
Proceedings of the ICPP 2020: 49th International Conference on Parallel Processing, 2020

2017
Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems.
ACM Trans. Parallel Comput., 2017

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

POSTER: Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms.
Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

2016
AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

An Efficient Cache-oblivious Parallel Viterbi Algorithm.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency.
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2015

High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Efficient computation of distance incorporated codon autocorrelation (DICA) score using fast Fourier transform.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

Accelerated molecular mechanical and solvation energetics on multicore CPUs and manycore GPUs.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Exploiting spatial architectures for edit distance algorithms.
Proceedings of the 2014 IEEE International Symposium on Performance Analysis of Systems and Software, 2014

High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
Avoiding Locks and Atomic Instructions in Shared-Memory Parallel BFS Using Optimistic Parallelization.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Polarization Energy on a Cluster of Multicores.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Designing Autocorrelated Genes.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
Organizing RadLex lexicon for efficient retrieval of radiology documents.
SIGHIT Rec., 2012

Poster: Polarization Energy on a Cluster of Multicores.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Abstract: Polarization Energy on a Cluster of Multicores.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012


  Loading...