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: Journal=Inf.~Process.~Lett. AND Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal algorithm for computing a minimum nested nonconvex polygon
Subir Kumar Ghosh
,
Anil Maheshwari
Information Processing Letters
36
, 1990, pp. 277-280
Rotation-based computations for ray-tracing second-order surfaces and curves
F. Kocsis
,
J.F. Böhme
Information Processing Letters
36
, 1990, pp. 281-283
Hypothetical reasoning in logic programming: A semantic approach
Antonio Brogi
,
Evelina Lamma
,
Paola Mello
Information Processing Letters
36
, 1990, pp. 285-291
The emptiness problem is undecidable for domains of partial monadic 2-modular tree transformations
Z. Fülöp
,
S. Vágvölgyi
Information Processing Letters
36
, 1990, pp. 293-296
A calculational derivation of the CASOP algorithm
Rob R. Hoogerwoord
Information Processing Letters
36
, 1990, pp. 297-299
Performance analysis of file organizations that use multi-bucket data leaves
Gabriel Matsliach
Information Processing Letters
36
, 1990, pp. 301-310
The immortality problem for Lag systems
Kai Salomaa
,
Sheng Yu
Information Processing Letters
36
, 1990, pp. 311-315
Bipartite graphs, upward drawings, and planarity
Giuseppe Di Battista
,
Wei-Ping Liu
,
Ivan Rival
Information Processing Letters
36
, 1990, pp. 317-322
Parallel algorithms for the segment dragging problem
Sung Kwon Kim
Information Processing Letters
36
, 1990, pp. 323-327
Seiten
<
1
2
3