Information and Computation

Article	Citations
Extending the reach of the point-to-set principle	28
Editorial Board	21
26th Workshop on Logic, Language, Information and Computation – WoLLIC 2019	17
Geometric bounds for convergence rates of averaging algorithms	16
Special Issue: Selected papers of the 12th International Conference on Language and Automata Theory and Applications, LATA 2018	13
Nondeterminism and the clique problem	13
Slowly synchronizing automata with fixed alphabet size	13
Zeroing neural network based on the equation AXA = A	13
Constant-time dynamic weight approximation for minimum spanning forest	12
On Boolean threshold functions with minimum specification number	12
On quotients of formal power series	11
A computable and compositional semantics for hybrid systems	10
Parameterized problems complete for nondeterministic FPT time and logarithmic space	10
Satisfiability checking for Mission-time LTL (MLTL)	10
On the decidability of the valuedness problem for two-way finite transducers	9
Scooby: Improved multi-party homomorphic secret sharing based on FHE	9
Completeness of string analysis for dynamic languages	8
Survey on mining signal temporal logic specifications	8
Editorial Board	8
Weighted automata and logics meet computational complexity	8
Automatic pre- and postconditions for partial differential equations	7
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	7
Preface	7
Determining temporal agreements in cross-organizational business processes	7
The membership problem for subsemigroups of GL<	7

Descriptional Complexity of Formal Systems (DCFS 2019)	6
Narrowing the speedup factor gap of partitioned EDF	6
Complexity thresholds in inclusion logic	6
On the complexity of decision problems for some classes of machines and applications	6
Topological mixing notions on Turing machine dynamical systems	6
r-indexing the eBWT	6
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	6
Eilenberg's variety theorem without Boolean operations	6
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source	6
Default logic and bounded treewidth	6
Asymptotics of the number of 2-threshold functions	5
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	5
Reversible pushdown transducers	5
Atomic cross-chain swaps with improved space, time and local time complexities	5
Query complexity of generalized Simon's problem	5
On the amount of nonconstructivity in learning formal languages from text	5
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond	5
Secretive interaction	5
Slicing techniques for temporal aggregation in spanning event streams	5
Syntactic stochastic processes: Definitions, models, and related inference problems	5
Are bundles good deals for first-order modal logic?	5
A new framework for deniable secure key exchange	5
Effective notions of weak convergence of measures on the real line	5
Approximating the directed path partition problem	4
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency	4
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	4
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	4
A probabilistic calculus of cyber-physical systems	4
Editorial Board	4
Finite-word hyperlanguages	4
Pushdown and Lempel-Ziv depth	4
Editorial Board	4
Constructing and indexing the bijective and extended Burrows–Wheeler transform	4
Modelling mutual exclusion in a process algebra with time-outs	4
On the data persistency of replicated erasure codes in distributed storage systems	4
Weighted propositional configuration logics: A specification language for architectures with quantitative features	4
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas	4
Isomorphism testing of read-once functions and polynomials	4
The computational properties of P systems with mutative membrane structures	4
On computational complexity of set automata	4
Succinctness issues for LTL and safety and cosafety fragments of LTL	3
Model checking timed recursive CTL	3
Randomness and uniform distribution modulo one	3
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces	3
Universal solutions for temporal data exchange	3
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages	3
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	3
Biased differential distinguisher – Cryptanalysis of reduced-round SKINNY	3
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	3
The geometry of reachability in continuous vector addition systems with states	3

