Seguir
Marek Karpinski
Marek Karpinski
Professor of Computer Science, University of Bonn
Dirección de correo verificada de cs.uni-bonn.de - Página principal
Título
Citado por
Citado por
Año
An XOR-based erasure-resilient coding scheme
J Blomer
Technical report at ICSI, 1995
5881995
Polynomial time approximation schemes for dense instances of NP-hard problems
S Arora, D Karger, M Karpinski
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
5741995
Resolution for quantified Boolean formulas
HK Buning, M Karpinski, A Flogel
Information and computation 117 (1), 12-18, 1995
4481995
On some tighter inapproximability results
P Berman, M Karpinski
Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 1999
4261999
New approximation algorithms for the Steiner tree problems
M Karpinski, A Zelikovsky
Journal of Combinatorial Optimization 1, 47-65, 1997
2911997
Learning read-once formulas with queries
D Angluin, L Hellerstein, M Karpinski
Journal of the ACM (JACM) 40 (1), 185-210, 1993
2481993
375-Approximation Algorithm for Sorting by Reversals
P Berman, S Hannenhalli, M Karpinski
European Symposium on Algorithms, 200-210, 2002
2422002
Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
M Karpinski, A Macintyre
Journal of Computer and System Sciences 54 (1), 169-176, 1997
2221997
Approximation hardness of short symmetric instances of MAX-3SAT
P Berman, M Karpinski, A Scott
2072004
Approximation schemes for clustering problems
WF De La Vega, M Karpinski, C Kenyon, Y Rabani
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
1952003
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
DY Grigoriev, M Karpinski, MF Singer
SIAM Journal on Computing 19 (6), 1059-1063, 1990
1781990
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
DY Grigoriev, M Karpinski
28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 166-172, 1987
1631987
8/7-approximation algorithm for (1, 2)-TSP
P Berman, M Karpinski
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1612006
New inapproximability bounds for TSP
M Karpinski, M Lampis, R Schmied
Journal of Computer and System Sciences 81 (8), 1665-1677, 2015
1422015
Greater trochanteric pain syndrome. A report of 15 cases
MR Karpinski, H Piggott
The Journal of Bone & Joint Surgery British Volume 67 (5), 762-763, 1985
1411985
Efficient algorithms for Lempel-Ziv encoding
L Gasieniec, M Karpinski, W Plandowski, W Rytter
Algorithm Theory—SWAT'96: 5th Scandinavian Workshop on Algorithm Theory …, 1996
1401996
Random sampling and approximation of MAX-CSPs
N Alon, WF De La Vega, R Kannan, M Karpinski
Journal of computer and system sciences 67 (2), 212-243, 2003
1302003
Polynomial bounds for VC dimension of sigmoidal neural networks
M Karpinski, A Macintyre
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
1271995
Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
M Karpinski, W Schudy
International Symposium on Algorithms and Computation, 3-14, 2010
1242010
An exponential lower bound for depth 3 arithmetic circuits
D Grigoriev, M Karpinski
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
1191998
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20