„bit parallelism“

Suchergebnisse

11 Treffer

• Combinatorial Pattern Matching – 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
  Fischer, Johannes ; Sanders, Peter 2013 Springer Berlin Heidelberg
• Internal Shortest Absent Word Queries
  Badkobeh, Golnaz ; Charalampopoulos, Panagiotis ; Pissis, Solon P. 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
  Bez, Dominik ; Kurpicz, Florian ; Lehmann, Hans-Peter ; Sanders, Peter 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Bit-Parallelism to Quantum String Matching for Labelled Graphs
  Equi, Massimo ; Meijer-van de Griend, Arianne ; Mäkinen, Veli 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences
  Funakoshi, Mitsuru ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki ; Shinohara, Ayumi 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Packed String Matching
  Ben-Kiki, Oren ; Bille, Philip ; Breslauer, Dany ; Gasieniec, Leszek ; Grossi, Roberto ; Weimann, Oren 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parallelism for free – efficient and optimal bitvector analyses for parallel programs
  Knoop, Jens ; Steffen, Bernhard ; Vollmer, Jürgen 1994 Univ., Fak. für Math. und Informatik
• Secure pattern matching based on bit parallelism – Non-interactive protocols for non-deterministic string matching automata evaluation
  Samadani, Mohammad Hasan ; Berenjkoob, Mehdi ; Blanton, Marina
• Combinatorial pattern matching – 24th annual symposium ; proceedings
  Fischer, Johannes ; Sanders, Peter 2013 Springer
• Parallel and Bit-parallel Text Algorithms – Second Edition
  Šupol, Jan 2012 LAP LAMBERT Academic Publishing
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
  Saif, Ahmed A. F. ; Hu, Liang ; Chu, Jianfeng