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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Faster implementation of a shortest superstring approximation
Dan Gusfield
Information Processing Letters
51
, 1994, pp. 271-274
Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space
Ying The Tsai
,
Chuan Yi Tang
,
Yunn Yen Chen
Information Processing Letters
51
, 1994, pp. 275-282
Finding succinct ordered minimal perfect hash functions
Steven S. Seiden
,
Daniel S. Hirschberg
Information Processing Letters
51
, 1994, pp. 283-288
Constructing sparse spanners for most graphs in higher dimensions
Barun Chandra
Information Processing Letters
51
, 1994, pp. 289-294
On timeout for global deadlock detection in decentralized database systems
Micha Hofri
Information Processing Letters
51
, 1994, pp. 295-302
Extending Bachmair's method for proof by consistency to the final algebra
Olaf Lysne
Information Processing Letters
51
, 1994, pp. 303-310
New lower bounds for element distinctness on a one-tape Turing machine
Alejandro López-Ortiz
Information Processing Letters
51
, 1994, pp. 311-314
Multi-processor scheduling and expanders
Nikolai N. Kuzjurin
Information Processing Letters
51
, 1994, pp. 315-319
On the complexity of computing Gröbner bases in characteristic 2
Vincenzo Acciaro
Information Processing Letters
51
, 1994, pp. 321-323
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
Seiten
<
1
2
3
4
5
6
7
8
9
>