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="Aspvall, Bengt"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation for the general block distribution of a matrix
Bengt Aspvall
,
Magnús M. Halldórsson
,
Fredrik Manne
Theoretical Computer Science
262
(1-2), 2001, pp. 145-160
Approximations for the general block distribution of a matrix
Bengt Aspvall
,
Magnús M. Halldórsson
,
Fredrik Manne
Lecture Notes in Computer Science
1432
, 1998, pp. 47-58
Memory requirements for table computations in partial
k
-tree algorithms
Bengt Aspvall
,
Andrzej Proskurowski
,
Jan Arne Telle
Lecture Notes in Computer Science
1432
, 1998, pp. 222-233
On 2-QBF truth testing in parallel
Bengt Aspvall
,
Christos Levcopoulos
,
Andrzej Lingas
,
Robert Storlind
Information Processing Letters
57
(2), 1996, pp. 89-93
Minimizing elimination tree height can increase fill more than linearly
Bengt Aspvall
Information Processing Letters
56
, 1995, pp. 115-120
Graph coloring using eigenvalue decomposition
Bengt Aspvall
,
John R. Gilbert
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 526-538
Graph coloring using eigenvalue decomposition
Bengt Aspvall
,
John R. Gilbert
Technical Report (83-545), 1983, February
The dinner table problem
Bengt Aspvall
,
Frank Liang
Technical Report (STAN-CS-80-829), 1980, December
Khachiyan's linear programming algorithm
Bengt Aspvall
,
Richard E. Stone
Journal of Algorithms
1
, 1980, pp. 1-13
Recognizing disguised
NR(1)
instances of the satisfiability problem
Bengt Aspvall
Journal of Algorithms
1
, 1980, pp. 97-103