On the one hand, decision diagrams are a common means to represent Boolean functions. Since they were first proposed in the 80s, they became more and more popular. They are widely used in circuit optimization and verification and are useful when dealing with combinatorial problems. Zero-Suppressed Decision Diagram (ZDD)s are one type of those diagrams. On the other hand, Java is presently one of the most popular programming languages. Much research was done on each of these two subjects, ZDDs and Java, separately, but not on a combination of both. There is no appropriate library for Java implementing ZDDs. In the course of this thesis such a library was developed and implemented. The thesis describes the basic functionality of decision diagrams and lists particularities regarding the realization of them. Finally, the results of benchmarks for the library in general and the optimizations in particular are presented and discussed.