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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Total domination in interval graphs
A.A. Bertossi
Information Processing Letters
23
(3), 1986, October, pp. 131-134
On an asymptotic analysis of a tree-type algorithm for broadcast communications
W. Szpankowski
Information Processing Letters
23
(3), 1986, October, pp. 135-142
On the intersection of the class of linear context-free languages and the class of single-reset languages
K.W. Wagner
Information Processing Letters
23
(3), 1986, October, pp. 143-146
Semantics of a declarative language
G. Mints
,
E. Tyugu
Information Processing Letters
23
(3), 1986, October, pp. 147-151
Some characterizations of finitely specifiable implicational dependency families
K. Taghva
Information Processing Letters
23
(3), 1986, October, pp. 153-158
Absence of individual starvation using weak semaphores
J.T. Udding
Information Processing Letters
23
(3), 1986, October, pp. 159-162
Turing complexity of the ordinals
P. Dehornoy
Information Processing Letters
23
(4), 1986, November, pp. 167-170
Finitely generated
\omega
-languages
M. Latteux
,
E. Timmerman
Information Processing Letters
23
(4), 1986, November, pp. 171-175
Safety without stuttering
B. Alpern
,
A.J. Demers
,
F.B. Schneider
Information Processing Letters
23
(4), 1986, November, pp. 177-180
A generalized deadlock predicate
D.R. O'Hallaron
,
P.F., Jr. Reynolds
Information Processing Letters
23
(4), 1986, November, pp. 181-188
Towards an asymptotic analysis of Karmarkar's algorithm
L. Blum
Information Processing Letters
23
(4), 1986, November, pp. 189-194
Hamiltonian circuits in interval graph generalizations
A.A. Bertossi
,
M.A. Bonuccelli
Information Processing Letters
23
(4), 1986, November, pp. 195-200
Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic
S. Yamasaki
,
S. Doshita
Information Processing Letters
23
(4), 1986, November, pp. 201-207
Eliminating the flag in threaded binary search trees
D. Gordon
Information Processing Letters
23
(4), 1986, November, pp. 209-214
The efficiency of using k-d trees for finding nearest neighbors in discrete space
O.J. Murphy
,
S.M. Selkow
Information Processing Letters
23
(4), 1986, November, pp. 215-218
A parallel
O(\log n)
algorithm for the drawing of algebraic curves in an
n\times n
square
R. Sommerhalder
,
S.C. van Westrhenen
Information Processing Letters
23
(5), 1986, November, pp. 221-226
A note on complete problems for complexity classes
K. Ambos-Spies
Information Processing Letters
23
(5), 1986, November, pp. 227-230
An alternative implementation of communication primitives
J.L.A. van de Snepscheut
,
J.T. Udding
Information Processing Letters
23
(5), 1986, November, pp. 231-238
Merging by the parallel jump searching algorithm
D.J. Evans
,
N.Y. Yousif
Information Processing Letters
23
(5), 1986, November, pp. 239-246
The value of an array facility in Prolog
G. Chen
,
M.H. Williams
Information Processing Letters
23
(5), 1986, November, pp. 247-251
Denotational semantics of communicating sequential programs
M. Broy
Information Processing Letters
23
(5), 1986, November, pp. 253-259
A note on implementing PROLOG in LISP
J. Stojanovski
Information Processing Letters
23
(5), 1986, November, pp. 261-264
An in situ distributive sort
C.C. Handley
Information Processing Letters
23
(5), 1986, November, pp. 265-270
A note on pure grammars
E. Mäkinen
Information Processing Letters
23
(5), 1986, November, pp. 271-274
The inaccessible set: a classification by query type of security risks in statistical databases
E.L. Leiss
Information Processing Letters
23
(6), 1986, December, pp. 275-279
Seiten
<
1
2
3
>