Igor O. Zavadskyi

Orcid: 0000-0002-4826-5265

According to our database1, Igor O. Zavadskyi authored at least 20 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lossless text compression by means of binary-coded ternary number representation.
Discret. Appl. Math., 2024

2023
Efficient Integer Retrieving from Unordered Compressed Sequences.
CoRR, 2023

Efficient Integer Retrieval from Unordered Compressed Sequences.
Proceedings of the Prague Stringology Conference 2023, 2023

Binary Mixed-Digit Data Compression Codes.
Proceedings of the String Processing and Information Retrieval, 2023

Compressed unordered integer sequences with fast direct access.
Proceedings of the Data Compression Conference, 2023

2022
Fast Exact Pattern Matching by the Means of a Character Bit Representation.
SN Comput. Sci., 2022

Practical Word-based Text Compression Using the Reverse Multi-Delimiter Codes.
Proceedings of the Selected Papers of the IX International Scientific Conference "Information Technology and Implementation" (IT&I-2022), Workshop Proceedings, Kyiv, Ukraine, November 30, 2022

Binary-Coded Ternary Number Representation in Natural Language Text Compression.
Proceedings of the Data Compression Conference, 2022

2021
Reverse Multi-Delimiter Codes in English and Ukrainian Natural Language Text Compression.
Proceedings of the Selected Papers of the VIII International Scientific Conference "Information Technology and Implementation" (IT&I-2021). Conference Proceedings, 2021

Hybrid Technologies for Databases.
Proceedings of the Selected Papers of the II International Scientific Symposium "Intelligent Solutions" (IntSol-2021). Workshop Proceedings, Kyiv, 2021

2020
Fast Exact Pattern Matching in a Bitstream and 256-ary Strings.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Reverse Multi-Delimiter Compression Codes.
Proceedings of the Data Compression Conference, 2020

2018
English Text Parsing by Means of Error Correcting Automaton.
Proceedings of the Natural Language Processing and Information Systems, 2018

2017
Variable-Length Prefix Codes With Multiple Delimiters.
IEEE Trans. Inf. Theory, 2017

A Family of Exact Pattern Matching Algorithms with Multiple Adjacent Search Windows.
Proceedings of the Prague Stringology Conference 2017, 2017

2016
A family of fast exact pattern matching algorithms.
CoRR, 2016

A Family of Data Compression Codes with Multiple Delimiters.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
Variable-length Splittable Codes with Multiple Delimiters.
CoRR, 2015

Variable length prefix (Δ, k)-codes.
Proceedings of the IEEE International Black Sea Conference on Communications and Networking, 2015

2014
Forward error correcting codes by means of the two-base (2, 3)-numeration system.
Proceedings of the IEEE International Black Sea Conference on Communications and Networking, 2014


  Loading...