Information and Computation

Papers
(The median citation count of Information and Computation is 1. 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 2020-03-01 to 2024-03-01.)
ArticleCitations
Cell-like P systems with evolutional symport/antiport rules and membrane creation46
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle19
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination18
Rule synchronization for tissue P systems15
Revisiting Deutsch-Jozsa algorithm14
A probabilistic calculus of cyber-physical systems12
Neural-like P systems with plasmids12
Computational fuzzy extractors12
A theory of monitors11
Wheeler languages11
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results10
A simplicial complex model for dynamic epistemic logic to study distributed task computability9
PPLite: Zero-overhead encoding of NNC polyhedra9
What's decidable about weighted automata?9
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries8
Bounding the dimension of points on a line8
Reversibility of computations in graph-walking automata8
The computational power of monodirectional tissue P systems with symport rules8
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators8
Arrow update synthesis7
Polymorphic lambda calculus with context-free session types7
A parametric framework for reversible π-calculi7
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees6
Model checking interval temporal logics with regular expressions6
Learning families of algebraic structures from informant6
An algebraic geometric approach to Nivat's conjecture6
Survey on mining signal temporal logic specifications6
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way6
Improved parallel construction of wavelet trees and rank/select structures6
Reachability of scope-bounded multistack pushdown systems5
The complexity of the asynchronous prediction of the majority automata5
Integrated encryption in dynamic arithmetic compression5
Minimum fill-in: Inapproximability and almost tight lower bounds5
Presynthesis of bounded choice-free or fork-attribution nets5
Information leakage due to operative errors in card-based protocols5
Variable-length codes independent or closed with respect to edit relations5
Allocating contiguous blocks of indivisible chores fairly5
Optimal in-place suffix sorting5
Non-normal modal logics and conditional logics: Semantic analysis and proof theory5
Distributional formal semantics4
On the universal steganography of optimal rate4
Efficient pattern matching in elastic-degenerate strings4
Comparison of algorithms for simple stochastic games4
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees4
Hitting forbidden induced subgraphs on bounded treewidth graphs4
Posets with interfaces as a model for concurrency4
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol4
Regular ω-languages with an informative right congruence4
Automated deep abstractions for stochastic chemical reaction networks4
Fast mixing via polymers for random graphs with unbounded degree4
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations4
Ring exploration with myopic luminous robots4
Sensitivity of string compressors and repetitiveness measures4
Rule synchronization for monodirectional tissue-like P systems with channel states4
Determining temporal agreements in cross-organizational business processes4
A universal algorithm for Krull's theorem4
The link-calculus for open multiparty interactions4
Value iteration for simple stochastic games: Stopping criterion and learning algorithm4
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS3
Polylog depth, highness and lowness for E3
Weighted propositional configuration logics: A specification language for architectures with quantitative features3
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency3
Descriptional complexity of iterated uniform finite-state transducers3
On equations and first-order theory of one-relator monoids3
Finite-state strategies in delay games3
Lifting proofs from countable to uncountable mathematics3
Fast scalable construction of ([compressed] static | minimal perfect hash) functions3
Model checking hyperproperties for Markov decision processes3
Fixing monotone Boolean networks asynchronously3
Formal languages over GF(2)3
Advice complexity of treasure hunt in geometric terrains3
Constant-space, constant-randomness verifiers with arbitrarily small error3
The emptiness problem for valence automata over graph monoids3
On the complexity of the stability problem of binary freezing totalistic cellular automata3
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems3
Clairvoyant state machine replication3
Efficient enumeration of three-state two-dimensional number-conserving cellular automata3
Nondeterministic right one-way jumping finite automata3
c-trie++: A dynamic trie tailored for fast prefix searches3
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice3
To be announced3
Learning Mealy machines with one timer3
An improved FPT algorithm for the flip distance problem3
A new foundation for finitary corecursion and iterative algebras3
Faster repetition-aware compressed suffix trees based on Block Trees2
On the cost of unsuccessful searches in search trees with two-way comparisons2
Constant delay traversal of grammar-compressed graphs with bounded rank2
Binary and circular automata having maximal state complexity for the set of synchronizing words2
Complexity of automatic sequences2
Behavioural strategies in weighted Boolean games2
Team equivalences for finite-state machines with silent moves2
Completeness of string analysis for dynamic languages2
Geometric bounds for convergence rates of averaging algorithms2
Static and dynamic property-preserving updates2
Online recognition of dictionary with one gap2
Complexity analysis of a unifying algorithm for model checking interval temporal logic2
Finite-word hyperlanguages2
New characterizations of primitive permutation groups with applications to synchronizing automata2
Pomset bisimulation and unfolding for reset Petri nets2
Slowly synchronizing automata with fixed alphabet size2
Event-based functional decomposition2
Distributed localization of wireless sensor network using communication wheel2
Robust, expressive, and quantitative linear temporal logics: Pick any two for free2
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization2
Beyond the worst-case analysis of random priority: Smoothed and average-case approximation ratios in mechanism design2
Efficient construction of the BWT for repetitive text using string compression2
Preservation of normality by transducers2
State complexity of transforming graph-walking automata to halting, returning and reversible2
Structural properties of NFAs and growth rates of nondeterminism measures2
Turing-completeness of asynchronous non-camouflage cellular automata2
A structured view on weighted counting with relations to counting, quantum computation and applications2
Algorithmic aspects of secure domination in unit disk graphs2
Satisfiability checking for Mission-time LTL (MLTL)2
On the conjugacy problem of cellular automata2
Safe dependency atoms and possibility operators in team semantics2
On the complexity of approximately matching a string to a directed graph2
Query complexity of generalized Simon's problem2
Beyond PCSP(1-in-3,NAE)2
Game-theoretic semantics for ATL+ with applications to model checking2
On the transformation of two-way finite automata to unambiguous finite automata2
Location automata for regular expressions with shuffle and intersection2
The complexity of regex crosswords2
Asymptotics of the number of 2-threshold functions2
Randomness and uniform distribution modulo one2
Specification and optimal reactive synthesis of run-time enforcement shields2
Fairness and communication-based semantics for session-typed languages2
Operational union-complexity2
Streaming k-mismatch with error correcting and applications2
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement2
Optimizing reachability sets in temporal graphs by delaying2
Logical vs. behavioural specifications2
On fast pattern formation by autonomous robots2
Elementary, finite and linear vN-regular cellular automata2
Exploiting social influence to control elections based on positional scoring rules2
Uniform van Lambalgen's theorem fails for computable randomness2
Timed hyperproperties2
On finite-index indexed grammars and their restrictions2
Dynamics of reputation in mobile agents systems and weighted timed automata2
Combination of roots and boolean operations: An application to state complexity2
Biased differential distinguisher – Cryptanalysis of reduced-round SKINNY1
Distributed computability: Relating k-immediate snapshot and x-set agreement1
Bisimulation metrics and norms for real-weighted automata1
Learnability and positive equivalence relations1
Consensus string problem for multiple regular languages1
Time-bounded termination analysis for probabilistic programs with delays1
Simple and fast approximate counting and leader election in populations1
Eilenberg's variety theorem without Boolean operations1
A compressed dynamic self-index for highly repetitive text collections1
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal1
On continued fraction randomness and normality1
An extended coding theorem with application to quantum complexities1
Weighted parsing for grammar-based language models over multioperator monoids1
Transformation of variants of Petri nets into context-dependent fusion grammars1
A new class of string transformations for compressed text indexing1
Bounded complete domains and their logical form1
Nonlinear neural P systems for generating string languages1
On tightness of Tsaknakis-Spirakis descent methods for approximate Nash equilibria1
McCarthy-Kleene fuzzy automata and MSO logics1
To drive or not to drive: A logical and computational analysis of European transport regulations1
Temporal logics with language parameters1
On linear languages recognized by deterministic biautomata1
A practical succinct dynamic graph representation1
Reachability problems in low-dimensional nondeterministic polynomial maps over integers1
Polynomial interrupt timed automata: Verification and expressiveness1
The Caucal hierarchy: Interpretations in the (W)MSO+U logic1
Parameter synthesis of polynomial dynamical systems1
Complexity thresholds in inclusion logic1
Extremal synchronizing circular automata1
The refinement calculus of reactive systems1
Higher order monotonicity and submodularity of influence in social networks: From local to global1
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond1
Greibach normal form for ω-algebraic systems and weighted simple ω-pushdown automata1
Recent developments in theory and tool support for hybrid systems verification with HyPro1
On the Weisfeiler-Leman dimension of fractional packing1
Counting (Watson-Crick) palindromes in Watson-Crick conjugates1
Regular transducer expressions for regular transformations1
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning1
Logic for ω-pushdown automata1
Advice hierarchies among finite automata1
Granularity of wagers in games and the possibility of saving1
Detecting useless transitions in pushdown automata1
Principal abstract families of weighted tree languages1
Narrowing the speedup factor gap of partitioned EDF1
A periodicity lemma for partial words1
Distributability of mobile ambients1
Cayley polynomial–time computable groups1
Syntactic stochastic processes: Definitions, models, and related inference problems1
Context-free timed formalisms: Robust automata and linear temporal logics1
Non-closure under complementation for unambiguous linear grammars1
Linear-time parameterized algorithms with limited local resources1
Dynamic branching in qualitative constraint-based reasoning via counting local models1
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric1
Usefulness of information and decomposability of unary regular languages1
Traceable constant-size multi-authority credentials1
Computational completeness of sequential spiking neural P systems with inhibitory rules1
Efficient representation and counting of antipower factors in words1
Approximate minimization of weighted tree automata1
On the termination of dynamics in sequential games1
A self-stabilizing Hashed Patricia Trie1
Default logic and bounded treewidth1
Equilibria in multi-player multi-outcome infinite sequential games1
Enumeration of two dimensional palindromes1
Fast polynomial inversion for post quantum QC-MDPC cryptography1
On the spread of influence in graphs1
On the computational completeness of matrix simple semi-conditional grammars1
On hardest languages for one-dimensional cellular automata1
Costs and rewards in priced timed automata1
Slicing techniques for temporal aggregation in spanning event streams1
On the existence of weak subgame perfect equilibria1
Abstract processes and conflicts in place/transition systems1
Load balanced distributed directories1
Regular matching and inclusion on compressed tree patterns with constrained context variables1
Language models for some extensions of the Lambek calculus1
HR-SQL: Extending SQL with hypothetical reasoning and improved recursion for current database systems1
A decidable and expressive fragment of Many-Sorted First-Order Linear Temporal Logic1
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters1
Branching interval algebra: An almost complete picture1
Learners based on transducers1
Incentive ratio: A game theoretical analysis of market equilibria1
Probabilistic automata of bounded ambiguity1
Exploring sparse graphs with advice1
A derivational model of discontinuous parsing1
Search by a metamorphic robotic system in a finite 2D square Grid1
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs1
Converting nondeterministic two-way automata into small deterministic linear-time machines1
Noisy beeping networks1
Effective notions of weak convergence of measures on the real line1
Compact representation of graphs with bounded bandwidth or treedepth1
Geometrically closed positive varieties of languages1
Asymptotic elimination of partially continuous aggregation functions in directed graphical models1
Exorcising the phantom zone1
Weighted models for higher-order computation1
LTL falsification in infinite-state systems1
Hennessy-Milner properties via topological compactness1
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past1
LZRR: LZ77 parsing with right reference1
0.062088966369629