Michael Kaminski
| Michael Kaminski | |
|---|---|
| Born | |
| 🏡 Residence |  Israel |
| 💼 Occupation | |
| Twitter= | |
Michael Kaminski is an Israeli theoretical computer scientist known for his contributions to polynomial multiplication algorithns and automata theory. Kaminski is currently a professor at Technion.
Research contributions[edit]
Kaminski developed new algorithms for polynomial multiplication[1][2] and studied computational complexity of this problem.[3] He also contributed to modal and temporal logics.[4][5]
In automata theory, Kaminski introduced several new models: pushdown automata over infinite alphabets[6] which he proved equivalent to context-free grammars over infinite alphabets, pushdown automata with synchronized alternation equivalent to conjunctive grammars,[7] and pebble automata over infinite alphabets.[8]
References[edit]
- ↑ Kaminski, Michael (1987). "A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor". Journal of the ACM. 34 (4): 968–984. doi:10.1145/31846.31850. ISSN 0004-5411.
- ↑ Kaminski, Michael (1989). "A note on probabilistically verifying integer and polynomial products". Journal of the ACM. 36 (1): 142–149. doi:10.1145/58562.214082. ISSN 0004-5411.
- ↑ Kaminski, Michael (2005). "A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields". SIAM Journal on Computing. 34 (4): 960–992. doi:10.1137/S0097539704442118. ISSN 0097-5397.
- ↑ Tiomkin, Michael; Kaminski, Michael (1991). "Nonmonotonic default modal logics". Journal of the ACM. 38 (4): 963–984. doi:10.1145/115234.115350. ISSN 0004-5411.
- ↑ Kaminski, Michael (1994). "A branching time logic with past operators". Journal of Computer and System Sciences. 49 (2): 223–246. doi:10.1016/S0022-0000(05)80048-0. ISSN 0022-0000.
- ↑ Cheng, Edward Y.C.; Kaminski, Michael (1998). "Context-free languages over infinite alphabets". Acta Informatica. 35 (3): 245–267. doi:10.1007/s002360050120. ISSN 0001-5903.
- ↑ Aizikowitz, Tamar; Kaminski, Michael (2013). "Conjunctive grammars and alternating pushdown automata". Acta Informatica. 50 (3): 175–197. doi:10.1007/s00236-013-0177-3. ISSN 0001-5903.
- ↑ Kaminski, Michael; Tan, Tony (2010). "A Note on Two-pebble Automata Over Infinite Alphabets". Fundamenta Informaticae. doi:10.3233/FI-2010-234.
External links[edit]
- Lua error in Module:Official_website at line 90: attempt to index field 'wikibase' (a nil value).
- Michael Kaminski at DBLP Bibliography Server
   | This article about an Israeli scientist is a stub. You can help EverybodyWiki by expanding it. |
| P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help EverybodyWiki by expanding it. |
This article "Michael Kaminski (computer scientist)" is from Wikipedia. The list of its authors can be seen in its historical. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
