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: Journal=Inf.~Process.~Lett. AND Volume=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of matching with bonds
Manfred Padberg
,
Antonio Sassano
Information Processing Letters
32
, 1989, pp. 297-300
A note on lower bounds for the maximum area and maximum perimeter
k
-gon problems
Robert L. (Scot) Drysdale III
,
Jerzy W. Jaromczyk
Information Processing Letters
32
, 1989, pp. 301-303
A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
A.M. Gibbons
,
Y.N. Srikant
Information Processing Letters
32
, 1989, pp. 305-311
Heuristics for syntactical optimization of relational queries
Robert Demolombe
,
Arantza Illarramendi
Information Processing Letters
32
, 1989, pp. 313-316
An alternative way to represent the cogroup of a relation in the context of nested databases
Serge Abiteboul
,
Marc Gyssens
,
Dirk van Gucht
Information Processing Letters
32
, 1989, pp. 317-324
Fast Knuth-Bendix completion with a term rewriting system compiler
Yoshihito Toyama
Information Processing Letters
32
, 1989, pp. 325-328
Seiten
<
1
2
3