Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Joseph, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum vertex hulls for polyhedral domains
G. Das
,
D. Joseph
Lecture Notes in Computer Science
415
, 1990, pp. 126-137
Kolmogorov complexity, restricted nondeterminism and generalized spectra
D. Joseph
,
M. Sitharam
Lecture Notes in Computer Science
415
, 1990, pp. 152-164
Generalized Boolean hierarchies and Boolean hierarchies over
RP
A. Bertoni
,
D. Bruschi
,
D. Joseph
,
M. Sitharam
,
P. Young
Lecture Notes in Computer Science
380
, 1989, pp. 35-46
Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set
J. Goldsmith
,
D. Joseph
,
P. Young
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 50-59
Three results on the polynomial isomorphism of complete sets
J. Goldsmith
,
D. Joseph
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 390-397
On the movement of robot arms in 2-dimensional bounded regions
J. Hopcroft
,
D. Joseph
,
S. Whitesides
SIAM Journal on Computing
14
(2), 1985, May, pp. 315-333
Movement problems for 2-dimensional linkages
J. Hopcroft
,
D. Joseph
,
S. Whitesides
SIAM Journal on Computing
13
(3), 1984, August, pp. 610-629
Polynomial time computations in models of ET
D. Joseph
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 311-338
On the movement of robot arms in 2-dimensional bounded regions
J. Hopcroft
,
D. Joseph
,
S. Whitesides
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 280-289
A survey of some recent results on computational complexity in weak theories of arithmetic
D.A. Joseph
,
P.R. Young
Technical Report (TR 82-501), 1982
Fast programs for initial segments and polynomial time computation in weak models of arithmetic
D. Joseph
,
P. Young
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 55-61