Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=482
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinite ternary square-free words concatenated from permutations of a single word
James Currie
Theoretical Computer Science
482
, 2013, pp. 1-8
Maximizing the minimum load: The cost of selfishness
Xujin Chen
,
Leah Epstein
,
Elena Kleiman
,
Rob van Stee
Theoretical Computer Science
482
, 2013, pp. 9-19
Detecting induced minors in AT-free graphs
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Theoretical Computer Science
482
, 2013, pp. 20-32
Nash equilibria with minimum potential in undirected broadcast games
Yasushi Kawase
,
Kazuhisa Makino
Theoretical Computer Science
482
, 2013, pp. 33-47
Fibonacci BSTs: A new balancing method for binary search trees
Salvador Roura
Theoretical Computer Science
482
, 2013, pp. 48-59
Space-efficient data-analysis queries on grids
Gonzalo Navarro
,
Yakov Nekrich
,
Luís M.S. Russo
Theoretical Computer Science
482
, 2013, pp. 60-72
Learning and classifying
Sanjay Jain
,
Eric Martin
,
Frank Stephan
Theoretical Computer Science
482
, 2013, pp. 73-85
\mathcal{NP}
-hardness of pure Nash equilibrium in Scheduling and Network Design Games
Nguyen Kim Thang
Theoretical Computer Science
482
, 2013, pp. 86-95
The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
Adam Woryna
Theoretical Computer Science
482
, 2013, pp. 96-110
Three-matching intersection conjecture for perfect matching polytopes of small dimensions
Xiumei Wang
,
Yixun Lin
Theoretical Computer Science
482
, 2013, pp. 111-114