|
University of Bonn -> Department of Computer Science -> Chair V | ||
CS-Reports 1994 |
Copyright 1994 University of Bonn,
Department of Computer Science, Chair V
|
|
85107 |
On the Sequential and Parallel Complexity of Matching in Chordal and Strongly Chordal Graphs
Elias Dahlhaus, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85109 |
Fast Interpolation Algorithms for Sparse Polynomials with Respect to the Size of Coefficients
Alexander Christov, Marek Karpinksi [Download PostScript] [Download PDF] [Abstract] |
|
85112 |
Polynomial-Time Computation of the Dimension of Affine Algebraic Varieties in Zero-Characteristic
Alexander L. Chistov [Download PostScript] [Download PDF] [Abstract] |
|
85113 |
A Polynomial Time Subpolynom-Approximation Scheme for the Acyclic Directed Steiner Tree Problem
Alexander Zelikovsky [Download PostScript] [Download PDF] [Abstract] |
|
85114 |
Lower Bound for Randomized Linear Decision Trees Recognising a Union of Hyperplanes in a Generic Position
Dima Grigoriev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85115 |
1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Marek Karpinski, Alexander Zelikovsky [Download PostScript] [Download PDF] [Abstract] |
|
85116 |
Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
Marek Karpinski, Angus Macintyre [Download PostScript] [Download PDF] [Abstract] |
|
85117 |
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees
Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov [Download PostScript] [Download PDF] [Abstract] |
|
85118 |
Randomized Navigation to a Wall through Convex Obstacles
Piotr Berman, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85119 |
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Sanjeev Arora, David Karger, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85122 |
Once again: Connected Components on a CREW-PRAM
Kai Werther [Download PostScript] [Download PDF] [Abstract] |
|
85125 |
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees
Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov [Download PostScript] [Download PDF] [Abstract] |
|
85126 |
Constant-space string matching with smaller number of comparisons: sequential sampling
Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter [Download PostScript] [Download PDF] [Abstract] |
|
Last Change:
11/20/08 at 12:19:01
Deutsch |
University of Bonn -> Department of Computer Science -> Chair V |