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: Series=LNCS AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A modular design for a parallel multifrontal mesh generator
Jean-Paul Boufflet
,
Piotr Breitkopf
,
Alain Rassineux
,
Pierre Villon
Lecture Notes in Computer Science
2400
, 2002, pp. 715-723
On multicasting with minimum costs for the Internet topology
Young-Cheol Bang
,
Hyunseung Choo
Lecture Notes in Computer Science
2400
, 2002, pp. 736-744
Stabilizing inter-domain routing in the Internet
Yu Chen
,
Ajoy K. Datta
,
Sébastien Tixeuil
Lecture Notes in Computer Science
2400
, 2002, pp. 749-752
A mixed deflection and convergence routing algorithm: Design and performance
D. Barth
,
P. Berthomé
,
T. Czarchoski
,
J.M. Fourneau
,
C. Laforest
,
S. Vial
Lecture Notes in Computer Science
2400
, 2002, pp. 767-774
Congestion control based on transmission times
E. Baydal
,
P. López
,
J. Duato
Lecture Notes in Computer Science
2400
, 2002, pp. 781-790
Double
P
-tree: A distributed architecture for large-scale video-on-demand
Fernando Cores
,
Ana Ripoll
,
Emilio Luque
Lecture Notes in Computer Science
2400
, 2002, pp. 816-825
Performance scalability of multimedia instruction set extensions
D. Cheresiz
,
B. Juurlink
,
S. Vassiliadis
,
H. Wijshoff
Lecture Notes in Computer Science
2400
, 2002, pp. 849-859
Transparent fault tolerance for Web services based architectures
Vijay Dialani
,
Simon Miles
,
Luc Moreau
,
Davod de Roure
,
Michael Luck
Lecture Notes in Computer Science
2400
, 2002, pp. 889-898
Algorithm design and performance prediction in a Java-based Grid system with skeletons
Martin Alt
,
Holger Bischof
,
Sergei Gorlatch
Lecture Notes in Computer Science
2400
, 2002, pp. 899-906
A scalable approach to network enabled servers
Eddy Caron
,
Frédéric Desprez
,
Frédéric Lombard
,
Jean-Marc Nicod
,
Laurent Philippe
,
Martin Quinson
,
Frédéric Suter
Lecture Notes in Computer Science
2400
, 2002, pp. 907-910
MALLBA: A library of skeletons for combinatorial optimisation
E. Alba
,
F. Almeida
,
M. Blesa
,
J. Cabeza
,
C. Cotta
,
M. Díaz
,
I. Dorta
,
J. Gabarró
,
C. León
,
J. Luna
,
L. Moreno
,
C. Pablos
,
J. Petit
,
A. Rojas
,
F. Xhafa
Lecture Notes in Computer Science
2400
, 2002, pp. 927-932
A local decision algorithm for maximum lifetime in ad hoc networks
Andrea Clematis
,
Daniele D'Agostino
,
Vittoria Gianuzzi
Lecture Notes in Computer Science
2400
, 2002, pp. 947-956
A performance study of distance source routing based protocols for mobile and wireless ad hoc networks
Azzedine Boukerche
,
Joseph Linus
,
Agarwal Saurabha
Lecture Notes in Computer Science
2400
, 2002, pp. 957-964
On higher Arthur-Merlin classes
Jin-Yi Cai
,
Denis Charles
,
A. Pavan
,
Samik Sengupta
Lecture Notes in Computer Science
2387
, 2002, pp. 18-27
(2+f(n))
-SAT and its properties
Xiaotie Deng
,
C.H. Lee
,
Yunlei Zhao
,
Hong Zhu
Lecture Notes in Computer Science
2387
, 2002, pp. 28-36
Extending the accommodating function
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Lecture Notes in Computer Science
2387
, 2002, pp. 87-96
Inferring a union of halfspaces from examples
Tatsuya Akutsu
,
Sascha Ott
Lecture Notes in Computer Science
2387
, 2002, pp. 117-126
Dictionary look-up within small edit distance
Abdullah N. Arslan
,
Ömer Eğecioğlu
Lecture Notes in Computer Science
2387
, 2002, pp. 127-136
Solving constraint satisfaction problems with DNA computing
Evgeny Dantsin
,
Alexander Wolpert
Lecture Notes in Computer Science
2387
, 2002, pp. 171-180
Cluster: A fast tool to identify groups of similar programs
Casey Carter
,
Nicholas Tran
Lecture Notes in Computer Science
2387
, 2002, pp. 191-199
On the connected domination number of random regular graphs
William Duckworth
,
Bernard Mans
Lecture Notes in Computer Science
2387
, 2002, pp. 210-219
On the number of minimum cuts in a graph
L. Sunil Chandran
,
L. Shankar Ram
Lecture Notes in Computer Science
2387
, 2002, pp. 220-229
On crossing numbers of 5-regular graphs
G.L. Chia
,
C.S. Gan
Lecture Notes in Computer Science
2387
, 2002, pp. 230-237
Maximum flows and critical vertices in AND/OR graphs
Yvo Desmedt
,
Yongge Wang
Lecture Notes in Computer Science
2387
, 2002, pp. 238-248
New energy-efficient permutation routing protocol for single-hop radio networks
Amitava Datta
,
Albert Y. Zomaya
Lecture Notes in Computer Science
2387
, 2002, pp. 249-258
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>