Wojciech Szpankowski

From MaRDI portal
Revision as of 09:08, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:205208

Available identifiers

zbMath Open szpankowski.wojciechDBLPs/WSzpankowskiWikidataQ21822539 ScholiaQ21822539MaRDI QIDQ205208

List of research outcomes





PublicationDate of PublicationType
Regret bounds for log-loss via Bayesian algorithms2024-07-19Paper
On the Concentration of the Maximum Degree in the Duplication-Divergence Models2024-03-14Paper
Analytic Information Theory2023-10-16Paper
The concentration of the maximum degree in the duplication-divergence models2023-03-30Paper
Analysis of Lempel-Ziv'78 for Markov Sources2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58744152023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58744162023-02-07Paper
Degree distribution for duplication-divergence graphs: large deviations2022-12-21Paper
https://portal.mardi4nfdi.de/entity/Q50546252022-11-29Paper
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization2022-10-11Paper
Sequential universal modeling for non-binary sequences with constrained distributions2022-07-15Paper
Hidden words statistics for large patterns2021-06-07Paper
Towards degree distribution of a duplication-divergence graph model2021-01-29Paper
Joint string complexity for Markov sources: small data matters2020-10-21Paper
The Trade-Off Between Privacy and Fidelity via Ehrhart Theory2020-09-29Paper
Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices2020-09-29Paper
Compression of dynamic graphs generated by a duplication model2020-09-03Paper
Asymmetric Rényi Problem2020-03-11Paper
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems2019-12-04Paper
Asymmetry and structural information in preferential attachment graphs2019-11-28Paper
Expected External Profile of PATRICIA Tries2019-09-17Paper
Phase Transitions in Parameter Rich Optimization Problems2019-09-17Paper
On Symmetries of Non-Plane Trees in a Non-Uniform Model2019-09-17Paper
Partial fillup and search time in LC tries2019-09-16Paper
Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents2019-09-16Paper
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338192019-05-06Paper
Asymmetric R\'enyi Problem and PATRICIA Tries2019-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46324882019-04-29Paper
Toward Universal Testing of Dynamic Network Models2019-04-05Paper
Entropy and Optimal Compression of Some General Plane Trees2019-03-28Paper
Partial fillup and search time in LC tries2018-11-05Paper
Posterior agreement for large parameter-rich optimization problems2018-09-24Paper
Lossless Compression of Binary Trees With Correlated Vertex Names2018-09-19Paper
Profiles of PATRICIA tries2018-02-28Paper
Greedy algorithms for the shortest common superstring that are asymtotically optimal2017-12-05Paper
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods2017-11-22Paper
https://portal.mardi4nfdi.de/entity/Q53650472017-09-29Paper
Noisy Constrained Capacity for BSC Channels2017-07-27Paper
Tunstall Code, Khodak Variations, and Random Walks2017-07-27Paper
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets2017-07-12Paper
Counting Markov Types, Balanced Matrices, and Eulerian Graphs2017-07-12Paper
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments2017-07-12Paper
Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints2017-07-12Paper
Average Redundancy of the Shannon Code for Markov Sources2017-06-08Paper
Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood2017-06-08Paper
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources2017-05-16Paper
Types of Markov Fields and Tilings2017-04-28Paper
https://portal.mardi4nfdi.de/entity/Q29598532017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q29599192017-02-10Paper
https://portal.mardi4nfdi.de/entity/Q28343312016-11-28Paper
A functional equation often arising in the analysis of algorithms (extended abstract)2016-09-01Paper
https://portal.mardi4nfdi.de/entity/Q27895442016-03-01Paper
https://portal.mardi4nfdi.de/entity/Q27895652016-03-01Paper
A Limit Theorem for Radix Sort and Tries with Markovian Input2015-05-27Paper
Philippe Flajolet2015-02-20Paper
https://portal.mardi4nfdi.de/entity/Q29346782014-12-18Paper
Data driven weak universal consistency2014-11-17Paper
https://portal.mardi4nfdi.de/entity/Q29216512014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29208402014-09-29Paper
https://portal.mardi4nfdi.de/entity/Q29208632014-09-29Paper
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence2014-09-24Paper
On symmetry of uniform and preferential attachment graphs2014-09-09Paper
Constrained pattern matching2014-09-09Paper
Philippe flajolet, the father of analytic combinatorics2014-09-09Paper
A Master Theorem for Discrete Divide and Conquer Recurrences2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q49041032013-01-28Paper
On a recurrence arising in graph compression2012-10-24Paper
Philippe Flajolet, the father of analytic combinatorics2012-04-26Paper
In memoriam: Philippe Flajolet, the father of analytic combinatorics2012-02-28Paper
PHILIPPE FLAJOLET 1 December 1948 – 22 March 20112011-12-08Paper
Philippe Flajolet, the father of analytic combinatorics2011-09-12Paper
The expected profile of digital search trees2011-07-07Paper
https://portal.mardi4nfdi.de/entity/Q35767512010-08-02Paper
https://portal.mardi4nfdi.de/entity/Q35767722010-08-02Paper
https://portal.mardi4nfdi.de/entity/Q35654192010-06-03Paper
A universal online caching algorithm based on pattern matching2010-03-04Paper
Profiles of Tries2009-11-06Paper
https://portal.mardi4nfdi.de/entity/Q51907592009-07-27Paper
Multiple choice tries and distributed hash tables2009-06-16Paper
On the Construction of (Explicit) Khodak's Code and Its Analysis2009-02-24Paper
A One-to-One Code and Its Anti-Redundancy2009-02-24Paper
Hidden word statistics2008-12-21Paper
Multicast tree structure and the power law2008-12-21Paper
Precise Minimax Redundancy and Regret2008-12-21Paper
Markov Types and Minimax Redundancy for Markov Sources2008-12-21Paper
Problems on Sequences: Information Theory and Computer Science Interface2008-12-21Paper
Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments2008-12-21Paper
On the Joint Path Length Distribution in Random Binary Trees2008-10-17Paper
On the entropy of a hidden Markov process2008-07-10Paper
https://portal.mardi4nfdi.de/entity/Q53876622008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q53877052008-05-27Paper
Profile of Tries2008-04-15Paper
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks2007-08-30Paper
Finding biclusters by random projections2007-01-22Paper
Maximum Queue Length and Waiting Time Revisited: Multserver G/G/c Queue2007-01-19Paper
https://portal.mardi4nfdi.de/entity/Q54853172006-08-29Paper
https://portal.mardi4nfdi.de/entity/Q54853222006-08-29Paper
Research in Computational Molecular Biology2005-11-23Paper
Probabilistic behavior of asymmetric level compressed tries2005-09-22Paper
Combinatorial Pattern Matching2005-09-07Paper
Combinatorial Pattern Matching2005-09-07Paper
A universal predictor based on pattern matching2005-05-11Paper
Optimal versus randomized search of fixed length binary words2005-05-11Paper
Analytic variations on redundancy rates of renewal processes2005-05-11Paper
Special Issue on Analysis of Algorithms2005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q46687232005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46687242005-04-15Paper
On the number of full levels in tries2005-02-16Paper
On average sequence complexity2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48289522004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q30443352004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44289162003-09-22Paper
Limit laws for the height in PATRICIA tries2003-03-23Paper
The height of a binary search tree: the limiting distribution perspective.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q31527992002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q45350162002-06-12Paper
Average profile of the Lempel-Ziv parsing scheme for a Markovian source2002-01-14Paper
On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol2001-10-10Paper
On asymptotics of certain recurrences arising in universal coding2001-09-10Paper
https://portal.mardi4nfdi.de/entity/Q27157882001-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45245712001-04-18Paper
Asymptotic average redundancy of Huffman (and other) block codes2001-03-19Paper
A suboptimal lossy data compression based on approximate pattern matching2001-01-14Paper
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme2000-10-18Paper
A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49526162000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45083872000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38365191999-12-09Paper
Entropy computations via analytic depoissonization1999-11-21Paper
Philippe Flajolet's research in analysis of algorithms and combinatorics1999-06-21Paper
On pattern frequency occurrences in a Markovian sequence1999-04-22Paper
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm1999-02-22Paper
Analytical depoissonization and its applications1998-08-13Paper
Greedy algorithms for the shortest common superstring that are asymptotically optimal1998-05-24Paper
Analysis of an asymmetric leader election algorithm1998-02-12Paper
On the average redundancy rate of the Lempel-Ziv code1997-11-05Paper
Stability analysis of quota allocation access protocols in ring networks with spatial reuse1997-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31231191997-06-23Paper
On the distribution for the duration of a randomized leader election algorithm1997-06-12Paper
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees1997-02-28Paper
On pattern occurrences in a random text1997-02-27Paper
On asymptotics of certain sums arising in coding theory1996-08-13Paper
A Probabilistic Analysis of a String Editing Problem and its Variations1996-01-25Paper
The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: Tight limits1996-01-15Paper
A scheduling policy with maximal stability region for ring networks with spatial reuse1995-07-25Paper
https://portal.mardi4nfdi.de/entity/Q47636091995-07-17Paper
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm1995-07-12Paper
Combinational optimization problems for which almost every algorithm is asymptotically optimal1995-06-21Paper
https://portal.mardi4nfdi.de/entity/Q47634301995-04-11Paper
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach1994-11-30Paper
Asymptotic properties of data compression and suffix trees1994-10-03Paper
A note on binomial recurrences arising in the analysis of algorithms1994-09-19Paper
Digital Search Trees Again Revisited: The Internal Path Length Perspective1994-08-14Paper
MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES1994-03-13Paper
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors1994-02-07Paper
Stability conditions for some distributed systems: buffered random access systems1994-01-01Paper
Limiting Distribution for the Depth in PATRICIA Tries1993-07-21Paper
A probabilistic analysis of a pattern matching problem1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40374221993-05-18Paper
Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter1993-04-22Paper
https://portal.mardi4nfdi.de/entity/Q40288871993-03-28Paper
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited1993-01-16Paper
Self-alignments in words and their applications1993-01-16Paper
Stability of token passing rings1992-09-27Paper
A characterization of digital search trees from the successful search viewpoint1992-06-28Paper
A Note on the Height of Suffix Trees1992-06-28Paper
On the height of digital trees and related problems1991-01-01Paper
Yet another application of a binomial recurrence. Order statistics1990-01-01Paper
Patricia tries again revisited1990-01-01Paper
Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation1989-01-01Paper
The presence of exponentiality in entropy maximized M/GI/1 queues1989-01-01Paper
On the balance property of Patricia tries: External path length viewpoint1989-01-01Paper
On The variance of the extremal path length in a symmetric digital trie1989-01-01Paper
The evaluation of an alternative sum with applications to the analysis of some data structures1988-01-01Paper
Some results on V-ary asymmetric tries1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37922381988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982251988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042061988-01-01Paper
Stability Conditions for Multidimensional Queueing Systems with Computer Applications1988-01-01Paper
Some Theorems on Instability with Applications to Multiaccess Protocols1988-01-01Paper
An analysis of a contention resolution algorithm. Another approach1987-01-01Paper
On a recurrence equation arising in the analysis of conflict resolution algorithms1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37582501987-01-01Paper
Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms1987-01-01Paper
Bounds for Queue Lengths in a Contention Packet Broadcast System1986-01-01Paper
Some sufficient conditions for non-ergodicity of markov chains1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33338281984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38719231980-01-01Paper

Research outcomes over time

This page was built for person: Wojciech Szpankowski