Digital Commons @ Michigan Tech
metadata only
SPECULATION-CENTRIC PARALLELIZATION FOR HIGH-PERFORMANCE FINITE STATE AUTOMATA PROCESSING ON GPUS
Pattern matching, driven by Finite Automata (FA) and Finite State Machines (FSM), is a fundamental computational kernel in modern unstructured data processing, spanning data analytics, bioinformatics, and network security. While Graphics Processing Units (GPUs) offer massive hardware parallelism, th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Automatisierte (Un)Gleichheit durch Künstliche Intelligenz#705969
- Introduction to algorithmic antagonisms: Resistance, reconfiguration, and renaissance for computational life#679145
- Structured Distributed Computation under Communication and Computation Constraints#796406
- Understanding computation time: a critical discussion of time as a computational performance metric#1043945
- Accelerating Floating-Point Satisfiability Solving via Gradient Normalization#1232847
Record · ID 1210864
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive