Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Aspvall, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Memory requirements for table computations in partial
k
-tree algorithms
B. Aspvall
,
A. Proskurowski
,
J.A. Telle
Algorithmica
27
, 2000, pp. 382-394
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
B. Aspvall
,
Y. Shiloach
SIAM Journal on Computing
9
(4), 1980, November, pp. 827-845
A linear-time algorithm for testing the truth of certain quantified Boolean formulas
B. Aspvall
,
M.F. Plass
,
R.E. Tarjan
Information Processing Letters
8
(3), 1979, February, pp. 121-123
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
B. Aspvall
,
Y. Shiloach
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 205-217