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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds on the area of finite-state machines
M.J. Foster
,
Ronald I. Greenberg
Information Processing Letters
30
, 1989, pp. 1-7
L
-Infinity interdistance selection by parametric search
Jeffrey S. Salowe
Information Processing Letters
30
, 1989, pp. 9-14
A note on word chains and regular languages
Peter Roth
Information Processing Letters
30
, 1989, pp. 15-18
Bisimulation and effectiveness
Ph. Darondeau
Information Processing Letters
30
, 1989, pp. 19-20
The reflected tree hierarchy for protection and sharing
Ravinderpal Singh Sandhu
Information Processing Letters
30
, 1989, pp. 21-26
Subtree isomorphism is
NC
reducible to bipartite perfect matching
Andrzej Lingas
,
Marek Karpinski
Information Processing Letters
30
, 1989, pp. 27-32
Increasing search efficiency using multiple heuristics
P.P. Chakrabarti
,
S. Ghose
,
A. Pandey
,
S.C. de Sarkar
Information Processing Letters
30
, 1989, pp. 33-36
Lower bounds for synchronous circuits and planar circuits
György Turán
Information Processing Letters
30
, 1989, pp. 37-40
Parallel evaluation of the determinant and of the inverse of a matrix
Zvi Galil
,
Victor Pan
Information Processing Letters
30
, 1989, pp. 41-45
There are no
\P
-complete families of symmetric Boolean functions
Mihály Geréb-Graus
,
Ramamohan Paturi
,
Endre Szemerédi
Information Processing Letters
30
, 1989, pp. 47-49
Real-time programming
Eric C.R. Hehner
Information Processing Letters
30
, 1989, pp. 51-56
Communication complexity of multi-processor systems
Rudolf Fleischer
Information Processing Letters
30
, 1989, pp. 57-65
A new approach to choosing initial points in local search
Wing Shing Wong
,
Robert J.T. Morris
Information Processing Letters
30
, 1989, pp. 67-72
A model of distributed control: Dependency and uncertainty
June Hyoung Kim
,
Kyu Ho Park
,
Myunghwan Kim
Information Processing Letters
30
, 1989, pp. 73-77
Partial evaluation of pattern matching in strings
Charles Consel
,
Olivier Danvy
Information Processing Letters
30
, 1989, pp. 79-86
An image algorithm for computing the Hausdorff distance efficiently in linear time
R. Shonkwiler
Information Processing Letters
30
, 1989, pp. 87-89
On coupling and the approximation of the permanent
Milena Mihail
Information Processing Letters
30
, 1989, pp. 91-95
A fast parallel quicksort algorithm
Charles U. Martel
,
Dan Gusfield
Information Processing Letters
30
, 1989, pp. 97-102
Space measures for storage modification machines
Peter van Emde Boas
Information Processing Letters
30
, 1989, pp. 103-110
An efficient algorithm for deciding quadratic residuosity in finite fields
GF(p^m)
Toshiya Itoh
,
Shigeo Tsujii
Information Processing Letters
30
, 1989, pp. 111-114
Customizable garbage collectors
Matti O. Jokinen
Information Processing Letters
30
, 1989, pp. 115-118
Shortest enclosing walks and cycles in embedded graphs
J. Scott Provan
Information Processing Letters
30
, 1989, pp. 119-125
Bit complexity of order statistics on a distributed star network
O. Gerstel
,
Y. Mansour
,
S. Zaks
Information Processing Letters
30
, 1989, pp. 127-132
A note on the best-case complexity
José D.P. Rolim
,
Sheila A. Greibach
Information Processing Letters
30
, 1989, pp. 133-138
The pitfall paradox and its solution with virtual objects
Udo Kelter
Information Processing Letters
30
, 1989, pp. 139-143
Seiten 1
2
3
>