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: Journal=J. Algorithms AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing visibility graphs of spiral polygons
H. Everett
,
D.G. Corneil
Journal of Algorithms
11
, 1990, pp. 1-26
Probability-based game tree pruning
Liwu Li
,
T.A. Marsland
Journal of Algorithms
11
, 1990, pp. 27-43
A new algorithm for the generation of binary de Bruijn sequences
Yuejiang Huang
Journal of Algorithms
11
, 1990, pp. 44-51
Uniform generation of random regular graphs of moderate degree
Brendan D. McKay
,
Nicholas C. Wormald
Journal of Algorithms
11
, 1990, pp. 52-67
Generating binary trees by transpositions
Frank Ruskey
,
Andrzej Proskurowski
Journal of Algorithms
11
, 1990, pp. 68-84
Sequence comparison with mixed convex and concave costs
David Eppstein
Journal of Algorithms
11
, 1990, pp. 85-101
Improved edge-coloring algorithms for planar graphs
Marek Chrobak
,
Takao Nishizeki
Journal of Algorithms
11
, 1990, pp. 102-116
Calculating the 2-variable polynomial for knots presented as closed braids
H.R. Morton
,
H.B. Short
Journal of Algorithms
11
, 1990, pp. 117-131
An efficient reconstruction of a graph from its line graph in parallel
Joseph Naor
,
Mark B. Novick
Journal of Algorithms
11
, 1990, pp. 132-143
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
11
, 1990, pp. 144-151
Generalized planar matching
Frank Berman
,
David Johnson
,
Tom Leighton
,
Peter W. Shor
,
Larry Snyder
Journal of Algorithms
11
, 1990, pp. 153-184
Generating random combinatorial objects
V.G. Kulkarni
Journal of Algorithms
11
, 1990, pp. 185-207
Competitive algorithms for server problems
Mark S. Manasse
,
Lyle A. McGeoch
,
Daniel D. Sleator
Journal of Algorithms
11
, 1990, pp. 208-230
A parallel fault identification algorithm
E. Schmeichel
,
S.L. Hakimi
,
M. Otsuka
,
G. Sullivan
Journal of Algorithms
11
, 1990, pp. 231-241
Tight lower bounds for shellsort
Mark Allen Weiss
,
Robert Sedgewick
Journal of Algorithms
11
, 1990, pp. 242-251
Parallel algorithms for cographs and parity graphs with applications
Gur Saran Adhar
,
Shietung Peng
Journal of Algorithms
11
, 1990, pp. 252-284
NP
-complete stable matching problems
Eytan Ronn
Journal of Algorithms
11
, 1990, pp. 285-304
Improved routing strategies with succinct tables
Baruch Awerbuch
,
Amotz Bar-Noy
,
Nathan Linial
,
David Peleg
Journal of Algorithms
11
, 1990, pp. 307-341
On the effects of feedback in dynamic network protocols
Baruch Awerbuch
Journal of Algorithms
11
, 1990, pp. 342-373
Automatically increasing the fault-tolerance of distributed algorithms
Gil Neiger
,
Sam Toueg
Journal of Algorithms
11
, 1990, pp. 374-419
A combinatorial characterization of the distributed 1-solvable tasks
Ofer Biran
,
Shlomo Moran
,
Shmuel Zaks
Journal of Algorithms
11
, 1990, pp. 420-440
Fast randomized consensus using shared memory
James Aspnes
,
Maurice Herlihy
Journal of Algorithms
11
, 1990, pp. 441-461
Recovery in distributed systems using optimistic message logging and checkpointing
David B Johnson
,
Willy Zwaenepoel
Journal of Algorithms
11
, 1990, pp. 462-491
Security, verifiability, and universality in distributed computing
Ming-Deh A. Huang
,
Shang-Hua Teng
Journal of Algorithms
11
, 1990, pp. 492-521
Finding Sylow normalizers in polynomial time
William M. Kantor
Journal of Algorithms
11
, 1990, pp. 523-563
Seiten 1
2
>