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=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generating function for entropy
Andrew A. Sekey
Information Processing Letters
4
, 1975, pp. 51
Sequence-to-sequence recursiveness
G. Germano
,
A. Maggiolo-Schettini
Information Processing Letters
4
, 1975, pp. 1-6
Three results of comparison between L languages with and without interaction
Keijo Ruohonen
Information Processing Letters
4
, 1975, pp. 7-10
ETOL-grammars and N-grammars
Martti Penttonen
Information Processing Letters
4
, 1975, pp. 11-13
On homomorphic images of transition graphs
Juhani Nieminen
Information Processing Letters
4
, 1975, pp. 14-15
Some observations on the determination of an upper bound for the clique number of a graph
Juhani Nieminen
Information Processing Letters
4
, 1975, pp. 16-17
Some properties of a centroid of a free tree
Andy N.C. Kang
,
David A. Ault
Information Processing Letters
4
, 1975, pp. 18-20
An
O(|E|\log\log|V|)
algorithm for finding minimum spanning trees
A. Yao
Information Processing Letters
4
, 1975, pp. 21-23
Optimal chain partitions of trees
Jayadev Misra
,
R. Endre Tarjan
Information Processing Letters
4
, 1975, pp. 24-26
A note on optimal scheduling for two-processor systems
Andrzej Rowicki
Information Processing Letters
4
, 1975, pp. 27-30
LL-regular grammars
Stanislaw Jarzabek
,
Tomasz Krawczyk
Information Processing Letters
4
, 1975, pp. 31-37
Complete operator precedence
M.R. Levy
Information Processing Letters
4
, 1975, pp. 38-40
A linear algorithm for the domination number of a tree
E. Cockayne
,
S. Goodman
,
S. Hedetniemi
Information Processing Letters
4
, 1975, pp. 41-44
On the additive complexity of specific polynomials
L. Hyafil
,
J.P. van de Wiele
Information Processing Letters
4
, 1975, pp. 45-47
A rationale for the numerical differentiation of experimental data
R.S. Anderssen
,
A.J. Guttmann
Information Processing Letters
4
(2), 1975, pp. 48-50
Priority queues with update and finding minimum spanning trees
D.B. Johnson
Information Processing Letters
4
, 1975, pp. 53-57
On a correspondence between binary trees and a certain type of permutation
Doron Rotem
Information Processing Letters
4
, 1975, pp. 58-61
A fast algorithm for copying binary trees
Douglas W. Clark
Information Processing Letters
4
, 1975, pp. 62-63
A dual link data structure for random file organization
J. Banerjee
,
V. Rajaraman
Information Processing Letters
4
(3), 1975, pp. 64-69
Loop unravelling: A practical tool in proving program correctness
Arthur G. Duncan
,
Lawrence Yelowitz
Information Processing Letters
4
, 1975, pp. 70-72
Crossvalidation: Minimizing the entropy of the future
R. Christensen
Information Processing Letters
4
, 1975, pp. 73-76
On the complexity of inexact computations
Judea Pearl
Information Processing Letters
4
, 1975, pp. 77-81
Subgraph isomorphism, matching relational structures and maximal cliques
H.G. Barrow
,
R.M. Burstall
Information Processing Letters
4
(4), 1976, pp. 83-84
Two fast simulations which imply some fast string matching and palindrome recognition algorithms
Zvi Galil
Information Processing Letters
4
, 1975, pp. 85-87
Comments on ``a synchronization anomaly''
Leslie Lamport
Information Processing Letters
4
, 1975, pp. 88-89
Seiten 1
2
>