Deborah Joseph
Affiliations: University of WisconsinMadison, Madison, USA
According to our database^{1},
Deborah Joseph
authored at least 27 papers
between 1980 and 2002.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on cs.wisc.edu
On csauthors.net:
Bibliography
2002
Beyond tandem repeats: complex pattern structures and distant regions of similarity.
Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002
1994
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994
1993
Inf. Comput., June, 1993
J. Comput. Syst. Sci., 1993
Discret. Comput. Geom., 1993
Comput. Complex., 1993
1992
Theor. Comput. Sci., 1992
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.
Proceedings of the Algorithm Theory, 1992
1991
SIAM J. Comput., 1991
1990
Int. J. Found. Comput. Sci., 1990
Proceedings of the SWAT 90, 1990
Proceedings of the STACS 90, 1990
1989
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989
1988
The Structural Complexity Column, guest authors.
Bull. EATCS, 1988
1987
SelfReducible, PSelectlve, NearTestable, NearTestable, and PCheatable Sets: The Effect of Internal Structure on the Complexity of a Set.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987
1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Theor. Comput. Sci., 1985
SIAM J. Comput., 1985
1984
SIAM J. Comput., 1984
1983
J. Comput. Syst. Sci., 1983
1982
J. Comput. Syst. Sci., 1982
1981
J. Comput. Syst. Sci., 1981
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981
1980
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980