Martin Löbbing

According to our database, Martin Löbbing authored at least 5 papers between 1995 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1999

On the complexity of the hidden weighted bit function for various BDD models.

Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener

RAIRO Theor. Informatics Appl., 1999

1998

Parity OBDDs Cannot be Handled Efficiently Enough.

Martin Löbbing, Detlef Sieling, Ingo Wegener

Inf. Process. Lett., 1998

1996

On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams.

Beate Bollig, Martin Löbbing, Ingo Wegener

Inf. Process. Lett., 1996

The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams.

Martin Löbbing, Ingo Wegener

Electron. J. Comb., 1996

1995

The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams

Martin Löbbing, Ingo Wegener

Electron. Colloquium Comput. Complex., 1995