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="Kaminski, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimum dominating sets of intervals on lines
S.-W. Cheng
,
M. Kaminski
,
S. Zaks
Algorithmica
20
(3), 1998, pp. 294-308
Finite-memory automata
M. Kaminski
,
N. Francez
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 683-688
An algorithm for polynomial multiplication that does not depend on the ring constants
M. Kaminski
Journal of Algorithms
9
(1), 1988, March, pp. 137-147
Multiplicative complexity of polynomial multiplication over finite fields
M. Kaminski
,
N.H. Bshouty
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 138-140
A lower bound for polynomial multiplication
M. Kaminski
Theoretical Computer Science
40
(2,3), 1985, pp. 319-322
A classification of
\omega
-regular languages
M. Kaminski
Theoretical Computer Science
36
(2,3), 1985, pp. 217-229
Multiplication of polynomials over the ring of integers
M. Kaminski
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 251-254