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: Series=LNCS AND Volume=557
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient parallel divide-and-conquer for a class of interconnection topologies
I-Chen Wu
Lecture Notes in Computer Science
557
, 1991, pp. 229-240
Optimal specified root embedding of full binary trees in faulty hypercubes
M.Y. Chan
,
F.Y.L. Chin
,
C.K. Poon
Lecture Notes in Computer Science
557
, 1991, pp. 241-250
A tight lower bound for the worst case of bottom-up-heapsort
Rudolf Fleischer
Lecture Notes in Computer Science
557
, 1991, pp. 251-262
Historical searching and sorting
Alistair Moffat
,
Ola Petersson
Lecture Notes in Computer Science
557
, 1991, pp. 263-272
Comparison-efficient and write-optimal searching and sorting
Arne Andersson
,
Tony W. Lai
Lecture Notes in Computer Science
557
, 1991, pp. 273-282
Nearest neighbors revisited
Frances Yao
Lecture Notes in Computer Science
557
, 1991, pp. 283-283
Competitiveness and response time in on-line algorithms
Vladimir Estivill-Castro
,
Murray Sherk
Lecture Notes in Computer Science
557
, 1991, pp. 284-293
A linear time optimal via assignment algorithm for three-dimensional channel routing
Jan-Ming Ho
Lecture Notes in Computer Science
557
, 1991, pp. 294-307
Symmetry of information and one-way functions
Luc Longpré
,
Sarah Mocas
Lecture Notes in Computer Science
557
, 1991, pp. 308-315
A linear time algorithm to recognize the double Euler trail for series-parallel networks
Lih-Hsing Hsu
,
J.Y. Hwang
,
T.Y. Ho
,
C.H. Tsai
Lecture Notes in Computer Science
557
, 1991, pp. 316-325
On finding a smallest augmentation to biconnect a graph
Tsan-sheng Hsu
,
Vijaya Ramachandran
Lecture Notes in Computer Science
557
, 1991, pp. 326-335
A faster algorithm for edge-disjoint paths in planar graphs
Michael Kaufmann
,
Gerhard Klär
Lecture Notes in Computer Science
557
, 1991, pp. 336-348
An optimal construction method for generalized convex layers
Hans-Peter Lenhof
,
Michiel Smid
Lecture Notes in Computer Science
557
, 1991, pp. 349-363
Rectangular point location and the dynamic closest pair problem
Michiel Smid
Lecture Notes in Computer Science
557
, 1991, pp. 364-374
Parallel algorithms for some dominance problems based on a CREW PRAM
Ip-Wang Chan
,
Donald K. Friesen
Lecture Notes in Computer Science
557
, 1991, pp. 375-384
Parallel algorithms for finding maximal
k
-dependent sets and maximal
f
-matchings
Krzysztof Diks
,
Oscar Garrido
,
Andrzej Lingas
Lecture Notes in Computer Science
557
, 1991, pp. 385-395
Seiten
<
1
2