The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Non-confluence in divisionless P systems with active membranes (Q847664) (← links)
- Criterion of calibration for transductive confidence machine with limited feedback (Q860820) (← links)
- Well-calibrated predictions from on-line compression models (Q860821) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- RealLife: the continuum limit of larger than life cellular automata (Q870839) (← links)
- Fitness landscape of the cellular automata majority problem: view from the ``Olympus'' (Q884450) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Model checking computation tree logic over finite lattices (Q896917) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Extending the metric dimension to graphs with missing edges (Q897908) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Soft constraint abstraction based on semiring homomorphism (Q944369) (← links)
- Synapses as stochastic concurrent systems (Q959792) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- Inapproximability results for equations over infinite groups (Q974745) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Polynomial summaries of positive semidefinite kernels (Q1017663) (← links)
- Moves and displacements of particular elements in quicksort (Q1019745) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Succinct representation of regular languages by Boolean automata. II (Q1068549) (← links)
- The intractability of resolution (Q1071750) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- CTS systems and Petri nets (Q1085981) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Stationary deterministic flows: II. The Single-server queue (Q1097690) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Observations concerning a public-key cryptosystem based on iterated morphisms (Q1121851) (← links)
- On the number of arithmetical operations for finding Fibonacci numbers (Q1123222) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- List scheduling in the presence of branches. A theoretical evaluation (Q1128736) (← links)
- Polymorphic syntax definition (Q1129122) (← links)
- A decision procedure for the order of regular events (Q1132636) (← links)
- On the average number of rebalancing operations in weight-balanced trees (Q1140428) (← links)
- Selection and sorting with limited storage (Q1143174) (← links)
- Evaluation and comparison of two efficient probabilistic primality testing algorithms (Q1144064) (← links)
- The complexity of logical theories (Q1159661) (← links)
- Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
