Ilya Volkovich CV

Curriculum Vitae Contact Information: CSE Division, Bob and Betty Beyster Building 2260 Hayward, Office 3609 University of Michigan Ann Arbor, MI 48109 E-mail: [email protected] Homepage: http://www.umich.edu/~ilyavol

Research Interests:   

Computational Complexity: Derandomization, Algebraic Complexity with Applications to Algorithms Learning: Computational Learning Theory and Statistical Machine Learning Game Theory

Education: March 2012

Technion, Israel Institute of Technology

Haifa, Israel

Ph.D., Computer Science (Direct Ph.D. track)

Thesis: Polynomial Identity Testing and its relation to some Algebraic problems Advisor: Prof. Amir Shpilka

July 2003

Technion, Israel Institute of Technology

Haifa, Israel

B.A., Summa Cum Laude in Mathematics with Computer Science

Employment: 2015 – Present

University of Michigan

Ann Arbor, MI

Lecturer, Department of Electrical Engineering and Computer Science

 

2014 – 2015

Undergraduate course: Foundations of Computer Science, Discrete Math Graduate course: Advanced Cryptography

University of Michigan

Ann Arbor, MI

Postdoctoral Visiting Scholar, Department of Electrical Engineering and Computer Science

2014

University of Michigan

Ann Arbor, MI

Lecturer, Department of Mathematics



2012 – 2014

Undergraduate course: Boundary Value Problems for Partial Differential Equations

Princeton University

Princeton, NJ

Postdoctoral Research Associate, Department of Computer Science

2013 – 2014

Princeton University

Princeton, NJ

Lecturer, Department of Computer Science



2012 – 2013

Undergraduate course: Reasoning about Computation

Institute for Advanced Study

Princeton, NJ

Visitor, School of Mathematics

2007 – 2012

Technion, Israel Institute of Technology

Haifa, Israel

Teaching Assistant, Department of Computer Science

 

Undergraduate courses: Introduction to CS, Data Structures 1 Graduate course: Algebraic Problems and Algorithms in Computer Science

Ilya Volkovich CV

2003 – 2007

Israel Defense Forces (IDF)

Tel Aviv, Israel

Software Development Engineer, Intelligence Unit

  

2002 – 2003

Tested EAI Software (Including: development of adapters, XML-compatibility, DB-compatibility, SOAP-compatibility) Composed Technical/Functional Specifications & Business Requirement Documents Member of (XML-Based) IDF Standard Development team

Technion, Israel Institute of Technology

Haifa, Israel

Teaching Assistant, Department of Mathematics



Undergraduate course: Calculus 1

Professional Service: Journal Reviews:  Algorithmica  Computational Complexity (CC)  Journal of the ACM (JACM)  The ACM Transactions on Computation Theory (ToCT) Conference Reviews:  The ACM Symposium on Theory of Computing: STOC 2012, STOC 2015, STOC 2017  The Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2011, SODA 2015  The International Computer Science Symposium in Russia: CSR 2015, CSR 2016  The International Colloquium on Automata, Languages, and Programming: ICALP 2014, ICALP 2017  The Annual IEEE Conference on Computational Complexity: CCC 2011, CCC 2014, CCC 2017  The Annual IEEE Symposium on Foundations of Computer Science: FOCS 2010  The International Symposium on Mathematical Foundations of Computer Science: MFCS 2016 Event Organization: Co-organizer, 66th Midwest Theory Day at University of Michigan (MTD 2014)

Funding:    

Lecturers’ Professional Development Fund, Center for Research on Learning and Teaching (CRLT), University of Michigan, Nov 2015 – June 2016, $2000. LEO Lecturers Professional Development Fund, University of Michigan, Winter 2016, $900. LEO Lecturers Professional Development Fund, University of Michigan, Fall 2016, $900. Lecturers’ Professional Development Fund, Center for Research on Learning and Teaching (CRLT), University of Michigan, Nov 2017 – June 2018, $2000.

Mentoring and Advising: Undergraduate Research Mentoring:  Daniel Minahan. University of Michigan, Departments of Mathematics and EECS Summer 2016, Research Experience for Undergraduates (REU) Program Paper title: “Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas” Appeared in Proceedings of the 32nd Annual Conference on Computational Complexity (CCC), Riga, Latvia. 2017.

