Information and Computation

Article	Citations
Succinctness issues for LTL and safety and cosafety fragments of LTL	28
A parallel algorithm for counting parse trees	20
Nondeterminism and the clique problem	17
A computable and compositional semantics for hybrid systems	16
Comparison of algorithms for simple stochastic games	13
An improved FPT algorithm for the flip distance problem	13
Converting nondeterministic two-way automata into small deterministic linear-time machines	13
Unambiguous injective morphisms in free groups	12
Hierarchical identification of nonlinear hybrid systems in a Bayesian framework	11
Extending the reach of the point-to-set principle	10
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022)	10
Special issue of SSS 2020	10
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	9
Editorial Board	9
Pspace-completeness of the temporal logic of sub-intervals and suffixes	9
Special Issue: Selected papers of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018	8
Slowly synchronizing automata with fixed alphabet size	8
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries	8
Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning	8
An auxiliary logic on trees: On the tower-hardness of logics featuring reachability and submodel reasoning	7
Geometric bounds for convergence rates of averaging algorithms	7
Selected papers from CSCML 2020, the 4th International Symposium on Cyber Security Cryptology and Machine Learning	7
Editorial Board	6
Functionality of compositions of top-down tree transducers is decidable	6
Editorial Board	6

Editorial Board	6
Universal solutions for temporal data exchange	6
Polynomial interrupt timed automata: Verification and expressiveness	6
On the decidability of the valuedness problem for two-way finite transducers	6
Editorial Board	6
Enumeration of two dimensional palindromes	5
On linear languages recognized by deterministic biautomata	5
Dynamics of reputation in mobile agents systems and weighted timed automata	5
Multivariate to bivariate reduction for noncommutative polynomial factorization	5
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems	5
Model checking timed recursive CTL	5
Scooby: Improved multi-party homomorphic secret sharing based on FHE	5
Modification problems toward proper (Helly) circular-arc graphs	5
Satisfiability checking for Mission-time LTL (MLTL)	5
Automated deep abstractions for stochastic chemical reaction networks	5
Wheeler languages	5
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	4
Mining CSTNUDs significant for a set of traces is polynomial	4
On quotients of formal power series	4
Traceable constant-size multi-authority credentials	4
Entropic risk for turn-based stochastic games	4
Safe dependency atoms and possibility operators in team semantics	4
On the complexity of asynchronous freezing cellular automata	4
Lifting proofs from countable to uncountable mathematics	4
Automatic winning shifts	4
Improving convergence and practicality of slide-type reductions	4
Combinatory categorial grammars as generators of weighted forests	4
Towards a proof theory for quantifier macros	4
One-variable fragments of intermediate logics over linear frames	4
Decisiveness of stochastic systems and its application to hybrid models	4
Rational weighted tree languages with storage	4
Algorithmic aspects of secure domination in unit disk graphs	4
The ideal view on Rackoff's coverability technique	4
Symbolic computation in algebra, geometry, and differential equations	4
Binary and circular automata having maximal state complexity for the set of synchronizing words	3
Survey on mining signal temporal logic specifications	3
Removing redundant refusals: Minimal complete test suites for failure trace semantics	3
Monomial Boolean functions with large high-order nonlinearities	3
Efficient and competitive broadcast in multi-channel radio networks	3
On Boolean threshold functions with minimum specification number	3
Causal computational complexity of distributed processes	3
Relative approximate bisimulations for fuzzy picture automata	3
Specification and optimal reactive synthesis of run-time enforcement shields	3
Compact representations of spatial hierarchical structures with support for topological queries	3
Zeroing neural network based on the equation AXA = A	3
Completeness of string analysis for dynamic languages	3
Maximal diameter of integral circulant graphs	3
Online search with a hint	3
Parameterized problems complete for nondeterministic FPT time and logarithmic space	3
Pathwise-randomness and models of second-order arithmetic	3

