Information and Computation

Article	Citations
Cell-like P systems with evolutional symport/antiport rules and membrane creation	50
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle	28
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results	16
Neural-like P systems with plasmids	16
Rule synchronization for tissue P systems	16
Revisiting Deutsch-Jozsa algorithm	16
Survey on mining signal temporal logic specifications	14
A probabilistic calculus of cyber-physical systems	13
Wheeler languages	13
Computational fuzzy extractors	13
PPLite: Zero-overhead encoding of NNC polyhedra	12
A theory of monitors	12
The computational power of monodirectional tissue P systems with symport rules	10
A simplicial complex model for dynamic epistemic logic to study distributed task computability	10
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries	10
Arrow update synthesis	9
Learning families of algebraic structures from informant	9
Polymorphic lambda calculus with context-free session types	9
What's decidable about weighted automata?	9
Bounding the dimension of points on a line	8
Comparison of algorithms for simple stochastic games	8
Value iteration for simple stochastic games: Stopping criterion and learning algorithm	8
Reversibility of computations in graph-walking automata	8
Integrated encryption in dynamic arithmetic compression	8
Nondeterministic right one-way jumping finite automata	7

A parametric framework for reversible π-calculi	7
Posets with interfaces as a model for concurrency	7
Information leakage due to operative errors in card-based protocols	7
Allocating contiguous blocks of indivisible chores fairly	6
Optimal in-place suffix sorting	6
Rule synchronization for monodirectional tissue-like P systems with channel states	6
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way	6
Sensitivity of string compressors and repetitiveness measures	6
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	6
Efficient pattern matching in elastic-degenerate strings	6
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs	5
Non-normal modal logics and conditional logics: Semantic analysis and proof theory	5
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees	5
Hitting forbidden induced subgraphs on bounded treewidth graphs	5
To be announced	5
A universal algorithm for Krull's theorem	5
Reachability of scope-bounded multistack pushdown systems	5
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	5
Variable-length codes independent or closed with respect to edit relations	5
Automated deep abstractions for stochastic chemical reaction networks	5
Computational completeness of sequential spiking neural P systems with inhibitory rules	5
Beyond PCSP(1-in-3,NAE)	5
The link-calculus for open multiparty interactions	4
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency	4
Deterministic quantum search with adjustable parameters: Implementations and applications	4
The emptiness problem for valence automata over graph monoids	4
Regular ω-languages with an informative right congruence	4
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems	4
Fast mixing via polymers for random graphs with unbounded degree	4
Ring exploration with myopic luminous robots	4
Descriptional complexity of iterated uniform finite-state transducers	4
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol	4
Determining temporal agreements in cross-organizational business processes	4
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	4
Distributional formal semantics	4
Formal languages over GF(2)	4
On equations and first-order theory of one-relator monoids	4
On the universal steganography of optimal rate	4
Learning Mealy machines with one timer	4
Location automata for regular expressions with shuffle and intersection	3
Efficient construction of the BWT for repetitive text using string compression	3
An improved FPT algorithm for the flip distance problem	3
The complexity of regex crosswords	3
Clairvoyant state machine replication	3
On the complexity of approximately matching a string to a directed graph	3
Model checking hyperproperties for Markov decision processes	3
Exploiting social influence to control elections based on positional scoring rules	3
On finite-index indexed grammars and their restrictions	3
Query complexity of generalized Simon's problem	3
Advice complexity of treasure hunt in geometric terrains	3

