Computing the throughput of concatenation state machines
From MaRDI portal
Publication:954952
DOI10.1016/j.jda.2007.04.002zbMath1152.68027OpenAlexW2071925009MaRDI QIDQ954952
Mohammadreza Yazdani, Jurek Czyzowicz, Wojciech Fraczak
Publication date: 18 November 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2007.04.002
Related Items
Cites Work
- Unnamed Item
- New scaling algorithms for the assignment and minimum mean cycle problems
- Generalized AND/OR graphs
- A characterization of the minimum cycle mean in a digraph
- Finding the \(K\) shortest hyperpaths
- Directed hypergraphs and applications
- Finding minimum cost to time ratio cycles with small integral transit times
- Combinatorial Optimization with Rational Objective Functions
- Dynamic Programming as Graph Searching: An Algebraic Approach
- Implementation and Application of Automata
- Faster parametric shortest path and minimum‐balance algorithms