Boris Yamnitsky
This article has been nominated for deletion. You are welcome to participate in the deletion discussion, which will decide whether to keep it. This discussion may also result in the article being merged, redirected, or draftified. |
 | A major contributor to this article appears to have a close connection with its subject. (December 2025) |
Boris Yamnitsky | |
|---|---|
| Born | |
| Alma mater | Boston University |
| Occupations | Computer scientist, researcher, software developer |
| Known for | Boris FX (founder) |
| Website | www |
Boris Yamnitsky is a Soviet-American computer scientist, researcher, and software developer. He is the founder of Boris FX, a company that develops software for visual effects and compositing. He co-authored a polynomial-time algorithm for linear programming with Leonid A. Levin.
Early life and education
[edit]Yamnitsky emigrated from the former Soviet Union in the 1970s.[1] He earned an M.A. in Mathematics from Boston University in 1982, where he studied theoretical computer science and linear programming.[1][2]
Research and career
[edit]In 1982, Yamnitsky co-authored a paper with Leonid A. Levin titled "An Old Linear Programming Algorithm Runs in Polynomial Time". The paper introduced an n-dimensional simplex-splitting technique, known as the Yamnitsky–Levin algorithm. The authors demonstrated that the number of splits required, denoted q(n), equals 1, which establishes polynomial-time behavior under certain conditions.[2][3][4]
Yamnitsky founded Boris FX in 1995 to develop software for visual effects, compositing, and post-production.[5][6] He oversaw the development of software tools incorporating machine learning and AI for rotoscoping, object detection, motion estimation, image restoration, and audio denoising.[7][8]
Awards and recognition
[edit]- 2017: Digital Video Industry Innovator Award from NewBay Media[9]
- 2019: Engineering Emmy Awards for Sapphire, Mocha Pro, and Silhouette[10]
- 2025: Engineering, Science & Technology Emmy Award for Continuum[11]
Selected publications
[edit]- Yamnitsky, Boris & Levin, Leonid A. (1982). An Old Linear Programming Algorithm Runs in Polynomial Time. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (pp. 327–328). IEEE. doi:10.1109/SFCS.1982.63.
References
[edit]- ^ a b "GTC Program Guide" (PDF). NVIDIA. Retrieved 2025-12-08.
- ^ a b "An Old Linear Programming Algorithm Runs in Polynomial Time" (PDF). Boston University. Retrieved 2025-12-08.
- ^ Yamnitsky, Boris; Levin, Leonid A. (1982). "An old linear programming algorithm runs in polynomial time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 327–328. doi:10.1109/SFCS.1982.63.
- ^ Bartels, Sven G. (2000), Kalai, Gil; Ziegler, Günter M. (eds.), "The Complexity of Yamnitsky and Levin's Simplices Algorithm", Polytopes — Combinatorics and Computation, Basel: Birkhäuser, pp. 199–225, doi:10.1007/978-3-0348-8438-9_10, ISBN 978-3-0348-8438-9, retrieved 2025-11-20
{{citation}}: CS1 maint: work parameter with ISBN (link) - ^ "BorisFX founder Boris Yamnitsky shares his vision of the future of AI". Retrieved 2025-12-08.
- ^ "Boris goes to Hollywood". 1997-08-11. Retrieved 2025-12-08.
- ^ "Boris FX Continuum Adds New AI VFX Tools". Animation World Network. Retrieved 2025-12-08.
- ^ "Boris FX Continues Expansion of Visual Effects Tools". October 9, 2019. Retrieved 2025-12-08.
- ^ "Boris FX Founder Honored with a Digital Video Industry Innovator Award". Retrieved 2025-12-08.
- ^ "Boris FX Wins Big at Engineering Emmy Awards". Retrieved 2025-12-08.
- ^ Electa Petrov, Jessie. "Boris FX Continuum Honored with 2025 Engineering, Science & Technology Emmy® Award". Retrieved 2025-12-08.