Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1995 Copyright 1995 Universität Bonn, Institut für Informatik, Abteilung V

85127 ESPRIT BR Working Group - 7097 (RAND): Annual Progress Report July 1, 1993 - June 30, 1994
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85128 ESPRIT BR , NSF Project RAND-REC: (Exploratory Collaborative Activity - EC-US030): Annual Progress Report July 1, 1993 - June 30, 1994
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85129 The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal Graphs
Elias Dahlhaus, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85131 A New Approach to Approximation of Steiner Trees
Marek Karpinski, Alexander Zelikovsky
[Download PostScript] [Download PDF] [Abstract]
85132 The Fully Compressed String Matching for Lempel-Ziv Encoding
Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85134 Correctness of Constructing Optimal Alphabetic Trees Revisited
Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85135 An Improved Pattern-Matching Algorithm for Strings with Short Descriptions
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
[Download PostScript] [Download PDF] [Abstract]
85136 Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
Sergei Evdokimov, Ilia Ponomarenko
[Download PostScript] [Download PDF] [Abstract]
85137 On a New High Dimensional Weisfeiler-Lehman Algorithm
Sergei Evdokimov, Marek Karpinski, Ilia Ponomarenko
[Download PostScript] [Download PDF] [Abstract]
85138 Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees
Marek Karpinksi, Lawrence L. Larmore, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85139 Alphabet Independent Optimal Parallel Search for Three-Dimensional Patterns (Revised Version)
Marek Karpinski, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85140 Almost Optimal Sublinear Time Parallel Recognition Algorithms of Three Subclasses of Cfl's
Lawrence L. Larmore, Wojciech Rytter
[Download PostScript] [Download PDF] [Abstract]
85141 Polynomial--Time Computation of the Degree of Algebraic Varieties in Zero--Characteristic and its Applications
Alexander L. Chistov
[Download PostScript] [Download PDF] [Abstract]
85142 Algorithms for Interpolation of Sparse Rational Functions Using Polynomial Number of Evaluations
Alexander Christov, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85143 A Lower Bound on the Size of Algebraic Decision Trees for the MAX Problem
Dima Grigoriev, Marek Karpinski, Andrew Yao
[Download PostScript] [Download PDF] [Abstract]
85144 A Lower Bound for Randomized Algebraic Decision Trees
Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky
[Download PostScript] [Download PDF] [Abstract]
85145 Approximating the Volume of General Pfaffian Bodies
Marek Karpinski, Angus Macintyre
[Download PostScript] [Download PDF] [Abstract]
85146 A Simple Linear-Time Algorithm to Find the Contour in a Coloured Triangular Graph
Carsten Dorgerloh, Jens Luessem
[Download PostScript] [Download PDF] [Abstract]
Last Change: 02/04/03 at 10:32:24
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope