The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Simulation relations for alternating Büchi automata (Q557801) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Gathering of asynchronous robots with limited visibility (Q557818) (← links)
- Factors of characteristic words of irrational numbers (Q557819) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- On the completeness and decidability of duration calculus with iteration (Q557828) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- The plurality problem with three colors and more. (Q557833) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- The complexity of Fibonacci-like kneading sequences (Q557842) (← links)
- Approximation of Walrasian equilibrium in single-minded auctions (Q557845) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- Using data-independence in the analysis of intrusion detection systems (Q557891) (← links)
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- The super connectivity of the pancake graphs and the super laceability of the star graphs (Q557901) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- On queuing lengths in on-line switching (Q557908) (← links)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group (Q557909) (← links)
- Divisibility problem for one relator monoids (Q557910) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
- A proof of the extended Duval's conjecture (Q557916) (← links)
- Sequences of linear arithmetical complexity (Q557917) (← links)
- Sturmian words and a criterium by Michaux-Villemaire (Q557919) (← links)
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- The algebra of binary search trees (Q557924) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
