Concepedia

Variations on parallel explicit emptiness checks for generalized Büchi automata

Étienne Renault, Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud

International Journal on Software Tools for Technology Transfer · 2016 · 14 citations · 18 references

Open access

Concepts

ComputingComputer EngineeringComputer ScienceAlgorithmsParallel ComputingTheory Of ComputationAutomata TheoryFinite AutomataFinite-state MachinesModel CheckingBüchi AutomataEmptiness Problem

References

18

Depth-First Search and Linear Graph Algorithms

Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations

Computing, Computer Science, Algorithms +16

Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

Maged M. Michael, Michael L. Scott · 1996 · 791 citations · Full text

Computing, Computer Science, Algorithms +8

Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe et al. · ACM SIGPLAN Notices · 2000 · 449 citations · Full text

Computing, Computer Science, Computer Systems +13

Depth-first search is inherently sequential

John H. Reif · Information Processing Letters · 1985 · 294 citations

Computing, Computer Science, Algorithms +6

Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe et al. · 2000 · 217 citations · Full text

Computing, Computer Science, Computer Systems +13