Center for Science of Information
Center for Science of Information


National Science Foundation

CSoICenter for Science of Information
    • About
      • Overview
      • Mission
      • Participants
      • Organizational Chart
      • Academic Partners
      • Strategic Plan
      • Annual Report
      • Reimbursement Forms
      • Contact Us
      • Related Links
    • Research
      • Overview
      • Communication Thrust
      • Knowledge Thrust
      • Life Sciences Thrust
      • Grant Opportunities
      • RCR Ethics Training
    • Education
      • Overview
      • Courses & Modules
      • Research Teams
      • Seminars
      • Workshops
      • Outreach
    • Diversity
      • Overview
      • Channels Program
      • Explore Diversity
    • Knowledge Transfer
      • Overview
      • Information for Industry Partners
      • International Partnerships
    • News and Events
      • Center News
      • Newsletter
      • Calendar
    • Resources
      • Articles
      • Courses & Modules
      • K-12 Resources
      • Video
      • Books
      • Journal Papers
      • Presentation Slides
      • Posters
      • Theses
    • More
      • News and Events
      • Resources
    • About
    • Research
    • Education
    • Diversity
    • Knowledge Transfer
    • News and Events
    • Resources
OverviewMissionParticipants
FacultyPostdocsStaffGraduate StudentsAlumniCollaboratorsUndergraduate StudentsExternal Advisory Committee
Organizational ChartAcademic Partners
Bryn Mawr CollegeHoward UniversityMassachusetts Institute of TechnologyPrinceton UniversityPurdue UniversityStanford UniversityTexas A&M UniversityUniversity of California, BerkeleyUniversity of California, San DiegoUniversity of Hawaiʻi at MānoaUniversity of Illinois, Urbana-Champaign
Strategic PlanAnnual ReportReimbursement FormsContact UsRelated Links
  • Wojciech Szpankowski

  • Saul Rosen Professor of Computer Science
    Computer Science
    Purdue University

    Before coming to Purdue, W. Szpankowski was Assistant Professor at the Technical University of Gdansk, and in 1984 he was Assistant Professor at the McGill University, Montreal. During 1992/1993 he was Professeur Invité at INRIA, Rocquencourt, France. His research interests cover analysis of algorithms, data compression, information theory, analytic combinatorics, random structures, networking, stability problems in distributed systems, modeling of computer systems and computer communication networks, queueing theory, and operations research. His recent work is devoted to the probabilistic analysis of algorithms on words, analytic information theory, and designing efficient multimedia data compression schemes based on approximate pattern matching. He is a recipient of the Humboldt Fellowship. He has been guest editors for special issues in IEEE Transactions on Automatic Control, Theoretical Computer Science, Random Structures & Algorithms, and Algorithmica. He edited a special issue on \"Analysis of Algorithms\" in Algorithmica. He serves on the editorial boards of Theoretical Computer Science, Discrete Mathematics and Theoretical Computer Science, and book series Advances in the Theory of Computation and Computational Mathematics. Currently the Director for Center for Science of information.



    Keywords
    Computer science

    Years Active

    2011 2012 2013 2014 2015 2016 2017 2018 2019
    Associated Resources

    • Journal Papers: Asymmetric Renyi Problem and PATRICIA Tries
    • Journal Papers: Average Size of a Suffix Tree for Markov Sources.
    • Journal Papers: Analysis of a Sequence to Structure Channel
    • Journal Papers: A Study of the Boltzmann Sequence-Structure Channel
    • Journal Papers: Dynamic Modeling of Molecular Motor Association with Axonal Amyloid Precursor Protein Vesicles
    • Journal Papers: Compression of Graphical Structures: Fundamental Limits Algorithms and Experiment
    • Journal Papers: A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
    • Journal Papers: On the Limiting Distribution of Lempel Ziv'78 Redundancy for Memoryless Sources
    • Journal Papers: On Symmetry of Uniform and Preferential Attachment Graphs
    • Journal Papers: Minimax Pointwise Redundancy for Memoryless Model over Large Alphabets
    • Journal Papers: Analytic Pattern Matching: From DNA to Twitter
    • Journal Papers: Markov Field Types and Tilings
    • Journal Papers: Uncertainty Estimates of Purity Measurements Based on Current Information: Toward a "Live Validation" of Purity Methods
    • Journal Papers: Data-dependent weak universal redundancy
    • Journal Papers: The Expected Profile of Digital Search Trees
    • Journal Papers: A General Discrete Divide and Conquer Recurrence and Its Applications
    • Journal Papers: Deinterleaving Markov Processes: the Finite-Memory Switch Case
    • Journal Papers: Counting Markov Types, Balanced Matrices, and Eulerian Graphs
    • Journal Papers: Mutual Information for a Deletion Channel
    • Journal Papers: Capacity of a Structural Binary Symmetric Channel
    • Journal Papers: Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood
    • Journal Papers: Classification of Markov Sources Through Joint String Complexity: Theory and Experiments
    • Journal Papers: Minimum Expected Length of Fixed- to-Variable Lossless Compression Without Prefix Constraints
    • Journal Papers: Joint String Complexity for Markov Sources, 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms
    • Journal Papers: Average redundancy of the Shannon code for Markov sources
    • Journal Papers: Limiting Distribution of Lempel Ziv'78 Redundancy
    • Journal Papers: On a Recurrence Arising in Graph Compression
    • Journal Papers: Joint String Complexity for Markov Sources
    • Journal Papers: Two-Phase Cardinality Estimation Protocols for Sensor Networks with Provable Precision
    • Journal Papers: Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
    • Journal Papers: Constrained Pattern Matching
    • Journal Papers: Analysis of a Block Arithmetic Coding: Discrete Divide and Conquer Recurrences
    • Journal Papers: Expected External Profile of PATRICIA Tries
    • Journal Papers: Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
    • Journal Papers: Noisy Constrained Capacity for BSC
    • Journal Papers: A Discrete Divide and Conquer Recurrence
    • Journal Papers: Counting Markov Types
    • Journal Papers: Minimax Redundancy for Large Alphabets
    • Articles: Frontiers of Science of Information: Shannon Meets Turing
    • Books: Average Case Analysis of Algorithms
    • Video: Wojciech Szpankowski - Shannon Information Theory and Beyond
    • Presentation Slides: Shannon Information Theory and Beyond
    • Center News: CSoI Center Director, Wojciech Szpankowski honored with Purdue’s inaugural 2015 Arden L. Bement, Jr. Award
    • Articles: The Sequence of Things to Come: An Interview with Wojciech Szpankowski about the Future of Information Science
    • Center News: CSoI Article appears in IEEE Information Theory Newsletter
    • Center News: CSoI sponsors The Seventh Workshop on Information Theoretic Methods in Science and Engineering
    • Posters: Investigating Symmetries of Uniform Attachment Groups
    • Articles: Quantitative Approach to Information Processing - U.S. News & World Report
    • Center News: Wojciech Szpankowski gives Plenary Talk at ISIT 2011, St. Petersburg, Russia
    • Center News: CSOI Director, Wojciech Szpankowski recognized as Humboldt Research Award Recipient
    • Presentation Slides: Compression of Graphical Structures
    • Presentation Slides: What is Information?
    • Presentation Slides: Emerging Frontiers of Science of Information: Overview of the NSF STC
    • Presentation Slides: A Discrete Divide and Conquer Recurrence
    • Presentation Slides: Counting Markov Types
    • Presentation Slides: Minimax Redundancy for Large Alphabets
    • Articles: Intersection of Information Theory with Other Disciplines
    • Presentation Slides: Darwin Channel?
    Associated Events

    • Bits and Biology
    • Data Science Fundamentals, Methods and Algorithms Workshop
    • Knuth80: Algorithms, Combinatorics, and Information
    • 2016 NSF Site Visit
    • Arden L. Bement Jr. Distinguished Lecture
    • Information Theory, Learning and Big Data Workshop
    • Recent Innovations in Info-Metrics - American University Info-Metrics Institute
    • Wojtek Szpankowski to deliver Helsinki Distinguished Lecture on Future Information Technology
    • 2014 CSoI Summer School
    • Challenges and Opportunities for the Science of Information - A Symposium
    • CSoI sponsors The Seventh Workshop on Information Theoretic Methods in Science and Engineering
    • Wojciech Szpankowski Structural Information talk
    • Charles River Science of Information Day - MIT
    • UIUC/Purdue Science of Information Day
    • CSoI Reception and Research Presentation at ITA Workshop, San Diego
    • Info-Metrics Conference: Information, Instability,and Fragility in Networks
    • Midwest Science of Information Student Research Meeting
    • CSoI / Bell Labs Research Workshop - Princeton
    • 2013 STC Directors Meeting
    • 2013 Science of Information Summer School
    • CSoI Big Data Workshop
    • Emery Brown - A Look at the Unconscious Brain Under General Anesthesia
    • 2012 Student Research Workshop
    • 2012 North American School of Information Theory (IT Summer School)
    • 2012 Science of Information Summer School
    • 2012 STC Grand Challenge Workshop
    • Algorithms, Combinatorics, Information, and Beyond
    • Opportunistic Research Meeting at ISIT in St. Petersburg, Russia
    • Shannon Legacy and Beyond
    • 2011 Science of Information Summer School
    • Industrial Partnership Roundtable
    • Optimal and almost optimal variable-to-fixed length codes: renewal theory and divide-and-conquer recurrences
    • Compression of Graphical Structures
    • All-Hands Meeting to Launch CSoI

Terms of Use | Contact Us Center for Science of Information © 2018
Made possible by grant NSF CCF-0939370