The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Looking at the stars (Q820158) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- On synchronization and orientation in distributed barrier coverage with relocatable sensors (Q820528) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
- The \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* model (Q820540) (← links)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- A new construction of odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity (Q820554) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Which is the fairest allocation in the max-min fairness-based coalitional game? (Q820567) (← links)
- Reliability analysis of the cactus-based networks (Q820572) (← links)
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes (Q820573) (← links)
- On the proper orientation number of chordal graphs (Q820574) (← links)
- Comparing consecutive letter counts in multiple context-free languages (Q831122) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- Profit maximization for competitive social advertising (Q831129) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Distance domains: continuity (Q831143) (← links)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- Relation between powers of factors and the recurrence function characterizing Sturmian words (Q837150) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- A Curtis-Hedlund-Lyndon theorem for Besicovitch and Weyl spaces (Q837152) (← links)
- Two non-holonomic lattice walks in the quarter plane (Q837153) (← links)
- Optimally competitive list batching (Q837154) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words (Q837156) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- Conservation of some dynamical properties for operations on cellular automata (Q837159) (← links)
- On the relative dominance of paging algorithms (Q837160) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- On the uniqueness of shuffle on words and finite languages (Q837162) (← links)
- Accelerating certain outputs of merging and sorting networks (Q837163) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- New permutation coding and equidistribution of set-valued statistics (Q837165) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
