The following pages link to Theory of Computing Systems (Q169698):
Displaying 50 items.
- 2-stack sorting is polynomial (Q2363966) (← links)
- Special issue: Fixed-parameter tractability. Selected papers based on the presentations at the seminar `Exact algorithms and fixed-parameter tractability', Dagstuhl, Germany, July 2005. (Q2382589) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Built-in coloring for highly-concurrent doubly-linked lists (Q2392250) (← links)
- On rationality of verbal subsets in a group (Q2392251) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- On the generic undecidability of the halting problem for normalized Turing machines (Q2398210) (← links)
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems (Q2398211) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Games for active XML revisited (Q2402614) (← links)
- Asymptotic determinacy of path queries using union-of-paths views (Q2402616) (← links)
- From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
- Optimal broadcasting strategies for conjunctive queries over distributed data (Q2402618) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Online regenerator placement (Q2408557) (← links)
- On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Adversarial multiple access channels with individual injection rates (Q2408561) (← links)
- The parameterized space complexity of embedding along a path (Q2408562) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs (Q2408565) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- The query complexity of witness finding (Q2411034) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy (Q2411037) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- Guest editorial: Computer science symposium in Russia (Q2411039) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
- Some properties of antistochastic strings (Q2411042) (← links)
- Rewriting higher-order stack trees (Q2411043) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
