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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on a modification of the fundamental cycles finding algorithm
Antonije D. Jovanovich
Information Processing Letters
3
, 1974, pp. 33
The Earley algorithm as a problem representation
Jack Minker
,
Gordon J. VanderBrug
Information Processing Letters
3
, 1974, pp. 1-7
Median selection of 9 elements in 14 comparisons
Kohei Noshita
Information Processing Letters
3
, 1974, pp. 8-12
A new algorithm for finding weak components
Robert Endre Tarjan
Information Processing Letters
3
, 1974, pp. 13-15
Information streams sharing a finite buffer: other solutions
Lee W. Cooprider
,
F. Heymans
,
P.J. Courtois
,
David L. Parnas
Information Processing Letters
3
, 1974, pp. 16-21
An improved bound for detecting looping configurations in deterministic DPA's
J. van Leeuwen
,
Carl H. Smith
Information Processing Letters
3
, 1974, pp. 22-24
A note on semilinear sets and bounded-reversal multihead pushdown automata
Oscar H. Ibarra
Information Processing Letters
3
, 1974, pp. 25-28
Bounded workspace garbage collection in an address-order preserving list processing environment
David A. Fisher
Information Processing Letters
3
, 1974, pp. 29-32
A note on the ambiguity of context-free grammars
Tadao Takaoka
Information Processing Letters
3
, 1974, pp. 35-36
Optimal use of storage in a simple model of garbage collection
J.A. Campbell
Information Processing Letters
3
, 1974, pp. 37-38
Structured operating system organization
Martin V. Zelkowitz
Information Processing Letters
3
, 1974, pp. 39-42
Remark on the computational power of a Turing machine variant
Lionel E., Jr. Deimel
Information Processing Letters
3
, 1974, pp. 43-45
Abstract computation model used for a production compiler
S. Arnborg
Information Processing Letters
3
(2), 1974, pp. 46-50
A good algorithm for edge-disjoint branching
Robert Endre Tarjan
Information Processing Letters
3
, 1974, pp. 51-53
A note on extending equivalence theories of algorithms
Kojiro Kobayashi
Information Processing Letters
3
, 1974, pp. 54-56
Computer generation of vertex graphs
N.S. Sridharan
Information Processing Letters
3
, 1974, pp. 57-63
A synchronization anomaly
Richard J. Lipton
,
Robert W. Tuttle
Information Processing Letters
3
, 1974, pp. 65-66
On the cardinality of some lattices
Chiharu Hosono
Information Processing Letters
3
, 1974, pp. 67-68
On TOL languages over terminals
S.H. von Solms
Information Processing Letters
3
, 1974, pp. 69-70
On the minimization of control memories
Subrata Dasgupta
,
John Tartar
Information Processing Letters
3
, 1974, pp. 71-74
On the vector representation of the reachability in planar directed graphs
T. Kameda
Information Processing Letters
3
, 1974, pp. 75-77
A decidability theorem for a class of vector-addition systems
S. Crespi Reghizzi
,
D. Mandrioli
Information Processing Letters
3
(3), 1975, January, pp. 78-80
Bounds for 3-matroid intersection problems
P.M. Camerini
,
F. Maffioli
Information Processing Letters
3
, 1974, pp. 81-83
Evading the drift in floating-point addition
John F. Reiser
,
Donald E. Knuth
Information Processing Letters
3
, 1974, pp. 84-87
A simple FORTRAN support for computer-assisted instruction
Ivan Dal Bono
,
Mauro Diligenti
,
Concetta Mosca
,
Antonio Ricci
,
Antonio Villani
Information Processing Letters
3
, 1974, pp. 88-90
Seiten 1
2
>