|
Universität Bonn -> Institut für Informatik -> Abteilung V | ||
CS-Reports 1998 |
Copyright 1998 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
85184 |
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
Farid Ablayev, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85185 |
Strong Version of the Basic Deciding Algorithm for the Existential Theory of Real Fields
Alexander Christov [Download PostScript] [Download PDF] [Abstract] |
|
85186 |
ESPRIT Working Group: 21726 Randomized Algorithms (RAND2) Annual Progress Report
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85187 |
On Approximation Hardness of Dense TSP and other Path Problems
W. Fernandez de la Vega, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85188 |
ESPRIT BR Project RAND-REC EC-US Exploratory Collaborative Activity -- EC-US 030 Final Progress Report July 1, 1993 -- September 30, 1997
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85189 |
Approximation Algorithms for Bandwidth Problems on some large Graph Classes
Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
85190 |
On Efficient Decoding of Huffman Codes
Yakov Nekritch [Download PostScript] [Download PDF] [Abstract] |
|
85191 |
Approximation of the Permanent for Graphs of Density Less than 1/2 is hard
Elias Dahlhaus, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85192 |
Randomized OBDDs and the Model Checking
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85193 |
On Some Tighter Inaproximability Results
Piotr Berman, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85194 |
On the Computation Power of Randomized Branching Programs
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85195 |
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Sanjeev Arora, David Karger, Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85196 |
Some Separation Problems on Randomized OBDDs
Marek Karpinski, Rustam Mubarakzjanov [Download PostScript] [Download PDF] [Abstract] |
|
85197 |
Optimal Prefix-Free Codes for Unequal Letter Costs:
Dynamic Programming with the Monge Property
Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter [Download PostScript] [Download PDF] [Abstract] |
|
85198 |
NP-Hardness of the Bandwidth Problem on Dense Graphs (Revised)
Marek Karpinski, Juergen Wirtgen [Download PostScript] [Download PDF] [Abstract] |
|
85199 |
On Some Tighter Inapproximability Results, Further Improvements
Marek Karpinski, Piotr Berman [Download PostScript] [Download PDF] [Abstract] |
|
85200 |
A Note on Las Vegas OBBDs
Marek Karpinski, Rustam Mubarakzjanov [Download PostScript] [Download PDF] [Abstract] |
|
Last Change:
11/19/08 at 15:33:43
English |
Universität Bonn -> Institut für Informatik -> Abteilung V |