Works matching IS 14324350 AND DT 2022 AND VI 66 AND IP 4
Results: 7
The Complexity of Unavoidable Word Patterns.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 802, doi. 10.1007/s00224-022-10090-z
- By:
- Publication type:
- Article
Non-Existence of Stable Social Groups in Information-Driven Networks.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 758, doi. 10.1007/s00224-022-10089-6
- By:
- Publication type:
- Article
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 847, doi. 10.1007/s00224-022-10087-8
- By:
- Publication type:
- Article
Second-Order Finite Automata.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 861, doi. 10.1007/s00224-022-10085-w
- By:
- Publication type:
- Article
Nonuniform Reductions and NP-Completeness.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 743, doi. 10.1007/s00224-022-10083-y
- By:
- Publication type:
- Article
Graph Square Roots of Small Distance from Degree One Graphs.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 821, doi. 10.1007/s00224-022-10079-8
- By:
- Publication type:
- Article
Mechanism Design for Perturbation Stable Combinatorial Auctions.
- Published in:
- Theory of Computing Systems, 2022, v. 66, n. 4, p. 778, doi. 10.1007/s00224-022-10078-9
- By:
- Publication type:
- Article