Schriftenreihen der Institute für Informatik und Mathematik

Report Series of the Institutes for Computer Science and Mathematics

Report Series A: Preprints

Report Series B: Expository material, lecture notes, theses

Report Series A

Number	Institute	Author/s	Title
2009
09-01	MATH	I. Schiermeyer, M. Sonntag & H.-M. Teichert	Structural properties and hamiltonicity of neighborhood graphs
09-02	MATH	R. Hielscher, J. Prestin & A. Vollrath	Fast summation of Functions on SO (3)
09-03	TCS	M. Liskiewicz, R. Reischuk & U. Wölfel	Grey-Box Steganography
2008
08-01	TCS	M. Hinkelmann, A. Jakoby & P. Stechert	t-Private and t-Secure Auctions
08-02	TCS	M. Elberfeld, T. Tantau	Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
08-03	TCS	T. Tantau	Complexity of the Undirected Radius and Diameter Problems for Succinctly Represented Graphs
08-04	TCS	M. Hinkelmann & A. Jakoby	Preserving Privacy versus Data Retention
08-05	TCS	M. Elberfeld, I. Schnoor & T. Tantau	Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
08-06	MATH	D. Langemann & J. Prestin	Multivariate periodic wavelet analysis
08-07	MATH	K. Ens, J. von Berg & B. Fischer	A Communication Term for the Combined Registration and Segmentation
08-08	MATH	K. Ens, F. Wenzel, S. Young, J. Modersitzki & B. Fischer	Design of a synthetic database for the validation of nonlinear registration and segmentation of MR brain image
08-09	MATH	K. Ens, S. Heldmann, J. Modersitzki & B. Fischer	Improving a registration and/or segmentation task by incorporating characteristics of the displacement feld
08-10	MATH	K. Ens, F. Wenzel & B. Fischer	Verbesserung der Symmetrie von Hirnaufnahmen entlang der Sagittalebene
2007
07-01	MATH	K.Ens, H. Schumacher, A. Franz & B. Fischer	Improved elastic medical image registration using mutual information
07-02	MATH	E. Röhl, H. Schumacher & B. Fischer	Automatic detection of abrupt patient motion in SPECT data acquisition
07-03	MATH	J. Keiner	Gegenbauer polynomials and semiseparable matrices
07-04	MATH	H. Schumacher, J. Modersitzki & B. Fischer	Combined Reconstruction and Motion Correction in SPECT Imaging
07-05	ROB	C. Bodensteiner, C. Darolti, H. Schumacher, L. Matthäus & A. Schweikard	Motion and Positional Error Correction for Cone Beam 3D-Reconstruction with Mobile C-arms
07-06	MATH	D. Potts, J. Prestin & A. Vollrath	A Fast Fourier Algorithm on the Rotation Group
07-07	IFIS	W. Dosch, C. Grelck & A. Stümpel	14. Kolloquium Programmiersprachen und Grundlagen der Programmierung (KPS'07)
07-08	MATH	T. Knopp, H. Eggers, H. Dahnke, J. Prestin, J. Senegas	Iterative Off-resonance and Signal Decay Correction for Improved Multi-echo Imaging in MRI
07-09	MATH	K. Ens, J. von Berg, S. Kabus, S. Renisch, B. Fischer	Distanzmaß für die Segistrierung
07-10	MATH	H. Schumacher, S. Heldmann, E. Haber	Iterative Reconstruction of SPECT Images using Adaptive Multi-Level Refinement
2006
06-01	TCS	B. Manthey & L. Shankar Ram	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
06-02	TCS	B. Manthey	Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
06-03	MATH	H. Schumacher & B. Fischer	A new flexible reconstruction framework for motion correction in SPECT imaging
06-04	MATH	L. Mattner & B. Roos	A shorter proof of Kanters Bessel function concentration bound
06-05	MATH	J. Modersitzki & N. Papenberg	A Unified Approach to Registration and Intensity Correction (RIC)
06-06	MATH	M. Ludwig, J. Koch & B. Fischer	An application of the finite volume method to the bio-heat-transfer-equation in premature infants
06-07	MATH	J. Keiner & D. Potts	Fast evaluation of quadrature formulae on the sphere
06-08	MATH	L. Mattner	Lower bounds for tails of sums of indipendent symmetric random variables
06-09	MATH	H. Schumacher & B. Fischer	A new Approach for Motion Correction in SPECT imaging
06-10	MATH	K. Ens & H. Schumacher & A. Franz & B. Fischer	Wahl eines gewichteten Distanzmaßes für monomodale Bilder in der nichtparametrischen Registrierung
06-11	MATH	N. Papenberg, H. Schumacher, S. Heldmann, S. Wirtz, S. Bommersheim, K. Ens, J. Modersitzki & B. Fischer	A Fast and Flexible Image Registration Toolbox: Design and Implementation of the general approach
06-12	MATH	J. Modersitzki	FLIRT with rigidity-image registration with a local non-rigidity penalty
2005
05-01	MATH	M. Sonntag & H.-M. Teichert	Minimizing the number of strong components in digraphs having a given competition hypergraph
05-02	MATH	H. N. Mhaskar & J. Prestin	Polynomial Frames: A Fast Tour
05-03	MATH	R. Hielscher, S. Bernstein, H. Schaeben, K. G. van den Boogaart, J. Beckmann & J. Prestin	PDF-to-ODF Inversion by Approximation with Spherical Radial Basis Functions
05-04	MATH	H. Schaeben, S. Bernstein, R. Hielscher, J. Beckmann, J. Keiner & J. Prestin	High Resolution Texture Analysis with Spherical Wavelets
05-05	MATH	K. G. van den Boogaart, R. Hielscher, J. Prestin & H. Schaeben	Application of the radial basis function method to texture analysis
05-06	TCS	B. Manthey	Restricted Cycle Covers in Undirected Graphs
05-07	TCS	A. Jakoby & M. Liskiewicz	Privacy of Two-Party Quantum Computation
05-08	TCS	M. Hinkelmann & A. Jakoby	Communications in Unknown Networks: Preserving the Secret of Topology
05-09	TCS	M. Liskiewicz & U. Wölfel	On the Intractability of Inverting Geometric Distortions in Watermaking Schemes
05-10	MATH	T. Knopp, S. Kunis & D. Potts	Fast Iterative Reconstruction for MRI
05-11	MATH	M. Fenn, S. Kunis & D. Potts	Fast evaluation of trigonometric polynomials from hyperbolic crosses
05-12	MATH	S. Kunis, D. Potts & G. Steidl	Fast Gauss transforms with complex parameters
05-13	TCS	M. Hinkelmann, A. Jakoby & P. Stechert	Dynamic t-Private Auctions
05-14	MATH	K. Keller & M. Sinn	Ordinal symbolic dynamics
05-15	MATH	C. Hipp & L. Mattner	On the normal approximation to symmetric binomial distributions
05-16	TCS	A. Jakoby
05-17	TCS	B. Manthey & R. Reischuk	Smoothed Analysis of the Height of Binary Search Trees
05-18	TCS	H. Völzer, D. Varacca & E. Kindler	Defining Fairness
05-19	IFIS	B.C. Hammerschmidt, M. Kempa & V. Linnemann	Comparions and Performance Measurements of XML Index Structures
05-20	TCS	H. Völzer	On Conspiracies and Hyperfairness in Distributed Computing
05-21	TCS	M. Liskiewicz & U. Wölfel	Towards a Practical Realisation of Cryptographically Secure Steganography
05-22	TCS	C.J. Eibl, M. Hinkelmann, A. Jakoby & O. Lachish	Preserving the Secret of Topology with One Omniscient Party
05-23	TCS	A. Jakoby & M. Liskiewicz	Revealing Additional Information in Two-Party Computations
05-24	TCS	B. Manthey	Approximability of Minimum AND-Circuits
05-25	MATH	J. Keiner & J. Prestin	A Fast Algorithm For Sperical Basis Approximation
05-26	MATH	H. Schumacher, B. Fischer & A. Franz	Weighted non-rigid image registration
05-27	MATH	H. Schumacher, A. Franz & B. Fischer	Weighted medical image registration with automatic mask generation
05-28	MATH	M. Sonntag & H.-M. Teichert	Competition hypergraphs of hamiltonian and related digraphs
2004
04-01	TCS	M. Liskiewicz, H. J. Purohit & D. V. Raje	The Complexity of Generalized Consensus String Problem
04-02	TCS	B. Manthey	Non-Approximability of Weighted multiple Sequence Alignment for Arbitrary Metrics
04-03	TCS	M. Liskiewicz, H. J. Purohit & D. V. Raje	Relation of residues in the variable region of 16S rDNA sequences and their relevance to genus-specificity
04-04	MATH	J. Prestin & E. Quak	Periodic and Spline Multiresolution Analysis and the Lifting Scheme
04-05	MATH	R. Khabiboulline & J. Prestin	Asymptotic formulas for the frame coefficients generated by Laguerre and Hermite type polynomials
04-06	MATH	H. N. Mhaskar & J. Prestin	On local smoothness classes of periodic functions
04-07	MATH	N. Lain Fernandez & J. Prestin	Interpolatory Band-limited Wavelet Bases on the Sphere
04-08	MATH	F. Mattner, L. Mattner, H. U. Borck & P. Gastmeier	Nosocomial Norovirus Outbreak Severities Depend on the Index Case: Patient or Staff
04-09	IFIS	B. C. Hammerschmidt, M. Kempa, V. Linnemann	On the Index Selection Problem applied to Key oriented XML Indexes
04-10	TCS	H. Völzer	On Randomization versus Synchronization in Distributed Systems
04-11	TCS	H. Völzer	A Constructive Proof for FLP
04-12	MATH	S. Kunis, D. Potts	Stability Results for Scattered Data Int erpolation by Trigonometric Polynomials
04-13	INB	T. Martinetz & A. Madany Mamlouk	Easy and Fast Computation of Approximate Smallest Enclosing Balls
04-14	TCS	J. Arpe & R. Reischuk	On the Complexity of Optimal Grammar-Based Compression
2003
03-01	MATH	B. Fischer & J. Modersitzki	Combination of automatic non-rigid and landmark based registration: the best of both worlds
03-02	TCS	M. Bläser	Budget Balanced Mechanisms for the Multicast Pricing Problem with Rates
03-03	TCS	M. Liskiewicz & B. Manthey	New Lower and Upper Bounds for the Competitive Ratio of Transmission Protocols
03-04	TCS	J. Arpe, A. Jakoby & M. Liskiewicz	One-Way Communication Complexity of Symmetric Boolean Functions
03-05	MATH	E. D'Agostino, J. Modersitzki, F. Maes, D. Vandermeulen, B. Fischer & P. Suetens	Free-form registration using mutual information and curvature regularization
03-06	MATH	B. Fischer & J. Modersitzki	FLIRT: A Flexible Image Registration Toolbox
03-07	ITM	H. Neukirchen, Z. R. Dai & J. Grabowski	Communication Patterns for Expressing Real-Time Requirements Using MSC and their Application to Testing
03-08	MATH	J. Modersitzki
03-09	MATH	J. Modersitzki
03-10	TCS	M. Bläser, A. Jakoby, M. Liskiewicz & B. Manthey	Privacy in Non-Private Environments
03-11	MATH	M. Böhme & D. Potts	A Fast Algorithm for Spherical Filtering on Arbitrary Grids
03-12	TCS	J. Arpe & R. Reischuk	Robust Inference of Relevant Attributes
03-13	MATH	L. Dümbgen, S. Freitag & G. Jongbloed	Estimating a Unimodal Distribution from Interval-Censored Data
03-14	TCS	A. Jakoby, M. Liskiewicz, R. Reischuk & C. Schindelhauer	On Average-Case Bit Complexity of Sorting Circuits
2002
02-01	MATH	M. Conrad & J. Prestin	Multiresolution on the Sphere
02-02	MATH	D. Potts & G. Steidl	Fast Summation at Nonequispaced Knots by NFFTs
02-03	TCS	M. Bläser & B. Siebert	Two Approximation Algorithms for 3-Cycle Covers
02-04	MATH	W. zu Castell & F. Filbir	De la Vallée Poussin means for the Hankel transform
02-05	TCS	M. Bläser, A. Jakoby, M. Liskiewicz & B. Siebert	Private Computation - k-connected versus 1-connected Networks
02-06	MATH	A. Meister	Viscous Fluid Flow at all Speeds: Analysis and Numerical Simulation
02-07	MATH	B. Fischer & J. Modersitzki	A unified approach to fast image registration and a new curvature based registration technique
02-08	TCS/ITI/MATH	M. Böhme, R. Hagenau, J. Modersitzki & B. Siebert	Non-Linear Image Registration on PC-Clusters Using Parallel FFT Techniques
02-09	TCS	M. Bläser	Algebras of minimal rank over arbitrary fields
02-10	IFIS	M. Kempa & V. Linnemann	XML-Objekte: Das Projekt XOBE
02-11	MATH	A. Nieslony, D. Potts & G. Steidl	Rapid Evaluation of Radial Functions by Fast Fourier Transforms at Nonequispaced Knots
02-12	MATH	L. Dümbgen, S. Freitag & G. Jongbloed	Consistency of Concave Regression with an Application to Current-Status Data
02-13	MATH	S. Kunis & D. Potts	Fast spherical Fourier algorithms
02-14	MATH	N. Laín Fernández	Polynomial Bases on the Sphere
02-15	MATH	B. Fischer & J. Modersitzki	Curvature Based Image Registration
02-16	TCS	M. Bläser & B. Siebert	Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
02-17	TCS	B. Manthey & R. Reischuk	The Intractability of Computing the Hamming Distance
02-18	MATH	N. Laín Fernández & J. Prestin	Localization of the Spherical Gauss-Weierstrass Kernel
02-19	MATH	H. Burchard, E. Deleersnijder & A. Meister	A high-order conservative Patankar-type discretisation for stiff systetms of production-destruction equations
02-20	TCS	M. Bläser	A new approximation algorithm for the asymmetric TSP with triangle inequality
02-21	MATH	M. Sonntag & H.-M. Teichert	Competition hypergraphs
02-22	MATH	M. Fenn & D. Potts	Fast Summation based on fast trigonometric transforms at nonequispaced nodes
02-23	ROB	A. Schweikard, H. Shiomi, M. Doetter, M. Roth, K. Berlinger & J. Adler	Fiducial-Less Compensation of Breathing Motion in Lung Cancer Radiosurgery
02-24	MATH	N. Kalwat & J. Prestin	Shift-invariant Spaces on the Torus
02-25	MATH	N. Laín Fernández	Localized polynomial bases on the sphere
02-26	MATH	J. Modersitzki & B. Fischer	Optimal image registration with a guaranteed one-to-one point match
2001
01-01	MATH	J. Prestin	Trigonometric Wavelets
01-02	MATH	K. Weinberg	Adaptive Computation of Elasto-Plastic Plates by a Locking Free Finite Element Method
01-03	TCS	T. Zeugmann	Learning Approximations of Recursive Concepts
01-04	MATH	B. Fischer & W. Themistoclakis	Orthogonal polynomial wavelets
01-05	MATH	L. Dümbgen	Confidence bands for convex median curves using sign-tests
01-06	TCS	S. Jain, E. Kinber, R. Wiehagen & T. Zeugmann	Refutable Inductive Inference of Recursive Functions
01-07	MATH	F. Filbir & W. Themistoclakis	On the Construction of de la Vallée Poussin Means for Orthogonal Polynomials Using Convolution Structures
01-08	TCS	M. Bläser & B. Siebert	Computing Cycle Covers without Short Cycles
01-09	MATH	C. Carstensen & K. Weinberg	Adaptive Mixed Finite Element Method for Reissner-Mindlin Plate
01-10	MATH	J. Prestin, E. Quak, H. Rauhut & K. Selig	On the connection of uncertainty principles for functions on the circle and on the real line
01-11	ITM	M. Ebner	A Mapping of OMG IDL to TTCN-3
01-12	MATH	Hm. Zeuner	Stochastic Roundoff Error Analysis with Applications to DFT and DCT
01-13	TCS	M. Bläser	Algebras of minimal rank over perfect fields
01-14	ITM	Z. R. Dai, J. Grabowski & H. Neukirchen	Timed TTCN-3 - A Real-time extension for TTCN-3
01-15	TCS	M. Liskiewicz, M. Ogihara & S. Toda	The Complexity of Counting Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs
01-16	MATH	D. Potts	Fast Algorithms for Discrete Polynomial Transforms on arbitrary Grids
01-17	MATH	D. Potts	Approximation of scattered data by trigonometric polynomials on the torus and the 2-sphere
01-18	MATH	B. Fischer & J. Modersitzki	Fast diffusion registration
01-19	TCS	R. Reischuk & K. Genther	Analysing The Competitive Ratio of Caching in Multiprocessor Systems
01-20	MATH	F. Filbir, R. Lasser & R. Szwarc	Reiter's condition P1 and approximate identities for hypergroups
01-21	TCS	M. Bläser	An 8/13-Approximation Algorithm for the Asymmetric Maximum TSP
2000
00-01	MATH	H.-M. Teichert	Sum labellings of cycle hypergraphs
00-02	TCS	A. Jakoby, M. Liskiewicz & R. Reischuk	Scheduling Dynamic Graphs
00-03	MATH	B. Fischer	An application of the finite volume method to the thermoregulation of infants
00-04	MATH	K. Weinberg	A locking free and adaptive finite element method for Reissner-Mindlin plates
00-05	TCS	B. Siebert	Die Komplexität des Multiple Sequence Alignment Problems bei nichtmetrischen Kostenfunktionen
00-06	MATH	J. Modersitzki & O. Schmitt	Image Registration of Histological Sections
00-07	TCS	A. Jakoby, M. Liskiewicz & R. Reischuk	The Expressive Power and Complexity of Dynamic Process Graphs
00-08	MATH	M. K. Ng & D. Potts	Fast Iterative Methods for Sinc Systems
00-09	TCS	B. Siebert	Non-Approximability of Weighted Multiple Sequence Alignment
00-10	ITM	M. Schmitt	The Development of a Parser for SDL-2000
00-11	ITM	S. Mayer	Automatic test generation for the Test Synchronization Protocol 1 with Autolink
00-12	ITM	St. Heymer	A Semantics for MSC based on Petri-Net Components
00-13	MATH	H.N. Mhaskar, F.J. Narcowich, J.D. Ward & J. Prestin	Polynomial frames on the sphere
00-14	MATH	L. Dümbgen & L. Hömke	P-Values for Discriminant Analysis
00-15	MATH	D. Potts & G. Steidl	New Fourier reconstruction algorithms for computerized tomography
00-16	MATH	K. Weinberg	Preasymptotic Performance of Modified Mixed Finite Element Schemes for Plates
00-17	TCS	A. Jakoby, M. Liskiewicz & R. Reischuk	Space Efficient Algorithms for Series-Parallel Graphs
00-18	TCS	A. Piccolboni & Ch. Schindelhauer	Discrete Prediction Games with arbitrary Feedback and Loss
00-19	ITM	B. Koch	Testfallspezifikation für verteilte Testarchitekturen
00-20	IFIS	R. Behrens & V. Linnemann	XML-basierte Informationsmodellierung am Beispiel eines Medienarchivs f¨r die Lehre
00-21	IFIS	M. Kempa & V. Linnemann	Effizientes Parsen von XML Dokumenten ohne Einschränkungen: DTD impliziert LL(1)-Grammatik
00-22	MATH	J. Prestin & E. Quak	On the arclength of trigonometric interpolants
00-23	MATH	K. Weinberg & U. Gabbert	An Adaptive pNh-Technique for Global-Local Finite Element Analysis
00-24	MATH	L. Dümbgen & R. B. Johns	Confidence Bands for Isotonic Median Curves Using Sign Tests
1999
99-01	MATH	D. Potts & G. Steidl	Preconditioners for ill-conditioned Toeplitz systems constructed from positive kernels
99-02			leer!
99-03	MATH	M. Tasche & Hm. Zeuner	Roundoff error analysis for the fast fourier transform with precomputed twiddle factors
99-04	MATH	H.-M. Teichert	Classes of hypergraphs with sum number one
99-05	TCS	S. Weis	Das Entscheidungsproblem Physikalische Kartierung mit starkchimerischen Fehlern
99-06	TCS	S. Weis	Zur algorithmischen Komplexität des Optimierungsproblems Physikalische Kartierung mit starkchimerischen Fehlern
99-07	TCS	A. Döring, G. Lustig, W. Obelöer & S. Petri	Implementation of Virtual Channels for HIC
99-08	MATH	B. Fischer & F. Peherstorfer	Comparing the convergence rate of Krylov subspace methods via polynomial mappings
99-09	MATH	D. Potts, G. Steidl & M. Tasche	Numerical stability of fast trigonometric transforms
99-10	MATH	J. Modersitzki, G. Lustig, O. Schmitt & W. Obelöer	Elastic Registration of Brain Images on large PC-Clusters
99-11	IFIS	R. Behrens, G. Buntrock, C. Lecon & V. Linnemann	Is XML really enough?
99-12	MATH	R.H. Chan, D. Potts & G. Steidl	Preconditioners for non-Hermitian Toeplitz systems
99-13	MATH	M. Tasche & Hm. Zeuner	Roundoff error analysis for fast trigonometric transforms
99-14	MATH	D. Potts & G. Steidl	Preconditioning of Hermitian block-Toeplitz-Toeplitz-block matrices by level-1 preconditioners
99-15	MATH	L. Dümbgen	Optimal confidence bands for shape-restricted curves
99-16	MATH	B. Fischer	From orthogonal polynomials to iteration schemes for linear systems: CG and CR revisted
1998
98-01	TCS	A. Jakoby	The Average Time Complexity to Compute Prefix Functions in Processor Networks
98-02	MATH	L. Dümbgen & V. G. Spok oiny	Optimal Nonparametric Testing of Qualitative Hypotheses
98-03	TCS	A. Jakoby	The Computational Problem of Designing Avarage Efficient Networks
98-04	ITM	M. Schmitt, J. Grabowski, D. Hogrefe & B. Koch	Autolink -- Putting formal test methods into practice
98-05	ITM	B. Koch, J. Grabowski, D. Hogrefe & M. Schmitt	Autolink -- A Tool for Automatic Test Generation from SDL Specifications
98-06	TCS	Ch. Schindelhauer & A. Jakoby	Error Complexity Classes of Decision Problems
98-07	TCS	A. Jakoby, M. Liskiewicz & R. Reischuk	Scheduling Dynamic Graphs
98-08	ITM	B. Schnor	A Resource Management Concept for Dynamic Load Balancing of Parallel Applications in Heterogeneous Systems
98-09	IFIS	C. Lecon & V. Linnemann	Klassifikation und Beschreibung von Medienobjekten mit attributierten kontextfreien Grammatiken am Beispiel eines Medienarchivs für die Lehre
98-10	MATH	D. Potts	Preconditioners for indefinite Toeplitz matrices
98-11	MATH	H.-M. Teichert	The sum number of d-partite complete hypergraphs
98-12	MATH	L. Dümbgen	Application of Local Rank Tests to Nonparametric Regression
98-13	ITM	J. Grabowsky & Th. Walter	Towards an Integrated Test Methodology for Advanced Communication Systems
98-14	TCS	Ch. Schindelhauer	Toolbox for mental cardgames
98-15	TCS	R. Reischuk & Th. Zeugmann	A Complete and Light Average-Case Analysis of Learning Monomials
98-16	MATH	G. Baszenski, U. Schreiber & M. Tasche	Numerical Stability of Fast Cosine Transforms
98-17	TCS	A. Jakoby & R. Reischuk	Average Case Complexity of Unboundet Fanin Circuits
98-18	ITM	St. Heymer	Chemistry in Action: Discovering the Behaviour of a Network from Local Observations
98-19	IFIS	R. Behrens, C. Lecon, V. Linnemann & O. Schmitt	MONTANA: Ein Medienarchiv für die Lehre
98-20	MATH	D. Potts, G. Steidl & M. Tasche	Fast Fourier transforms for nonequispaced data: A tutorial
98-21	TCS	G. Buntrock	On Smullyan's Basis Property
98-22	TCS	R. Reischuk & Th. Zeugmann	An Average-Case Optimal One-Variable Pattern Language Learner
98-23	TCS	K. Genther	Effizienter Datenzugriff in Parallelrechnerarchitekturen: Modellierung der Caching- und Konsistenzproblematik
98-24	TCS	K. Genther	Gegenseitiger Ausschluss in abgeschwächten Speicherkonsistenzmodellen am Beispiel des Bakery-Algorithmus
98-25	TCS	K. Genther	Analyse der Datenzugriffszeiten für Multiprozessorsysteme mit Speicherhierarchien
98-26	MATH	M. Schürmann & R. Rascher-Friesenhausen	Time-Frequency Analysis Contributes to the Functional Interpretation of EEG Alpha Responses
98-27	ITM	E. Rudolph, J. Grabowski & P. Graubmann	Towards a Harmonization of UML-Sequence Diagrams and MSC
98-28	ITM	J. Grabowski, B. Koch, M. Schmitt & D. Hogrefe	SDL and MSC Based Test Generation for Distributed Test Architectures
98-29	MATH	B. Fischer & J. Modersitzki	Fast Inversion of Matrices Arising in Image Processing
98-30	MATH	J. Modersitzki, W. Obelöer, O. Schmitt & G. Lustig	Elastic matching of very large digital images on high performance clusters
1997
97-01	ITM	J. Grabowski, R. Scheurer, Z. R. Dai & D. Hogrefe	Applying SaMsTaG to the B-ISDN Protocol SSCOP -- Technical Description and TTCN Testsuite --
97-02	MATH	F. Filbir, R. Lasser & J. Obermaier	Blackman Kernel and Approximation Identities
97-03	ITM	A. Elk, J. Grabowski, D. Hogrefe, R. Jerome, B. Koch & M. Schmitt	Towards the Industrial Use of Validation Techniques and Automatic Test Generation Methods for SDL Specifications
97-04	MATH	D. Potts, G. Steidl & M. Tasche	Trigonometric Preconditioners for Block Toeplitz Systems
97-05	TCS	R. Reischuk	Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise
97-06	MATH	M. Sonntag & H.-M. Teichert	Sum Hypergraphs
97-07	ITM	J. Grabowski, R. Scheurer & D. Hogrefe	Comparison of an Automatically Generated and a Manually Specified Abstract Test Suite for the B-ISDN Protocol SSCOP
97-08	MATH	H.-M. Teichert	The sum number of d-uniform complete hypergraphs
97-09	MATH	M. Tasche	Simultaneous Polynomial Approximation in the Weighted Chebyshev Norm
97-10	TCS	C. Bertram-Kretzberg, Th. Hofmeister & H. Lefmann	Sparse 0-1-Matrices and Forbidden Hypergraphs
97-11	IFIS	R. Käckenhoff	Semantic Integration of Media Objects into Relational Database Systems
97-12	TCS	C. Bertram-Kretzberg, T. Hofmeister & H. Lefmann	Sparse 0-1-Matrices and Forbidden Hypergraphs
97-13	TCS	R. Reischuk & Th. Zeugmann	Learning One-Variable Pattern Languages in Linear Average Time
97-14	MATH	A.J. Wathen, B. Fischer & D.J. Silvester	The convergence of iterative solution methods for symmetric and indefinite linear systems
97-15	TCS	A. Jakoby & R. Reischuk	Scheduling Trees with Communication Delays
97-16	TCS	A. Jakoby & Ch. Schindelhauer	Optimization of Unary Costs
97-17	TCS	Ch. Schindelhauer & A. Jakoby	Computational Error Complexity Classes
1996
96-01	MATH	B. Fischer & J. Prestin	Wavelets Based on Orthogonal Polynomials
96-02	MATH	D. Potts, G. Steidl & M. Tasche	Kernels of Spherical Harmonics and Sphericals Frames
96-03	MATH	J. M. Borwein & R. Girgensohn	Evaluation of Triple Euler Sums
96-04	MATH	A. Ilchmann & M.-F. Weirig	Adaptive -Trackers for Anaerobic Fermentation Processes
96-05	MATH	D. Potts, G. Steidl & M. Tasche	Fast Algorithms for Discrete Polynomial Transforms
96-06	MATH	A. P. Bassom & A. Ilchmann	Oxygen Diffusion in Tissue Preparations with Michaelis-Menten Kinetics
96-07	TCS	R. Reischuk	Zeit und Raum in Rechnernetzen
96-08	TCS	M. Liskiewicz & R. Reischuk	Space Bounds for Interactive Proof Systems with Public Coins and Bounded Number of Rounds
96-09	TCS	A. Döring	Deriving Invariants for Cellular Automata
96-10	MATH	G. Winkler	Moment Sets of Bell-Shaped Distributions: Extreme Points, Extremal Decomposition and Chebysheff Inequalities
96-11	MATH	G. Winkler	An Adaptive Gradient Algorithm for Maximum Likelihood Estimation: A Tutorial
96-12	IFIS	L. Faulstich, V. Linnemann & M. Spiliopoulou	Unterstützung von Internet Data Warehousing durch Objekt-Grammatiken
96-13	IFIS	G. Braunreuther, V. Linnemann & H.-G. Lipinski	Unterstützung von Computersimulation durch objektorientierte Datenbanksysteme am Beispiel einer Anwendung aus der Medizin
96-14	ITI	B. Bieker & M. Maehle	User Transparent Checkpointing and Restart for Parallel Computers
96-15	MATH	H.-M. Teichert	On 3-Uniform Sum Hypergraphs
96-16	MATH	B. Fischer, A. Ramage, D. Silvester & A. J. Wathen	Towards Parameter-Free Streamline Upwinding for Advection-Diffusion Problems
96-17	TCS	M. Liskiewicz & R. Reischuk	Separating Small Space Complexity Classes of Stochastic Turing Machines
1995
95-01	TCS	M. Liskiewicz & R. Reischuk	The Sublogarithmic Alternating Space World
95-02	TCS	A. Jakobi, R. Reischuk & C. Schindelhauer	Circuit Complexity: From the Worst Case to the Average Case
95-03	TCS	A. Jakoby, R. Reischuk, C. Schindelhauer & S. Weis	The Average Case Complexity of the Parallel Prefix Problem
95-04	TCS	D. Dolev, R. Reischuk & R. Strong	Observable Clock Synchronization
95-05	TCS	M. Dietzfelbinger, R. Reischuk & C. Schindelhauer	Feasible Time-Optimal
95-06	TCS	A. Jakoby, R. Reischuk & C. Schindelhauer	Malign Distributions for Average Case Circuit Complexity
95-07	TCS	M. Liskiewicz & R. Reischuk	The Complexity World Below Logarithmic Space
95-08	TCS	A. Jakoby, R. Reischuk & C. Schindelhauer	The Complexity Broadcasting in Planar and Decomposable Graphs
95-09	MATH	R. Lasser	On the Modified Moment Problem with Solution Carried by [-1,1]
95-10	MATH	R. Lasser	On Lag Windows Connected with Jacobi Polynomials
95-11	MATH	G. Budke & R. Lasser	A Recursive Algorithm for the Solution of Special Non-Linear Stochastic Differential Equations
95-12	MATH	G. Welzl & R. Lasser	A Certain Robustness for Tests in the Case of Discrete Distributions
95-13	MATH	H.-M. Teichert	The Structure of Sum Graphs Gn
95-14	MATH	A. Ilchmann	Universal Adaptive Stabilization of Nonlinear Systems
95-15	MATH	F. Allgöwer, J. Ashman & A. Ilchmann	High-Gain Adaptive -Tracking for Nonlinear Systems
95-16	MATH	F. Allgöwer & A. Ilchmann	Adaptive -Tracking for Chemical Processes
95-17	IFIS	U. Masermann	Ablauforganisation am Beispiel der Zeichnungsverwaltung einer Engineering Database
95-18	TCS	A. Jakoby & R. Reischuk	Data Transmission in Processor Networks
95-19	MATH	B. Fischer, A. Ramage, D. Silvester & A.J. Wathen	Minimum Residual Methods for Augumented Systems
95-20	TCS	K. Cronauer, U. Hertrampf, H. Vollmer & K.W. Wagner	The Chain Method to Separate Counting Classes
95-21	TCS	U. Hertrampf	Regular Leaf Languages and (Non-)Regular Tree Shapes
95-22	TCS	G. Buntrock	Growing Context-Sensitive Languages and Church-Rosser Languages
95-23	MATH	F. Filbir & R. Lasser	Hamming Kernels and Approximate Identities
95-24	TCS	A. Jakoby & C. Schindelhauer	On the Complexity of Worst Case and Expected Time in a Circuit
95-25	MATH	P. Imkeller	On the Smoothness of the Laws of Random Flags and Oseledets Spaces of Random Dynamical Systems generated by Linear Stochastic Differential Equations
95-26	TCS	D. Dolev, R. Reischuk, R. Strong & E. Wimmers	A Decentralized High Performance Time Service Architecture

---