Author of the publication

An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph.

, and . Fundam. Informaticae, 84 (1): 81-97 (2008)

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)Efficient parallel exponentiation in GF(2n) using normal basis representations., , , and . SPAA, page 179-188. ACM, (2001)Work-time-optimal parallel algorithms for string problems., , , , and . STOC, page 713-722. ACM, (1995)An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks., , and . IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 100-111. Springer, (2000)Constructing Suffix Arrays for Multi-dimensional Matrices., , and . CPM, volume 1448 of Lecture Notes in Computer Science, page 126-139. Springer, (1998)Finding Optimal Alignment and Consensus of Circular Strings., , , , and . CPM, volume 6129 of Lecture Notes in Computer Science, page 310-322. Springer, (2010)Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.. CPM, volume 1075 of Lecture Notes in Computer Science, page 335-347. Springer, (1996)Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together., , , , and . SIGMOD Conference, page 1429-1446. ACM, (2019)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)