Incremental dead state detection in logarithmic time
From MaRDI portal
Publication:6535537
Recommendations
- Incremental topological sort and cycle detection in \(\tilde O(m \sqrt n)\) expected total time
- A new approach to incremental cycle detection and related problems
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs
- Faster Algorithms for Incremental Topological Ordering
- Incremental cycle detection, topological ordering, and strong component maintenance
Cites work
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1306899 (Why is no real title available?)
- scientific article; zbMATH DE number 1929959 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- scientific article; zbMATH DE number 7649967 (Why is no real title available?)
- A Data Structure for Dynamically Maintaining Rooted Trees
- A data structure for dynamic trees
- A decision procedure for regular membership and length constraints over unbounded strings
- A dynamic topological sort algorithm for directed acyclic graphs
- A new approach to incremental cycle detection and related problems
- Advanced automata minimization
- An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- An SMT solver for regular expressions and linear arithmetic over string length
- Derivatives of Regular Expressions
- Dynamic trees in practice
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient E-Matching for SMT Solvers
- Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]
- Fast Decision Procedures Based on Congruence Closure
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Incremental cycle detection, topological ordering, and strong component maintenance
- Incremental topological sort and cycle detection in \(\tilde O(m \sqrt n)\) expected total time
- Maintaining a topological order under edge insertions
- Maintaining information in fully dynamic trees with top trees
- Minimisation of automata
- Minimization of symbolic automata
- Model checking of safety properties
- On the State Minimization of Nondeterministic Finite Automata
- Partial derivatives of regular expressions and finite automaton constructions
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Regular expressions: new results and open problems
- Succinctness of the complement and intersection of regular expressions
- Symbolic solving of extended regular expression inequalities
- Three Partition Refinement Algorithms
- Variations on the Common Subexpression Problem
This page was built for publication: Incremental dead state detection in logarithmic time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535537)