On the Weisfeiler-Leman dimension of fractional packing	3
Probabilistic automata of bounded ambiguity	3
Lifting proofs from countable to uncountable mathematics	3
Complexity of automatic sequences	3
Team equivalences for finite-state machines with silent moves	3
Complexity analysis of a unifying algorithm for model checking interval temporal logic	3
Noisy beeping networks	3
Distributability of mobile ambients	3
Weighted propositional configuration logics: A specification language for architectures with quantitative features	3
Constant-space, constant-randomness verifiers with arbitrarily small error	3
Branching interval algebra: An almost complete picture	3
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past	3
Dynamics of reputation in mobile agents systems and weighted timed automata	3
Structural properties of NFAs and growth rates of nondeterminism measures	3
Distributed localization of wireless sensor network using communication wheel	3
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS	3
LTL falsification in infinite-state systems	3
Timed hyperproperties	3
c-trie++: A dynamic trie tailored for fast prefix searches	3
On the cost of unsuccessful searches in search trees with two-way comparisons	3
On linear languages recognized by deterministic biautomata	2
Recent developments in theory and tool support for hybrid systems verification with HyPro	2
Online recognition of dictionary with one gap	2
Language models for some extensions of the Lambek calculus	2
Safe dependency atoms and possibility operators in team semantics	2
Pomset bisimulation and unfolding for reset Petri nets	2
Weighted models for higher-order computation	2
Principal abstract families of weighted tree languages	2
Exploring sparse graphs with advice	2
Preservation of normality by transducers	2
Approximate minimization of weighted tree automata	2
Static and dynamic property-preserving updates	2
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization	2
Beyond the worst-case analysis of random priority: Smoothed and average-case approximation ratios in mechanism design	2
The membership problem for subsemigroups of GL<	2
Bisimulation metrics and norms for real-weighted automata	2
Behavioural strategies in weighted Boolean games	2
On the spread of influence in graphs	2
Completeness of string analysis for dynamic languages	2
The bang calculus revisited	2
The refinement calculus of reactive systems	2
Traceable constant-size multi-authority credentials	2
Approximating the directed path partition problem	2
Slowly synchronizing automata with fixed alphabet size	2
Finite-word hyperlanguages	2
On the transformation of two-way finite automata to unambiguous finite automata	2
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class	2
Linear-time parameterized algorithms with limited local resources	2
The ideal view on Rackoff's coverability technique	2
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond	2
A structured view on weighted counting with relations to counting, quantum computation and applications	2
Asymptotics of the number of 2-threshold functions	2
On the existence of weak subgame perfect equilibria	2
Exorcising the phantom zone	2
Fairness and communication-based semantics for session-typed languages	2
Dynamic branching in qualitative constraint-based reasoning via counting local models	2
Nearest neighbor representations of Boolean functions	2
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	2
To drive or not to drive: A logical and computational analysis of European transport regulations	2
State complexity of transforming graph-walking automata to halting, returning and reversible	2
Satisfiability checking for Mission-time LTL (MLTL)	2
Bounded complete domains and their logical form	2
Algorithmic aspects of secure domination in unit disk graphs	2
New characterizations of primitive permutation groups with applications to synchronizing automata	2
On fast pattern formation by autonomous robots	2
Game-theoretic semantics for ATL+ with applications to model checking	2
Geometric bounds for convergence rates of averaging algorithms	2
A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption	2
Reachability problems in low-dimensional nondeterministic polynomial maps over integers	2
Optimizing reachability sets in temporal graphs by delaying	2
Default logic and bounded treewidth	2
Faster repetition-aware compressed suffix trees based on Block Trees	2
Combination of roots and boolean operations: An application to state complexity	2
Randomness and uniform distribution modulo one	2
Complexity thresholds in inclusion logic	2
Counting (Watson-Crick) palindromes in Watson-Crick conjugates	2
Operational union-complexity	2
A robust class of linear recurrence sequences	2
Specification and optimal reactive synthesis of run-time enforcement shields	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2

