A bidirectional reduction between suffix random access and function inversion enables improved asymmetric streaming algorithms for exact/approximate pattern matching and relative Lempel-Ziv compression.
On approximate pure Nash equi- libria in weighted congestion games with polynomial latencies
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
other 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
Establishes PLS-completeness for lexicographic local search in 4-CNF and 3-CNF (double flips), and for Abelian permutation orbit minimization even when groups are cyclic or consist of involutions, with applications to bounded congestion games.
citing papers explorer
-
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
A bidirectional reduction between suffix random access and function inversion enables improved asymmetric streaming algorithms for exact/approximate pattern matching and relative Lempel-Ziv compression.