Storing text retrieval systems on CD-ROM: compression and encryption considerations
ACM Transactions on Information Systems (TOIS)
ACM Computing Surveys (CSUR)
Efficient decoding of prefix codes
Communications of the ACM
Compression, information theory, and grammars: a unified approach
ACM Transactions on Information Systems (TOIS)
Construction of optimal graphs for bit-vector compression
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Online algorithms for locating checkpoints
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Linear approximation of shortest superstrings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An honors course in data compression
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
An analysis of the longest match and the greedy heuristics in text encoding
Journal of the ACM (JACM)
Practical dictionary management for hardware data compression
Communications of the ACM
On-line algorithms for cache sharing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Practical prefetching via data compression
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
Lossless compression of volume data
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Efficient recompression techniques for dynamic full-text retrieval systems
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
An inter-reference gap model for temporal locality in program behavior
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Stochastic sequential machine synthesis targeting constrained sequence generation
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Efficiently supporting ad hoc queries in large datasets of time sequences
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Compression-Based Program Characterization for Improving Cache Memory Performance
IEEE Transactions on Computers
Crowd modelling in collaborative virtual environments
VRST '98 Proceedings of the ACM symposium on Virtual reality software and technology
Stochastic sequential machine synthesis with application to constrained sequence generation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Journal of VLSI Signal Processing Systems
An approximation algorithm for the shortest common supersequence problem: an experimental analysis
Proceedings of the 2001 ACM symposium on Applied computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sending compressed messages to a learned receiver on a bidirectional line
Information Processing Letters
Database Management with Sequence Trees and Tokens
IEEE Transactions on Knowledge and Data Engineering
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Program Modelling via Inter-Reference Gaps and Applications
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Sliding-Window Compression on the Hypercube (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
Work-Optimal Parallel Decoders for LZ2 Data Compression
DCC '00 Proceedings of the Conference on Data Compression
Compression of Biological Sequences by Greedy Off-Line Textual Substitution
DCC '00 Proceedings of the Conference on Data Compression
On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol
DCC '00 Proceedings of the Conference on Data Compression
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Investigation of some hardware accelerators for relational algebra operations
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A VLSI architecture for cellular automata based parallel data compression
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
A work-optimal parallel implementation of lossless image compression by block matching
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
The effect of non-greedy parsing in Ziv-Lempel compression methods
DCC '95 Proceedings of the Conference on Data Compression
Multiple-dictionary compression using partial matching
DCC '95 Proceedings of the Conference on Data Compression
DCC '95 Proceedings of the Conference on Data Compression
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Overlap in Adaptive Vector Quantization
DCC '01 Proceedings of the Data Compression Conference
IEEE Transactions on Computers
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
Journal of Experimental Algorithmics (JEA)
Common Subsequences and Supersequences and their Expected Length
Combinatorics, Probability and Computing
A nearly-optimal Fano-based coding algorithm
Information Processing and Management: an International Journal
An efficient algorithm for sequence comparison with block reversals
Theoretical Computer Science - Latin American theorotical informatics
Linear-time computation of local periods
Theoretical Computer Science
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Space efficient search for maximal repetitions
Theoretical Computer Science - Combinatorics on words
Secret image sharing with smaller shadow images
Pattern Recognition Letters
An efficient algorithm for online square detection
Theoretical Computer Science - Computing and combinatorics
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Compressing electrocardiogram signals using parameterized wavelets
Proceedings of the 2008 ACM symposium on Applied computing
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Discrete Applied Mathematics
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Disappearing Cryptography: Information Hiding: Steganography & Watermarking
Beam search for the longest common subsequence problem
Computers and Operations Research
Image compression via textual substitution
WSEAS Transactions on Information Science and Applications
Textual substitution methods for image compression
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
Finding the longest common nonsuperstring in linear time
Information Processing Letters
Why greed works for shortest common superstring problem
Theoretical Computer Science
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the complexity of finding gapped motifs
Journal of Discrete Algorithms
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
Shortest common superstring problem with discrete neural networks
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Interactive compression of books
WSEAS Transactions on Computers
Improving dictionary based data compression by using previous knowledge and interaction
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Text data compression algorithms
Algorithms and theory of computation handbook
A hybrid metaheuristic for the longest common subsequence problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Memory energy minimization by data compression: algorithms, architectures and implementation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2002 international symposium on low-power electronics and design (ISLPED)
An improved algorithm for the longest common subsequence problem
Computers and Operations Research
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
LZ-based adaptive compression for images
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
The multiple sequence sets: problem and heuristic algorithms
Journal of Combinatorial Optimization
On primary and secondary repetitions in words
Theoretical Computer Science
DNA'06 Proceedings of the 12th international conference on DNA Computing
An enhanced beam search algorithm for the Shortest Common Supersequence Problem
Engineering Applications of Artificial Intelligence
A hyper-heuristic for the Longest Common Subsequence problem
Computational Biology and Chemistry
Bridging lossy and lossless compression by motif pattern discovery
General Theory of Information Transfer and Combinatorics
A fast and efficient nearly-optimal adaptive Fano coding scheme
Information Sciences: an International Journal
Robust approaches to 3d object secret sharing
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
A new algorithm for lossless compression applied to two-dimensional static images
WORLD-EDU'12/CIT'12 Proceedings of the 6th international conference on Communications and Information Technology, and Proceedings of the 3rd World conference on Education and Educational Technologies
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
An in-depth analysis of data aggregation cost factors in a columnar in-memory database
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
| Hi-index | 0.04 |