Information and Computation

Papers
(The TQCC of Information and Computation is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-08-01 to 2025-08-01.)
ArticleCitations
Editorial Board30
26th Workshop on Logic, Language, Information and Computation – WoLLIC 201927
Special Issue: Selected papers of the 12th International Conference on Language and Automata Theory and Applications, LATA 201817
Zeroing neural network based on the equation AXA = A16
Nondeterminism and the clique problem15
Constant-time dynamic weight approximation for minimum spanning forest14
On quotients of formal power series13
On Boolean threshold functions with minimum specification number13
On the decidability of the valuedness problem for two-way finite transducers13
Parameterized problems complete for nondeterministic FPT time and logarithmic space12
Scooby: Improved multi-party homomorphic secret sharing based on FHE12
Geometric bounds for convergence rates of averaging algorithms11
A computable and compositional semantics for hybrid systems11
Extending the reach of the point-to-set principle11
Slowly synchronizing automata with fixed alphabet size10
Survey on mining signal temporal logic specifications10
Satisfiability checking for Mission-time LTL (MLTL)10
Weighted automata and logics meet computational complexity9
Editorial Board8
Automatic pre- and postconditions for partial differential equations8
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement8
The membership problem for subsemigroups of GL<8
Determining temporal agreements in cross-organizational business processes8
Completeness of string analysis for dynamic languages8
r-indexing the eBWT8
Descriptional Complexity of Formal Systems (DCFS 2019)7
Narrowing the speedup factor gap of partitioned EDF7
Topological mixing notions on Turing machine dynamical systems7
Complexity thresholds in inclusion logic6
Asymptotics of the number of 2-threshold functions6
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice6
On the complexity of decision problems for some classes of machines and applications6
Effective notions of weak convergence of measures on the real line6
Are bundles good deals for first-order modal logic?6
Eilenberg's variety theorem without Boolean operations6
Slicing techniques for temporal aggregation in spanning event streams6
A new framework for deniable secure key exchange6
Preface6
Reversible pushdown transducers5
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source5
Weighted propositional configuration logics: A specification language for architectures with quantitative features5
Finite-word hyperlanguages5
Default logic and bounded treewidth5
Secretive interaction5
Syntactic stochastic processes: Definitions, models, and related inference problems5
On the data persistency of replicated erasure codes in distributed storage systems5
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency5
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond5
Atomic cross-chain swaps with improved space, time and local time complexities5
On the amount of nonconstructivity in learning formal languages from text5
Pushdown and Lempel-Ziv depth5
Query complexity of generalized Simon's problem4
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees4
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form4
Editorial Board4
On the computational power of energy-constrained mobile robots4
On regular trees defined from unfoldings and coverings4
Computable one-way functions on the reals4
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal4
Approximating the directed path partition problem4
Modelling mutual exclusion in a process algebra with time-outs4
On computational complexity of set automata4
Complexity of automatic sequences4
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric4
The computational properties of P systems with mutative membrane structures4
Editorial Board4
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas4
Isomorphism testing of read-once functions and polynomials4
A probabilistic calculus of cyber-physical systems4
Synchronizing deterministic push-down automata can be really hard4
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths4
Biased differential distinguisher – Cryptanalysis of reduced-round SKINNY4
Constructing and indexing the bijective and extended Burrows–Wheeler transform4
Editorial Board4
Rational weighted tree languages with storage3
Towards a proof theory for quantifier macros3
Projection theorems using effective dimension3
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages3
Reachability games with relaxed energy constraints3
Randomness and uniform distribution modulo one3
Weighted operator precedence languages3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces3
Building a small and informative phylogenetic supertree3
Unambiguous injective morphisms in free groups3
The geometry of reachability in continuous vector addition systems with states3
Topologies for error-detecting variable-length codes3
A parallel algorithm for counting parse trees3
Model checking timed recursive CTL3
What's decidable about weighted automata?3
Solving mean-payoff games via quasi dominions3
Bialgebraic foundations for the operational semantics of string diagrams3
Structural properties of NFAs and growth rates of nondeterminism measures3
Cayley polynomial–time computable groups3
Efficient and competitive broadcast in multi-channel radio networks3
Succinctness issues for LTL and safety and cosafety fragments of LTL3
Robust, expressive, and quantitative linear temporal logics: Pick any two for free3
Probabilistic input-driven pushdown automata3
Editorial Board3
Editorial Board3
On linear languages recognized by deterministic biautomata3
Preface to “Computation over Compressed Data” at DCC 20223
The complexity of subcube partition relates to the additive structure of the support3
Fairness and communication-based semantics for session-typed languages3
Neural-like P systems with plasmids3
Monomial Boolean functions with large high-order nonlinearities3
Information gathering in ad-hoc radio networks3
Load balanced distributed directories3
Optimizing reachability sets in temporal graphs by delaying3
Universal solutions for temporal data exchange3
A derivational model of discontinuous parsing2
Computing maximal palindromes in non-standard matching models2
Efficient construction of the BWT for repetitive text using string compression2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines2
Deterministic quantum search with adjustable parameters: Implementations and applications2
Total (restrained) domination in unit disk graphs2
Distributed localization of wireless sensor network using communication wheel2
Characterising spectra of equivalences for event structures, logically2
Editorial Board2
A periodicity lemma for partial words2
Beyond PCSP(1-in-3,NAE)2
The generalized constrained longest common subsequence in the run-length encoded format2
Chained time lock puzzle with small puzzle size2
Measuring the expressive power of practical regular expressions by classical stacking automata models2
Transduction from trees to graphs through folding2
Timed network games2
Exorcising the phantom zone2
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way2
On continued fraction randomness and normality2
Generalising the maximum independent set algorithm via Boolean networks2
QCTL model-checking with 2
Randomness below complete theories of arithmetic2
Enumeration of two dimensional palindromes2
Abstract processes and conflicts in place/transition systems2
Deducibility and independence in Beklemishev's autonomous provability calculus2
Order-preserving pattern matching indeterminate strings2
Editorial Board2
Computing absolutely normal numbers in nearly linear time2
Incentive ratio: A game theoretical analysis of market equilibria2
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem2
Hennessy-Milner properties via topological compactness2
Exchange of indivisible goods under matroid constraints2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines2
A self-stabilizing Hashed Patricia Trie2
Efficient pattern matching in elastic-degenerate strings2
To drive or not to drive: A logical and computational analysis of European transport regulations2
Compact representations of spatial hierarchical structures with support for topological queries2
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters2
Exploiting social influence to control elections based on positional scoring rules2
Model checking hyperproperties for Markov decision processes2
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields2
Formal languages over GF(2)2
Optimal in-place suffix sorting2
A decidable and expressive fragment of Many-Sorted First-Order Linear Temporal Logic2
Learnability and positive equivalence relations2
Noisy beeping networks2
Special issue: Formal verification of cyber-physical systems2
Achieving sequenced SQL with log-segmented timestamps2
Binary and circular automata having maximal state complexity for the set of synchronizing words2
The tail-recursive fragment of timed recursive CTL2
Usefulness of information and decomposability of unary regular languages2
Intensional Kleene and Rice theorems for abstract program semantics2
0.11656284332275