Leonard Schulman, Caltech Leonard J. Schulman Professor of Computer Science California Institute of Technology  ResearchCoursesContact InformationCenter for the Mathematics of InformationInstitute for Quantum InformationCS Theory GroupISTGraduate StudyLinks Bio - Research - Essays - Lectures - Journals Bio Leonard J. Schulman received the B.Sc. in Mathematics in 1988 andthe Ph.D. in Applied Mathematics in 1992, both from the MassachusettsInstitute of Technology. Since 2000 he has been on the faculty of theCalifornia Institute of Technology. He has also held appointments atUC Berkeley, the Weizmann Institute of Science, the Georgia Instituteof Technology, and the Mathematical Sciences Research Institute. Hehas received the MIT Bucsela prize in mathematics, an NSF mathematicalsciences postdoctoral fellowship, an NSF CAREER award, and the IEEESchelkunoff prize. He is the director of the Center for the Mathematics ofInformation and is on the faculty of the Institute for QuantumInformation. His research is in several overlapping areas:algorithms and communication protocols; combinatorics and probability;coding and information theory; quantum computation. Research  Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics, with Y. Bartal. SIAM J. Discrete Math., to appear.Muirhead-Rado inequality for compact groups.Positivity, to appear. On a capacitated multivehicle routing problem,with X. Gao. Proc. 27th PODC 175-184, 2008. On partitioning graphs via single commodity flows,with L. Orecchia, U. V. Vazirani and N. K. Vishnoi. Proc. 40th STOC 461-470, 2008. Approximation algorithms for labeling hierarchical taxonomies,with Y. Rabani and C. Swamy. Proc. 19th SODA 671-680, 2008. Contraction and expansion of convex sets, withM. Langberg. Proc. 19th Canadian Conf. Computational Geometry 25-28, 2007.Quantum algorithms for hidden nonlinear structures, with A. M. Childs and U. V. Vazirani. Proc. 48th FOCS 395-404, 2007.pdfPreliminary version: quant-ph. Imaging geometry through dynamics: the observablerepresentation, with B. Gaveau and L. S. Schulman.J. Physics A 39(33):10307-10321, 2006.The effectiveness of Lloyd-type methods for the k-meansproblem, with R. Ostrovsky, Y. Rabani and C. Swamy.Proc. 47th FOCS 165-174, 2006.Convergence of matrices under random conjugation: wave packetscattering without kinematic entanglement, with L. S. Schulman.J. Physics A 39(7):1717-1728, 2006. Analysis of incomplete data and an intrinsic-dimension Helly theorem, with J. Gao and M. Langberg. Discrete and Computational Geometry, to appear. Preliminary version: Proc. 17th SODA 464-473, 2006.Error-correcting codes for automatic control,with R. Ostrovsky and Y. Rabani. Proc. 46th FOCS 309-316, 2005.Real-time coding for multiple access channels,with X. Gao. Proc. ISIT 67-71, 2005.Feedback control for router congestion resolution,with X. Gao. Proc. 24th PODC 218-226, 2005.Physical limits of heat-bath algorithmic cooling,with T. Mor and Y. Weinstein. Short version: PhysicalReview Letters 94:120501, 2005.(Correctedexample.)Also in the Virtual J. Nanoscale Science & Technology 11(14) 4/11/2005 and the Virtual J. Quantum Information April 2005. Long version: SIAM J. Computing36(6) 1729-1747, 2007.The symmetric group defies strong Fourier sampling,with C. Moore and A. Russell. SIAM J. Computing37(6) 1842-1864, 2008. Preliminary version: Proc. 46th FOCS 479-488, 2005. Tech report: quant-ph. Improved expansion of random Cayley graphs, withP.-S. Loh. DiscreteMathematics and Theoretical Computer Science 6(2):523-528, 2004. Deterministic clustering with data nets,with M. Effros. Research announcement in Proc. ISIT, 2004: Rapidnear-optimal VQ design with a deterministic data net. ECCC TR04-050, 2004. Wave packet scattering without kinematic entanglement: convergence of expectation values, with L. S. Schulman.IEEETrans. Nanotechnology 4(1):8-13, 2005. Fair and efficient router congestion control, with X. Gao and K. Jain. Proc. 15th SODA1043-1052, 2004. The power of strong Fourier sampling: quantumalgorithms for affine groups and hidden shifts, with C. Moore,D. Rockmore and A. Russell. SIAM J. Computing 37(3):938-958, 2007. journal Preliminaryversion: The Power of Basis Selection in Fourier Sampling: HiddenSubgroup Problems in Affine Groups, Proc. 15th SODA 1106-1115,2004. Tech report: quant-ph.On the maximum tolerable noise of k-input gates forreliable computation by formulas, with W. Evans.IEEE Transactions on Information Theory 49(11):3094-3098, 2003.abstract/ps/pdf. Reconstruction from subsequences, with M. Dudik.J.Combinatorial Theory Series A 103:337-348, 2003.abstract.A random walk model of wave propagation,with M. Franceschetti and J. Bruck. IEEE Transactions on Antennas andPropagation 52(5):1304-1317, 2004. Preliminary version: IEEE AP-SAntennas and Propagation Society Symposium 2002.A random stacking process, Special issue of DiscreteMathematics dedicated to Daniel J. Kleitman 257(2):541-547, 2002. Lower bounds for linear locally decodable codes and private information retrieval, with O. Goldreich, H. Karloff and L. Trevisan. ComputationalComplexity 15(3):263-296, 2006. Preliminary version: Proc. 17th Conference on Computational Complexity175-183, 2002. ECCCTR01-080, 2001. Quantum mechanical algorithms for the nonabelian hiddensubgroup problem, with M. Grigni, M. Vazirani andU. Vazirani. Combinatorica 24(1):137-154, 2004. Preliminary version:Proc. 33rd STOC 68-74, 2001.The vector partition problem for convex objectivefunctions, with S. Onn.Mathematics of Operations Research 26(3):583-590, 2001.abstract/ps/pdf.A probabilistic analysis of EM for mixtures of separated, sphericalGaussians, with S. Dasgupta. Journalof Machine Learning Research 8:203-226, 2007. Preliminary version:A two-round variant of EM for Gaussian mixtures,Proc. 16th UAI (Conference on Uncertainty in Artificial Intelligence)152-159, 2000.abstract/ps/pdf.Computing with highly mixed states, with A. Ambainis andU. Vazirani. J. ACM 53(3):507-531, 2006. Preliminary version:Proc. 32nd STOC 697-704, 2000. ps.Broadcasting on trees and the Ising model, with W. Evans,C. Kenyon and Y. Peres. Annals of Applied Probability 10(2):410-433, 2000.ps/pdf.Clustering for edge-cost minimization.ECCC TR99-035, 1999. Proc. 32nd STOC 547-555, 2000.Updated: abstract/ps/pdf.Molecular scale heat engines and scalable quantum computation,with U. Vazirani. Proc. 31st STOC 322-329, 1999.abstract/ps/pdfPreliminary version: quant-ph, Scalable NMR quantum computation.A computationally motivated definition of parametric estimationand its applications to the Gaussian distribution, with V. Vazirani.Combinatorica 25(4):465-486, 2005. Preliminary version:Proc. 31st STOC 288-294, 1999.ps/pdf.The quantum communication complexity of sampling, withA. Ambainis, A. Ta-Shma, U. Vazirani and A. Wigderson.SIAM J. Computing 32:1570-1585, 2003. Preliminary version: Proc. 39thFOCS 342-351, 1998.ps/pdf.Pattern matching for spatial point sets, with D. Cardoze.Proc. 39th FOCS 156-165, 1998.Updated: abstract/ps/pdf.A three-party communication problem. J. Computer and System Sciences 57:399-401, 1998.Asymptotically good codes correcting insertions,deletions and transpositions, with D. Zuckerman. IEEE Transactions on Information Theory 45(7):2552-2557, 1999.abstract/ps/pdfPreliminary version: Proc. 8th SODA 669-674, 1997.Verification of identities, with S. Rajagopalan. SIAMJ. Computing 29(4):1155-1163, 2000.abstract/ps/pdfPreliminary version: Proc. 37th FOCS 612-616, 1996.Bounds on the chromatic polynomial and on the number of acyclicorientations of a graph, with N. Kahale. Combinatorica16(3):383-397, 1996.ps/pdf.Splitters and near-optimal derandomization, with M. Naorand A. Srinivasan. Proc. 36th FOCS 182-191, 1995.abstract/ps/pdf.Fairness in scheduling, withM. Ajtai, J. Aspnes, M. Naor, Y. Rabani and O. Waarts.J. of Algorithms 29(2):306-357, 1998.ps/pdfPreliminary version: Proc. 6th SODA 477-485, 1995.A coding theorem for distributed computation, with S. Rajagopalan.Proc. 26th STOC 790-799, 1994.ps/pdf.A product theorem for intersection families.European J. of Combinatorics 15:579-586, 1994.Signal propagation and noisy circuits,with W. Evans. IEEE Transactions on Information Theory 45(7)2367-2373, 1999. journalPreliminary version: Proc. 34th FOCS 594-603, 1993.Coding for interactive communication.Special issue on Codes and Complexity of the IEEE Transactions onInformation Theory 42(6) Part I:1745-1756, 1996.ps/pdfPreliminary versions: Proc. 33rd FOCS 724-733, 1992 and Proc. 25thSTOC 747-756, 1993.Postscript of 21 September 2003.Minimally distant sets of lattice points, with D. J. Kleitman.Special issue of the European J. of Combinatorics dedicated toBernt Lindström 14:231-240, 1993. An equipartition of planar sets.Discrete and Computational Geometry 9:257-266, 1993.Sample spaces uniform on neighborhoods.Proc. 24th STOC 17-25, 1992.The maintenance of common data in a distributed system, withB. Awerbuch. J. of the ACM 44(1):86-103, 1997.ps/pdfPreliminary version: Proc. 32nd FOCS 505-514, 1991.Crossing families, with B. Aronov, P. Erdös,W. Goddard, D. J. Kleitman, M. Klugerman and J. Pach.Combinatorica 14(2):127-134, 1994. Preliminary version: Proc. 7th ACMSymp. Comp. Geom. 351-356, 1991.Optimal randomized algorithms for local sorting and set-maxima,with W. Goddard, C. Kenyon and V. King. SIAM J. Computing22(2):272-283, 1993. Preliminary version: Proc. 22nd STOC 45-53, 1990.Sorting on a ring of processors, with Y. Mansour.J. of Algorithms 11:622-630, 1990. Essays Quantum computation and physical law, July 2006. article.A bit chilly, Nature 438:431-432, 24 November 2005. journal.Lectures Videos of quantum computation lectures at MSRI: (1),(2). Journals Editor of ACM Transactions on Algorithms, ACMTransactions on Computation Theory. Glossary: FOCS: IEEE Symposium on Foundations of Computer Science. STOC: ACM Symposium on Theory of Computing. SODA: SIAM-ACM Symposiumon Discrete Algorithms. ISIT: IEEE International Symposium on Information Theory. PODC: ACM Symposium on Principles ofDistributed Computing. Fantasy, abandoned by reason, produces impossible monsters; unitedwith it, she is the mother of the arts and the origin of marvels. - Goya |
|
