Skip to main content
Princeton Engineering
Magnifying Glass
Princeton Computer Science
CS GUIDE

Main navigation

  • Academics
    • Undergraduate Program
    • Graduate Program
    • Courses
  • Research
    • Research Areas
    • Technical Reports
    • Computing Facilities
  • People
    • Faculty
    • Researchers
    • Technical Staff
    • Administrative Staff
    • Graduate Students
    • Undergraduate Students
    • Graduate Alumni
  • News & Events
    • Events
    • News
  • Diversity & Outreach
    • Climate and Inclusion Committee
    • REU on AI and Machine Learning
    • Resources for students
    • Outreach initiatives
    • Resources for faculty and staff

Reports for Author "Karpinski, Marek"

  • TR-526-96 - Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks (1996-10-00)
    Macintyre, Angus / Karpinski, Marek
  • TR-527-96 - A Lower Bound for Randomized Algebraic Decision Trees (1996-10-00)
    Smolensky, Roman / Grigoriev, Dima / Karpinski, Marek / Meyer auf der Heide, Friedhelm
  • TR-531-96 - On the Power of Randomized Branching Programs (1996-10-00)
    Ablayev, Farid / Karpinski, Marek
  • TR-538-96 - Randomized Omega (n^2) Lower Bound for Knapsack (1996-12-00)
    Grigoriev, Dima / Karpinski, Marek
  • TR-539-96 - Correctness of Constructing Optimal Alphabetic Trees Revisited (1996-12-00)
    Larmore, Lawrence L. / Rytter, Wojciech / Karpinski, Marek
  • TR-542-97 - Approximating Dense Cases of Covering Problems (1996-12-00)
    Zelikovsky, Alexander / Karpinski, Marek
Princeton Shield Princeton University
Department of Computer Science
Visit Us
35 Olden Street
Princeton, NJ 08544
Contact Us
Jobs
Princeton Engineering
© 2025 The Trustees of Princeton University | Privacy | Accessibility
Connect with us
Facebook
X.com
LinkedIn
YouTube