Deborah Joseph

Computer Science · Physical Sciences

16h-index1.4kcitations38works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computability, Logic, AI Algorithms(13), Complexity and Algorithms in Graphs(10), semigroups and automata theory(7), Advanced Graph Theory Research(5), Computational Geometry and Mesh Generation(5)

Publications38 total

Some Submaximal Elements of the Lattice of Finitary Operations on a Finite Set
Preprints.org·2024Open Access
Weaker Form of Fuzzy Minimal Open Sets and a Stronger Form of Fuzzy Mean Open Sets
Tuijin Jishu/Journal of Propulsion Technology·2023Open Access
Simon Albert Philip Jenkins
BMJ·2017
Dynamic methods for fragment assembly in large scale genome sequencing projects
2002· 4 cited
Collapsing degrees in subexponential time
2002· 4 cited
Resources for Workplace Diversity: An Annotated Practitioner Guide to Information
eCommons (Cornell University)·2001· 1 citedOpen Access
Human Resources and the Internet.
1998
A note on bi-immunity and p-closeness of p-cheatable sets in P/poly
Journal of Computer and System Sciences·1993· 8 cited
Relativized isomorphisms of NP-complete sets
Computational Complexity·1993· 9 cited
Using Self-Reducibilities to Characterize Polynomial Time
Information and Computation·1993· 6 cited
A geophysical investigation of the Nova-Canton Trough : the key to the Late Cretaceous evolution of the Central Pacific
1993Open Access
On sparse spanners of weighted graphs
Discrete & Computational Geometry·1993· 590 citedOpen Access
Minimum vertex hulls for polyhedral domains
Theoretical Computer Science·1992· 16 cited
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
Lecture notes in computer science·1992· 45 cited
Near-Testable Sets
SIAM Journal on Computing·1991· 24 cited
STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP
International Journal of Foundations of Computer Science·1990· 16 cited
Generating sparse spanners for weighted graphs
Lecture notes in computer science·1990· 60 cited
Minimum vertex hulls for polyhedral domains
Lecture notes in computer science·1990· 2 cited
Self-Reducibility: Effects of Internal Structure on Computational Complexity
1990· 26 cited
Kolmogorov complexity, restricted nondeterminism and generalized spectra
Lecture notes in computer science·1990· 2 cited
page 1 of 2Next →

Frequent Co-authors

Paul R. Young(13), Judy Goldsmith(7), Gautam Das(5), John E. Hopcroft(3), Sue Whitesides(3), Ingo Althöfer(2), David Dobkin(2), João Meidânis(2), Meera Sitharam(2), Danilo Bruschi(2), Paul Young(2), José Soares(1), Prasoon Tiwari(1), Alberto Bertoni(1), Danilo Bruschi(1), Lane A. Hemachandra(1), Paul Young(1), W. Istvanick(1), A. Kryder(1), Gary Lewandowski(1)