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=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinite Lyndon words
Rani Siromoney
,
Lisa Mathew
,
V.R. Dare
,
K.G. Subramanian
Information Processing Letters
50
, 1994, pp. 101-104
On lookahead in the list update problem
Rahul Simha
,
Amitava Majumdar
Information Processing Letters
50
, 1994, pp. 105-110
A better lower bound for on-line scheduling
Yair Bartal
,
Howard Karloff
,
Yuval Rabani
Information Processing Letters
50
, 1994, pp. 113-116
On two-way tree automata
Etsuro Moriya
Information Processing Letters
50
, 1994, pp. 117-121
Bits and relative order from residues, space efficiently
Paul F. Dietz
,
Ioan I. Macarie
,
Joel I. Seiferas
Information Processing Letters
50
, 1994, pp. 123-127
O(\log n)
numerical algorithms on a mesh with wormhole routing
Dongseung Kim
,
Seung-Hoon Kim
Information Processing Letters
50
, 1994, pp. 129-136
Allocation techniques for distributed reduction data elements
Bob P. Weems
,
Lloyd C. Swayze
Information Processing Letters
50
, 1994, pp. 137-142
On the complexity of building an interval heap
Yuzheng Ding
,
Mark Allen Weiss
Information Processing Letters
50
, 1994, pp. 143-144
Optimal network partitioning for fault-tolerant network management using evolutionary programming
G. Prem Kumar
,
G. Phanendra Babu
Information Processing Letters
50
, 1994, pp. 145-149
A token based
k
-resilient mutual exclusion algorithm for distributed systems
Dhananjay M. Dhamdhere
,
Sandeep S. Kulkarni
Information Processing Letters
50
, 1994, pp. 151-157
Logic program semantics and circumscription of autoepistemic theories
Li Yan Yuan
Information Processing Letters
50
, 1994, pp. 159-164
Distributed algorithms for multiple entries to a critical section with priority
R. Baldoni
,
B. Ciciani
Information Processing Letters
50
, 1994, pp. 165-172
Simpler proof of a realizability theorem on Delaunay triangulations
Kokichi Sugihara
Information Processing Letters
50
, 1994, pp. 173-176
On the serializability theorem for nested transactions
R.F. Resende
,
A. El Abbadi
Information Processing Letters
50
, 1994, pp. 177-183
A primal-dual approximation algorithm for the Steiner forest problem
R. Ravi
Information Processing Letters
50
, 1994, pp. 185-189
An algorithm for approximate membership checking with application to password security
Udi Manber
,
Sun Wu
Information Processing Letters
50
, 1994, pp. 191-197
Directed monotone contact networks for threshold functions
Jaikumar Radhakrishnan
,
K.V. Subrahmanyam
Information Processing Letters
50
, 1994, pp. 199-203
Approximating
x^n
efficiently
Chandrasekhar Narayanaswami
,
William Luken
Information Processing Letters
50
, 1994, pp. 205-210
Bounded-width polynomial-size Boolean formulas compute exactly those functions in
AC^0
Sorin Istrail
,
Dejan Zivkovic
Information Processing Letters
50
, 1994, pp. 211-216
Multiprocessor interconnection network using pairwise balanced combinatorial designs
Simon Y. Berkovich
Information Processing Letters
50
, 1994, pp. 217-222
Consistent global checkpoints based on direct dependency tracking
Yi-Min Wang
,
Andy Lowry
,
W. Kent Fuchs
Information Processing Letters
50
, 1994, pp. 223-230
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
Giovanni Manzini
Information Processing Letters
50
, 1994, pp. 231-238
An optimal algorithm to compute all the covers of a string
Dennis Moore
,
W.F. Smyth
Information Processing Letters
50
, 1994, pp. 239-246
Nondominated
k
-coteries for multiple mutual exclusion
Mitchell L. Neilsen
,
Masaaki Mizuno
Information Processing Letters
50
, 1994, pp. 247-252
Trajectory planning in
H
-space
Huade Li
Information Processing Letters
50
, 1994, pp. 253-258
Seiten
<
1
2
3
4
5
6
7
8
9
>