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 YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simple FPTAS for the subset-sums ratio problem
Danupon Nanongkai
Information Processing Letters
113
(19-21), 2013, pp. 750-753
Author's reply to S. Moran's note on the shortest path problem
Francesco Romani
Information Processing Letters
13
, 1981, pp. 87
A fast algorithm for finding all shortest paths
Osamu Watanabe
Information Processing Letters
13
, 1981, pp. 1-3
A new class of C.F.L. for which the equivalence is decidable
G. Senizergues
Information Processing Letters
13
, 1981, pp. 30-34
A shared-memory scheme for coalesced hashing
Jeffrey Scott Vitter
Information Processing Letters
13
, 1981, pp. 77-79
The clique problem for planar graphs
C.H. Papadimitriou
,
M. Yannakakis
Information Processing Letters
13
(4-5), 1981, pp. 131-133
An alternative for the implementation of the Knuth-Morris-Pratt algorithm
G. Barth
Information Processing Letters
13
(4-5), 1981, pp. 134-137
Data compression in limited capacity microcomputer systems
R.H. Davis
,
C. Rinaldi
,
C.J. Trebilcock
Information Processing Letters
13
(4-5), 1981, pp. 138-141
Time complexity of languages recognized by one-way multihead pushdown automata
W. Rytter
Information Processing Letters
13
(4-5), 1981, pp. 142-144
A hardest language recognized by two-way nondeterministic pushdown automata
W. Rytter
Information Processing Letters
13
(4-5), 1981, pp. 145-146
Tree equivalence of linear recursive schemata is polynomial-time decidable
V.K. Sabelfeld
Information Processing Letters
13
(4-5), 1981, pp. 147-153
Limitations of the chase
Nathan Goodman
,
Oded Shmueli
Information Processing Letters
13
, 1981, pp. 154-156
The edge Hamiltonian path problem is
NP
-complete
A. Bertossi
Information Processing Letters
13
(4-5), 1981, pp. 157-159
Efficient query evaluation in relational data bases with missing values
L. Siklóssy
Information Processing Letters
13
(4-5), 1981, pp. 160-163
The complexity of testing whether a graph is a superconcentrator
M. Blum
,
R.M. Karp
,
O. Vornberger
,
C.H. Papadimitriou
,
M. Yannakakis
Information Processing Letters
13
(4-5), 1981, pp. 164-167
Finding the minimum distance between two convex polygons
Jacob T. Schwartz
Information Processing Letters
13
, 1981, pp. 168-170
A new method for implementing LR(k) tables
M. Ancona
,
V. Gianuzzi
Information Processing Letters
13
(4-5), 1981, pp. 171-176
On the intersection of orthogonal objects
H. Edelsbrunner
,
H.A. Maurer
Information Processing Letters
13
(4-5), 1981, pp. 177-181
Acceptors for isometric parallel context-free array languages
A. Nakamura
,
K. Aizawa
Information Processing Letters
13
(4-5), 1981, pp. 182-186
A systematic test for extended operator precedence
M.H. Williams
Information Processing Letters
13
(4-5), 1981, pp. 187-190
Width and depth of combinational logic circuits
H. Yasuura
Information Processing Letters
13
(4-5), 1981, pp. 191-194
Projections of languages recognizable by probabilistic and alternating finite multitape automata
Rūsiņs̆ Freivalds
Information Processing Letters
13
, 1981, pp. 195-198
Guarded procedure: a distributed programming concept
P.K. Arora
,
N.K. Sharma
Information Processing Letters
13
(4-5), 1981, pp. 199-203
Multi-problem-solving: knowledge representation and system architecture
G. Guida
,
M. Somalvico
Information Processing Letters
13
(4-5), 1981, pp. 204-214
Modulus division on a two's complement machine
Henry S., Jr. Warren
,
A. Shawhan Fox
,
Peter W. Markstein
Information Processing Letters
13
, 1981, pp. 215-217
Seiten 1
2
>