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 × Greece
1 × Switzerland
2 × Spain
Collaborated with:
T.Pröger P.Woelfel I.Wegener
Talks about:
obdd (4) bound (3) multipl (2) lower (2) integ (2) algorithm (1) implicit (1) asymptot (1) univers (1) program (1)

Person: Beate Bollig

DBLP DBLP: Bollig:Beate

Contributed to:

LATA 20122012
LATA 20092009
STOC 20012001
ICALP 20002000

Wrote 4 papers:

LATA-2012-BolligP #algorithm #performance
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.
LATA-2009-Bollig #bound #complexity #integer #multi
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.
STOC-2001-BolligW #bound #branch #integer #multi #using
A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.
ICALP-2000-BolligW #bound #problem
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.

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.