Rational weighted tree languages with storage	3
Efficient and competitive broadcast in multi-channel radio networks	3
Structural properties of NFAs and growth rates of nondeterminism measures	3
Projection theorems using effective dimension	3
On linear languages recognized by deterministic biautomata	3
Editorial Board	3
Fairness and communication-based semantics for session-typed languages	3
Editorial Board	3
On regular trees defined from unfoldings and coverings	3
Synchronizing deterministic push-down automata can be really hard	3
Editorial Board	3
Monomial Boolean functions with large high-order nonlinearities	3
A parallel algorithm for counting parse trees	3
Optimizing reachability sets in temporal graphs by delaying	3
Constrained existence problem for weak subgame perfect equilibria with ω-regular Boolean objectives	3
What's decidable about weighted automata?	3
Unambiguous injective morphisms in free groups	3
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths	3
Complexity of automatic sequences	3
On the computational power of energy-constrained mobile robots	3
Solving mean-payoff games via quasi dominions	3
Preface to “Computation over Compressed Data” at DCC 2022	3
Towards a proof theory for quantifier macros	3
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	2
Load balanced distributed directories	2
Compact representations of spatial hierarchical structures with support for topological queries	2
Neural-like P systems with plasmids	2
Formal verification for event stream processing: Model checking of BeepBeep stream processing pipelines	2
Generalising the maximum independent set algorithm via Boolean networks	2
A simplicial complex model for dynamic epistemic logic to study distributed task computability	2
Timed network games	2
Efficient pattern matching in elastic-degenerate strings	2
Exploiting social influence to control elections based on positional scoring rules	2
Optimal in-place suffix sorting	2
Randomness below complete theories of arithmetic	2
Reachability games with relaxed energy constraints	2
Chained time lock puzzle with small puzzle size	2
Beyond PCSP(1-in-3,NAE)	2
Building a small and informative phylogenetic supertree	2
Editorial Board	2
A derivational model of discontinuous parsing	2
Topologies for error-detecting variable-length codes	2
On continued fraction randomness and normality	2
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines	2
Noisy beeping networks	2
Transduction from trees to graphs through folding	2
Information gathering in ad-hoc radio networks	2
The tail-recursive fragment of timed recursive CTL	2
Efficient construction of the BWT for repetitive text using string compression	2
Abstract processes and conflicts in place/transition systems	2
Characterising spectra of equivalences for event structures, logically	2
Computing maximal palindromes in non-standard matching models	2
Special issue: Formal verification of cyber-physical systems	2
Deterministic quantum search with adjustable parameters: Implementations and applications	2
Exchange of indivisible goods under matroid constraints	2
Weighted operator precedence languages	2
Hennessy-Milner properties via topological compactness	2
QCTL model-checking with 2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Usefulness of information and decomposability of unary regular languages	2
Formal languages over GF(2)	2
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way	2
A self-stabilizing Hashed Patricia Trie	2
The complexity of subcube partition relates to the additive structure of the support	2
Achieving sequenced SQL with log-segmented timestamps	2
Order-preserving pattern matching indeterminate strings	2
Intensional Kleene and Rice theorems for abstract program semantics	2
Exorcising the phantom zone	2
Editorial Board	2
Incentive ratio: A game theoretical analysis of market equilibria	2
Bialgebraic foundations for the operational semantics of string diagrams	2
Learnability and positive equivalence relations	2
Cayley polynomial–time computable groups	2
Exploring sparse graphs with advice	1
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem	1
Posets with interfaces as a model for concurrency	1
Model checking hyperproperties for Markov decision processes	1
Regular languages as images of local functions over small alphabets	1
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields	1
Learning residual alternating automata	1

