The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- An algorithmic framework for network reconstruction (Q548474) (← links)
- Parameter estimation for Boolean models of biological networks (Q548478) (← links)
- Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures (Q548479) (← links)
- Component-based construction of bio-pathway models: the parameter estimation problem (Q548481) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- IDD-based model validation of biochemical networks (Q548487) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- Interface theories for concurrency and data (Q549177) (← links)
- A calculus for four-valued sequential logic (Q549178) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Brouwer's \(\epsilon\)-fixed point and Sperner's lemma (Q549181) (← links)
- On the algebra of structured specifications (Q549182) (← links)
- On equal \(\mu \)-terms (Q549186) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- The correctness of Newman's typability algorithm and some of its extensions (Q549191) (← links)
- Verification of mobile ad hoc networks: an algebraic approach (Q549194) (← links)
- On cool congruence formats for weak bisimulations (Q549196) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- Probabilities, distribution monads, and convex categories (Q549198) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- Metrics for weighted transition systems: axiomatization and complexity (Q549202) (← links)
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) (Q549205) (← links)
- Continuity of operators on continuous and discrete time streams (Q549207) (← links)
- On the ambiguation of Polish notation (Q549208) (← links)
- Directional dynamics along arbitrary curves in cellular automata (Q549696) (← links)
- Generalized Besicovitch and Weyl spaces: topology, patterns, and sliding block codes (Q549697) (← links)
- Positive expansiveness versus network dimension in symbolic dynamical systems (Q549698) (← links)
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata (Q549699) (← links)
- Bulking I: An abstract theory of bulking (Q549700) (← links)
- Bulking II: Classifications of cellular automata (Q549701) (← links)
- Traced communication complexity of cellular automata (Q549703) (← links)
- Cellular automata with limited inter-cell bandwidth (Q549704) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- Stochastic minority on graphs (Q549711) (← links)
- On the complexity of sandpile critical avalanches (Q549714) (← links)
- Theories of initial segments of standard models of arithmetics and their complete extensions (Q549718) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases (Q549726) (← links)
- Special issue: Stability, safety, and security of distributed systems (SSS 2009). Selected papers based on the presentations at the 11th international symposium, Lyon, France, November 3--6, 2009. (Q550688) (← links)
- Return time complexity of Sturmian sequences (Q551163) (← links)
- Dynamic FTSS in asynchronous systems: the case of unison (Q551164) (← links)
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
- Multiplication of polynomials modulo \(x^n\) (Q551166) (← links)
- Recognisability for algebras of infinite trees (Q551167) (← links)
