The following pages link to Theory of Computing Systems (Q169698):
Displaying 50 items.
- Online scheduling FIFO policies with admission and push-out (Q255276) (← links)
- Online knapsack revisited (Q260271) (← links)
- Regular languages of thin trees (Q290908) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Nominal monoids (Q372971) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
- The complexity of finding effectors (Q519899) (← links)
- Sophistication vs logical depth (Q519900) (← links)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable (Q538463) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Guessing bank PINs by winning a mastermind game (Q692940) (← links)
- Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Distributed streams algorithms for sliding windows (Q706324) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups (Q722220) (← links)
- Computation and logic in the real world: CiE 2007 (Q733735) (← links)
- Depth as randomness deficiency (Q733740) (← links)
- On-line stream merging with max span and min coverage (Q814921) (← links)
- Efficient data storage in large nanoarrays (Q814927) (← links)
- Dynamic analysis of the arrow distributed protocol (Q863197) (← links)
- The effect of faults on network expansion (Q863198) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- Arithmetic complexity, Kleene closure, and formal power series (Q1405781) (← links)
- On multidimensional curves with Hilbert property (Q1587370) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- Limits of schema mappings (Q1650918) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- A generalized characterization of algorithmic probability (Q1694008) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Finite-state independence (Q1787949) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Limit complexities revisited (Q1959396) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- CSR 2018 special issue on TOCS (Q2300618) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
