Deborah Joseph

Learn More
The Göttingen State and University Library provides access to digitized documents strictly for noncommercial educational, research and private purposes and makes no warranty with regard to their use for other purposes. Some of our collections are protected by copyright. Publication and/or broadcast in any form (including electronic) requires prior written(More)
GAUTAM DAS University of Wisconsin DEBORAH JOSEPH University of Wisconsin A b s t r a c t . Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants are sparse approximations of the complete graph, in that the shortest distance between two sites within the triangulation is bounded by a constant multiple of their Euclidean(More)
We present two results about witness functions for sets in NP and coNP. First, any set that has a polynomially computable function which witnesses that it is not in coNP must be at least NP-hard. It follows from this result that any set in N P c o N P that has a polynomially computable function which witnesses this fact must already be complete for NP.(More)
The classical mover's problem is the following: can a rigid object in 3-dimensional space be moved from one given position to another while avoiding obstacles? It is known that a more general version of this problem involving objects with movable joints is PSPACE-complete, even for a simple tree-like structure. In this paper, we investigate a 2-dimensional(More)
MOTIVATION Tandem repeats (TRs) are associated with human disease, play a role in evolution and are important in regulatory processes. Despite their importance, locating and characterizing these patterns within anonymous DNA sequences remains a challenge. In part, the difficulty is due to imperfect conservation of patterns and complex pattern structures. We(More)
This paper proves three results relating to the isomorphism question for NP-complete sets. Result 1: We construct an oracle A such that SATA is ≤mP- complete for NPA and all ≤mP-complete sets for NPA are pA- isomorphic to SATA. Result 2: We construct a time function T(n) such that DTIME(T(n)) contains btt-complete sets, which are many-one(More)