A universal algorithm for Krull's theorem	3
Compact representation of graphs with bounded bandwidth or treedepth	3
Constant-time dynamic weight approximation for minimum spanning forest	3
The Geometry of Reachability in Continuous Vector Addition Systems with States	3
Weighted automata and logics meet computational complexity	3
Automatic pre- and postconditions for partial differential equations	3
Growth and irreducibility in path-incompressible trees	3
Editorial Board	3
Building a small and informative phylogenetic supertree	3
Bayesian definition of random sequences with respect to conditional probabilities	3
Rule synchronization for monodirectional tissue-like P systems with channel states	3
On fast pattern formation by autonomous robots	3
Topologies for error-detecting variable-length codes	3
On the transformation of two-way finite automata to unambiguous finite automata	3
Extremal synchronizing circular automata	3
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past	3
Special issue: Selected papers of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019	3
On continued fraction randomness and normality	3
On divergence-sensitive weak probabilistic bisimilarity	3
Editorial Board	3
Optimizing reachability sets in temporal graphs by delaying	3
Preface to Special Issue for DCC 2020	2
Non-normal modal logics and conditional logics: Semantic analysis and proof theory	2
Metric quantifiers and counting in timed logics and automata	2
Operational union-complexity	2
A derivational model of discontinuous parsing	2
The bang calculus revisited	2
Transformation of variants of Petri nets into context-dependent fusion grammars	2
Learning residual alternating automata	2
Cayley polynomial–time computable groups	2
QCTL model-checking with 2
Context-free timed formalisms: Robust automata and linear temporal logics	2
Branching interval algebra: An almost complete picture	2
r-indexing the eBWT	2
Dynamic branching in qualitative constraint-based reasoning via counting local models	2
Predictive mining of multi-temporal relations	2
A combinatorial characterization of self-stabilizing population protocols	2
Load balanced distributed directories	2
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	2
Bialgebraic foundations for the operational semantics of string diagrams	2
Descriptional Complexity of Formal Systems (DCFS 2019)	2
Regular ω-languages with an informative right congruence	2
Fixed-parameter algorithms for Fair Hitting Set problems	2
State complexity of transforming graph-walking automata to halting, returning and reversible	2
Deterministic size discovery and topology recognition in radio networks with short labels	2
Narrowing the speedup factor gap of partitioned EDF	2
Reachability games with relaxed energy constraints	2
Complexity of C-coloring in hereditary classes of graphs	2
Nonlinear neural P systems for generating string languages	2
On the complexity of decision problems for some classes of machines and applications	2
Neural-like P systems with plasmids	2
The complexity of subcube partition relates to the additive structure of the support	2
Special Issue: Selected papers of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020	2
Learning Mealy machines with one timer	2
Information gathering in ad-hoc radio networks	2
Attacking (EC)DSA with partially known multiples of nonces	2
Probabilistic automata of bounded ambiguity	2
The membership problem for subsemigroups of GL<	2
Unifying lower bounds for algebraic machines, semantically	2
Preface	2
Weighted operator precedence languages	2
Bideterministic weighted automata	2
Topological mixing notions on Turing machine dynamical systems	2
Variable-length codes independent or closed with respect to edit relations	2
Eilenberg's variety theorem without Boolean operations	2
Efficient construction of the BWT for repetitive text using string compression	2
Abstract processes in the absence of conflicts in general place/transition systems	2
Characterizing contrasimilarity through games, modal logic, and complexity	2
Detecting arrays for effects of multiple interacting factors	1
Distributed computability: Relating k-immediate snapshot and x-set agreement	1
Consensus string problem for multiple regular languages	1
Succinct data structure for path graphs	1
Editorial Board	1
An improved approximation algorithm for the minimum common integer partition problem	1
Weight-reducing Turing machines	1
On the Weisfeiler-Leman dimension of fractional packing	1
The emptiness problem for valence automata over graph monoids	1
Editorial Board	1
Parameterized verification of coverability in infinite state broadcast networks	1
Special issue: Formal verification of cyber-physical systems	1

