Bengt Aspvall Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2011
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tim Bell, Bengt Aspvall: Sorting algorithms as special cases of a priority queue sort. SIGCSE 2011: 123-128
2001
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt 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
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski: Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
1998
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne: Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle: Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233
1996
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind: On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996)
1995
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall: Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. Inf. Process. Lett. 56(2): 115-120 (1995)
1980
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Richard E. Stone: Khachiyan's Linear Programming Algorithm. J. Algorithms 1(1): 1-13 (1980)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall: Recognizing Disguised NR(1) Instances of the Satisfiability Problem. J. Algorithms 1(1): 97-103 (1980)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt 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
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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): 121-123 (1979)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bengt Aspvall, Yossi Shiloach: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. FOCS 1979: 205-217

Coauthor Index

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

Colors in the list of coauthors

Last update Sun May 19 09:13:18 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page