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=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fully parallel algorithm for residue to binary conversion
Ferruccio Barsi
,
M. Cristina Pinotti
Information Processing Letters
50
, 1994, pp. 1-8
On the problem of approximating the number of bases of a matroid
Y. Azar
,
A.Z. Broder
,
A.M. Frieze
Information Processing Letters
50
, 1994, pp. 9-11
Determining the global progress of parallel simulation with FIFO communication property
Yi-Bing Lin
Information Processing Letters
50
, 1994, pp. 13-17
Approximation results for the minimum graph coloring problem
Marc Demange
,
Pascal Grisoni
,
Vangelis Th. Paschos
Information Processing Letters
50
, 1994, pp. 19-23
Efficient management of dynamic tables
Aviezri S. Fraenkel
,
Edward M. Reingold
,
Prashant Saxena
Information Processing Letters
50
, 1994, pp. 25-30
An explanatory presentation of composition rules for assumption-commitment specifications
Pierre Collette
Information Processing Letters
50
, 1994, pp. 31-35
Improving the strict avalanche characteristics of cryptographic functions
Jennifer Seberry
,
Xian-Mo Zhang
,
Yuliang Zheng
Information Processing Letters
50
, 1994, pp. 37-41
An optimal scheduling algorithm for preemptable real-time tasks
Yong-Seok Kim
Information Processing Letters
50
, 1994, pp. 43-48
Designing multi-commodity flow trees
Samir Khuller
,
Balaji Raghavachari
,
Neal Young
Information Processing Letters
50
, 1994, pp. 49-55
Polyominos and perfect graphs
Frédéric Maire
Information Processing Letters
50
, 1994, pp. 57-61
Static and dynamic parallel computation of connected components
P. Ferragina
Information Processing Letters
50
, 1994, pp. 63-68
Message complexity of hierarchical quorum consensus algorithm
Her-Kun Chang
,
Shyan-Ming Yuan
Information Processing Letters
50
, 1994, pp. 69-73
A new method to solve non-linear equations
T. Sony Roy
,
G. Athithan
,
M.S. Ganagi
,
A. Sivasankara Reddy
Information Processing Letters
50
, 1994, pp. 75-79
An optimal parallel algorithm for merging using multiselection
Narsingh Deo
,
Amit Jain
,
Muralidhar Medidi
Information Processing Letters
50
, 1994, pp. 81-87
Finding the
k
quickest simple paths in a network
Y.L. Chen
Information Processing Letters
50
, 1994, pp. 89-92
Round-optimal perfect zero-knowledge proofs
Giovanni di Crescenzo
,
Giuseppe Persiano
Information Processing Letters
50
, 1994, pp. 93-99
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
Seiten 1
2
3
>