next up previous
Next: Research Funding Up: Jeff Vitter's Curriculum Vitæ Previous: Technical Reports (information not

Invited Talks since 1990

1990
``Optimal Disk I/O with Parallel Block Transfer,'' Brandeis University, Waltham, MA.

``Geometric Algorithms for High-Performance Computing,'' Air Force Office of Scientific Research, Bolling Air Force Base, D.C.

``Optimal Disk I/O with Parallel Block Transfer,'' AT&T Bell Laboratories, Murray Hill, NJ.

``Optimal Disk I/O with Parallel Block Transfer,'' Ecole Normale Supérieure, Paris, France.

``Optimal Disk I/O with Parallel Block Transfer,'' Tulane University, New Orleans, LA.

1991
``Theory Curriculum,'' Respondent, Computer Science Curriculum Workshop, Dedham, MA.

``Parallelism in Point Location Problems,'' Ecole Normale Supérieure, Paris, France.

``Efficient Memory Access in Large-Scale Computation,'' plenary address at 1991 Symposium on Theoretical Aspects of Computer Science (STACS '91), Hamburg, West Germany.

``Optimal Algorithms for Parallel Large-Scale Memory,'' University of Maryland, College Park, MD.

``Optimal Algorithms for Parallel Large-Scale Memory,'' Center of Excellence in Space Data and Information Sciences, NASA Goddard Space Flight Center, Greenbelt, MD.

``Dynamic Arithmetic Coding,'' IEEE Data Compression Conference (DCC '91), Snowbird, UT.

``Optimal Algorithms for Parallel Large-Scale Memory,'' Washington University at St. Louis, St. Louis, MO.

``Optimal Prefetching via Data Compression,'' University of Washington, Seattle, WA.

``Practical Implementations of Arithmetic Coding,'' 3rd International Conference on Advances in Communication and Control Systems (COMCON '91), Victoria, Canada.

``Optimal Algorithms for Parallel Large-Scale Memory,'' Supercomputing Research Center, Bowie, MD.

``Optimal Prefetching via Data Compression,'' University of Maryland, College Park, MD.

1992
``$\epsilon$-Approximations with Minimum Packing Constraint Violation,'' INRIA, Sophia Antipolis, France.

``Optimal Prefetching via Data Compression,'' University of Notre Dame, Notre Dame, IN.

``Efficient Memory Access in Large-Scale Computation,'' Duke University, Durham, NC.

``Optimal Prefetching via Data Compression,'' University of Victoria, Victoria, Canada.

``Optimal Prefetching via Data Compression,'' University of Southwestern Louisiana, Lafayette, LA.

``$\epsilon$-Approximations with Minimum Packing Constraint Violation,'' Georgia Institute of Technology, Atlanta, GA.

``Mathematical Results Specific to Neural Networks,'' panel member, Neural Network Workshop, sponsored by Rutgers, East Brunswick, NJ.

``A Theory for Memory-Based Learning,'' Massachusetts Institute of Technology, Cambridge, MA.

``Paradigms for Optimal Sorting with Multiple Disks and Memory Hierarchies,'' plenary address at 7th Maryland Theoretical Computer Science Day, Johns Hopkins University, Baltimore, MD.

``The Design of Lossless Image Compression Systems,'' Workshop on Data and Image Compression Needs and Uses in the Scientific Community, Center of Excellence in Space Data and Information Sciences, NASA Goddard Space Flight Center, Greenbelt, MD.

1993
``Locality, Dynamic, and Prediction Issues in DIS,'' panel member, ARO Workshop on Virtual, Distributed Interactive Simulation, Research Triangle Park, NC.

``Obstacles in the Implementation of Parallel Algorithms,'' panel member, Workshop on Parallel I/O and Databases, Dartmouth Institute for Advanced Graduate Studies (DAGS '93), Hanover, NH.

``Load Balancing Paradigms for Optimal Use of Parallel Disks and Parallel Memory Hierarchies,'' Workshop on Parallel I/O and Databases, Dartmouth Institute for Advanced Graduate Studies (DAGS '93), Hanover, NH.

``Average-Case Analysis of Prediction,'' Dagstuhl-Seminar on Average-Case Analysis of Algorithms, Schloss Dagstuhl, Wadern, Germany.

``Paradigms for Optimal Sorting and Computational Geometry in Large-Scale Parallel Memories,'' Max Planck Institute, Saarbrücken, Germany.

``Models for Parallel Secondary and Hierarchical Storage,'' Workshop on Models, Architectures, and Technologies for Parallel Computation, DIMACS, Rutgers University, New Brunswick, NJ.

``Load Balancing Paradigms for Optimal Use of Parallel Disks and Parallel Memory Hierarchies,'' Stanford University, Stanford, CA.

``Optimal Prediction via Data Compression,'' University of Texas at Dallas, Dallas, TX.

``Load Balancing Paradigms for Optimal Use of Parallel Disks and Parallel Memory Hierarchies,'' keynote address at the Workshop on Algorithmic Research in the Midsouthwest (WARM '93), University of North Texas, Denton, TX.

1994
``Predictive Techniques for Caching and Locality Management,'' Microsoft Corporation, Redmond, WA.

``Efficient Processing of Large-Scale Data,'' Mathematisches Forschungsinstitut Oberwolfach, Germany.

``Data Compression and Applications,'' Air Force Office of Scientific Research, Bolling Air Force Base, D.C.

``Efficient Processing of Large-Scale Data in External Memory,'' Distinguished Lecturer Series, Johns Hopkins University, Baltimore, MD.

``How to Predict Well,'' Tulane University, New Orleans, LA.

``How to Predict Well,'' Supercomputing Research Center, Bowie, MD.

``Future Communication Issues in Dealing with Large-Scale Data,'' Army Research Office Math/CS Investment Strategy Meeting, Lake Buena Vista, FL.

1995
``Data Compression Techniques for Networks,'' Air Force Office of Scientific Research Initiative Planning Meeting, Raleigh, NC.

``Future Trends and Issues in I/O,'' panel moderator, Workshop on Modeling and Specification of I/O (MSIO '95), as part of the 7th IEEE Symposium on Parallel and Distributed Processing (SPDP '95), San Antonio, TX.

1996
``I/O Environments for Geometric Computation,'' Army Research Office MURI Advisory Board, Johns Hopkins University, Baltimore, MD.

``Theory and Practice of I/O-Efficient Computation,'' Distinguished Lecturer Series, Northwestern University, Chicago, IL.

``Predicting Fast and Reliably,'' keynote address at the Midwest Theory Day, Washington University at St. Louis, St. Louis, MO.

``Predicting Fast and Reliably,'' University of Venice, Venice, Italy.

``I/O-Efficient Computation,'' University of Rome, La Sapienza, Rome, Italy.

``Algorithms for Processing Line Segments in External Memory, with Applications to Databases and Geographic Information Systems,'' Dagstuhl-Seminar on Computational Cartography, Schloss Dagstuhl, Wadern, Germany.

1997
``I/O-Efficient Geometry with TPIE,'' Army Research Office MURI Advisory Board, University of Pennsylvania. Philadelphia, PA.

``On Sorting Strings in External Memory," INRIA, Sophia Antipolis, France.

``Sequence Sorting in Secondary Storage," International Conference on Compression and Complexity of Sequences, Positano, Italy.

``Efficient Geometric Processing of Massive Data Sets,'' ARL/ARO Workshop on Battlespace Visualization, Army Research Laboratory, Adelphi, MD.

``System Requirements and Support for Battlespace Visualization,'' panel member, ARL/ARO Workshop on Battlespace Visualization, Army Research Laboratory, Adelphi, MD.

``Efficient Geometric Processing of Massive Data Sets,'' ARL/CGC Workshop, Johns Hopkins University, Baltimore, MD.

``Geographic Information Systems, Terrains, and Visualization," Army Research Office MURI Advisory Board, Duke University, Durham, NC.

``Dealing with Massive Spatial Data,'' ARL Federated Laboratory Workshop on Database and Object Oriented Technologies, Army Research Laboratory, Adelphi, MD.

1998
``External-Memory Algorithms,'' Workshop on External Memory Algorithms and Visualization, DIMACS, Rutgers University, New Brunswick, NJ.

``External-Memory Algorithms,'' 17th Annual ACM Symposium on Principles of Database Systems (PODS '98), Seattle, WA.

``External Memory Algorithms: Dealing with MASSIVE Data,'' two talks, BRICS Workshop on the Theory and Practice of Algorithms for Problems Involving Massive Data Sets, University of Aarhus, Århus, Denmark.

``External Memory Algorithms: Dealing with MASSIVE Data,'' two talks, Department of Computer Science, University of Aalborg, Aalborg, Denmark.

``Recent Developments in External Memory Algorithms,'' Department of Computer Science, University of Münster, Münster, Germany.

``External Memory Algorithms,'' 6th Annual European Symposium on Algorithms (ESA '98), Venice, Italy.

``Designing External Memory Algorithms to Adapt to Changing Internal Memory Allocations,'' University of Florence, Florence, Italy.

``Range Queries on Spatial Data,'' INRIA, Sophia Antipolis, France.

``External Memory Algorithms: Dealing with MASSIVE Data,'' Journée Scientifique et Assemblée Générale de l'Association Française d'Informatique Théorique, Cachan, France.

``External Memory Algorithms: Dealing with MASSIVE Data,'' Séminaire J. Morgenstern, INRIA, Sophia Antipolis, France.

1999
``External Memory Point Location and Level-Balanced B-trees,'' Dagstuhl-Seminar on Computational Geometry, Schloss Dagstuhl, Wadern, Germany.

``Geometric Searching in Massive Data,'' 15th Annual European Workshop on Computational Geometry (CG '99), Antibes, France.

``Geometric Searching in Massive Data,'' University of London, London, England.

``Parallel I/O Algorithms,'' 1999 ACM/UMIACS Workshop on Parallel Algorithms (WOPA '99), as part of the 3rd Federated Computing Research Conference (FCRC '99), Atlanta, GA.

``Simple Randomized Mresgerot (Mergesort),'' 5th International Seminar on the Mathematical Analysis of Algorithms (SMAA '99), Barcelona, Spain.

``Online Data Structures in External Memory,'' Max Planck Institute, Saarbrücken, Germany.

``Affichage et Elimination des Parties Cachées,'' Ecole Normale Supérieure, Paris, France.

``Online Geometric Data Structures in External Memory,'' University of Genoa, Genoa, Italy.

``Online Data Structures in External Memory,'' University of Tübingen, Tübingen, Germany.

``Online Data Structures in External Memory,'' 26th Annual International Colloquium on Automata, Languages, and Programming (ICALP '99), Prague, Czech Republic.

``Online Data Structures in External Memory,'' 6th Biannual Workshop on Algorithms and Data Structures, (WADS '99), Vancouver, Canada, August 1999.

2000
``Efficient Search through Massive Data,'' IBM T. J. Watson Research Center, Hawthorne, NY.

``Multiresolution Approximation Techniques for Database Systems,'' Dagstuhl-Seminar on Data Structures, Schloss Dagstuhl, Wadern, Germany.

``Online Data Structures in External Memory,'' Georgia Institute of Technology, Atlanta, GA.

2001
``External Memory Algorithms: Dealing with MASSIVE Data,'' Distinguished Lecture Series, Louisiana State University, Baton Rouge, LA.

``Information Technology Partnerships in Education,'' TechVision 2020 Mayor's Information Technology Summit, New Orleans, LA.

``Computing on MASSIVE Data,'' 16th Clemson Mini-Conference on Discrete Mathematics, Clemson University, Clemson, SC.

``Computing on MASSIVE Data,'' University of Notre Dame, Notre Dame, IN.

2002
``The Power of Duality and Randomness in Scheduling and Sorting with Multiple Disks,'' KNUTHfest 2002 Symposium, Stanford University, Stanford, CA.

``Entropy-Compressed Indexes for Sequences,'' Dagstuhl-Seminar on Data Structures, Schloss Dagstuhl, Wadern, Germany.

``Compressed Indexes for Fast Search in Sequences,'' keynote address at the 6th Joint Conference on Information Sciences (JCIS '02), Durham, NC.

``Prediction via Data Compression,'' Workshop on Compression Issues in Next-Generation Network Applications, DIMACS, Rutgers University, New Brunswick, NJ.

``The Data Explosion,'' University of Kansas, Lawrence, KS.

``The Data Explosion,'' Purdue University, West Lafayette, IN.

$\phantom{\lq\lq }$ Minicourse on ``External Memory Algorithms and Parallel Disk Access,'' EEF Summer School on Massive Data Sets, University of Aarhus, Århus, Denmark.

2003
``How to Store and Search Massive Data Archives,'' XVI Louisiana Distinguished Lecture Series, University of Louisiana-Lafayette, Lafayette, LA.

``Managing and Strengthening Interdisciplinary Programs," panel member, 2003 Annual Meeting of the American Association of Universities Arts & Sciences Deans, College Park, MD.

``Data, Data Everywhere!'' Scientech Club, Indianapolis, IN.

``Entropy-Based Space Models for Algorithms and Data Structures,'' NSF Workshop on Information Theory and Computer Science Interface Chicago, IL.

2004
``Data, Data Everywhere! Compressed Indexing and Indexed Compression,'' Distinguished Lecturer Series, University of Rochester, Rochester, NY.

``CS Education Après le Crash,'' panel member, Computing Research Association Conference 2004 (Snowbird '04), Snowbird, UT.

``Best of Both Worlds: Data Compression with Fast Indexing,'' IBM Data Management Workshop, IBM Toronto Laboratory, Toronto, Canada.

2005
``Undergraduate Programs -- Curricular Objectives and Access Issues,'' panel organizer, 2005 Annual Meeting of the American Association of Universities Arts & Sciences Deans, Irvine, CA.

2006
``Compressed Data Structures: Dictionaries and the Data-Aware Measures,'' Information Theory and Applications Workshop, California Institute for Telecommunications and Information Technology, University of California-San Diego, La Jolla, CA.

``Issues and Challenges with Commercialization of Research," panel member, 2006 Annual Meeting of the American Association of Universities Arts & Sciences Deans, Minneapolis, MN.

``A Nearly Tight Analysis of the Burrows-Wheeler Transform,'' Workshop on Space-Conscious Algorithms, University of Bologna Residential Center, Bertinoro, Italy.

``Bringing Engagement to Life in Arts and Sciences Departments and Colleges,'' panel member, Outreach Scholarship 2006 Conference, Columbus, OH.

2007
``The Impact of Computer Science and Information Technology on our Lives,'' Lafayette Rotary Club, West Lafayette, IN.

``Lower Bounds on Encoding Length with Burrows-Wheeler Compression,'' Information Theory and Applications Workshop, California Institute for Telecommunications and Information Technology, University of California-San Diego, La Jolla, CA.

``The Impact of Information Science and Technology on our Lives,'' Town and Gown Club, West Lafayette, IN.

``From Molecules to Ecosystems: Research Foci in Purdue Life Sciences,'' Indiana Health Industry Forum, Barnes & Thornburg LLP, and Indiana Economic Development Corporation, Indianapolis, IN.

``The Entrepreneurial Spirit in Indiana at Purdue,'' Purdue Entrepreneurship Roundtable, Palo Alto, CA.

``Hestia and Climate Change,'' moderator, Roundtable Forum on Climate Change, Barnes & Thornburg LLP, Indianapolis, IN.

``I/O-Efficient Algorithms and Data Structures,'' keynote talk for inauguration of Center for Massive Data Algorithmics, Danish National Research Foundation, University of Aarhus, Århus, Denmark.

2008
``On Searching Compressed String Collections Cache Obliviously,'' Information Theory and Applications Workshop, California Institute for Telecommunications and Information Technology, University of California-San Diego, La Jolla, CA.

$\phantom{\lq\lq }$ Interview as part of ACM SIGMOD series on Distinguished Profiles in Databases, interviewed by Marianne Winslett, West Lafayette, IN.

``Multidisciplinary Research in Universities,'' U.S.-China Computer Science Leadership Summit, Arlington, VA.

$\phantom{\lq\lq }$ Interview as part of Purdue University Oral History Program Collection, interviewed by Ms. Katherine Markee, West Lafayette, IN.

``I/O-Efficient Algorithms and Data Structures,'' Computing Research Association, Washington, DC.

2009
``The Value of Connections,'' keynote talk at Phi Beta Kappa induction ceremony, Alpha of Texas Chapter, College Station, TX.

``Searching String Collections for the Most Relevant Documents,'' University of Pisa, Pisa, Italy.

``Applying Wavelets in Database Systems,'' ACM SIGMOD Test of Time Award lecture for the most impactful paper from SIGMOD '99, 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD '09).

``Searching String Collections for the Most Relevant Documents,'' Texas A&M University, College Station, TX.

``Searching String Collections for the Most Relevant Documents,'' Los Alamos Computer Science Symposium 2009 (LACSS), Santa Fe, NM.

``Compressed Data Structures and Top-k Document Retrieval Problems,'' University of Notre Dame, Notre Dame, IN.

``Compressed Data Structures and Searching Document Collections for the Most Relevant Documents,'' inaugural talk for the University of Texas Computer Science Distinguished Lecture Series, University of Texas, Austin, TX.

2010
$\phantom{\lq\lq }$ TBA, 19th Annual Conference on Combinatorial Pattern Matching (CPM '10), New York, NY.


next up previous
Next: Research Funding Up: Jeff Vitter's Curriculum Vitæ Previous: Technical Reports (information not
Jeff Vitter
2009-11-16