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=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modular term rewriting systems and the termination
Masahito Kurihara
,
Ikuo Kaji
Information Processing Letters
34
, 1990, pp. 1-4
Flush primitives for asynchronous distributed systems
Mohan Ahuja
Information Processing Letters
34
, 1990, pp. 5-12
Routing with critical paths
Shai Simonson
Information Processing Letters
34
, 1990, pp. 13-19
Construction of a tree from its traversals in optimal time and space
Arne Andersson
,
Svante Carlsson
Information Processing Letters
34
, 1990, pp. 21-25
Separability and the detection of hidden channels
Jeremy Jacob
Information Processing Letters
34
, 1990, pp. 27-29
Cyclic reference counting with local mark-scan
Alejandro D. MartÃnez
,
Rosita Wachenchauzer
,
R.D. Lins
Information Processing Letters
34
, 1990, pp. 31-35
Finding nearest neighbors with Voronoi tessellations
O.J. Murphy
,
S.M. Selkow
Information Processing Letters
34
, 1990, pp. 37-41
The area-time complexity of the greatest common divisor problem: A lower bound
Carla Neaderhouser Purdy
,
George B. Purdy
Information Processing Letters
34
, 1990, pp. 43-46
Preemptive scheduling to minimize mean weighted flow time
Joseph Y.-T. Leung
,
Gilbert H. Young
Information Processing Letters
34
, 1990, pp. 47-50
On the classification of binding mechanisms
R. Morrison
,
M.P. Atkinson
,
A.L. Brown
,
A. Dearle
Information Processing Letters
34
, 1990, pp. 51-55
The robber route problem
Simeon Ntafos
Information Processing Letters
34
, 1990, pp. 59-63
Lexical ambiguity in tree adjoining grammars
Pradip Dey
,
Barrett R. Bryant
,
Tadao Takaoka
Information Processing Letters
34
, 1990, pp. 65-69
On the angle restricted nearest neighbor problem
Young C. Wee
,
Seth Chaiken
,
Dan E. Willard
Information Processing Letters
34
, 1990, pp. 71-76
Finding an approximate median with high probability in constant parallel time
Sandeep Sen
Information Processing Letters
34
, 1990, pp. 77-80
A feasibly constructive lower bound for resolution proofs
Stephen Cook
,
Toniann Pitassi
Information Processing Letters
34
, 1990, pp. 81-85
Connectivity of plane triangulations
Jean-Paul Laumond
Information Processing Letters
34
, 1990, pp. 87-96
On the closure of triangle-free graphs under substitution
Stephan Olariu
Information Processing Letters
34
, 1990, pp. 97-101
The complexity of searching in
X + Y
and other multisets
Michel Cosnard
,
Jean Duprat
,
Afonso G. Ferreira
Information Processing Letters
34
, 1990, pp. 103-109
Fixed points of increasing functions
C.A.R. Hoare
Information Processing Letters
34
, 1990, pp. 111-112
A distance metric on binary trees using lattice-theoretic measures
J.M. Pallo
Information Processing Letters
34
, 1990, pp. 113-116
Counting problems and algebraic formal power series in noncommuting variables
A. Bertoni
,
M. Goldwurm
,
P. Massazza
Information Processing Letters
34
, 1990, pp. 117-121
An efficient probabilistic encryption scheme
Lein Harn
,
Thomas Kiesler
Information Processing Letters
34
, 1990, pp. 123-129
A distributed synchronization scheme for fair multi-process handshakes
Moon Hwa Park
,
Myunghwan Kim
Information Processing Letters
34
, 1990, pp. 131-138
Towards a theory of (self) applicative communicating processes: A short note
Henk Goeman
Information Processing Letters
34
, 1990, pp. 139-142
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
Christoph Meinel
Information Processing Letters
34
, 1990, pp. 143-146
Seiten 1
2
3
>