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

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

85255 Optimal Trade-Off for Merkle Tree Traversal
Piotr Berman, Marek Karpinski, Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
85256 An Efficient Data Structure for Searching Strings
Marek Karpinski, Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
85257 Wavelet Based Erasure-Resilient Video Transmission System
Joachim M. Buhmann, Marek Karpinski, Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
85258 A Note on Traversing Skew Merkle Trees
Marek Karpinski and Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
85259 Computational Complexity of Some Restricted Instances of 3SAT
Piotr Berman, Marek Karpinski and Alexander D. Scott
[Download PostScript] [Download PDF] [Abstract]
85260 TSP with Bounded Metrics: Approximation Hardness for the (1,2) Case
Lars Engebretsen and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85261 Space Efficient Dynamic Orthogonal Range Reporting
Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
Last Change: 01/10/05 at 17:13:16
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope