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: Author="Martel, Charles U."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph and hashing algorithms for modern architectures: Design and performance
John R., Jr. Black
,
Charles U. Martel
,
Hongbin Qi
Proceedings of the 2nd Workshop on Algorithm Engineering, WAE'98 (Saarbrücken, Germany, August 20-22, 1998)
(MPI-I-98-1-019), 1998, pp. 37-48
Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches
Lucas Chi Kwong Hui
,
Charles U. Martel
Information Processing Letters
58
(5), 1996, pp. 231-236
Analysing deletions in competitive self-adjusting linear list algorithms
Lucas Chi Kwong Hui
,
Charles U. Martel
Lecture Notes in Computer Science
834
, 1994, pp. 433-441
Maximum finding on a multiple access broadcast network
Charles U. Martel
Information Processing Letters
52
, 1994, pp. 7-13
Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists
Lucas Chi Kwong Hui
,
Charles U. Martel
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 426-435
On the efficiency of maximum-flow algorithms on networks with small integer capacities
David Fernández-Baca
,
Charles U. Martel
Algorithmica
4
, 1989, pp. 173-189
A fast parallel quicksort algorithm
Charles U. Martel
,
Dan Gusfield
Information Processing Letters
30
, 1989, pp. 97-102
A parallel algorithm for preemptive scheduling of uniform machines
Charles U. Martel
Journal Parallel Distributed Computing
5
(6), 1988, December, pp. 700-715
Theoretical efficiency of maximum flow algorithms on networks with small integer capacities
David Fernández-Baca
,
Charles U. Martel
Technical Report (87-4), 1987, February