| 2001 |
|---|
| 11 | EE | Bengt Aspvall,
Magnús M. Halldórsson,
Fredrik Manne:
Approximations for the general block distribution of a matrix.
Theor. Comput. Sci. 262(1): 145-160 (2001) |
| 2000 |
|---|
| 10 | EE | Bengt Aspvall,
Jan Arne Telle,
Andrzej Proskurowski:
Memory Requirements for Table Computations in Partial k-Tree Algorithms.
Algorithmica 27(3): 382-394 (2000) |
| 1998 |
|---|
| 9 | EE | Bengt Aspvall,
Andrzej Proskurowski,
Jan Arne Telle:
Memory Requirements for Table Computations in Partial k-tree Algorithms.
SWAT 1998: 222-233 |
| 8 | EE | Bengt Aspvall,
Magnús M. Halldórsson,
Fredrik Manne:
Approximations for the General Block Distribution of a Matrix.
SWAT 1998: 47-58 |
| 1996 |
|---|
| 7 | EE | Bengt Aspvall,
Christos Levcopoulos,
Andrzej Lingas,
Robert Storlind:
On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett. 57(2): 89-93 (1996) |
| 1995 |
|---|
| 6 | EE | Bengt Aspvall:
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.
Inf. Process. Lett. 56(2): 115-120 (1995) |
| 1980 |
|---|
| 5 | | Bengt Aspvall,
Richard E. Stone:
Khachiyan's Linear Programming Algorithm.
J. Algorithms 1(1): 1-13 (1980) |
| 4 | | Bengt Aspvall:
Recognizing Disguised NR(1) Instances of the Satisfiability Problem.
J. Algorithms 1(1): 97-103 (1980) |
| 3 | | Bengt Aspvall,
Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
SIAM J. Comput. 9(4): 827-845 (1980) |
| 1979 |
|---|
| 2 | | Bengt Aspvall,
Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality
FOCS 1979: 205-217 |
| 1 | | Bengt Aspvall,
Michael F. Plass,
Robert Endre Tarjan:
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas.
Inf. Process. Lett. 8(3): 121-123 (1979) |
