Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrew Hennessee

dblp:360/3378 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0002-2189-7497ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › quantum computing
quantum annealing
0.912025
Quantum-Based SMT Solving for String Theory · HPDC 2025
Emerging computing paradigms
quantum computing
0.912025
Quantum-Based SMT Solving for String Theory · HPDC 2025
Automated reasoning and model checking
satisfiability modulo theories
0.912025
Quantum-Based SMT Solving for String Theory · HPDC 2025
Automated reasoning and model checking › constraint solving
string constraint solving
0.912025
Quantum-Based SMT Solving for String Theory · HPDC 2025
Emerging computing paradigms › quantum computing
quadratic unconstrained binary optimization
0.312025
Quantum-Based SMT Solving for String Theory · HPDC 2025

Methods — techniques the papers use, named apart from their topics

quantum annealing · 1.7quadratic unconstrained binary optimization · 1.7
YearPublicationVenuePosition
2025 Quantum-Based SMT Solving for String Theory
abstract
Satisfiability Modulo Theory (SMT) solvers are a useful tool that can be applied to a variety of problems, such as configuring relationships in distributed systems, detecting race conditions, and program analysis. String constraints are particularly difficult for SMT solvers to navigate, as the search space is generally large. Often times, classical SMT solvers will have to quit generating a solution for string constraints because it takes too long to find the solution. Quantum computing offers the advantages of quantum mechanics (e.g., superposition), which allows a system to explore a large search space much more efficiently. In this work, we explore creating a quantum-enabled SMT solver for string theory by using quantum annealing and Quadratic Unconstrained Binary Optimization (QUBO). Our preliminary results demonstrate that it is feasible to transform these string constraints to QUBO, and generate solutions for given constraints.
Beatrice Casey, Joanna C. S. Santos, Andrew Hennessee
HPDC3
2023 Invited Paper: Algorithm/Hardware Co-Design for Few-Shot Learning at the Edge
abstract
On-device learning is essential to achieve intelligence at the edge, where it is desirable to learn from few samples or even just a single sample. Memory-augmented neural networks (MANNs), which augment neural networks with an attentional memory, can draw on already learnt knowledge patterns and adapt to new but similar tasks. Implementing MANNs on conventional architectures can require a significant amount of costly data transfer, thereby limiting the practical use of MANNs at the edge. In this paper, we introduce algorithm/hardware co-design solutions which exploit compact designs of content addressable memories (CAMs) based on emerging non-volatile memories (e.g., FeFETs) to implement energy-efficient MANN accelerators. The design space of MANN accelerators is systematically analyzed by considering different circuit, architecture, and algorithm options. We further discuss how hyper-dimensional representations of data can be combined with MANNs to overcome the negative effect of device/circuit variabilities on learning quality, thus achieving not only energy-efficient but also accuracy-competitive on-device learning at the edge. We also investigate modeling of device-to-device (D2D) variation in FeFETs using the write-with-verify approach and detail its impact on the energy, delay, and accuracy of the MANN application.
Ann Franchesca Laguna, Mohammad Mehdi Sharifi, Dayane Reis, Liu Liu 0023, Andrew Hennessee, Clayton O'Dell, Ian O'Connor, Michael T. Niemier, Xiaobo Sharon Hu
ICCAD5