Topic
- Computing and Processing
- Components, Circuits, Devices and Systems
- Communication, Networking and Broadcast Technologies
- Power, Energy and Industry Applications
- Signal Processing and Analysis
- Robotics and Control Systems
- General Topics for Engineers
- Fields, Waves and Electromagnetics
- Engineered Materials, Dielectrics and Plasmas
- Bioengineering
- Transportation
- Photonics and Electrooptics
- Engineering Profession
- Aerospace
- Geoscience
- Nuclear Engineering
- Career Development
- Emerging Technologies
- Telecommunications
- English for Technical Professionals
Tomasz Kociumaka
Affiliation
Max Planck Institute for Informatics Saarland Informatics Campus, Saarbrücken, Germany
Topic
Substring,Edit Distance,Running Time,Estimation Algorithm,Pattern Matching,String Length,Alphabet Size,Burrows-Wheeler Transform,Approximate Matching,Approximate Time,Block Length,Data Structure,Dynamic Setting,Factorization,Hyperbaric Oxygen,Input String,Lexicographic,Linear Time,Lower Bound,Number Of Deletions,Number Of Phrases,Optimal Alignment,Overview Of Techniques,Polylogarithmic,Query Time,Time And Space,Adaptive Sampling,Additional Error,Algorithm For Problem,Algorithm Running,Alignment Tree,Almost Periodic,Almost Surely,Alphabet,Balanced Tree,Block Boundaries,Child Nodes,Collection Of Texts,Column Vector,Complex Ones,Compression Of Structures,Compressor,Computational Model,Consistent Conditions,Construction Algorithm,Context-free Grammar,Contralateral,Distance Model,Distance Tree,Distinct Lengths,
Biography
Tomasz Kociumaka received the B.Sc., M.Sc., and Ph.D. degrees in computer science from the University of Warsaw, Poland. He has been a Post-Doctoral Researcher at Bar-Ilan University, Israel; the University of California at Berkeley, Berkeley, CA, USA; and the Max Planck Institute for Informatics, Saarbrücken, Germany. He studies string problems from multiple perspectives, including combinatorics on words, dynamic algorithms, fine-grained complexity, streaming and sketching, and sublinear algorithms. He is the coauthor of over 100 conferences and journal papers. His research focuses on designing efficient algorithms for processing strings with a particular focus on sequence similarity measures, approximate pattern matching, lossless data compression, and data structures. He has served as a program committee member for ten international conferences. He was a recipient of the Cor Baayen Young Researcher Award in 2021 and the Witold Lipski Prize in 2018.