dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Bengt Aspvall Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Bell, Bengt Aspvall: Sorting algorithms as special cases of a priority queue sort. SIGCSE 2011: 123-128
2001
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
1998
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Magnús M. Halldórsson, Fredrik Manne: Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58
1996
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind: On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996)
1995
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall: Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. Inf. Process. Lett. 56(2): 115-120 (1995)
1980
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Richard E. Stone: Khachiyan's Linear Programming Algorithm. J. Algorithms 1(1): 1-13 (1980)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall: Recognizing Disguised NR(1) Instances of the Satisfiability Problem. J. Algorithms 1(1): 97-103 (1980)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Yossi Shiloach: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality FOCS 1979: 205-217
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt 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)

Coauthor Index

1Timothy C. Bell (Tim Bell) [12]
2Magnús M. Halldórsson [8] [11]
3Christos Levcopoulos [7]
4Andrzej Lingas [7]
5Fredrik Manne [8] [11]
6Michael F. Plass [1]
7Andrzej Proskurowski [9] [10]
8Yossi Shiloach [2] [3]
9Richard E. Stone [5]
10Robert Storlind [7]
11Robert Endre Tarjan [1]
12Jan Arne Telle [9] [10]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page