Biography:Boris Yamnitsky

From HandWiki
Boris Yamnitsky
Born
Soviet Union
Alma materBoston University
OccupationComputer scientist, researcher, software developer
Known forBoris FX (founder)
Websitewww.borisfx.com

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

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

In 1982, Yamnitsky co-authored a paper with Leonid A. Levin titled "An Old Linear Programming Algorithm Runs in Polynomial Time".[3][4] 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][5][6] The algorithm has been cited in studies on convex optimization, approximation algorithms, and linear programming methods.[7][6][8][9] Yamnitsky documented the algorithm in his Master’s thesis.[2]

Yamnitsky founded Boris FX in 1995 to develop software for visual effects, compositing, and post-production.[10][11] He oversaw the development of software tools incorporating machine learning and AI for rotoscoping, object detection, motion estimation, image restoration, and audio denoising.[12][13]

Awards and recognition

  • 2017: Digital Video Industry Innovator Award from NewBay Media[14]
  • 2019: Engineering Emmy Awards for Sapphire, Mocha Pro, and Silhouette[15]
  • 2025: Engineering, Science & Technology Emmy Award for Continuum[16][17][18][19][20][21]

Selected publications

  • 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.[5][22][23]

References

  1. ↑ 1.0 1.1 "GTC Program Guide". https://www.nvidia.com/content/gtc/documents/gtc_programguide.pdf. 
  2. ↑ 2.0 2.1 2.2 "An Old Linear Programming Algorithm Runs in Polynomial Time". https://www.cs.bu.edu/fac/lnd/pdf/simpl.pdf. 
  3. ↑ "An old linear programming algorithm runs in polynomial time". https://www.computer.org/csdl/proceedings-article/sfcs/1982/04568407/12OmNyvGyjw. 
  4. ↑ 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. 
  5. ↑ 5.0 5.1 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. 
  6. ↑ 6.0 6.1 Bartels, Sven G. (2000), Kalai, Gil; Ziegler, Günter M., eds., "The Complexity of Yamnitsky and Levin's Simplices Algorithm" (in en), 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, https://doi.org/10.1007/978-3-0348-8438-9_10, retrieved 2025-11-20 
  7. ↑ "A brief history of NP-completeness, 1954–2012". https://www.researchgate.net/publication/267432503. 
  8. ↑ Chvátal, Vašek (1983-09-15) (in en). Linear Programming. Macmillan. ISBN 978-0-7167-1587-0. https://books.google.com/books?id=DN20_tW_BV0C&dq=Yamnitsky-Levin&pg=PA452. 
  9. ↑ Faigle, U.; Hunting, M.; Kern, W.; Prakash, R.; Supowit, K. J. (1997-02-01). "Simplices by point-sliding and the Yamnitsky-Levin algorithm" (in en). Mathematical Methods of Operations Research 46 (1): 131–142. doi:10.1007/BF01199467. ISSN 1432-5217. https://doi.org/10.1007/BF01199467. 
  10. ↑ "BorisFX founder Boris Yamnitsky shares his vision of the future of AI". https://www.postmagazine.com/Press-Center/Daily-News/2024/BorisFX-founder-Boris-Yamnitsky-shares-his-visio.aspx. 
  11. ↑ "Boris goes to Hollywood" (in en-US). 1997-08-11. https://www.bizjournals.com/boston/stories/1997/08/11/smallb1.html. 
  12. ↑ "Boris FX Continuum Adds New AI VFX Tools" (in en). https://www.awn.com/news/boris-fx-continuum-adds-new-ai-vfx-tools. 
  13. ↑ "Boris FX Continues Expansion of Visual Effects Tools". October 9, 2019. https://postperspective.com/emails/BorisFX/ppnews-BorisFX-191009.html. 
  14. ↑ "Boris FX Founder Honored with a Digital Video Industry Innovator Award". https://continuum-redesign--borisfx.netlify.app/reviews/. 
  15. ↑ "Boris FX Wins Big at Engineering Emmy Awards" (in en). https://blog.borisfx.com/press/boris-fx-wins-big-at-engineering-emmy-awards. 
  16. ↑ Electa Petrov, Jessie. "Boris FX Continuum Honored with 2025 Engineering, Science & Technology Emmy® Award" (in en). https://blog.borisfx.com/press/boris-fx-continuum-honored-with-2025-engineering-science-technology-emmy-award. 
  17. ↑ "77th Engineering, Science & Technology Emmy Awards" (in en). https://www.televisionacademy.com/events/251014-emmys. 
  18. ↑ Schneider, Michael (2025-09-02). "TV Academy Announces Engineering, Science & Technology Emmy Award Winners" (in en-US). https://variety.com/2025/tv/news/tv-academy-engineering-science-technology-emmy-winners-1236504747/. 
  19. ↑ "2025 ENGINEERING, SCIENCE & TECHNOLOGY EMMYS" (in en). https://reader.emagazines.com/issue/emmy-engineering/emmy-engineering-program-2025/2025-engineering-science-technology-emmys?ipt=a4367903-827b-4fa2-b05d-52a7ddbd8015#p8. 
  20. ↑ Corrigan, Matthew (2025-09-03). "BBC Research and Development awarded Engineering, Science and Technology Emmy" (in en-GB). https://www.tvbeurope.com/business/bbc-research-and-development-awarded-engineering-science-and-technology-emmy. 
  21. ↑ "Congratulations to Boris FX for their 2025 Emmy® Win! -" (in en-US). 2025-09-11. https://www.toolfarm.com/news/boris-fx-emmy/. 
  22. ↑ Yamnitsky, Boris; Levin, Leonid A. (1982). An Old Linear Programming Algorithm Runs in Polynomial Time. IEEE. pp. 327–328. doi:10.1109/SFCS.1982.63. https://www.computer.org/csdl/proceedings-article/sfcs/1982/04568407/12OmNyvGyjw. Retrieved 2025-12-08. 
  23. ↑ Yamnitsky, Boris; Levin, Leonid A. (November 1982). "An old linear programming algorithm runs in polynomial time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 327–328. doi:10.1109/SFCS.1982.63. https://ieeexplore.ieee.org/document/4568407/authors. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Boris_Yamnitsky&oldid=4222853"