( en | de | ru )

 

Disambiguation of "Karpinski, Marek"

Author of the publication

copydeleteadd this publication to your clipboard
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs

, , and . Electron. Colloquium Comput. Complex., (2005)

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

Approximating Huffman Codes in Parallel., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 845-855. Springer, (2002)The Equivalences Problems for Binary EOL-Systems are Decidable.. FCT, volume 56 of Lecture Notes in Computer Science, page 423-434. Springer, (1977)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)On a Sublinear Time Parallel Construction of Optimal Binary Search Trees., and . Parallel Process. Lett., 8 (3): 387-397 (1998)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , and . SODA, page 74-83. ACM/SIAM, (2002)Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields., , and . SIAM J. Comput., 19 (6): 1059-1063 (1990)The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract), and . FOCS, page 166-172. IEEE Computer Society, (1987)Effects of Kolmogorov Complexity Present in Inductive Inference as Well., , , , , , , and . ALT, volume 1316 of Lecture Notes in Computer Science, page 244-259. Springer, (1997)Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees., , and . FOCS, page 258-265. IEEE Computer Society, (1995)A QPTAS for the Base of the Number of Triangulations of a Planar Point Set., , and . CoRR, (2014)