Bengt Aspvall

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximations for the general block distribution of a matrix Algorithm Theory — SWAT'98	2022-12-09	Paper
Memory requirements for table computations in partial k-tree algorithms Algorithm Theory — SWAT'98	2022-12-09	Paper
Approximations for the general block distribution of a matrix Theoretical Computer Science	2002-03-03	Paper
Memory requirements for table computations in partial \(k\)-tree algorithms Algorithmica	2000-08-27	Paper
On 2-QBF truth testing in parallel Information Processing Letters	1997-02-28	Paper
Minimizing elimination tree height can increase fill more than linearly Information Processing Letters	1997-02-27	Paper
Selecting among scheduled projects Operations Research Letters	1995-12-13	Paper
Finding minimum height elimination trees for interval graphs in polynomial time BIT	1995-06-19	Paper
Graph Coloring Using Eigenvalue Decomposition SIAM Journal on Algebraic Discrete Methods	1984-01-01	Paper
Recognizing disguised NR(1) instances of the satisfiability problem Journal of Algorithms	1980-01-01	Paper
A fast algorithm for solving systems of linear equations with two variables per equation Linear Algebra and its Applications	1980-01-01	Paper
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality SIAM Journal on Computing	1980-01-01	Paper
Khachiyan's linear programming algorithm Journal of Algorithms	1980-01-01	Paper
A linear-time algorithm for testing the truth of certain quantified Boolean formulas Information Processing Letters	1979-01-01	Paper

Research outcomes over time

This page was built for person: Bengt Aspvall