List of 1997
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
-
K. Jansen:
- Approximation Results for the Optimum Cost Chromatic Partition
Problem
- 02
-
P. Gritzmann, V. Klee:
- Separation by Hyperplanes in Finite-Dimensional Vector
Spaces Over Archimedean Ordered Fields
- 03
-
T. Erlebach, K. Jansen:
- An Optimal Greedy Algorithm for Wavelength Allocation in Directed
Tree Networks
- 04
-
R. Horst, L. D. Muu, N. V. Thoai:
- A Decomposition Algorithm for Optimization over Efficient Sets
- 05
-
A. Neumann:
- Unambiguity
of SMGL Content Models - Pushdown Automata Revisited
- 06
-
H. Seidl, Ch. Fecht:
- Interprocedural
Analysis Based on PDAs
- 07
-
A. Kaplan, R. Tichatschke:
- Stable Methods for Variational Inequalities with Set Valued
Monotone Operators
- 08
-
H. Luschgy:
- Complete Families of Invariant Distributions
- 09
-
B. B. King:
- Nonuniform Grids for Reduced Basis Design of Low Order
Feedback Controllers for Nonlinear Continuous Systems
- 10
-
A. Kaplan, R. Tichatschke:
- Regularized Penalty Method for Parabolic Optimal Control
Problems
- 11
-
O. Khamisov:
- On Optimization Properties of Functions with a Concave
Minorant
- 12
-
Ch. W. Keßler:
- Practical
PRAM Programming with Fork95 - A Tutorial
- 13
-
H. Seidl, Ch. Fecht:
- Propagating
Differences: An Efficient New Fixpoint Algorithm for Distributive
Constraint Systems
- 14
-
Ch. Meinel, F. Somenzi, Th. Theobald:
- Function
Decomposition and Synthesis Using Linear Sifting
- 15
-
Ch. Meinel, H. Sack:
- Case
Study: Manipulating
-OBDDs by Means of Signatures
- 16
-
J. Bern, C. Damm, Ch. Meinel:
- The
Electronic Colloquium on Computational Complexity (ECCC): A Digital
Library in Use
- (See this
remark on the figures in the appendix, too)
- 17
-
M. Davidson:
- Stochastic
Constraint Aggregation Method for Convex Semi-Infinite Problems
- 18
-
H. Seidl:
- Model-Checking
for L
- 19
-
Ch. Meinel, C. Damm, M. Mundhenk (ed.):
- 33.
Workshop über Komplexitätstheorie, Datenstrukturen und
effiziente Algorithmen
- 20
-
H. Schmitt:
- On
a Weak Norm Based Prox-Regularization Method
- 21
-
C. Damm:
- A
Note on Spectral Lower Bound Arguments for Decision Trees
- 22
-
J. Hofmann:
- The
BMAP/G/1 Queue with Level Dependent Arrivals and its Stationary
Distribution
- 23
-
B. Di Martino, Ch. Keßler:
- Two
Program Comprehension Tools for Automatic Parallelization: A
Comparative Study
- 24
-
N. V. Thoai:
- A
Decomposition Method Using Duality Bounds for Nonconvex Optimization
- 25
-
M. Roters:
- The
Theory of Optimal Sampling in Continuous Time
- 26
-
M. Davidson:
- Primal-Dual
Contraint Aggregation Method in Multistage Stochastic Programming
- 27
-
Ch. Meinel, A. Slobodová, P. Willems:
- Block-Restricted
Reordering - Extended Experiments -
- 28
-
Ch. Meinel, C. Stangier:
- OBDD-based
Verification of Communication Protocols - Methods for the Verification
of Data Link Protocols
Link to: CS Homepage
Tech Report List 1997 - Jochen Bern -
04-Feb-1997 / 29-Jun-1999