CS TRIER: List of 1996 Technical Reports Mathematics / Computer Science


Remember: The hyperlinks at the numbers reference the report's abstract, while the hyperlinks at the titles reference the full postscript text.

01
R. Horst, M. Nast:
Linearly Constrained Global Minimization of Functions with Concave Minorants
02
Ch. Meinel, A. Slobodovä:
An Adequate Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
03
R. Horst, N. V. Thoai:
Utility Function Programs and Optimization over the Efficient Set in Multiple Objective Decision Making
04
T. Theobald, Ch. Meinel:
State Encodings and OBDD-Sizes
05
H. Seidl:
Fast and Simple Nested Fixpoints
06
R. Horst:
On Generalized Bisection of N-Simplices
07
U. Hertrampf:
On the Acceptance Power of Groups and Semigroups
08
Th. Burger, P. Gritzmann:
Polytopes in Combinatorial Optimization
09
F. Leibfritz, E. W. Sachs:
Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
10
D. Baum:
BMAP/G/1-Queues: Properties of the Fundamental-Period-Matrix G
11
C. Fecht, H. Seidl:
An Even Faster Solver for General Systems of Equations
12
Ch. W. Keßler:
Scheduling Expression DAGs for Minimal Register Need
13
K. Jansen, J. Reiter:
Approximation Algorithms for Register Allocation
14
E. Levitin, R. Tichatschke:
On Smoothing of Generalized max-Functions via \epsilon-Regularization
15
M. Laumen:
Newton's Method for a Class of Optimal Shape Design Problems
16
M. Laumen:
A Modified Mesh Independence Principle of Newton's Method
17
M. Laumen:
Structured PSB-Update for Optimal Shape Design Problems
18
H. Finner, M. Roters:
Log-concavity and Inequalities for Chi-square, F and Beta Distributions with Applications in Multiple Comparisons
19
Th. Erlebach, K. Jansen:
Scheduling of Virtual Connections in Fast Networks
20
A. Kaplan, R. Tichatschke:
Proximal Point Methods in Examples
21
M. Gugat:
Ein Newtonverfahren zur zeitoptimalen Vibrationsdämpfung
22
D. Baum:
Convolution Algorithms for BMAP/G/1-Queues
23
Ch. Meinel, Th. Theobald:
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
24
R. Gardner, P. Gritzmann, D. Prangenberg:
On the Reconstruction of Binary Images from Their Discrete Radon Transforms
25
P. Gritzmann, V. Klee:
Computational Convexity
26
A. Czumaj, P. Kanarek, M. Kutylowski, K. Lorys:
Fast Generation of Random Permutations via Networks Simulation
27
A. Kaplan, R. Tichatschke:
Proximal Interior Point Approach in Convex Programming
28
A. Brieden, P. Gritzmann:
On Helly's Theorem: Algorithms and Extensions
29
K. Lux, M. Wiegelmann:
Condensing Tensor Product Modules
30
K. Lux, M. Wiegelmann:
Determination of Socle Series using the Condensation Method
31
B. Sturmfels, M. Wiegelmann:
Structural Gröbner Basis Detection
32
M. Gugat:
A Parametric View to the Mangasarian-Fromovitz Constraint Qualification
33
M. Laumen:
A Comparison of Numerical Methods for Optimal Shape Design Problems
34
E. Levitin, R. Tichatschke:
A Branch and Bound Approach for Solving a Class of Generalized Semi-Infinite Programming Problems
35
E. Levitin:
On Local Convex Majorizing Approximations of Generalized Semi-Infinite Programming Problems
36
D. Baum:
Ein Faltungskalkül für Matrizenfolgen und verallgemeinerte Poisson-Gruppenprozesse
37
K. Jansen:
Approximation Results for Wavelength Routing in Directed Binary Trees
38
M. Dür, R. Horst:
Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization
39
R. Host, U. Raber:
Convergent Outer Approximation Algorithms for Solving Unary Problems
40
Ch. Meinel, A. Slobodová:
Speeding up Variable Reordering of OBDDs
41
K. Jansen:
Complexity Results for the Optimum Cost Chromatic Partition Problem
42
Ch. Meinel, F. Somenzi, Th. Theobald:
Linear Sifting of Decision Diagrams
43
B. B. King:
Representation of Feedback Operators for Hyperbolic Partial Differential Equation Control Problems
44
K.-I. Ko, N. Müller, K. Weihrauch:
Computability and Complexity in Analysis
45
N. V. Thoai:
Utility Function Program with or without Explicit Form of Utility Function
46
J. Hofmann, M. Müller, K. Natarajan:
Parallel versus Sequential Task-Processing: A New Performance Model in Discrete Time

Link to:
CS Homepage

Tech Report List 1996 - Jochen Bern - 08-Feb-1995 / 29-Jun-1999