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 2020-11-01 to 2024-11-01.)
ArticleCitations
Cell-like P systems with evolutional symport/antiport rules and membrane creation50
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle28
Rule synchronization for tissue P systems16
Revisiting Deutsch-Jozsa algorithm16
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results16
Neural-like P systems with plasmids16
Survey on mining signal temporal logic specifications14
Wheeler languages13
Computational fuzzy extractors13
A probabilistic calculus of cyber-physical systems13
PPLite: Zero-overhead encoding of NNC polyhedra12
A theory of monitors12
The computational power of monodirectional tissue P systems with symport rules10
A simplicial complex model for dynamic epistemic logic to study distributed task computability10
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries10
Arrow update synthesis9
Learning families of algebraic structures from informant9
Polymorphic lambda calculus with context-free session types9
What's decidable about weighted automata?9
Bounding the dimension of points on a line8
Comparison of algorithms for simple stochastic games8
Value iteration for simple stochastic games: Stopping criterion and learning algorithm8
Reversibility of computations in graph-walking automata8
Integrated encryption in dynamic arithmetic compression8
Nondeterministic right one-way jumping finite automata7
A parametric framework for reversible π-calculi7
Posets with interfaces as a model for concurrency7
Information leakage due to operative errors in card-based protocols7
Rule synchronization for monodirectional tissue-like P systems with channel states6
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way6
Sensitivity of string compressors and repetitiveness measures6
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees6
Efficient pattern matching in elastic-degenerate strings6
Allocating contiguous blocks of indivisible chores fairly6
Optimal in-place suffix sorting6
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees5
Hitting forbidden induced subgraphs on bounded treewidth graphs5
To be announced5
A universal algorithm for Krull's theorem5
Reachability of scope-bounded multistack pushdown systems5
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice5
Variable-length codes independent or closed with respect to edit relations5
Automated deep abstractions for stochastic chemical reaction networks5
Computational completeness of sequential spiking neural P systems with inhibitory rules5
Beyond PCSP(1-in-3,NAE)5
Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs5
Non-normal modal logics and conditional logics: Semantic analysis and proof theory5
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency4
Deterministic quantum search with adjustable parameters: Implementations and applications4
The emptiness problem for valence automata over graph monoids4
Regular ω-languages with an informative right congruence4
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems4
Fast mixing via polymers for random graphs with unbounded degree4
Ring exploration with myopic luminous robots4
Descriptional complexity of iterated uniform finite-state transducers4
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol4
Determining temporal agreements in cross-organizational business processes4
Robust, expressive, and quantitative linear temporal logics: Pick any two for free4
Distributional formal semantics4
Formal languages over GF(2)4
On equations and first-order theory of one-relator monoids4
On the universal steganography of optimal rate4
Learning Mealy machines with one timer4
The link-calculus for open multiparty interactions4
On the complexity of approximately matching a string to a directed graph3
The complexity of regex crosswords3
Exploiting social influence to control elections based on positional scoring rules3
Clairvoyant state machine replication3
On finite-index indexed grammars and their restrictions3
Model checking hyperproperties for Markov decision processes3
Query complexity of generalized Simon's problem3
Advice complexity of treasure hunt in geometric terrains3
On the Weisfeiler-Leman dimension of fractional packing3
Probabilistic automata of bounded ambiguity3
Lifting proofs from countable to uncountable mathematics3
Complexity analysis of a unifying algorithm for model checking interval temporal logic3
Complexity of automatic sequences3
Noisy beeping networks3
Team equivalences for finite-state machines with silent moves3
Distributability of mobile ambients3
Weighted propositional configuration logics: A specification language for architectures with quantitative features3
Constant-space, constant-randomness verifiers with arbitrarily small error3
Branching interval algebra: An almost complete picture3
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past3
Dynamics of reputation in mobile agents systems and weighted timed automata3
Distributed localization of wireless sensor network using communication wheel3
LTL falsification in infinite-state systems3
Structural properties of NFAs and growth rates of nondeterminism measures3
Timed hyperproperties3
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS3
c-trie++: A dynamic trie tailored for fast prefix searches3
On the cost of unsuccessful searches in search trees with two-way comparisons3
Location automata for regular expressions with shuffle and intersection3
Efficient construction of the BWT for repetitive text using string compression3
An improved FPT algorithm for the flip distance problem3
Pomset bisimulation and unfolding for reset Petri nets2
Safe dependency atoms and possibility operators in team semantics2
Principal abstract families of weighted tree languages2
Weighted models for higher-order computation2
Exploring sparse graphs with advice2
Preservation of normality by transducers2
Approximate minimization of weighted tree automata2
Static and dynamic property-preserving updates2
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
The membership problem for subsemigroups of GL<2
Bisimulation metrics and norms for real-weighted automata2
Behavioural strategies in weighted Boolean games2
Completeness of string analysis for dynamic languages2
On the spread of influence in graphs2
The bang calculus revisited2
The refinement calculus of reactive systems2
Traceable constant-size multi-authority credentials2
Approximating the directed path partition problem2
Slowly synchronizing automata with fixed alphabet size2
Finite-word hyperlanguages2
Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class2
On the transformation of two-way finite automata to unambiguous finite automata2
Linear-time parameterized algorithms with limited local resources2
The ideal view on Rackoff's coverability technique2
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond2
A structured view on weighted counting with relations to counting, quantum computation and applications2
Asymptotics of the number of 2-threshold functions2
On the existence of weak subgame perfect equilibria2
Exorcising the phantom zone2
Fairness and communication-based semantics for session-typed languages2
Dynamic branching in qualitative constraint-based reasoning via counting local models2
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement2
Nearest neighbor representations of Boolean functions2
State complexity of transforming graph-walking automata to halting, returning and reversible2
To drive or not to drive: A logical and computational analysis of European transport regulations2
Satisfiability checking for Mission-time LTL (MLTL)2
Bounded complete domains and their logical form2
Algorithmic aspects of secure domination in unit disk graphs2
New characterizations of primitive permutation groups with applications to synchronizing automata2
On fast pattern formation by autonomous robots2
Game-theoretic semantics for ATL+ with applications to model checking2
A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption2
Geometric bounds for convergence rates of averaging algorithms2
Reachability problems in low-dimensional nondeterministic polynomial maps over integers2
Optimizing reachability sets in temporal graphs by delaying2
Default logic and bounded treewidth2
Faster repetition-aware compressed suffix trees based on Block Trees2
Combination of roots and boolean operations: An application to state complexity2
Randomness and uniform distribution modulo one2
Complexity thresholds in inclusion logic2
Counting (Watson-Crick) palindromes in Watson-Crick conjugates2
Operational union-complexity2
Specification and optimal reactive synthesis of run-time enforcement shields2
A robust class of linear recurrence sequences2
Binary and circular automata having maximal state complexity for the set of synchronizing words2
Non-closure under complementation for unambiguous linear grammars2
On linear languages recognized by deterministic biautomata2
Recent developments in theory and tool support for hybrid systems verification with HyPro2
Online recognition of dictionary with one gap2
Language models for some extensions of the Lambek calculus2
0.064810037612915