EUVIMED · CrossrefZeitschrift
Theory of Computing Systems
ISSN 1432-4350 · Springer Science and Business Media LLC
Neueste Artikel
A New Characterization of Integer Infeasibility in a Conjunctive UTVPI Constraint System
On the Enumeration of Signatures of XOR-CNF’s
Algorithms for Computing Longest Unbordered Factors on Run-Length Encoded Strings
Suffixient Arrays: A New Efficient Suffix Array Compression Technique
The ceBWT Index: An Index for Circular Cartesian Tree Matching on Multiple Texts
Algebraically Enhanced 3D Chaotic Map with Hash-Based Initialization for Secure Image Encryption
Pumping Lemmas Can be “Harmful”
On Polynomial Recursive Sequences
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System
Streaming Algorithms for Bin Packing and Vector Scheduling
Faster Parameterized Algorithm for Cluster Vertex Deletion
Space-Efficient Algorithms for Longest Increasing Subsequence
On the Relative Succinctness of Sentential Decision Diagrams
Verification of Quantum Computation: An Overview of Existing Approaches
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes
On the Information Carried by Programs About the Objects they Compute
New Pairwise Spanners
Regular Queries on Graph Databases
From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back
Paradigms for Parameterized Enumeration
A Difference in Complexity Between Recursion and Tail Recursion
The Update Complexity of Selection and Related Problems
A Fast Branching Algorithm for Cluster Vertex Deletion
On the Data Complexity of Consistent Query Answering
Online Results for Black and White Bin Packing
Linear-Space Data Structures for Range Mode Query in Arrays
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Extended Regular Expressions: Succinctness and Decidability
Finding Similar Users in Social Networks
Generating Shorter Bases for Hard Random Lattices
EUVIMED