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="Hopcroft, J.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reducing multipath object motion planning to graph searching
J.E. Hopcroft
,
G.T. Wilfong
SIAM Journal on Computing
15
(3), 1986, August, pp. 768-785
Routing, merging, and sorting on parallel models of computation
A. Borodin
,
J.E. Hopcroft
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 130-145
On the harmonious coloring of graphs
J.E. Hopcroft
,
M.S. Krishnamoorthy
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 306-311
Routing, merging, and sorting on parallel models of computation
A. Borodin
,
J.E. Hopcroft
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 338-344
On finding lowest common ancestors in trees
A.V. Aho
,
J.E. Hopcroft
,
J.D. Ullman
SIAM Journal on Computing
5
(1), 1976, March, pp. 115-132
Linear time algorithm for isomorphism of planar graphs
J.E. Hopcroft
,
J.K. Wong
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC'74 (Seattle, WA, April 30 - May 2, 1974)
, 1974, pp. 172-184
On finding lowest common ancestors in trees
A.V. Aho
,
J.E. Hopcroft
,
J.D. Ullman
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 253-265
Duality in determining the complexity of noncommutative matrix multiplication
J.E. Hopcroft
,
J. Musinski
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 73-87
A
V\log V
algorithm for isomorphism of triconnected planar graphs
J.E. Hopcroft
,
R.E. Tarjan
Journal of Computer and System Sciences
7
, 1973, pp. 323-331
Dividing a graph into triconnected components
J.E. Hopcroft
,
R.E. Tarjan
SIAM Journal on Computing
2
(3), 1973, September, pp. 135-158
On the computational power of pushdown automata
A.V. Aho
,
J.D. Ullman
,
J.E. Hopcroft
Journal of Computer and System Sciences
4
, 1970, pp. 129-136
A general theory of translation
A.V. Aho
,
J.E. Hopcroft
,
J.D. Ullman
Math. Systems Theory
3
, 1969, pp. 193-221
Some results on tape-bounded Turing machines
J.E. Hopcroft
,
J.D. Ullman
Journal of the ACM
16
, 1969, pp. 168-177
On the equivalence and containment problems for context-free languages
J.E. Hopcroft
Math. Systems Theory
3
, 1969, pp. 119-124
Time and tape complexity of pushdown automaton languages
A.V. Aho
,
J.E. Hopcroft
,
J.D. Ullman
Information and Control
13
, 1968, pp. 186-206
Deterministic stack automata and the quotient operator
J.E. Hopcroft
,
J.D. Ullman
Journal of Computer and System Sciences
2
, 1968, pp. 1-12
Decidable and undecidable questions about automata
J.E. Hopcroft
,
J.D. Ullman
Journal of the ACM
15
, 1968, pp. 317-324
Sets accepted by one-way stack automata are context sensitive
J.E. Hopcroft
,
J.D. Ullman
Information and Control
13
, 1968, pp. 114-133
Nonerasing stack automata
J.E. Hopcroft
,
J.D. Ullman
Journal of Computer and System Sciences
1
, 1967, pp. 166-186