Non-closure under complementation for unambiguous linear grammars	2
Search by a metamorphic robotic system in a finite 2D square Grid	1
Consensus string problem for multiple regular languages	1
Bialgebraic foundations for the operational semantics of string diagrams	1
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form	1
Are bundles good deals for first-order modal logic?	1
Functionality of compositions of top-down tree transducers is decidable	1
A universal pair of 1/2-betting strategies	1
Temporal logics with language parameters	1
Improving convergence and practicality of slide-type reductions	1
Effective notions of weak convergence of measures on the real line	1
Extremal synchronizing circular automata	1
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs	1
Maximal state complexity and generalized de Bruijn words	1
Removing redundant refusals: Minimal complete test suites for failure trace semantics	1
Hierarchical identification of nonlinear hybrid systems in a Bayesian framework	1
A periodicity lemma for partial words	1
Learnability and positive equivalence relations	1
Logic for ω-pushdown automata	1
Incentive ratio: A game theoretical analysis of market equilibria	1
Detecting useless transitions in pushdown automata	1
Multi-player games with LDL goals over finite traces	1
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming	1
Costs and rewards in priced timed automata	1
Characterization of exact two-query quantum algorithms	1
A new framework for deniable secure key exchange	1
Biased differential distinguisher – Cryptanalysis of reduced-round SKINNY	1
Usefulness of information and decomposability of unary regular languages	1
Load balanced distributed directories	1
State complexity of GF(2)-operations on unary languages	1
Efficient representation and counting of antipower factors in words	1
A derivational model of discontinuous parsing	1
Choosing the right algorithm with hints from complexity theory	1
Equilibria in multi-player multi-outcome infinite sequential games	1
r-indexing the eBWT	1
Synchronous t-resilient consensus in arbitrary graphs	1
Succinct data structure for path graphs	1
Scooby: Improved multi-party homomorphic secret sharing based on FHE	1
Atomic cross-chain swaps with improved space, time and local time complexities	1
On quotients of formal power series	1
Breaking Goppa-based McEliece with hints	1
Online search with a hint	1
On the complexity of asynchronous freezing cellular automata	1
Self-adjusting grid networks	1
Algorithmic coincidence classification of mesh patterns	1
Narrowing the speedup factor gap of partitioned EDF	1
Converting nondeterministic two-way automata into small deterministic linear-time machines	1
Learners based on transducers	1
Weighted parsing for grammar-based language models over multioperator monoids	1
Time-bounded termination analysis for probabilistic programs with delays	1
Advice hierarchies among finite automata	1
Greibach normal form for ω-algebraic systems and weighted simple ω-pushdown automata	1
Syntactic stochastic processes: Definitions, models, and related inference problems	1
Deterministic algorithms for the hidden subgroup problem	1
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games	1
Higher order monotonicity and submodularity of influence in social networks: From local to global	1
Tasks in modular proofs of concurrent algorithms	1
LZRR: LZ77 parsing with right reference	1
Distributed computability: Relating k-immediate snapshot and x-set agreement	1
Context-free timed formalisms: Robust automata and linear temporal logics	1
A self-stabilizing Hashed Patricia Trie	1
On the computational completeness of matrix simple semi-conditional grammars	1
Granularity of wagers in games and the possibility of saving	1
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric	1
Asymptotic elimination of partially continuous aggregation functions in directed graphical models	1
Nonlinear neural P systems for generating string languages	1
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters	1
Transduction from trees to graphs through folding	1
One-variable fragments of intermediate logics over linear frames	1
On the power of finite ambiguity in Büchi complementation	1
Compact representation of graphs with bounded bandwidth or treedepth	1
Pushdown and Lempel-Ziv depth	1
Cayley polynomial–time computable groups	1
Polynomial interrupt timed automata: Verification and expressiveness	1
Clustering categorical data: Soft rounding k-modes	1
The reflective higher-order calculus: Encodability, typability and separation	1
Eilenberg's variety theorem without Boolean operations	1
On the decidability of the valuedness problem for two-way finite transducers	1
An extended coding theorem with application to quantum complexities	1
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal	1
A decidable and expressive fragment of Many-Sorted First-Order Linear Temporal Logic	1
Abstract processes and conflicts in place/transition systems	1
On hardest languages for one-dimensional cellular automata	1
Regular transducer expressions for regular transformations	1
Early detection of temporal constraint violations	1
Parameter synthesis of polynomial dynamical systems	1
A practical succinct dynamic graph representation	1
On prime scenarios in qualitative spatial and temporal reasoning	1
Geometrically closed positive varieties of languages	1
Slicing techniques for temporal aggregation in spanning event streams	1
On continued fraction randomness and normality	1