Detecting causality in the presence of Byzantine processes: The case of synchronous systems	1
Lifting proofs from countable to uncountable mathematics	1
Dynamic branching in qualitative constraint-based reasoning via counting local models	1
Preface	1
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries	1
Combination of roots and boolean operations: An application to state complexity	1
Fixed-parameter algorithms for Fair Hitting Set problems	1
Editorial Board	1
Allocating contiguous blocks of indivisible chores fairly	1
Bayesian definition of random sequences with respect to conditional probabilities	1
Choosing the right algorithm with hints from complexity theory	1
Editorial Board	1
Towards non-iterative calculation of the zeros of the Riemann zeta function	1
Preface: Selected papers from SSS'2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems	1
On the computational completeness of matrix simple semi-conditional grammars	1
Regular transducer expressions for regular transformations	1
On fast pattern formation by autonomous robots	1
Pomset bisimulation and unfolding for reset Petri nets	1
Computing absolutely normal numbers in nearly linear time	1
Descriptional complexity of iterated uniform finite-state transducers	1
A periodicity lemma for partial words	1
Taming Strategy Logic: Non-Recurrent Fragments	1
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems	1
The bang calculus revisited	1
The opacity of backbones	1
Enumeration of two dimensional palindromes	1
Predictive mining of multi-temporal relations	1
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle	1
Decisiveness of stochastic systems and its application to hybrid models	1
Probabilistic judgment aggregation with conditional independence constraints	1
Breaking Goppa-based McEliece with hints	1
Distributed localization of wireless sensor network using communication wheel	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
Efficient assignment of identities in anonymous populations	1
Bounded game-theoretic semantics for modal mu-calculus	1
LZRR: LZ77 parsing with right reference	1
Trading information complexity for error II: The case of a large error and the external information complexity	1
Reachability problems in low-dimensional nondeterministic polynomial maps over integers	1
Some remarks on the orbit of closure-involution operations on languages	1
Continuous randomness via transformations of 2-random sequences	1
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)	1
Linear-time parameterized algorithms with limited local resources	1
Algorithmic aspects of secure domination in unit disk graphs	1
A discrete and continuous study of the Max-Chain-Formation problem	1
Succinct data structure for path graphs	1
Sensitivity of string compressors and repetitiveness measures	1
Measuring the Expressive Power of Practical Regular Expressions by Classical Stacking Automata Models	1
Editorial Board	1
Total (restrained) domination in unit disk graphs	1
New characterizations of primitive permutation groups with applications to synchronizing automata	1
Deducibility and independence in Beklemishev's autonomous provability calculus	1
Preface to Special Issue for DCC 2020	1
On finite-index indexed grammars and their restrictions	1
Wheeler languages	1
A combinatorial characterization of self-stabilizing population protocols	1
Rule synchronization for tissue P systems	1
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past	1
How does adiabatic quantum computation fit into quantum automata theory?	1
Language models for some extensions of the Lambek calculus	1
Detecting arrays for effects of multiple interacting factors	1
Parameter synthesis of polynomial dynamical systems	1
Generalized budgeted submodular set function maximization	1
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization	1
A practical succinct dynamic graph representation	1
A generic type system for higher-order Ψ-calculi	1
Further improvements for SAT in terms of formula length	1
Editorial Board	1
Higher order monotonicity and submodularity of influence in social networks: From local to global	1
Non-closure under complementation for unambiguous linear grammars	1
Special issue: Selected papers of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2020)	1
A decidable and expressive fragment of Many-Sorted First-Order Linear Temporal Logic	1
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms	1
To drive or not to drive: A logical and computational analysis of European transport regulations	1
The uniform measure of simple regular sets of infinite trees	0
Logic for ω-pushdown automata	0
Converting nondeterministic two-way automata into small deterministic linear-time machines	0
Safe dependency atoms and possibility operators in team semantics	0
Extremal synchronizing circular automata	0
Editorial Board	0
Automated deep abstractions for stochastic chemical reaction networks	0
Cost-asymmetric memory hard password hashing	0
Distance labeling schemes for K4-free bridged graphs	0
Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning	0
Traceable constant-size multi-authority credentials	0
Mining CSTNUDs significant for a set of traces is polynomial	0
Modification problems toward proper (Helly) circular-arc graphs	0
Truthful and privacy-preserving generalized linear models	0
Logical equivalences, homomorphism indistinguishability, and forbidden minors	0
Learners based on transducers	0
Editorial Board	0
Hierarchical identification of nonlinear hybrid systems in a Bayesian framework	0
Causal computational complexity of distributed processes	0
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond	0
Entropic risk for turn-based stochastic games	0
Functionality of compositions of top-down tree transducers is decidable	0