Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="M{\"u}hlbacher, J{\"o}rg"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Basic graphtheoretical structures for multi proscessor concepts
R.F. Albrecht
Applied Computer Science
, 1982, pp. 243-252
Formal tools for top-down and bottom-up generation of acyclic relational schemata
C. Batyini
,
A. D'Atri
,
M. Moscarini
Applied Computer Science
, 1982, pp. 219-229
Worst and best case behaviour of an approximate graph coloring algorithm
K. Dürre
,
J. Heuft
,
H. Müller
Applied Computer Science
, 1982, pp. 339-348
Depth-first search algorithms for augmentation problems
Jürgen Ebert
Applied Computer Science
, 1982, pp. 127-133
The shape of a set of points in the plane
H. Edelsbrunner
,
D.G. Kirkpatrick
,
R. Seidel
Applied Computer Science
, 1982, pp. 157-161
A graph theoretical model for multi-pass parsing
Hartmut Ehrig
,
Berthold Hoffmann
,
Ilse-R. Schmiedecke
Applied Computer Science
, 1982, pp. 19-31
On protokols for cake cutting
S. Even
Applied Computer Science
, 1982, pp. 183-193
A negative circuit algorithm for weighted min cost flows
H. Friesdorf
,
H. Hamacher
Applied Computer Science
, 1982, pp. 115-125
Structured development of modular software systems: The module graph as central data structure
R. Gall
Applied Computer Science
, 1982, pp. 327-338
Eficient routes in vector-valued graphs
W. Habenicht
Applied Computer Science
, 1982, pp. 349-355
VLSI algorithms for the connected component problem and its verification problem
S.E. Hambrusch
Applied Computer Science
, 1982, pp. 231-241
A structural text editor based on graph grammars
R. Heinonen
Applied Computer Science
, 1982, pp. 195-205
The complexity of constructing quad-trees in arbitrary dimensions
K.J. Jacquemain
Applied Computer Science
, 1982, pp. 293-301
Linear precedence parsing for a new class of graph grammars
M. Kaul
Applied Computer Science
, 1982, pp. 33-43
Description and simulation of processes using condensed nets
U. Knitelius
,
H. Lorenz
,
J. Perl
,
H.J. Schroeder
Applied Computer Science
, 1982, pp. 145-156
The write fixed serializability problem of interleaved database transactions
Georg Lausen
Applied Computer Science
, 1982, pp. 207-218
Euclidean shortest paths in the presence of parallel rectilinear barriers
D.T. Lee
,
F.P. Preparata
Applied Computer Science
, 1982, pp. 303-313
Lower bounds on the efficiency of transforming static data structures into dynamic structures
Kurt Mehlhorn
Applied Computer Science
, 1982, pp. 265-277
Four approximation algorithms for the feedback vertex set problem
B. Monien
,
R. Schulz
Applied Computer Science
, 1982, pp. 315-326
An algorithm for the compilation of arithmetic expressions generating an associated tree with minimal weighted height
W. Oberaigner
Applied Computer Science
, 1982, pp. 253-264
A realistic cost measure for binary search trees
Th. Ottmann
,
A.L. Rosenberg
,
H.W. Six
,
D. Wood
Applied Computer Science
, 1982, pp. 163-172
1-pass top-down update schemes for balanced search trees
Thomas Ottmann
,
Michael Schrapp
Applied Computer Science
, 1982, pp. 279-291
Transfroming semi-dynamik data structures into dynamic structures
Mark H. Overmars
Applied Computer Science
, 1982, pp. 173-182
Bus routing problems on acyclic networks
Hans Röck
Applied Computer Science
, 1982, pp. 99-113
Three-dimensional VLSI layouts
Arnold L. Rosenberg
Applied Computer Science
, 1982, pp. 55-60
Seiten 1
2
3
>