Tekniske rapporter 1995


95/1 Algorithms for Knapsack Problems. Ph.D. Thesis.
David Pisinger
95/2 Partial Evaluation Applied to Ray Tracing.
Peter Holst-Andersen
95/3 Thunks and the Lambda-calculus.
John Hatcliff and Olivier Danvy
95/4 Datalogi som Videnskab.
Peter Naur
95/5 An 0 (log log n) priority queue.
Mikkel Thorup
95/6 An 0 (nr ) algorithm for the Subset-sum Problem.
David Pisinger
95/7 On Some Stability Bounds Subject to Hille-Yosida Resolvent Conditions.
Jørgen Sand
95/8 From Paradigm to Algorithms in Computer Vision.
Mads Nielsen
95/9 Polymorphic Dynamic Typing. Aspects of Proof Theory and Inference.
Jakob Rehof
95/10 Space-efficient construction of optimal prefix codes.
Jyrki Katajainen, Alistair Moffat and Andrew Turpin
95/11 Asymptotically efficient in-place merging.
Jyrki Katajainen, Tomi Pasanen and George Titan
95/12 In-place calculation of minimum-redundacy codes.
Jyrki Katajainen
95/13 Parallel tree slicing.
Jyrki Katajainen, Mikkel Thorup and Jesper Träff
95/14 Mechanically Verifying the Correctness of an Offline Partial Evaluator.
John Hatcliff
95/15 A Computational Formalization for Partial Evaluation.
John Hatcliff and Olivier Danvy
95/16 Distributed and Parallel Graph Algorithms: Models and Experiments.
Jesper Larsson Träff. Ph.D. Theise
95/17 Procedings fra den 4. Danske Konference i Mønstergenkendelse og Billedanalyse.
Peter Johansen
95/18 Structured Programs have Small Tree-Width and Good Register Allocation.
Mikkel Thorup
95/19 Optimale dynamiske algoritmer til bestemmelse af nærmeste fælles forfædre på pointermaskiner.
Stephen Alstrup
95/20 Object and Native Code Thread Mobility Among Heterogeneous Computers.
Bjarne Steensgaard and Eric Jul
95/21 "When can We sort in o (n log n) Timer ?" Revisited.
Amir M.Ben-Amram
95/22 Pointer Machines and Pointer Algorithms: an Annotated Bibliography.
Amir M. Ben-Amram
95/23 Average-Case Complexity of Sorting on a RAM.
Amir M.Ben-Amram
95/24 Evaluation and Implementation of Operating System Support for Multiple Network Interfaces.
Michael Seifert and Ole Sass Thrane
95/25 On some initial value problems related to the Pantograph Equation.
Jørgen Sand
95/26 Improved Sampling with Applications to Dynamic Graph Algorithms.
Mikkel Thorup and Monika Rauch Henzinger
95/27 Constants in parallel sorting.
Jyrki Katajainen
95/28 Finding all nearest smaller values on a distributed memory machine.
Jyrki Katajainen
95/29 Parallel Branch and Bound - Principles and Personal Experiences.
Jens Clausen
95/30 Optimal algorithms for finding nearest common ancestors in dynamic trees.
Stephen Alstrup
95/30 Numerical Computations On Massively Parallel Graph Reduction Machine.
Martin Funk Larsen, Ph.D.Dissertation