Martin Löbbing - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 5 from 5

1999

On the complexity of the hidden weighted bit function for various BDD modelsBeate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener. ita, 33(2):103-116, 1999.

1998

Parity OBDDs Cannot be Handled Efficiently EnoughMartin Löbbing, Detlef Sieling, Ingo Wegener. ipl, 67(4):163-168, 1998. [doi]

1996

On the Effect of Local Changes in the Variable Ordering of Ordered Decision DiagramsBeate Bollig, Martin Löbbing, Ingo Wegener. ipl, 59(5):233-239, 1996. [doi]

The Number of Knight s Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision DiagramsMartin Löbbing, Ingo Wegener. combinatorics, 3(1), 1996. [doi]

1995

The Number of Knight s Tours Equals 33,439,123,484,294 - Counting with Binary Decision DiagramsMartin Löbbing, Ingo Wegener. eccc, 2(47), 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL