Bengt Aspvall

14 papers A* 1A 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2011 A conf
Sorting algorithms as special cases of a priority queue sort.
SIGCSE
Tim Bell, Bengt Aspvall
2001 J jnl
Approximations for the general block distribution of a matrix.
Theor. Comput. Sci.
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
2000 J jnl
Memory Requirements for Table Computations in Partial k-Tree Algorithms.
Algorithmica
Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski
1998 — conf
Approximations for the General Block Distribution of a Matrix.
SWAT
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
1998 — conf
Memory Requirements for Table Computations in Partial k-tree Algorithms.
SWAT
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle
1996 J jnl
On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett.
Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
1995 J jnl
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.
Inf. Process. Lett.
Bengt Aspvall
1995 J jnl
Selecting among scheduled projects.
Oper. Res. Lett.
Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger
1980 J jnl
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.
SIAM J. Comput.
Bengt Aspvall, Yossi Shiloach
1980 — —
Efficient algorithms for certain satisfiability and linear programming problems.
Bengt Aspvall
1980 J jnl
Khachiyan's Linear Programming Algorithm.
J. Algorithms
Bengt Aspvall, Richard E. Stone
1980 J jnl
Recognizing Disguised NR(1) Instances of the Satisfiability Problem.
J. Algorithms
Bengt Aspvall
1979 J jnl
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas.
Inf. Process. Lett.
Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan
1979 A* conf
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality
FOCS
Bengt Aspvall, Yossi Shiloach