Ilya Volkovich CV

Invited Talks: 2/2013

DIMACS “Theory of Computing” Seminar New Brunswick, NJ Talk Title: “Black-Box Identity Testing of Depth-4 Multilinear Circuits”

10/2011

Aarhus University, China Theory Week (CTW) 2011 Aarhus, Denmark Talk Title: “Black-Box Identity Testing of Depth-4 Multilinear Circuits”

Selected Seminar Talks: 2/2017

University of Illinois at Chicago “Computer Science” Seminar Chicago, IL Talk Title: “Complete Derandomization of Identity Testing and Reconstruction of ReadOnce Formulas””

12/2016

Technion “CS Theory” Seminar Haifa, Israel Talk Title: “Complete Derandomization of Identity Testing and Reconstruction of ReadOnce Formulas””

3/2015

University of Michigan Undergraduate “Math Club” Talk Title: “On Polynomial Identity Testing and some Applications”

2/2015

University of Michigan “Theoretical Computer Science” Seminar Ann Arbor, MI Talk Title: “Recent Progress on the Sparse Polynomial Factorization Problem”

12/2014

The 66th Midwest Theory Day (MTD) 2014 Talk Title: “Characterizing Arithmetic Read-Once Formulae”

Ann Arbor, MI

11/2014

University of Michigan “Theoretical Computer Science” Seminar Talk Title: “Characterizing Arithmetic Read-Once Formulae”

Ann Arbor, MI

5/2014

University of Michigan “Theoretical Computer Science” Seminar Talk Title: “On Learning, Lower Bounds and (un)Keeping Promises”

Ann Arbor, MI

1/2014

Columbia University CS Department “Theory” Seminar Talk Title: “On Learning, Lower Bounds and (un)Keeping Promises”

New York, NY

12/2012

NYU-Poly “Theory of Computer Science” Seminar New York, NY Talk Title: “Black-Box Identity Testing of Depth-4 Multilinear Circuits”

9/2012

Princeton University Center of Computation Intractability (CCI) Monthly Meeting Talk Title: “Personal Research Overview”

6/2012

Weizmann Institute, “Foundations of Computer Science” Seminar Rehovot, Israel Talk Title: “Black-Box Identity Testing of Depth-4 Multilinear Circuits”

1/2012

Hebrew University of Jerusalem “CS Theory” Seminar Jerusalem, Israel Talk Title: “Black-Box Identity Testing of Depth-4 Multilinear Circuits”

5/2010

Tel-Aviv University “Theory of Computation” Seminar Talk Title: “Polynomial-Time Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in”

3/2009

Haifa University “CS Theory” Seminar Talk Title: “Polynomial Identity Testing for Read-Once Formulas”

Ann Arbor, MI

Princeton, NJ

Tel Aviv, Israel

Haifa, Israel

Ilya Volkovich CV

Awards, Fellowships and Honors (At Technion): 2008 / 2010 / 2011

Excellence Fellowship for Graduate Students

2000 – 2003

President's List Award (5 out of 6 semesters)

2002

Dr. Maxim Bikov Award for Outstanding Achievements in Undergraduate Studies

2000

High Admission Grades Award

Professional Knowledge and Skills: Programming Languages:

C# (.NET Framework 1.0, 2.0), Java, C++, C, Visual Basic, (HTML, XML)

Applications:

MATLAB, XML-Spy, TIBCO BusinessWorks (EAI), Microsoft Visio

Professional training courses:  Programming the Microsoft .NET Framework with C# (Microsoft Certified)  Developing Windows Form Applications in .NET 2.0  Building XML Based Web Applications  Design Patterns for Programmers

Languages: Hebrew and Russian (native speaker), English (fluent), French (reading proficiency)

Ilya Volkovich CV

Publications: (As is customary in theoretical computer science, the author ordering on the papers is alphabetical)

