Banach-Saks Properties of C*-Algebras and Hilbert C*-Modules Michael Frank joint with Alexander A. Pavlov Pontryagin Conference, Moscow, June 2008 Michael Frank

Source URL: www.imn.htwk-leipzig.de

On Threshold Circuits for Parity Ramamohan Paturi and Michael E. Saks* Department of Computer Science and Engineering University of California, San Diego; La Jolla, CaAbstract

Source URL: cseweb.ucsd.edu

On The Triangle Algorithm for Convex Hull Membership Bahman Kalantari∗ and Michael Saks†. Abstract Given S = {v1 , . . . , vn } ⊂ Rm , p ∈ Rm and ε ∈ (0, 1), the triangle algorithm either computes p0 ∈ conv(

Source URL: www-cs.engr.ccny.cuny.edu

Lower Bounds for the Noisy Broadcast Problem Navin Goyal ∗ [removed] Dept. of Computer Science Rutgers University

Source URL: dimacs.rutgers.edu

• Computational complexity theory
• Communication
• Models of computation
• Asymptotic analysis
• Quantum information science
• Michael Saks
• Information theory
• Decision tree model
• Big O notation
• Theoretical computer science
• Applied mathematics
• Mathematics

Microsoft Word - RESUMES[removed]

Source URL: www.uchastings.edu

• Daubert standard
• Sanders
• Expert witness
• Witness
• University of California
• Hastings College of the Law
• David Bernstein
• Law
• Evidence law
• Michael J. Saks