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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conflict-free access of arrays - A counter example
A. Deb
Information Processing Letters
10
(1), 1980, February, pp. 20
The denotational semantics of sequential machines
M.J.C. Gordon
Information Processing Letters
10
(1), 1980, February, pp. 1-3
On the relationship between son-trees and symmetric binary b-trees
H. Olivié
Information Processing Letters
10
(1), 1980, February, pp. 4-8
Finding linear and circular sequences of minimal and maximal total adjacency
V.J. Rayward-Smith
,
R.N. Rolph
Information Processing Letters
10
(1), 1980, February, pp. 9-13
Testing the universal instance assumption
P. Honeyman
,
R.E. Ladner
,
M. Yannakakis
Information Processing Letters
10
(1), 1980, February, pp. 14-19
Once more on storage for consecutive retrieval
M. Truszczynski
Information Processing Letters
10
(1), 1980, February, pp. 21-24
A space efficient algorithm for the monotone planar circuit value problem
Leslie M. Goldschlager
Information Processing Letters
10
(1), 1980, February, pp. 25-27
List scheduling bounds for UET systems with resources
Errol L. Lloyd
Information Processing Letters
10
(1), 1980, February, pp. 28-31
Mixed transitivity for functional and multivalued dependencies in database relations
C. Zaniolo
Information Processing Letters
10
(1), 1980, February, pp. 32-34
A note on an improved bisection algorithm
T. Bui
Information Processing Letters
10
, 1980, pp. 35-36
A 2.5 times optimal algorithm for packing in two dimensions
Daniel D.K.D.B. Sleator
Information Processing Letters
10
, 1980, pp. 37-40
A note on universal classes of hash functions
Dilip V. Sarwate
Information Processing Letters
10
, 1980, pp. 41-45
Encoded pointers - An interesting data structure for modern SIL's
B. Anderson
Information Processing Letters
10
(2), 1980, March, pp. 47-50
Dynamization of decomposable searching problems
J. van Leeuwen
,
D. Wood
Information Processing Letters
10
(2), 1980, March, pp. 51-56
The logic-termal equivalence is polynomial-time decidable
V.K. Sabelfeld
Information Processing Letters
10
(2), 1980, March, pp. 57-62
Structured programs for Turing machines
S. Passy
Information Processing Letters
10
(2), 1980, March, pp. 63-67
An
O(\log n)
algorithm for computing general order-
k
Fibonacci numbers
Thomas C. Wilson
,
Joseph Shortt
Information Processing Letters
10
(2), 1980, March, pp. 68-75
A lower bound for on-line bin packing
Frank M. Liang
Information Processing Letters
10
(2), 1980, March, pp. 76-79
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
M. Blum
,
A.K. Chandra
,
M.N. Wegman
Information Processing Letters
10
(2), 1980, March, pp. 80-82
Achievable high scores of epsilon-moves and running times in DPDA computations
P.M.B. Vitányi
Information Processing Letters
10
(2), 1980, March, pp. 83-86
Extending the four Russians' bound to general matrix multiplication
N. Santoro
Information Processing Letters
10
(2), 1980, March, pp. 87-88
Purging in an equality data base
H. Samet
,
L. Marcus
Information Processing Letters
10
(2), 1980, March, pp. 89-95
A simplified proof that regular resolution is exponential
Mordechai Ben-Ari
Information Processing Letters
10
(2), 1980, March, pp. 96-98
A scheme for a fault-tolerant virtual memory
A. Brandwajn
,
R. Joly
Information Processing Letters
10
(2), 1980, March, pp. 99-103
On the generation of compilers from language definitions
F.G. Pagan
Information Processing Letters
10
(2), 1980, March, pp. 104-107
Seiten 1
2
3
>