BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
1 × USA
1 × United Kingdom
Collaborated with:
K.Mehlhorn J.Blömer H.Wagener S.Näher
Talks about:
function (2) complex (2) lower (2) bound (2) comparison (1) recognit (1) arithmet (1) approxim (1) respect (1) problem (1)

Person: Helmut Alt

DBLP DBLP: Alt:Helmut

Contributed to:

ICALP 19901990
ICALP 19871987
STOC 19841984
ICALP 19801980
ICALP 19761976

Wrote 5 papers:

ICALP-1990-AltBW #approximate
Approximation of Convex Polygons (HA, JB, HW), pp. 703–716.
ICALP-1987-MehlhornNA #bound #complexity #problem
A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
STOC-1984-Alt #comparison
Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (HA), pp. 466–470.
ICALP-1980-Alt #integer #multi
Functions Equivalent to Integer Multiplication (HA), pp. 30–37.
ICALP-1976-AltM #bound #complexity #recognition
Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.