The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Parameter estimation for Boolean models of biological networks (Q548478) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Linear logic (Q579249) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Orderings for term-rewriting systems (Q593789) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- Negative selection algorithms on strings with efficient training and linear-time classification (Q627104) (← links)
- From individuals to populations: a mean field semantics for process algebra (Q633693) (← links)
- Runtime analysis of the 1-ANT ant colony optimizer (Q633703) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- A timed calculus for wireless systems (Q650891) (← links)
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Redundancy of minimal weight expansions in Pisot bases (Q653321) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Reversible simulation of one-dimensional irreversible cellular automata (Q672388) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Mellin transforms and asymptotics: Finite differences and Rice's integrals (Q672985) (← links)
- Analysis of an optimized search algorithm for skip lists (Q672990) (← links)
- A brief history of Timed CSP (Q674191) (← links)
- Fixed points without completeness (Q674192) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- The complexity of computing the MCD-estimator (Q703560) (← links)
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- The complexity of Euler's integer partition theorem (Q714811) (← links)
- Consistency of multidimensional combinatorial substitutions (Q714822) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Iterative algebras (Q789385) (← links)
- On inherently ambiguous E0L languages (Q796996) (← links)
- Petri nets and algebraic specifications (Q804305) (← links)
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead (Q805244) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
