Bengt Aspvall

Publication Activity (10 Years)

Years Active: 1979-2011
Publications (10 Years): 0

Publications

Tim Bell, Bengt Aspvall
Sorting algorithms as special cases of a priority queue sort. SIGCSE (2011)
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
Approximations for the general block distribution of a matrix. Theor. Comput. Sci. 262 (1) (2001)
Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27 (3) (2000)
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
Approximations for the General Block Distribution of a Matrix. SWAT (1998)
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT (1998)
Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57 (2) (1996)
Bengt Aspvall
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. Inf. Process. Lett. 56 (2) (1995)
Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger
Selecting among scheduled projects. Oper. Res. Lett. 17 (1) (1995)
Bengt Aspvall, Richard E. Stone
Khachiyan's Linear Programming Algorithm. J. Algorithms 1 (1) (1980)
Bengt Aspvall, Yossi Shiloach
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. SIAM J. Comput. 9 (4) (1980)
Bengt Aspvall
Recognizing Disguised NR(1) Instances of the Satisfiability Problem. J. Algorithms 1 (1) (1980)
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) (1979)
Bengt Aspvall, Yossi Shiloach
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality FOCS (1979)