2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.PF2022★ 2 cited
Deterministic vs. Non Deterministic Finite Automata in Automata Processing
Farzana Ahmed Siddique, Tommy James Tracy, Nathan Brunelle +1
Linear-time pattern matching engines have seen promising results using Finite Automata (FA) as their computation model. Among different FA variants, deterministic (DFA) and non-det…
cs.NI2021
A Roadmap for Enabling a Future-Proof In-Network Computing Data Plane Ecosystem
Daehyeok Kim, Nikita Lazarev, Tommy Tracy +7
As the vision of in-network computing becomes more mature, we see two parallel evolutionary trends. First, we see the evolution of richer, more demanding applications that require…