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.
On module assignment in two-processor distributed systems: a modified algorithm
G. Sagar
,
Anil K. Sarje
,
Kamal U. Ahmed
Information Processing Letters
32
, 1989, pp. 151-153
Well-founded induction and the invariance theorem for loops
Joseph M. Morris
Information Processing Letters
32
, 1989, pp. 155-158
An optimal parallel algorithm for the minimum circle-cover problem
Mikhail J. Atallah
,
Danny Z. Chen
Information Processing Letters
32
, 1989, pp. 159-165
A note on the Hamiltonian circuit problem on directed path graphs
Giri Narasimhan
Information Processing Letters
32
, 1989, pp. 167-170
The Steiner problem with edge lengths 1 and 2
Marshall Bern
,
Paul Plassmann
Information Processing Letters
32
, 1989, pp. 171-176
On relations between intervals
Gérard Ligozat
,
Hélène Bestougeff
Information Processing Letters
32
, 1989, pp. 177-182
An efficient distributed depth-first-search algorithm
Mohan B. Sharma
,
Sitharama S. Iyengar
,
Narasimha K. Mandyam
Information Processing Letters
32
, 1989, pp. 183-186
A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
Micha Sharir
Information Processing Letters
32
, 1989, pp. 187-190
Voronoi diagrams with barriers and the shortest diagonal problem
Andrzej Lingas
Information Processing Letters
32
, 1989, pp. 191-198
A linear time algorithm for longest
(s, t)
-paths in weighted outerplanar graphs
John A. Ellis
,
Manrique Mata
,
Gary MacGillivray
Information Processing Letters
32
, 1989, pp. 199-204
Approximating the diameter of a set of points in the Euclidean space
ömer Eg̃eciog̃lu
,
Bahman Kalantari
Information Processing Letters
32
, 1989, pp. 205-211
The demand operation in the schematic protection model
Ravinderpal Singh Sandhu
Information Processing Letters
32
, 1989, pp. 213-219
PROCOL: A protocol-constrained concurrent object-oriented language
Jan van den Bos
Information Processing Letters
32
, 1989, pp. 221-227
A one-to-one correspondence between two classes of ordered trees
R. Kemp
Information Processing Letters
32
, 1989, pp. 229-234
Cooperating proofs for distributed programs with multiparty interactions
Nissim Francez
Information Processing Letters
32
, 1989, pp. 235-242
Acyclic directed hypercubes may have exponential diameter
H. Everett
,
A. Gupta
Information Processing Letters
32
, 1989, pp. 243-245
Centering a spanning tree of a biconnected graph
Grant A. Cheston
,
Art Farley
,
S.T. Hedetniemi
,
Andrzej Proskurowski
Information Processing Letters
32
, 1989, pp. 247-250
On the relative complexity of some languages in
NC^1
David A. Mix Barrington
,
James Corbett
Information Processing Letters
32
, 1989, pp. 251-256
A general implementation of relational recursion with speedup techniques for programmers
A. Clouâtre
,
N. Laliberte
,
T.H. Merrett
Information Processing Letters
32
, 1989, pp. 257-262
Another note on recursive ascent
George H. Roberts
Information Processing Letters
32
, 1989, pp. 263-266
Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
Gerd Baron
,
Friedrich Urbanek
Information Processing Letters
32
, 1989, pp. 267-269
On the subtree isomorphism problem for ordered trees
Erkki Mäkinen
Information Processing Letters
32
, 1989, pp. 271-273
A parallel algorithm for the maximum 2-chain edge packing problem
Shuji Shiraishi
Information Processing Letters
32
, 1989, pp. 277-279
Boundedness is undecidable for Datalog programs with a single recursive rule
Serge Abiteboul
Information Processing Letters
32
, 1989, pp. 281-287
Optimal incremental simple multi-pass attribute evaluation
Henk Alblas
Information Processing Letters
32
, 1989, pp. 289-295
Seiten
<
1
2
3
>