Publication Year

Publication Type

Co-author

Journals and Conferences

The PPSZ Algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3-SAT formula can be found in expected running… (More)

The PPSZ Algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3-SAT formula can be found in expected running… (More)

This paper establishes a randomized algorithm that finds a satisfying assignment for a satisfiable formula F in 3-CNF in O(1.32793n) expected running time. The algorithms is based on the analysis of… (More)

Geographical Information Systems (GISs) are playing an increasingly important role in society. Not only have the capabilities of GIS packages expanded, but their spectrum has been widened by the… (More)

This work deals with worst-case algorithms for the satisfiability problem regarding boolean formulas in conjunctive normal form. The main part of this work consists of the analysis of the running… (More)

Malware does not need to compromise the operating system kernel in order to provide an untrustworthy browsing experience for the user. This paper describes a simple, virtual machine-based, malware… (More)