default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 521
Volume 521, February 2014
- Márcia R. Cappelle, Lucia Draque Penso, Dieter Rautenbach:
Recognizing some complementary products. 1-7 - Sándor Vágvölgyi:
Tree shuffle. 8-28 - Maxime Crochemore
, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting powers and periods in a word from its runs structure. 29-41 - Hung-Lung Wang, Kuan-Yu Chen:
One-dimensional approximate point set pattern matching with Lp-norm. 42-50 - Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO is hard, even for a single player. 51-61 - Taibo Luo, Yinfeng Xu, Li Luo, Changzheng He:
Semi-online scheduling with two GoS levels and unit processing time. 62-72 - Andrey Grinshpun, Pakawat Phalitnonkiat, Sasha Rubin, Andrei Tarfulea:
Alternating traps in Muller and parity games. 73-91 - Robert Sámal, Tomás Valla:
The guarding game is E-complete. 92-106 - Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the hardness of network design for bottleneck routing games. 107-122
- Ling Lin, Zhiyi Tan:
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis. 123-134
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
