The following pages link to Theory of Computing Systems (Q169698):
Displayed 50 items.
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Speed scaling for maximum lateness (Q255271) (← links)
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- The outer-connected domination number of Sierpiński-like graphs (Q255280) (← links)
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Erratum to: ``Top-down tree transducers with regular look-ahead'' (Q255287) (← links)
- Foreword of the special issue dedicated to the 2013 workshop on approximation and online algorithms (Q260243) (← links)
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Min-sum 2-paths problems (Q260263) (← links)
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Online knapsack revisited (Q260271) (← links)
- On two continuum armed bandit problems in high dimensions (Q260274) (← links)
- Optimal probabilistic generation of XML documents (Q269313) (← links)
- On the data complexity of consistent query answering (Q269317) (← links)
- Certain answers over incomplete XML documents: extending tractability boundary (Q269320) (← links)
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Parallel skyline queries (Q269332) (← links)
- Deciding confluence for a simple class of relational transducer networks (Q269334) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Lower bounds on the error of query sets under the differentially-private matrix mechanism (Q269340) (← links)
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- XML compression via directed acyclic graphs (Q269349) (← links)
- Editorial: Special issue on computability, complexity and randomness (Q285504) (← links)
- Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials (Q285507) (← links)
- Normality and finite-state dimension of Liouville numbers (Q285510) (← links)
- On stability of probability laws with respect to small violations of algorithmic randomness (Q285512) (← links)
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
- Reducibilities relating to Schnorr randomness (Q285517) (← links)
- Algorithmic minimal sufficient statistics: a new approach (Q285518) (← links)
- Relating and contrasting plain and prefix Kolmogorov complexity (Q285520) (← links)
- Preface of STACS 2013 special issue (Q290896) (← links)
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- Approximate comparison of functions computed by distance automata (Q290904) (← links)
- Regular languages of thin trees (Q290908) (← links)
- Automaton semigroups: the two-state case. (Q290910) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)