OOIR: Observatory of International Research

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-03-01 to 2024-03-01.)

Article	Citations
Cell-like P systems with evolutional symport/antiport rules and membrane creation	46
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle	19
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination	18
Rule synchronization for tissue P systems	15
Revisiting Deutsch-Jozsa algorithm	14
Neural-like P systems with plasmids	12
Computational fuzzy extractors	12
A probabilistic calculus of cyber-physical systems	12
Wheeler languages	11
A theory of monitors	11
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results	10
What's decidable about weighted automata?	9
A simplicial complex model for dynamic epistemic logic to study distributed task computability	9
PPLite: Zero-overhead encoding of NNC polyhedra	9
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators	8
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries	8
Bounding the dimension of points on a line	8
Reversibility of computations in graph-walking automata	8
The computational power of monodirectional tissue P systems with symport rules	8
Polymorphic lambda calculus with context-free session types	7
A parametric framework for reversible π-calculi	7
Arrow update synthesis	7
Learning families of algebraic structures from informant	6
An algebraic geometric approach to Nivat's conjecture	6
Survey on mining signal temporal logic specifications	6

Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way	6
Improved parallel construction of wavelet trees and rank/select structures	6
On enumerating algorithms of novel multiple leaf-distance granular regular α-subtrees of trees	6
Model checking interval temporal logics with regular expressions	6
Presynthesis of bounded choice-free or fork-attribution nets	5
Information leakage due to operative errors in card-based protocols	5
Variable-length codes independent or closed with respect to edit relations	5
Allocating contiguous blocks of indivisible chores fairly	5
Optimal in-place suffix sorting	5
Non-normal modal logics and conditional logics: Semantic analysis and proof theory	5
Reachability of scope-bounded multistack pushdown systems	5
The complexity of the asynchronous prediction of the majority automata	5
Integrated encryption in dynamic arithmetic compression	5
Minimum fill-in: Inapproximability and almost tight lower bounds	5
Automated deep abstractions for stochastic chemical reaction networks	4
Fast mixing via polymers for random graphs with unbounded degree	4
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations	4
Ring exploration with myopic luminous robots	4
Sensitivity of string compressors and repetitiveness measures	4
Rule synchronization for monodirectional tissue-like P systems with channel states	4
Determining temporal agreements in cross-organizational business processes	4
A universal algorithm for Krull's theorem	4
The link-calculus for open multiparty interactions	4
Value iteration for simple stochastic games: Stopping criterion and learning algorithm	4
Distributional formal semantics	4
On the universal steganography of optimal rate	4
Efficient pattern matching in elastic-degenerate strings	4
Comparison of algorithms for simple stochastic games	4
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees	4
Hitting forbidden induced subgraphs on bounded treewidth graphs	4
Posets with interfaces as a model for concurrency	4
Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol	4
Regular ω-languages with an informative right congruence	4
Advice complexity of treasure hunt in geometric terrains	3
Constant-space, constant-randomness verifiers with arbitrarily small error	3
The emptiness problem for valence automata over graph monoids	3
On the complexity of the stability problem of binary freezing totalistic cellular automata	3
Combining multi-target regression deep neural networks and kinetic modeling to predict relative fluxes in reaction systems	3
Clairvoyant state machine replication	3
Efficient enumeration of three-state two-dimensional number-conserving cellular automata	3
Nondeterministic right one-way jumping finite automata	3
c-trie++: A dynamic trie tailored for fast prefix searches	3
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice	3
To be announced	3
Learning Mealy machines with one timer	3
An improved FPT algorithm for the flip distance problem	3
A new foundation for finitary corecursion and iterative algebras	3
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS	3
Polylog depth, highness and lowness for E	3
Weighted propositional configuration logics: A specification language for architectures with quantitative features	3

Multi-server verifiable delegation of computations: Unconditional security and practical efficiency	3
Descriptional complexity of iterated uniform finite-state transducers	3
On equations and first-order theory of one-relator monoids	3
Finite-state strategies in delay games	3
Lifting proofs from countable to uncountable mathematics	3
Fast scalable construction of ([compressed] static \| minimal perfect hash) functions	3
Model checking hyperproperties for Markov decision processes	3
Fixing monotone Boolean networks asynchronously	3
Formal languages over GF(2)	3
Distributed localization of wireless sensor network using communication wheel	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
Efficient construction of the BWT for repetitive text using string compression	2
Preservation of normality by transducers	2
State complexity of transforming graph-walking automata to halting, returning and reversible	2
Structural properties of NFAs and growth rates of nondeterminism measures	2
Turing-completeness of asynchronous non-camouflage cellular automata	2
A structured view on weighted counting with relations to counting, quantum computation and applications	2
Algorithmic aspects of secure domination in unit disk graphs	2
On the conjugacy problem of cellular automata	2
Satisfiability checking for Mission-time LTL (MLTL)	2
Safe dependency atoms and possibility operators in team semantics	2
On the transformation of two-way finite automata to unambiguous finite automata	2
On the complexity of approximately matching a string to a directed graph	2
Query complexity of generalized Simon's problem	2
Beyond PCSP(1-in-3,NAE)	2
Game-theoretic semantics for ATL+ with applications to model checking	2
Location automata for regular expressions with shuffle and intersection	2
The complexity of regex crosswords	2
Asymptotics of the number of 2-threshold functions	2
Randomness and uniform distribution modulo one	2
Specification and optimal reactive synthesis of run-time enforcement shields	2
Fairness and communication-based semantics for session-typed languages	2
Operational union-complexity	2
Streaming k-mismatch with error correcting and applications	2
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement	2
Logical vs. behavioural specifications	2
Optimizing reachability sets in temporal graphs by delaying	2
Elementary, finite and linear vN-regular cellular automata	2
On fast pattern formation by autonomous robots	2
Dynamics of reputation in mobile agents systems and weighted timed automata	2
Exploiting social influence to control elections based on positional scoring rules	2
Uniform van Lambalgen's theorem fails for computable randomness	2
Timed hyperproperties	2
On finite-index indexed grammars and their restrictions	2
Combination of roots and boolean operations: An application to state complexity	2
Faster repetition-aware compressed suffix trees based on Block Trees	2
On the cost of unsuccessful searches in search trees with two-way comparisons	2
Constant delay traversal of grammar-compressed graphs with bounded rank	2
Binary and circular automata having maximal state complexity for the set of synchronizing words	2
Complexity of automatic sequences	2
Behavioural strategies in weighted Boolean games	2
Team equivalences for finite-state machines with silent moves	2
Completeness of string analysis for dynamic languages	2
Static and dynamic property-preserving updates	2
Geometric bounds for convergence rates of averaging algorithms	2
Complexity analysis of a unifying algorithm for model checking interval temporal logic	2
Online recognition of dictionary with one gap	2
Slowly synchronizing automata with fixed alphabet size	2
Robust, expressive, and quantitative linear temporal logics: Pick any two for free	2
Finite-word hyperlanguages	2
New characterizations of primitive permutation groups with applications to synchronizing automata	2
Pomset bisimulation and unfolding for reset Petri nets	2
Event-based functional decomposition	2