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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs
A. Benkouar
,
Y.G. Manoussakis
,
V.Th. Paschos
,
R. Saad
Lecture Notes in Computer Science
557
, 1991, pp. 190-198
Dynamic programming on intervals
Takao Asano
Lecture Notes in Computer Science
557
, 1991, pp. 199-207
Combinatorics and algorithms of geometric arrangements
Leonidas J. Guibas
Lecture Notes in Computer Science
557
, 1991, pp. 218-218
An analysis of randomized shear sort on the mesh computer
Susumu Hasegawa
,
Hiroshi Imai
,
Koji Hakata
Lecture Notes in Computer Science
557
, 1991, pp. 219-228
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
Comparison-efficient and write-optimal searching and sorting
Arne Andersson
,
Tony W. Lai
Lecture Notes in Computer Science
557
, 1991, pp. 273-282
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
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
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
Algorithms for the shape of semialgebraic sets - a new approach
Paola Cellini
,
Patrizia Gianni
,
Carlo Traverso
Lecture Notes in Computer Science
539
, 1991, pp. 1-18
On the parameters of algebraic geometric codes
H. Janwa
Lecture Notes in Computer Science
539
, 1991, pp. 19-28
On Wiedemann's method of solving sparse linear systems
Erich Kaltofen
,
B. David Saunders
Lecture Notes in Computer Science
539
, 1991, pp. 29-38
Homogenity, pseudo-homogenity, and Gröbner basis computations
Thomas Becker
Lecture Notes in Computer Science
539
, 1991, pp. 65-73
Arithmetic on non supersingular elliptic curves
T. Beth
,
F. Schaefer
Lecture Notes in Computer Science
539
, 1991, pp. 74-81
Implementing some algorithms of Kantor
Greg Butler
Lecture Notes in Computer Science
539
, 1991, pp. 82-93
Computing roadmaps of general semi-algebraic sets
J.F. Canny
Lecture Notes in Computer Science
539
, 1991, pp. 94-107
An improved sign determination algorithm
J.F. Canny
Lecture Notes in Computer Science
539
, 1991, pp. 108-117
The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes
Habong Chung
Lecture Notes in Computer Science
539
, 1991, pp. 118-129
Buchberger algorithm and integer programming
Pasqualina Conti
,
Carlo Traverso
Lecture Notes in Computer Science
539
, 1991, pp. 130-139
New systolic architectures for cyclic code encoding
Menouer Diab
Lecture Notes in Computer Science
539
, 1991, pp. 140-151
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>