default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 482
Volume 482, April 2013
- James D. Currie:
Infinite ternary square-free words concatenated from permutations of a single word. 1-8 - Xujin Chen, Leah Epstein, Elena Kleiman, Rob van Stee:
Maximizing the minimum load: The cost of selfishness. 9-19 - Petr A. Golovach
, Dieter Kratsch, Daniël Paulusma:
Detecting induced minors in AT-free graphs. 20-32 - Yasushi Kawase, Kazuhisa Makino:
Nash equilibria with minimum potential in undirected broadcast games. 33-47 - Salvador Roura:
Fibonacci BSTs: A new balancing method for binary search trees. 48-59 - Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo:
Space-efficient data-analysis queries on grids. 60-72 - Sanjay Jain, Eric Martin, Frank Stephan:
Learning and classifying. 73-85 - Kim Thang Nguyen:
NPNP-hardness of pure Nash equilibrium in Scheduling and Network Design Games. 86-95 - Adam Woryna:
The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata. 96-110
- Xiumei Wang, Yixun Lin:
Three-matching intersection conjecture for perfect matching polytopes of small dimensions. 111-114
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-04-10 21:06 CEST 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:
