EECS | Electrical Engineering and Computer Science


Upcoming Seminars


Friday  Sep. 29, 2017
Distributed Exact Weighted All-Pairs Shortest Paths
Yi-Jun Chang
Graduate Student
University of Michigan
10:30am - 11:30am in BBB 3725


Friday  Oct. 06, 2017
An optimal no-go theorem on hidden variable theories
Yuri Gurevich
Microsoft Research
10:30am - 11:30am in EECS 3725


Friday  Oct. 13, 2017
TBA
Dawei Huang
Graduate Student
University of Michigan
10:30am - 11:30am in EECS 3725

 

Past Seminars


Friday  Sep. 15, 2017
Instance Optimal Learning
Yuqing Kong
Graduate Student
University of Michigan


Friday  Sep. 08, 2017
Approximation algorithms for inventory problems with submodular or routing costs
Viswanath Nagarajan
University of Michigan


Friday  Apr. 07, 2017
Generalization and Equilibrium in Generative Adversarial Nets (GANs)
Bo Li
Post Doc
University of Michigan


Friday  Mar. 24, 2017
An Information Theoretical View of Information Elicitation Mechanisms
Yuqing Kong
University of Michigan


Friday  Mar. 17, 2017
Core sets and streaming algorithms for MAX CUT
Suresh Venkatasubramanian
University of Utah


Friday  Mar. 10, 2017
Pseudorandomness of Ring-LWE for Any Ring and Modulus
Chris Peikert
Associate Professor
University of Michigan


Tuesday  Feb. 07, 2017
Lower bounds for estimating matching size in streaming models
Dawei Huang
Graduate Student
University of Michigan


Friday  Feb. 03, 2017
: A (2+eps )-Approximation for Maximum Weight Matching in the Semi-Streaming Model
Seth Pettie
Associate Professor
University of Michigan


Friday  Jan. 20, 2017
Cake Cutting: Fairness and Efficiency
Biaoshuai Tao
Graduate Student
University of Michigan


Friday  Jan. 13, 2017
Quantum hashing is maximally secure against classical leakage
Cupjin Huang
University of Michigan


Friday  Jan. 06, 2017
Fully Dynamic Connectivity in O(log n(log log n)^2) Amortized Expected Time
Shang-En Huang
University of Michigan


Friday  Dec. 09, 2016
Strategies for Extensive Form Games
Richard Stearns
University at Albany


Friday  Dec. 02, 2016
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Fang-Yi Yu
Graduate Student
University of Michigan


Friday  Nov. 04, 2016
Spookily Homomorphic Encryption
Daniel Wichs
Assistant Professor
Northeastern University


Friday  Oct. 28, 2016
Population Recovery in polynomial time
Mike Saks
Professor
Rutgers

 

   EECS Events Page