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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On codes,
\omega
-codes and
\omega
-generators
S. Julia
,
I. Litovsky
,
B. Patrou
Information Processing Letters
60
(1), 1996, pp. 1-5
Distributed algorithms for depth-first search
S.A.M. Makki
,
George Havas
Information Processing Letters
60
(1), 1996, pp. 7-12
Using total monotonicity for two optimization problems on the plane
Alfredo García
,
Javier Tejel
Information Processing Letters
60
(1), 1996, pp. 13-17
Semantic data modelling using linear logic
Dong-Tsan Lee
Information Processing Letters
60
(1), 1996, pp. 19-27
P_4
-laden graphs: A new class of brittle graphs
Vassilis Giakoumakis
Information Processing Letters
60
(1), 1996, pp. 29-36
First-order queries on databases embedded in an infinite structure
Martin Otto
,
Jan van den Bussche
Information Processing Letters
60
(1), 1996, pp. 37-41
The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key
A.Kh. Al Jabri
Information Processing Letters
60
(1), 1996, pp. 43-47
On the complexity of encoding in analog curcuits
Ingo Wegener
Information Processing Letters
60
(1), 1996, pp. 49-52
Viennot factorization of infinite words
Guy Melançon
Information Processing Letters
60
(2), 1996, pp. 53-57
On pushout consistency, modularity and interpolation for logical specifications
Paulo A.S. Veloso
Information Processing Letters
60
(2), 1996, pp. 59-66
Procedures and atomicity refinement
K. Sere
Information Processing Letters
60
(2), 1996, pp. 67-74
Off-line algorithms for the list update problem
Nick Reingold
,
Jeffery Westbrook
Information Processing Letters
60
(2), 1996, pp. 75-80
A fast maximum finding algorithm on broadcast communication
Shyue-Horng Shiau
,
Chang-Biau Yang
Information Processing Letters
60
(2), 1996, pp. 81-89
A simple analysis of the error probability of two-point based sampling
K. Gopalakrishnan
,
D.R. Stinson
Information Processing Letters
60
(2), 1996, pp. 91-96
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Peter Eades
,
Charles Stirk
,
Sue Whitesides
Information Processing Letters
60
(2), 1996, pp. 97-103
Transitive term graph rewriting
R. Banach
Information Processing Letters
60
(3), 1996, pp. 109-114
Efficient multiway radix search trees
Úlfar Erlingsson
,
Mukkai Krishnamoorthy
,
T.V. Raman
Information Processing Letters
60
(3), 1996, pp. 115-120
Range searching in low-density environments
Otfried Schwarzkopf
,
Jules Vleugels
Information Processing Letters
60
(3), 1996, pp. 121-127
Simple proof techniques for property preservation via simulation
Ching-Tsun Chou
Information Processing Letters
60
(3), 1996, pp. 129-134
Dividing strategies for the optimization of a test suite
Tsong Yueh Chen
,
Man Fai Lau
Information Processing Letters
60
(3), 1996, pp. 135-141
The subprogram problem for software metric design
Ronald E. Prather
Information Processing Letters
60
(3), 1996, pp. 143-149
An efficient algorithm for concurrent priority queue heaps
Galen C. Hunt
,
Maged M. Michael
,
Srinivasan Parthasarathy
,
Michael L. Scott
Information Processing Letters
60
(3), 1996, pp. 151-157
Finding biconnected components in
O(n)
time for a class of graphs
Y. Daniel Liang
,
Chongkye Rhee
Information Processing Letters
60
(3), 1996, pp. 159-163
Sorting permutations by block-interchanges
David A. Christie
Information Processing Letters
60
(4), 1996, pp. 165-169
A finite-difference sieve to count paths and cycles by length
Eric Bax
,
Joel Franklin
Information Processing Letters
60
(4), 1996, pp. 171-176
Seiten 1
2
3
4
5
6
7
8
9
>