Bengt Aspvall

According to our database, Bengt Aspvall authored at least 11 papers between 1979 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

Sorting algorithms as special cases of a priority queue sort.

Tim Bell, Bengt Aspvall

Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

2001

Approximations for the general block distribution of a matrix.

Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne

Theor. Comput. Sci., 2001

2000

Memory Requirements for Table Computations in Partial k-Tree Algorithms.

Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski

Algorithmica, 2000

1996

On 2-QBF Truth Testing in Parallel.

Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind

Inf. Process. Lett., 1996

1995

Selecting among scheduled projects.

Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger

Oper. Res. Lett., 1995

Minimizing Elimination Tree Height Can Increase Fill More Than Linearly.

Bengt Aspvall

Inf. Process. Lett., 1995

1980

Efficient algorithms for certain satisfiability and linear programming problems.

Bengt Aspvall

PhD thesis, 1980

A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality.

Bengt Aspvall, Yossi Shiloach

SIAM J. Comput., 1980

Khachiyan's Linear Programming Algorithm.

Bengt Aspvall, Richard E. Stone

J. Algorithms, 1980

Recognizing Disguised NR(1) Instances of the Satisfiability Problem.

Bengt Aspvall

J. Algorithms, 1980

1979

A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas.

Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan

Inf. Process. Lett., 1979