1 citations · 1 across the 10 of their papers we have counts for
11 papers
Context Compaction for World Models
Hayder Tirmazi
World models let observers explore and interact with generated worlds. Recent work shows that when observers revisit a region, current models often fail to regenerate it consistent…
Context Compaction Theory
Hayder Tirmazi, Sam Markelon, Allison Bishop +1
Large Language Models (LLMs) have a bounded context window. The context window is the maximum input size an LLM can consume for a single inference. AI agents rely on a process call…
DRCY: Agentic Hardware Design Reviews
Kyle Dumont, Nicholas Herbert, Hayder Tirmazi +1
Hardware design errors discovered after fabrication require costly physical respins that can delay products by months. Existing electronic design automation (EDA) tools enforce str…
Orla: A Library for Serving LLM-Based Multi-Agent Systems
Rana Shahout, Hayder Tirmazi, Minlan Yu +1
We introduce Orla, a library for constructing and running LLM-based agentic systems. Modern agentic applications consist of workflows that combine multiple LLM inference steps, too…
Whistledown: Combining User-Level Privacy with Conversational Coherence in LLMs
Chelsea McMurray, Hayder Tirmazi
Users increasingly rely on large language models (LLMs) for personal, emotionally charged, and socially sensitive conversations. However, prompts sent to cloud-hosted models can co…
All Proof of Work But No Proof of Play
Hayder Tirmazi
Speedrunning is a competition that emerged from communities of early video games such as Doom (1993). Speedrunners try to finish a game in minimal time. Provably verifying the auth…
LSM Trees in Adversarial Environments
Hayder Tirmazi
The Log Structured Merge (LSM) Tree is a popular choice for key-value stores that focus on optimized write throughput while maintaining performant, production-ready read latencies.…
Random Number Generation from Pulsars
Hayder Tirmazi
Pulsars exhibit signals with precise inter-arrival times that are on the order of milliseconds to seconds, depending on the individual pulsar. There are subtle variations in the ti…
Adversarially Robust Bloom Filters: Privacy, Reductions, and Open Problems
Hayder Tirmazi
A Bloom filter is a space-efficient probabilistic data structure that represents a set of elements from a larger universe . This efficiency comes with a trade-off, namely, i…
Computational Complexity of Game Boy Games
Hayder Tirmazi, Ali Tirmazi, Tien Phuoc Tran
We analyze the computational complexity of several popular video games released for the Nintendo Game Boy video game console. We analyze the complexity of generalized versions of f…
Adversary Resilient Learned Bloom Filters
Ghada Almashaqbeh, Allison Bishop, Hayder Tirmazi
A learned Bloom filter (LBF) combines a classical Bloom filter (CBF) with a learning model to reduce the amount of memory needed to represent a given set while achieving a target f…