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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bifaithful starry transductions
M. Latteux
,
E. Timmerman
Information Processing Letters
28
(1), 1988, May, pp. 1-4
Finding paths and deleting edges in directed acyclic graphs
G.F. Italiano
Information Processing Letters
28
(1), 1988, May, pp. 5-11
The evaluation of an alternative sum with applications to the analysis of some data structures
W. Szpankowski
Information Processing Letters
28
(1), 1988, May, pp. 13-19
Testing for class membership in multi-parent hierarchies
D.A. Lamb
,
R. Dawes
Information Processing Letters
28
(1), 1988, May, pp. 21-25
On the IO-complexity and approximation languages
J.D.P. Rolim
,
S.A. Greibach
Information Processing Letters
28
(1), 1988, May, pp. 27-31
Infinite hierarchy of expressions containing shuffle closure operator
J. Jȩdrzejowicz
Information Processing Letters
28
(1), 1988, May, pp. 33-37
Optimum watchman routes
Wei-Pang Chin
,
S. Ntafos
Information Processing Letters
28
(1), 1988, May, pp. 39-44
Synchronizing the I/O behavior of functional programs with feedback
A. Dwelly
Information Processing Letters
28
(1), 1988, May, pp. 45-51
Paw-free graphs
S. Olariu
Information Processing Letters
28
(1), 1988, May, pp. 53-54
Transposition of an
l\times l
matrix requires
\Omega(\log l)
reversals on conservative Turing machines
Walter W. Kirchherr
Information Processing Letters
28
, 1988, pp. 55-59
An improved parallel algorithm that computes the BFS numbering of a directed graph
Hillel Gazit
,
Gary L. Miller
Information Processing Letters
28
, 1988, pp. 61-65
An
O(\sqrt{n})
time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
Frank Dehne
,
Ivan Stojmenović
Information Processing Letters
28
, 1988, pp. 67-70
Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
Victor Pan
Information Processing Letters
28
, 1988, pp. 71-75
Prefix and equality languages of rational functions are co-context-free
Joost Engelfriet
,
Hendrik Jan Hoogeboom
Information Processing Letters
28
, 1988, pp. 77-79
Parallelism and the feedback vertex set problem
Daniele P. Bovet
,
S. de Agostino
,
R. Petreschi
Information Processing Letters
28
, 1988, pp. 81-85
Linear strategy for propositional modal resolution
Yves Auffray
Information Processing Letters
28
, 1988, pp. 87-92
Computing Eulerian trials
Jürgen Ebert
Information Processing Letters
28
, 1988, pp. 93-97
Atomic semantics of nonatomic programs
James H. Anderson
,
Mohamed G. Gouda
Information Processing Letters
28
, 1988, pp. 99-103
A parallel algorithm for recognizing unordered depth-first search
Catherine A. Schevon
,
Jeffrey Scott Vitter
Information Processing Letters
28
, 1988, pp. 105-110
Load imbalance in DASD dynamic reconnection
Alexandre Brandwajn
Information Processing Letters
28
, 1988, pp. 111-119
Strictness analysis of the untyped
\lambda
-calculus
Prateek Mishra
Information Processing Letters
28
, 1988, pp. 121-125
Characterizations of some rescaling functions
J. Aguilar-Martin
,
Claudi Alsina
Information Processing Letters
28
, 1988, pp. 127-132
Bad cases for shaker-sort
Mark Allen Weiss
,
Robert Sedgewick
Information Processing Letters
28
, 1988, pp. 133-136
Parallel
p
-adic computation
John F. Morrison
Information Processing Letters
28
, 1988, pp. 137-140
A probabilistic simulation of PRAMs on a bounded degree network
Fabrizio Luccio
,
A. Pietracaprina
,
G. Pucci
Information Processing Letters
28
, 1988, pp. 141-147
Seiten 1
2
3
>