The \(k\)-distinct language: parameterized automata constructions (Q5964071): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.01.029 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2252416325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $$k$$-Distinct Language: Parameterized Automata Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow sieves for parameterized paths and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Regular Simple Paths in Graph Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Module Motif / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Sets of Product Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm engineering for color-coding with applications to signaling pathway detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Families: A Unified Tradeoff-Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Hashing, Color Coding and Approximate Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic algorithms for weighted matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using nondeterminism to design efficient deterministic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Expansion and Color Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed-parameter tractable algorithms for matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for Weighted 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O *(3.523k ) Parameterized Algorithm for 3-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on more Flexible Versions of Graph Motif / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector sets for exhaustive testing of logic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced families of perfect hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Normal Form for Regular Languages as Xor Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.01.029 / rank
 
Normal rank

Latest revision as of 12:33, 9 December 2024

scientific article; zbMATH DE number 6546616
Language Label Description Also known as
English
The \(k\)-distinct language: parameterized automata constructions
scientific article; zbMATH DE number 6546616

    Statements

    The \(k\)-distinct language: parameterized automata constructions (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2016
    0 references
    parameterized complexity
    0 references
    automata theory
    0 references
    \(k\)-path
    0 references
    \(r\)-dimensional \(k\)-matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers