2026 Wojciech Szpankowski: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	55	4398	4274	2053	1980	379	9385

Research.com Recognitions

2004 - IEEE Fellow For contributions to information system performance evaluation.

Overview

Wojciech Szpankowski is affiliated with Purdue University West Lafayette in the United States and has a research focus primarily in the field of Computer Science. Within this domain, their work spans several subfields including Artificial Intelligence, Statistical and Nonlinear Physics, Computational Theory and Mathematics, Management Science and Operations Research, and Molecular Biology.

The scientist's research topics cover a broad spectrum, including Machine Learning and Algorithms, Algorithms and Data Compression, Advanced Bandit Algorithms Research, Complex Network Analysis Techniques, Quantum Computing Algorithms and Architecture, Neural Networks and Applications, and Quantum Information and Cryptography.

Wojciech Szpankowski has contributed to various publication venues with notable frequency in:

arXiv (Cornell University)
IEEE Transactions on Information Theory
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
The Electronic Journal of Combinatorics
2022 IEEE International Symposium on Information Theory (ISIT)

Frequent coauthors of Szpankowski include:

Mohsen Heidari
Changlong Wu
Krzysztof Turowski
Ananth Grama
Gil I. Shamir

Selected recent papers featuring their collaboration or influence include:

"Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries" (2020), published in IEEE/ACM Transactions on Computational Biology and Bioinformatics
"Toward Physically Realizable Quantum Neural Networks" (2022), published in Proceedings of the AAAI Conference on Artificial Intelligence
"Statistical and computational thresholds for the planted k-densest sub-hypergraph problem" (2020), published on arXiv (Cornell University)
"Power-Law Degree Distribution in the Connected Component of a Duplication Graph" (2020), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Expected Worst Case Regret via Stochastic Sequential Covering" (2022), published on arXiv (Cornell University)

Szpankowski has authored scholarly books, including:

"Analytic Information Theory" (2023), published by Cambridge University Press

The scientist was recognized as an IEEE Fellow in 2004 with a citation for contributions to information system performance evaluation.

Best Publications

Average Case Analysis of Algorithms on Sequences

Wojciech Szpankowski

675
Citations
Pairwise alignment of protein interaction networks.

Mehmet Koyutürk;Yohan Kim;Umut Topkara;Shankar Subramaniam

358
Citations
STABILITY CONDITIONS FOR SOME DISTRIBUTED SYSTEMS: BUFFERED RANDOM ACCESS SYSTEMS

Wojciech Szpankowski

323
Citations
An efficient algorithm for detecting frequent subgraphs in biological networks

Mehmet Koyutürk;Ananth Grama;Wojciech Szpankowski

266
Citations
Analytical depoissonization and its applications

Philippe Jacquet;Wojciech Szpankowski

253
Citations
Reliable detection of episodes in event sequences

Robert Gwadera;Mikhail J. Atallah;Wojciech Szpankowski

185
Citations
On the entropy of a hidden Markov process

Philippe Jacquet;Gadiel Seroussi;Wojciech Szpankowski

185
Citations
Analysis of algorithms

Philippe Flajolet;Wojciech Szpankowski

159
Citations
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

Philippe Jacquet;Wojciech Szpankowski

158
Citations
A suboptimal lossy data compression based on approximate pattern matching

T. Luczak;W. Szpankowski

149
Citations
On Pattern Frequency Occurrences in a Markovian Sequence

Mireille Régnier;Wojciech Szpankowski

147
Citations
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments

Yongwook Choi;W. Szpankowski

141
Citations
A generalized suffix tree and its (un)expected asymptotic behaviors

Wojciech Szpankowski

135
Citations
Entropy computations via analytic depoissonization

P. Jacquet;W. Szpankowski

132
Citations
On the average redundancy rate of the Lempel-Ziv code

G. Louchard;W. Szpankowski

129
Citations
Precise minimax redundancy and regret

M. Drmota;W. Szpankowski

126
Citations
Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach

Philippe Jacquet;Wojciech Szpankowski

123
Citations
Detecting conserved interaction patterns in biological networks.

Mehmet Koyutürk;Yohan Kim;Shankar Subramaniam;Wojciech Szpankowski

117
Citations
Analysis of digital tries with Markovian dependency

P. Jacquet;W. Szpankowski

109
Citations
Asymptotic properties of data compression and suffix trees

W. Szpankowski

109
Citations

Frequent Co-Authors

Ananth Grama Purdue University West Lafayette

Helmut Prodinger Stellenbosch University

Mikhail J. Atallah Purdue University West Lafayette

Stefano Lonardi University of California, Riverside

Gadiel Seroussi University of the Republic

Svante Janson Uppsala University

Leonidas Georgiadis Aristotle University of Thessaloniki

Alan Frieze Carnegie Mellon University

Philippe Flajolet French Institute for Research in Computer Science and Automation - INRIA

Sergio Verdu Princeton University

External Links

Wikipedia of Wojciech Szpankowski Personal website of Wojciech Szpankowski Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring associate's degree online programs can be a valuable stepping stone for students interested in computer science or related fields. These programs often take as little as 6 months to complete and offer essential foundational skills for various tech careers.

For those considering management or tech-business roles, enrolling in online business degree programs can provide crucial expertise in entrepreneurship, finance, and organizational leadership, complementing technical skills.

Affordability is a key concern for many students. Thankfully, some of the cheapest online colleges offer high-quality, accredited computer science and related degrees without the burden of high tuition costs.

If your interests lean more towards design, problem-solving, and innovation, pursuing an engineering online degree could open pathways in hardware, software, or interdisciplinary tech fields.

Whether your goal is a fast-track associate's, an affordable bachelor’s, or a specialized business or engineering degree, online study in the USA offers flexible and diverse pathways towards a rewarding tech career.