default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBengt Aspvall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c4]Tim Bell, Bengt Aspvall:
Sorting algorithms as special cases of a priority queue sort. SIGCSE 2011: 123-128
2000 – 2009
- 2001
- [j9]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
- [j8]Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski:
Memory Requirements for Table Computations in Partial k-Tree Algorithms. Algorithmica 27(3): 382-394 (2000)
1990 – 1999
- 1998
- [c3]Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58 - [c2]Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle:
Memory Requirements for Table Computations in Partial k-tree Algorithms. SWAT 1998: 222-233 - 1996
- [j7]Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind:
On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996) - 1995
- [j6]Bengt Aspvall:
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly. Inf. Process. Lett. 56(2): 115-120 (1995) - [j5]Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger:
Selecting among scheduled projects. Oper. Res. Lett. 17(1): 37-40 (1995)
1980 – 1989
- 1980
- [b1]Bengt Aspvall:
Efficient algorithms for certain satisfiability and linear programming problems. Stanford University, USA, 1980 - [j4]Bengt Aspvall, Richard E. Stone:
Khachiyan's Linear Programming Algorithm. J. Algorithms 1(1): 1-13 (1980) - [j3]Bengt Aspvall:
Recognizing Disguised NR(1) Instances of the Satisfiability Problem. J. Algorithms 1(1): 97-103 (1980) - [j2]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)
1970 – 1979
- 1979
- [j1]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) - [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
