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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Using overloading to express distinctions between evaluators
Cordelia V. Hall
Information Processing Letters
48
(1), 1993, pp. 1-8
Determining uni-connectivity in directed graphs
Adam L. Buchsbaum
,
Martin C. Carlisle
Information Processing Letters
48
(1), 1993, pp. 9-12
An approximate analysis of the performance of extendible hashing with elastic buckets
Nabil I. Hachem
Information Processing Letters
48
(1), 1993, pp. 13-20
Assertions about past and future in Highways: Global flush broadcast and flush-vector-time
Mohan Ahuja
Information Processing Letters
48
(1), 1993, pp. 21-28
Finding extremal sets in less than quadratic time
Daniel M. Yellin
,
Charanjit S. Jutla
Information Processing Letters
48
(1), 1993, pp. 29-34
Scheme for secure digital mobile communications based on symmetric key cryptography
Tzonelih Hwang
Information Processing Letters
48
(1), 1993, pp. 35-37
Rate monotonic scheduling in hard real-time systems
J. Santos
,
J. Orozco
Information Processing Letters
48
(1), 1993, pp. 39-45
A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
Ming-Shing Yu
,
Chen-Hsing Yang
Information Processing Letters
48
(1), 1993, pp. 47-51
Fast algorithms for approximately counting mismatches
Howard Karloff
Information Processing Letters
48
(2), 1993, pp. 53-60
A linear time algorithm for unique Horn satisfiability
Daniele Pretolani
Information Processing Letters
48
(2), 1993, pp. 61-66
An incremental LL(1) parsing algorithm
Wuu Yang
Information Processing Letters
48
(2), 1993, pp. 67-72
Enumerating
k
-way trees
M.D. Atkinson
,
Louise Walker
Information Processing Letters
48
(2), 1993, pp. 73-75
Kaikoura tree theorems: Computing the maximum agreement subtree
Mike Steel
,
Tandy Warnow
Information Processing Letters
48
(2), 1993, pp. 77-82
A remark on the regulation of
k
IET0L systems
Stefan Gärtner
Information Processing Letters
48
(2), 1993, pp. 83-85
Bounds on sample space size for matrix product verification
Donald D. Chinn
,
Rakesh K. Sinha
Information Processing Letters
48
(2), 1993, pp. 87-91
On bounded-probability operators and
C_=P
Sanjay Gupta
Information Processing Letters
48
(2), 1993, pp. 93-98
Worst-case performance of some heuristics for Steiner's problem in directed graphs
Stefan Voss
Information Processing Letters
48
(2), 1993, pp. 99-105
Rearrangeable nonblocking condition for multi-
\log_2 N
multiconnection networks
Yeonghwan Tscha
,
Yanghee Choi
,
Kyoon Ha Lee
Information Processing Letters
48
(3), 1993, pp. 107-112
A parallel algorithm for constructing projection polyhedra
Nimish R. Shah
Information Processing Letters
48
(3), 1993, pp. 113-119
Multidimensional on-line bin-packing: An algorithm and its average-case analysis
Ee-Chien Chang
,
Weiguo Wang
,
Mohan S. Kankanhalli
Information Processing Letters
48
(3), 1993, pp. 121-125
Fast gossiping on square mesh computers
Satoshi Fujita
,
Masafumi Yamashita
Information Processing Letters
48
(3), 1993, pp. 127-130
A fair banker's algorithm for read and write locks
Debra A. Hensgen
,
David L. Sims
,
David Charley
Information Processing Letters
48
(3), 1993, pp. 131-137
Reduction of OBDDs in linear time
Detlef Sieling
,
Ingo Wegener
Information Processing Letters
48
(3), 1993, pp. 139-144
The lower bounds on distributed shortest paths
K.V.S. Ramarao
,
S. Venkatesan
Information Processing Letters
48
(3), 1993, pp. 145-149
An exact algorithm for the constraint satisfaction problem: Application to logical inference
Hachemi Bennaceur
,
Gérard Plateau
Information Processing Letters
48
(3), 1993, pp. 151-158
Seiten 1
2
3
>