Journal Publications: 1. Daniel Minahan and Ilya Volkovich “Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas” Submitted, 2017 2. Shubhangi Saraf and Ilya Volkovich “Black-Box Identity Testing of Depth-4 Multilinear Circuits”, In Combinatorica, 2016 (accepted) 3. Ilya Volkovich “Characterizing Arithmetic Read-Once Formulae”, In ACM Transactions on Computation Theory (ToCT), volume 8, issue 1, article 2, 2016. 4. Matthew Anderson, Dieter van Melkebeek and Ilya Volkovich “Derandomizing Polynomial Identity Testing for Constant-Read Multilinear Formulae”, In Computational Complexity (CC), volume 24, issue 4, pp. 695-776, 2015. 5. Amir Shpilka and Ilya Volkovich “Read-Once Polynomial Identity Testing”, In Computational Complexity (CC), volume 24, issue 3, pp. 477-532, 2015 (Containing PIT Algorithms from “Read-once Polynomial Identity Testing”, STOC 2008 and “Improved Polynomial Identity Testing for Read-once Formulas”, RANDOM-APPROX 2009) 6. Amir Shpilka and Ilya Volkovich “On Reconstruction and Testing Read-Once Formulas”, In Theory of Computing (ToC), volume 10, pp. 465-514, 2014. (Partially based on “Read-once Polynomial Identity Testing”, STOC 2008) 7. Zohar S. Karnin, Partha Mukhppadhyay, Amir Shpilka and Ilya Volkovich “Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in”, In SIAM Journal of Computing (SICOMP), volume 42, issue 6, pp. 2114-2131, 2013. Conference Publications: 1. Russell Impagliazzo, Valentine Kabanets and Ilya Volkovich “Natural Oracles and Circuit Minimization” Submitted, 2017 2. Ilya Volkovich “On some Computations on Sparse Polynomials” In Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, (RANDOM-APPROX), volume 81 of LIPIcs, pp. 48:1-48:21, Berkley, CA. RANDOM-APPROX, 2017. 3. Daniel Minahan and Ilya Volkovich “Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas” In Proceedings of the 32nd Annual Conference on Computational Complexity (CCC), pp. 32:1-32:13 Riga, Latvia. CCC, 2017.

Ilya Volkovich CV

4. Ilya Volkovich “A Guide to Learning Arithmetic Circuits”, In Proceedings of the 29th Annual Conference on Learning Theory (COLT), pp. 1540-1561, New York, NY. COLT, 2016. 5. Ilya Volkovich “Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials”, In Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, (RANDOM-APPROX), volume 40 of LIPIcs, pp. 943-958, Princeton, NJ. RANDOM-APPROX, 2015. 6. Ilya Volkovich “On Learning, Lower Bounds and (un)Keeping Promises”, In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), pp. 1027-1038, Copenhagen, Denmark. ICALP, 2014. 7. Matthew Anderson, Dieter van Melkebeek and Ilya Volkovich “Derandomizing Polynomial Identity Testing for Constant-Read Multilinear Formulae”, In Proceedings of the 26th Annual IEEE Conference on Computational Complexity (CCC), pp. 273-282, San Jose, CA. CCC, 2011. 8. Shubhangi Saraf and Ilya Volkovich “Black-Box Identity Testing of Depth-4 Multilinear Circuits”, In Proceedings of the 43rd annual ACM symposium on Theory of computing (STOC), pp. 421-430, San Jose, CA. STOC, 2011. 9. Amir Shpilka and Ilya Volkovich “On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors”, In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), pp. 408-419, Bordeaux, France. ICALP, 2010. 10. Zohar S. Karnin, Partha Mukhppadhyay, Amir Shpilka and Ilya Volkovich “Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in”, In Proceedings of the 42nd annual ACM symposium on Theory of computing (STOC), pp. 649-658, Cambridge, MA. STOC, 2010. 11. Amir Shpilka and Ilya Volkovich “Improved Polynomial Identity Testing for Read-once Formulas”, In Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, (RANDOM-APPROX), volume 5687 of LNCS, pp. 700-713, Berkley, CA. RANDOM-APPROX, 2009.

12. Amir Shpilka and Ilya Volkovich “Read-Once Polynomial Identity Testing”, In Proceedings of the 40th annual ACM symposium on Theory of computing (STOC), pp. 507-516, Victoria, BC, Canada 2008. STOC, 2008.

Other Publications: 1. Ilya Volkovich “Polynomial Identity Testing and its relation to some Algebraic problems”, Ph.D. Thesis, Technion, Israel Institute of Technology, Haifa, Israel, 2012.