( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.

, , and . Nord. J. Comput., 4 (2): 172-186 (1997)

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.

Peter Karpinski

Hannelore Karpinski

Kurt Karpinski

Peter Karpinski

Werner Karpinski

 

Other publications of authors with the same name

On the Computational Complexity of Measuring Global Stability of Banking Networks., , , and . Algorithmica, 70 (4): 595-647 (2014)An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions., , and . Nord. J. Comput., 4 (2): 172-186 (1997)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , and . SODA, page 74-83. ACM/SIAM, (2002)9/8-Approximation Algorithm for Random MAX-3SAT, and . Electron. Colloquium Comput. Complex., (2002)Approximability of Dense Instances of NEAREST CODEWORD Problem, , and . Electron. Colloquium Comput. Complex., (2000)Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT, , and . Electron. Colloquium Comput. Complex., (2003)Generalized Wong sequences and their applications to Edmonds' problems., , , and . Electron. Colloquium Comput. Complex., (2013)Approximation Hardness of TSP with Bounded Metrics, and . Electron. Colloquium Comput. Complex., (2000)Efficient Amplifiers and Bounded Degree Optimization., and . Electron. Colloquium Comput. Complex., (2001)Parallel Construction of Minimum Redundancy Length-Limited Codes, and . Electron. Colloquium Comput. Complex., (2002)