Wojciech Szpankowski

Wojciech Szpankowski in 2017 Wojciech Szpankowski (born February 18, 1952, in Wapno) is the Saul Rosen Professor of Computer Science at Purdue University. He is known for his work in analytic combinatorics, analysis of algorithms and analytic information theory. He is the director of the NSF Science and Technology Center for Science of Information. Provided by Wikipedia
Showing 1 - 12 results of 12 for search 'Wojciech Szpankowski', query time: 0.03s Refine Results
  1. 1
    Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding

    Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding by Wojciech Szpankowski

    Published 2008-01-01
    Get full text
    Article
  2. 2
    Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence

    Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence by Valeri Stefanov, Wojciech Szpankowski

    Published 2007-01-01
    Get full text
    Article
  3. 3
    Enumeration of Binary Trees and Universal Types

    Enumeration of Binary Trees and Universal Types by Charles Knessl, Wojciech Szpankowski

    Published 2005-12-01
    Get full text
    Article
  4. 4
    Quicksort algorithm again revisited

    Quicksort algorithm again revisited by Charles Knessl, Wojciech Szpankowski

    Published 1999-12-01
    Get full text
    Article
  5. 5
    Enumeration of Binary Trees and Universal Types

    Enumeration of Binary Trees and Universal Types by Charles Knessl, Wojciech Szpankowski

    Published 2005-01-01
    Get full text
    Article
  6. 6
    Analysis of biclusters with applications to gene expression data

    Analysis of biclusters with applications to gene expression data by Gahyun Park, Wojciech Szpankowski

    Published 2005-01-01
    Get full text
    Article
  7. 7
    Joint String Complexity for Markov Sources

    Joint String Complexity for Markov Sources by Philippe Jacquet, Wojciech Szpankowski

    Published 2012-01-01
    Get full text
    Article
  8. 8
    On the Exit Time of a Random Walk with Positive Drift

    On the Exit Time of a Random Walk with Positive Drift by Michael Drmota, Wojciech Szpankowski

    Published 2007-01-01
    Get full text
    Article
  9. 9
    Quicksort algorithm again revisited

    Quicksort algorithm again revisited by Charles Knessl, Wojciech Szpankowski

    Published 1999-01-01
    Get full text
    Article
  10. 10
    Waiting time distributions for pattern occurrence in a constrained sequence

    Waiting time distributions for pattern occurrence in a constrained sequence by Valeri T. Stefanov, Wojciech Szpankowski

    Published 2007-01-01
    Get full text
    Article
  11. 11
    Analysis of the multiplicity matching parameter in suffix trees

    Analysis of the multiplicity matching parameter in suffix trees by Mark Daniel Ward, Wojciech Szpankowski

    Published 2005-01-01
    Get full text
    Article
  12. 12
    A New Binomial Recurrence Arising in a Graphical Compression Algorithm

    A New Binomial Recurrence Arising in a Graphical Compression Algorithm by Yongwook Choi, Charles Knessl, Wojciech Szpankowski

    Published 2012-01-01
    Get full text
    Article

Search Tools: