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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comment on 'Worst-case choice for the stable marriage problem'
D. Kapur
,
M.S. Krishnamoorthy
,
A.K. Pujari
,
S. Gupta
Information Processing Letters
24
(2), 1987, January, pp. 139
Weighted grammars and Kleene's theorem
A. Alexandrakis
,
S. Bozapalidis
Information Processing Letters
24
(1), 1987, January, pp. 1-4
How to prove representation-independent independence results
S.A. Kurtz
,
M.J. O'Donnel
,
J.S. Royer
Information Processing Letters
24
(1), 1987, January, pp. 5-10
In-situ inversion of a cyclic permutation
W.H.J. Feijen
,
A.J.M. van Gasteren
,
D. Gries
Information Processing Letters
24
(1), 1987, January, pp. 11-14
An
O(n\log n \log\log n)
parallel maximum matching algorithm for bipartite graphs
T. Kim
,
K.Y. Chwa
Information Processing Letters
24
(1), 1987, January, pp. 15-17
Multiple cuts, input repetition, an VLSI complexity
P. Hochschild
Information Processing Letters
24
(1), 1987, January, pp. 19-24
An efficient deadlock avoidance algorithm
R. Finkel
,
H.H. Madduri
Information Processing Letters
24
(1), 1987, January, pp. 25-30
ECLR-attributed grammars: a practical class of LR-attributed grammars
M. Sassa
,
H. Ishizuka
,
I. Nakata
Information Processing Letters
24
(1), 1987, January, pp. 31-41
Predicate transfer and timeout in message passing systems
A.J. Bernstein
Information Processing Letters
24
(1), 1987, January, pp. 43-52
The alpha-beta algorithm: an exercise in program transformation
R.S. Bird
,
J. Hughes
Information Processing Letters
24
(1), 1987, January, pp. 53-57
Binary search networks: a new method for key searching
T. Yuba
,
M. Hoshi
Information Processing Letters
24
(1), 1987, January, pp. 59-65
An
O(n^2)
algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences
V. Arvind
,
S. Biswas
Information Processing Letters
24
(1), 1987, January, pp. 67-69
An off-line storage allocation algorithm
M. Ślusarek
Information Processing Letters
24
(2), 1987, January, pp. 71-75
Uniform inevitability is tree automaton ineffable
E.A. Emerson
Information Processing Letters
24
(2), 1987, January, pp. 77-79
An infinite word language which is not co-CFL
A. Grazon
Information Processing Letters
24
(2), 1987, January, pp. 81-85
Concurrent execution of transaction copies
O. Wolfson
Information Processing Letters
24
(2), 1987, January, pp. 87-93
A note on a new data structure for in-the-past queries
D. Field
Information Processing Letters
24
(2), 1987, January, pp. 95-96
On determining the on-line minimax linear fit to a discrete point set in the plane
C. Rey
,
R. Ward
Information Processing Letters
24
(2), 1987, January, pp. 97-101
The program dependence graph in static program testing
B. Korel
Information Processing Letters
24
(2), 1987, January, pp. 103-108
Subsumption and implication
G. Gottlob
Information Processing Letters
24
(2), 1987, January, pp. 109-111
A simple realization of LR-parsers for regular right part grammars
M. Sassa
,
I. Nakata
Information Processing Letters
24
(2), 1987, January, pp. 113-120
Parallelism and the maximal path problem
Richard Anderson
,
Ernst W. Mayr
Information Processing Letters
24
(2), 1987, January, pp. 121-126
The weakest prespecification
C.A.R. Hoare
,
Jifeng He
Information Processing Letters
24
(2), 1987, January, pp. 127-132
The maximum
k
-colorable subgraph problem for chordal graphs
Mihalis Yannakakis
,
Fȃnicȃ Gavril
Information Processing Letters
24
(2), 1987, January, pp. 133-137
The complexity of scheduling independent two-processor tasks on dedicated processors
M. Kubale
Information Processing Letters
24
(3), 1987, February, pp. 141-147
Seiten 1
2
3
4
>