Relating $\mathcal{L}$ -Resilience and Wait-Freedom via Hitting Sets

Distributed Computing and Networking - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17679-1_17 ◽

2011 ◽

pp. 191-202 ◽

Author(s):

Eli Gafni ◽

Petr Kuznetsov

Keyword(s):

Download Full-text

Improving the efficiency of de Bruijn graph construction using compact universal hitting sets

Proceedings of the 12th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics ◽

10.1145/3459930.3469520 ◽

2021 ◽

Author(s):

Yael Ben-Ari ◽

Dan Flomin ◽

Lianrong Pu ◽

Yaron Orenstein ◽

Ron Shamir

Keyword(s):

De Bruijn Graph ◽

Hitting Sets ◽

Download Full-text

Surface Inspection via Hitting Sets and Multi-goal Motion Planning

Towards Autonomous Robotic Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-64107-2_12 ◽

2017 ◽

pp. 134-149 ◽

Author(s):

Stefan Edelkamp ◽

Baris Can Secim ◽

Erion Plaku

Keyword(s):

Motion Planning ◽

Surface Inspection ◽

Download Full-text

Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas

Computational Complexity ◽

10.1007/s00037-016-0131-1 ◽

2016 ◽

Vol 25 (2) ◽

pp. 455-505 ◽

Author(s):

Rafael Oliveira ◽

Amir Shpilka ◽

Ben lee Volk

Keyword(s):

Download Full-text

Succinct hitting sets and barriers to proving algebraic circuits lower bounds

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055496 ◽

2017 ◽

Author(s):

Michael A. Forbes ◽

Amir Shpilka ◽

Ben Lee Volk

Keyword(s):

Lower Bounds ◽

Download Full-text

Minimum Membership Hitting Sets of Axis Parallel Segments

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-94776-1_53 ◽

2018 ◽

pp. 638-649 ◽

Author(s):

N. S. Narayanaswamy ◽

S. M. Dhannya ◽

C. Ramya

Keyword(s):

Hitting Sets ◽

Download Full-text

Hitting Sets for Low-Degree Polynomials with Optimal Density

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.24 ◽

2014 ◽

Author(s):

Venkatesan Guruswami ◽

Chaoping Xing

Keyword(s):

Optimal Density ◽

Hitting Sets ◽

Low Degree Polynomials

Download Full-text

Near-Linear Approximation Algorithms for Geometric Hitting Sets

Algorithmica ◽

10.1007/s00453-011-9517-2 ◽

2011 ◽

Vol 63 (1-2) ◽

pp. 1-25 ◽

Author(s):

Pankaj K. Agarwal ◽

Esther Ezra ◽

Micha Sharir

Keyword(s):

Approximation Algorithms ◽

Linear Approximation ◽

Download Full-text

Computing all minimal hitting sets by subset recombination

Applied Intelligence ◽

10.1007/s10489-017-0971-7 ◽

2017 ◽

Vol 48 (2) ◽

pp. 257-270 ◽

Author(s):

Xiangfu Zhao ◽

Dantong Ouyang ◽

Liming Zhang

Keyword(s):

Download Full-text

A novel algorithm to solve the minimal hitting sets in MBD

2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) ◽

10.1109/fuzz-ieee.2014.6891683 ◽

2014 ◽

Author(s):

Jianfang Xu ◽

Zhigang Liu ◽

Chenxi Dai

Keyword(s):

Hitting Sets ◽

Novel Algorithm

Download Full-text

A method of combining SE-tree to compute all minimal hitting sets*

Progress in Natural Science Materials International ◽

10.1080/10020070612331343209 ◽

2006 ◽

Vol 16 (2) ◽

pp. 169-174 ◽

Author(s):

Zhao Xiangfu ◽

Ouyang Dantong

Keyword(s):

Download Full-text