Luis Rademacher Office: Dreese Labs 495 2015 Neil Avenue Columbus, OH 43210 Phone: (614) 292-3083 E-mail : lrademac [at] cse [dot] ohio-state [dot] edu

I am an Assistant Professor at the School of Computer Science and Engineering, Ohio State University. I am a member of the Theory and Algorithms group.

I am looking for PhD students interested in working on problems around algorithms, geometry and randomness. Contact me!

CV (PDF) (Jan 2011)

News

Presentations

• Randomized algorithms for the approximation of matrices
  FoCM 2011, Learning theory workshop: PDF
  IMA, High dimensional phenomena: PDF

Advisees

• Abhisek Kundu (MS)
• Jie Cui (MS)
  

Publications (PDF files)

• Lower bounds for the smoothed number of Pareto optima. (Navin Goyal)
  Submitted.
  
• Lower bounds on partitions and applications to query complexity. (Navin Goyal, Santosh Vempala)
  Submitted.
  
• Efficient volume sampling for row/column subset selection. (Amit Deshpande)
  FOCS 2010.
  
• On the Monotonicity of the Expected Volume of a Random Simplex.
  Mathematika. Arxiv. Presentation at Oberwolfach: PPTX, PDF.
  Computational experiments for the 3-dimensional case.
  
• Optimization of a Convex Program with a Polynomial Perturbation. (Ravi Kannan)
  ORL.
• Learning Convex Bodies is Hard. (Navin Goyal) 
  COLT 2009.
• Expanders via Random Spanning Trees. (Navin Goyal, Santosh Vempala) 
  SODA 2009.
• Minimal Partitioning into Product Sets. (Xuancheng Shao) In preparation.
• Approximating the Centroid is Hard. PDF presentation.
  SOCG 2007.
• Dispersion of Mass and the Complexity of Geometric Problems. 
  PhD thesis, Deparment of Mathematics, MIT, 2007.
• Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. (Santosh Vempala)
  Advances in Mathematics and FOCS 2006.
  PDF presentation of the volume lower bound.
• Computing Equilibrium Prices in Exchange Economies with Tax Distortions. (Bruno Codenotti, Kasturi Varadarajan)
  ICALP 2006.
• Matrix Approximation and Projective Clustering via Volume Sampling. (Amit Deshpande, Santosh Vempala, Grant Wang)
  Theory of Computing and SODA 2006. Short PDF presentation.
• Testing geometric convexity. (Santosh Vempala)
  FSTTCS 2004. Short PDF presentation.
  The Cross-Polytope with Peaks (java applet).
• Computation and Stability of Nash Equilibria and Applications to the Modeling of the Electrical Energy Generation Market (in spanish).
  Math. Eng. Thesis, Department of Mathematical Engineering, University of Chile, Santiago, Chile, August 2002.

Teaching

• Wi10 CSE 725 - Computability and Unsolvability
• Sp10 CSE 725 - Computability and Unsolvability
• Sp10 CSE 788.01 - Topics in Randomized Algorithms
• Au10 CSE 680 - Introduction to Analysis of Algorithms and Data Structures
• Jan 2011 - Summer School on Discrete Mathematics. Randomized algorithms and matrix decompositions.
• Wi11 CSE 725 - Computability and Unsolvability
• Au11 CSE 680 - Introduction to Analysis of Algorithms and Data Structures
• Sp12 CSE 788.01 - Sparse Representations and Compressed Sensing
• Sp12 CSE 725 - Computability and Unsolvability

Some of my Friends / Collaborators

• David Cash, Bruno Codenotti, Jie Cui, Amit Deshpande, Navin Goyal, Alejandro Jofré, Ravi Kannan, Abhisek Kundu, Nelson Morales, Patricio Ramírez, Roberto Rondanelli, Marcos Sotomayor, Alejandro Toriello, Kasturi Varadarajan, Santosh Vempala, Juan Pablo Vielma, Grant Wang, Xuancheng Shao.