The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Longest common extensions in trees (Q294947) (← links)
- Order-preserving indexing (Q294954) (← links)
- Approximate string matching using a bidirectional index (Q294959) (← links)
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Minimal consistent DFA revisited (Q306711) (← links)
- Algorithms for interactive Sprouts (Q307772) (← links)
- Forewords: Special issue on theory and applications of graph searching problems (Q343920) (← links)
- Mahler measures, short walks and log-sine integrals (Q384990) (← links)
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Proof theory for locally finite many-valued logics: semi-projective logics (Q385019) (← links)
- Complexity of Canadian traveler problem variants (Q386993) (← links)
- Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices (Q387802) (← links)
- Tackling continuous state-space explosion in a Markovian process algebra (Q387988) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- General time consistent discounting (Q391749) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- Efficient routing in carrier-based mobile networks (Q392206) (← links)
- Preface: Discrete mathematical structures: from dynamics to complexity (Q393143) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- A quadratic lower bound for topswops (Q410720) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- A study of the neutrality of Boolean function landscapes in genetic programming (Q418025) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Relativized codes (Q418759) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- Universal pattern generation by cellular automata (Q418784) (← links)
- A distance between populations for one-point crossover in genetic algorithms (Q418792) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Using minimal absent words to build phylogeny (Q442159) (← links)
- String matching with variable length gaps (Q442239) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Genetic and evolutionary computation (Q477076) (← links)
- The black paper of quantum cryptography: real implementation problems (Q477167) (← links)
- Generating square-free words efficiently (Q496050) (← links)
- Analysis and design of molecular machines (Q498934) (← links)
- A generalized neighborhood for cellular automata (Q511006) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
