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
Hilfe
Suche: Author="Perl, J{\"u}rgen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic models for database schemes and random hypergraphs
Giorgio Ausiello
,
Marco Protasi
,
Maurizio Talamo
Applied Computer Science
, 1983, pp. 5-16
A local-ratio theorem for approximating the weighted vertex cover problem
R. ans S. Even Bar-Yehuda
Applied Computer Science
, 1983, pp. 17-28
Contour extraction via path algorithms
M. Bertier
,
M. Habib
Applied Computer Science
, 1983, pp. 29-39
On the complexity of the membership problem of graph grammars
Franz-Josef Brandenburg
Applied Computer Science
, 1983, pp. 40-49
Application of attributed graph grammars to VLSI design
W. Brendel
Applied Computer Science
, 1983, pp. 50-60
Finding extreme distances between convex polygons
Herbert Edelsbrunner
Applied Computer Science
, 1983, pp. 61-75
Concurrent transformations of graphs and relational structures
Hartmut Ehrig
,
Annegret Habel
Applied Computer Science
, 1983, pp. 76-88
Interfacing and transforming knowledge bases in a graph grammar based documentation system
R. Heinonen
,
E. Hyvönen
Applied Computer Science
, 1983, pp. 89-99
The grid file: A data structure designed to support proximity queries on spatial objects
K. Hinrichs
,
J. Nievergelt
Applied Computer Science
, 1983, pp. 100-113
Neighbourhood-uniform NLC grammars
D. Janssens
,
G. Rozenberg
Applied Computer Science
, 1983, pp. 114-124
Relational data base schemas with functional dependencies and objects
P. Kandzia
Applied Computer Science
, 1983, pp. 125-135
Graph grammar derivation processes
Hans-Jörg Kreowski
Applied Computer Science
, 1983, pp. 136-150
Performance of index structures for databases
Hans-Peter Kriegel
Applied Computer Science
, 1983, pp. 151-166
Computer experiences with implicit enumeration algorithms for graph coloring
M. Kubale
,
E. Kusz
Applied Computer Science
, 1983, pp. 167-176
Gridless channelrouting revisited - A new formulation of the problem
Ulrich Lauther
,
Martin Nett
Applied Computer Science
, 1983, pp. 177-183
Finding shortest paths in very large networks
E.L. Lawler
,
M.G. Luby
,
B. Parker
Applied Computer Science
, 1983, pp. 184-199
Parallel computation using meshes of trees
Tom Leighton
Applied Computer Science
, 1983, pp. 200-218
Efficient algorithms for the constraint generation for integrated circuit layout compaction
T. Lengauer
Applied Computer Science
, 1983, pp. 219-230
Granularity of memory in parallel computation
Kurt Mehlhorn
,
Uzi Vishkin
Applied Computer Science
, 1983, pp. 231-240
The complexitgy of determining paths of length
k
B. Monien
Applied Computer Science
, 1983, pp. 241-251
A combinatorial rearrangement problem with implications to the embedding of graphs
Heinrich Müller
,
Stephan Abramowski
Applied Computer Science
, 1983, pp. 252-262
The locus approach
Mark H. Overmare
Applied Computer Science
, 1983, pp. 263-273
A language for software design and its graphoriented semantics
Udo Pletat
Applied Computer Science
, 1983, pp. 274-285
Fault-tolerant interconnection networks: A graph-theoretic approach
Arnold L. Rosenberg
Applied Computer Science
, 1983, pp. 286-297
Modifications of the logical structure of 3NF-relational databases
D. Ruland
Applied Computer Science
, 1983, pp. 298-306
Seiten 1
2
>