( en | de | ru )

 

Disambiguation of "Kaminski, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Pushdown automata with cancellation and commutation-augmented pregroups grammars.

, and . LATA, Report 35/07, page 7-26. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Kaminski

Lukas Michael Kaminski

Lars Kaminski

Horst Kaminski

Karl Kaminski

 

Other publications of authors with the same name

Nonstandard connectives of intuitionistic propositional logic.. Notre Dame J. Formal Log., 29 (3): 309-331 (1988)Indistinguishability by Default., , and . We Will Show Them! (1), page 415-428. College Publications, (2005)Polynomial multiplication over finite fields: from quadratic to straight-line complexity., and . Comput. Complex., 15 (3): 252-262 (2006)A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields., , and . J. Algorithms, 13 (4): 577-588 (1992)Finite-Memory Automata (Extended Abstract), and . FOCS, page 683-688. IEEE Computer Society, (1990)0-8186-2082-X.Invariance Under Stuttering in a Temporal Logic without the Üntil" Operator.. Fundam. Informaticae, 82 (1-2): 127-140 (2008)Context-Free Languages over Infinite Alphabets., and . Acta Inf., 35 (3): 245-267 (1998)Sets of Linear Forms Which Are Hard to Compute., and . MFCS, volume 202 of LIPIcs, page 66:1-66:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.. STACS, volume 3404 of Lecture Notes in Computer Science, page 485-495. Springer, (2005)Note on probabilistic algorithms in integer and polynomial arithmetic.. SYMSACC, page 117-121. ACM, (1981)