Reports for Author "Karpinski, Marek" | Computer Science Department at Princeton University

TR-542-97 - Approximating Dense Cases of Covering Problems (1996)
Authors: Karpinski, Marek / Zelikovsky, Alexander
TR-539-96 - Correctness of Constructing Optimal Alphabetic Trees Revisited (1996)
Authors: Karpinski, Marek / Larmore, Lawrence L. / Rytter, Wojciech
TR-538-96 - Randomized Omega (n^2) Lower Bound for Knapsack (1996)
Authors: Grigoriev, Dima / Karpinski, Marek
TR-531-96 - On the Power of Randomized Branching Programs (1996)
Authors: Ablayev, Farid / Karpinski, Marek
TR-527-96 - A Lower Bound for Randomized Algebraic Decision Trees (1996)
Authors: Grigoriev, Dima / Karpinski, Marek / Meyer auf der Heide, Friedhelm / Smolensky, Roman
TR-526-96 - Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks (1996)
Authors: Karpinski, Marek / Macintyre, Angus