Polymorphic lambda calculus with context-free session types	1
Approximate envy-freeness in indivisible resource allocation with budget constraints	1
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs	1
Determining temporal agreements in cross-organizational business processes	1
Secretive interaction	1
On equations and first-order theory of one-relator monoids	1
Effective notions of weak convergence of measures on the real line	1
Temporal logics with language parameters	1
Atomic cross-chain swaps with improved space, time and local time complexities	1
Exorcising the phantom zone	1
On degrees of ambiguity for Büchi tree automata	1
Characterising spectra of equivalences for event structures, logically	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs	1
Editorial Board	1
Combination of roots and boolean operations: An application to state complexity	1
Transduction from trees to graphs through folding	1
Temporal logic with recursion	1
Asymptotics of the number of 2-threshold functions	1
Further improvements for SAT in terms of formula length	1
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	1
Usefulness of information and decomposability of unary regular languages	1
On prime scenarios in qualitative spatial and temporal reasoning	1
Bounded game-theoretic semantics for modal mu-calculus	1
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning	1
Learning half-spaces on general infinite spaces equipped with a distance function	1
Subject-oriented spatial logic	1
Advice complexity of treasure hunt in geometric terrains	1
Reversible pushdown transducers	1
An algebraic attack on the key exchange protocol based upon a modified tropical structure	1
Exploring sparse graphs with advice	1
Efficient assignment of identities in anonymous populations	1
Efficient pattern matching in elastic-degenerate strings	1
On tightness of Tsaknakis-Spirakis descent methods for approximate Nash equilibria	1
How does adiabatic quantum computation fit into quantum automata theory?	1
Default logic and bounded treewidth	1
On the power of finite ambiguity in Büchi complementation	1
To be announced	1
Reachability problems in low-dimensional nondeterministic polynomial maps over integers	1
Are bundles good deals for first-order modal logic?	1
Order-preserving pattern matching indeterminate strings	1
Software science view on quantum circuit algorithms	1
Hennessy-Milner properties via topological compactness	1
On the computational completeness of matrix simple semi-conditional grammars	1
Fast synchronization of inhomogenous random automata	1
Slicing techniques for temporal aggregation in spanning event streams	1
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond	1
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	1
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization	1
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions	1
Tasks in modular proofs of concurrent algorithms	1
Location automata for regular expressions with shuffle and intersection	1
A simplicial complex model for dynamic epistemic logic to study distributed task computability	1
Optimal in-place suffix sorting	1
Exact bounds for acyclic higher-order recursion schemes	1
Approximate minimization of weighted tree automata	1
Probabilistic judgment aggregation with conditional independence constraints	1
Linear-time parameterized algorithms with limited local resources	1
Integrated encryption in dynamic arithmetic compression	1
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	1
Reasoning about group responsibility for exceeding risk threshold in one-shot games	1
A truthful near-optimal mechanism for online linear packing-covering problem in the random order model	1
Efficient representation and counting of antipower factors in words	1
Descriptional complexity of iterated uniform finite-state transducers	1
On the cost of unsuccessful searches in search trees with two-way comparisons	1
On the codewords of generalized Reed-Muller codes reaching the fourth weight	1
Parameter synthesis of polynomial dynamical systems	1
A new framework for deniable secure key exchange	1
Constant-space, constant-randomness verifiers with arbitrarily small error	1
Editorial Board	1
Fast mixing via polymers for random graphs with unbounded degree	0
A pumping lemma for regular closure of prefix-free languages	0
The number of spanning trees for Sierpiński graphs and data center networks	0
Counting (Watson-Crick) palindromes in Watson-Crick conjugates	0
On the complexity of approximately matching a string to a directed graph	0
Depth-3 circuits for inner product	0
Asymptotically optimal synthesis of reversible circuits	0
The computational properties of P systems with mutative membrane structures	0
Linear construction of a left Lyndon tree	0
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	0
Editorial Board	0
Constructing and indexing the bijective and extended Burrows–Wheeler transform	0
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020)	0
On parallelisms of PG(3,4) with automorphisms of order 2	0
Preface	0
Generalising the maximum independent set algorithm via Boolean networks	0
Higher order monotonicity and submodularity of influence in social networks: From local to global	0
Reducing the number of disjuncts in DTPs	0
Solving mean-payoff games via quasi dominions	0
Solving modular cubic equations with Coppersmith's method	0
Local higher-order fixpoint iteration	0
Generalized budgeted submodular set function maximization	0
Timed network games	0
ltl synthesis under environment specifications for reachability and safety properties	0
Editorial Board	0