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="Harrison, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Explicit solution by radicals, gonal maps and plane models of algebraic curves of genus 5 or 6
Michael Harrison
Journal Symbolic Computation
51
, 2013, pp. 3-21
Algorithms for Del Pezzo surfaces of degree 5 (construction, parametrization)
Jon González-Sánchez
,
Michael Harrison
,
Irene Polo-Blanco
,
Josef Schicho
Journal Symbolic Computation
47
(3), 2012, pp. 342-353
An extension of Kedlaya's algorithm for hyperelliptic curves
Michael C. Harrison
Journal Symbolic Computation
47
(1), 2012, pp. 89-101
Efficient hyperelliptic arithmetic using balanced representation for divisors
Steven D. Galbraith
,
Michael Harrison
,
David J. Mireles Morales
Lecture Notes in Computer Science
5011
, 2008, pp. 342-356
Rational parametrisation for degree 6 Del Pezzo surfaces using Lie algebras
Michael Harrison
,
Josef Schicho
Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'2006 (Università degli Studi di Genova, Genova, Italy, July 9-12, 2006)
, 2006, pp. 132-137
Normal forms of deterministic grammars
Matthew Geller
,
Michael A. Harrison
,
Ivan M. Havel
Discrete Mathematics
16
, 1976, pp. 313-321
On models of protection in operating systems
Michael A. Harrison
Lecture Notes in Computer Science
32
, 1975, pp. 46-60
Mutually divisible semigroups
Ronald V. Book
,
Michael A. Harrison
Discrete Mathematics
9
(4), 1974, pp. 329-332
Strict deterministic grammars
Michael A. Harrison
,
Ivan M. Havel
Journal of Computer and System Sciences
7
, 1973, pp. 237-277
On the covering and reduction problems for context-free grammars
James N. Gray
,
Michael A. Harrison
Journal of the ACM
19
, 1972, pp. 675-698
A grammatical characterization of one-way nondeterministic stack languages
Michael A. Harrison
,
Mario Schkolnick
Journal of the ACM
18
, 1971, pp. 148-172
On the closure of AFL under reversal
Seymour Ginsburg
,
Michael Harrison
Information and Control
17
, 1970, pp. 395-409
Decomposition of linear sequential machines
Hervé Gallaire
,
Michael A. Harrison
Math. Systems Theory
3
, 1969, pp. 246-287
One-way nondeterministic real-time list-storage languages
Seymour Ginsburg
,
Michael A. Harrison
Journal of the ACM
15
, 1968, pp. 428-446
On the elimination of endmarkers
Seymour Ginsburg
,
Michael A. Harrison
Information and Control
12
, 1968, pp. 103-115
On the cycle index of a product of permutation groups
Michael A. Harrison
,
Robert C. High
Journal of Combinatorial Theory
4
, 1968, pp. 277-299
Multi-tape and multi-head pushdown automata
Michael A. Harrison
,
Oscar H. Ibarra
Information and Control
13
, 1968, pp. 433-470
One-way stack automata
Seymour Ginsburg
,
Sheila A. Greibach
,
Michael A. Harrison
Journal of the ACM
14
, 1967, pp. 389-418
Stack automata and compiling
Seymour Ginsburg
,
Sheila A. Greibach
,
Michael A. Harrison
Journal of the ACM
14
, 1967, pp. 172-201
Bracketed context-free languages
Seymour Ginsburg
,
Michael A. Harrison
Journal of Computer and System Sciences
1
, 1967, pp. 1-23
Two-way pushdown automata
James N. Gray
,
Michael A. Harrison
,
Oscar H. Ibarra
Information and Control
11
, 1967, pp. 30-70
The theory of sequential relations
James N. Gray
,
Michael A. Harrison
Information and Control
9
, 1966, pp. 435-468
On Asymptotic estimates in switching and automata theory
Michael A. Harrison
Journal of the ACM
13
, 1966, pp. 151-157
Note on the number of finite algebras
Michael A. Harrison
Journal of Combinatorial Theory
1
, 1966, pp. 395-397
On the error correcting capacity of finite automata
Michael A. Harrison
Information and Control
8
, 1965, pp. 430-450
Seiten 1
2
>