( en | de | ru )

 

Disambiguation of "Holík, Lukás"

Author of the publication

copydeleteadd this publication to your clipboard
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection.

, , , , and . TACAS (2), volume 10806 of Lecture Notes in Computer Science, page 155-175. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Helga Holik

Josef Holik

Helga Holik

Helga Holik

Ludmilla Holik

 

Other publications of authors with the same name

Composed Bisimulation for Tree Automata., , , , and . CIAA, volume 5148 of Lecture Notes in Computer Science, page 212-222. Springer, (2008)Mediating for Reduction (on Minimizing Alternating Büchi Automata)., , , and . FSTTCS, volume 4 of LIPIcs, page 1-12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata., , , , , and . ATVA, volume 8172 of Lecture Notes in Computer Science, page 224-239. Springer, (2013)Simulation Algorithms for Symbolic Automata., , , , and . ATVA, volume 11138 of Lecture Notes in Computer Science, page 109-125. Springer, (2018)Regex matching with counting-set automata., , , , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 218:1-218:30 (2020)Counterexample Validation and Interpolation-Based Refinement for Forest Automata., , , , and . VMCAI, volume 10145 of Lecture Notes in Computer Science, page 288-309. Springer, (2017)Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers., , , , , and . USENIX Security Symposium, page 4165-4182. USENIX Association, (2022)Low-Level Bi-Abduction., , , , , and . ECOOP, volume 222 of LIPIcs, page 19:1-19:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Cooking String-Integer Conversions with Noodles., , , and . SAT, volume 305 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Antichain with SAT and Tries., and . SAT, volume 305 of LIPIcs, page 15:1-15:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)