Author of the publication

Efficient parallel exponentiation in GF(2n) using normal basis representations.

, , , and . SPAA, page 179-188. ACM, (2001)

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.

 

Other publications of authors with the same name

The Subtree Max Gap Problem with Application to Parallel String Covering., , , and . SODA, page 501-510. ACM/SIAM, (1994)Work-time-optimal parallel algorithms for string problems., , , , and . STOC, page 713-722. ACM, (1995)An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph., and . Fundam. Informaticae, 84 (1): 81-97 (2008)Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty., , , and . SPIRE, volume 3772 of Lecture Notes in Computer Science, page 315-326. Springer, (2005)Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings., , and . Stringology, page 48-60. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)Approximate Seeds of Strings., , , and . Stringology, page 25-36. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2003)On Representations of Ternary Order Relations in Numeric Strings., , , , and . ICABD, volume 1146 of CEUR Workshop Proceedings, page 46-52. CEUR-WS.org, (2014)Constructing Suffix Arrays for Multi-dimensional Matrices., , and . CPM, volume 1448 of Lecture Notes in Computer Science, page 126-139. Springer, (1998)Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.. CPM, volume 1075 of Lecture Notes in Computer Science, page 335-347. Springer, (1996)Finding Optimal Alignment and Consensus of Circular Strings., , , , and . CPM, volume 6129 of Lecture Notes in Computer Science, page 310-322. Springer, (2010)