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=313
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Periodicity in one-dimensional peg duotaire
J.P. Grossman
Theoretical Computer Science
313
(3), 2004, pp. 417-425
On the lengths of symmetry breaking-preserving games on graphs
F. Harary
,
W. Slany
,
O. Verbitsky
Theoretical Computer Science
313
(3), 2004, pp. 427-446
Assembling molecules in ATOMIX is hard
Markus Holzer
,
Stefan Schwoon
Theoretical Computer Science
313
(3), 2004, pp. 447-462
Periodicity and arithmetic-periodicity in hexadecimal games
S. Howse
,
R.J. Nowakowski
Theoretical Computer Science
313
(3), 2004, pp. 463-472
It is tough to be a plumber
Daniel Král'
,
Vladan Majerech
,
Jiȓí Sgall
,
Tomás̑ Tichý
,
Gerhard Woeginger
Theoretical Computer Science
313
(3), 2004, pp. 473-484
Error analysis in minimax trees
U. Lorenz
,
B. Monien
Theoretical Computer Science
313
(3), 2004, pp. 485-498
New results of exhaustive search in the game Amazons
Raymond Georg Snatzke
Theoretical Computer Science
313
(3), 2004, pp. 499-509
An effective two-level proof-number search algorithm
Mark H.M. Winands
,
Jos W.H.M. Uiterwijk
,
H. Jaap van den Herik
Theoretical Computer Science
313
(3), 2004, pp. 511-525
Counting the number of games
David Wolfe
,
William Fraser
Theoretical Computer Science
313
(3), 2004, pp. 527-532
Appendix A: Report on the First International Clobber Tournament
J.P. Grossman
Theoretical Computer Science
313
(3), 2004, pp. 533-537
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
Erik D. Demaine
,
Rudolf Fleischer
,
Aviezri S. Fraenkel
,
Richard J. Nowakowski
Theoretical Computer Science
313
(3), 2004, pp. 539-543
Seiten
<
1
2