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=276
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial ideals for sandpiles and their Gröbner bases
Robert Cori
,
Dominique Rossin
,
Bruno Salvy
Theoretical Computer Science
276
(1-2), 2002, pp. 1-15
Listing all potential maximal cliques of a graph
Vincent Bouchitté
,
Ioan Todinca
Theoretical Computer Science
276
(1-2), 2002, pp. 17-32
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Gruia Cȃlinescu
,
Peng-Jun Wan
Theoretical Computer Science
276
(1-2), 2002, pp. 33-50
On the analysis of the
(1+1)
evolutionary algorithm
Stefan Droste
,
Thomas Jansen
,
Ingo Wegener
Theoretical Computer Science
276
(1-2), 2002, pp. 51-81
Smaller solutions for the firing squad
Amber Settle
,
Janos Simon
Theoretical Computer Science
276
(1-2), 2002, pp. 83-109
Computing similarity between RNA structures
Bin Ma
,
Lusheng Wang
,
Kaizhong Zhang
Theoretical Computer Science
276
(1-2), 2002, pp. 111-132
Cryptographically significant Boolean functions with five valued Walsh spectra
Subhamoy Maitra
,
Palash Sarkar
Theoretical Computer Science
276
(1-2), 2002, pp. 133-146
Computational complexity of uniform quantum circuit families and quantum Turing machines
Harumichi Nishimura
,
Masanao Ozawa
Theoretical Computer Science
276
(1-2), 2002, pp. 147-181
Binary (generalized) Post Correspondenz Problem
Vesa Halava
,
Tero Harju
,
Mika Hirvensalo
Theoretical Computer Science
276
(1-2), 2002, pp. 183-204
Parallel communicating grammar systems with bounded resources
Erzsébet Csuhaj-Varjú
,
György Vaszil
Theoretical Computer Science
276
(1-2), 2002, pp. 205-219
Iterated relabeling tree transducers
Z. Fülöp
,
A. Terlutte
Theoretical Computer Science
276
(1-2), 2002, pp. 221-244
Decidability of EDT0L structural equivalence
Kai Salomaa
,
Sheng Yu
Theoretical Computer Science
276
(1-2), 2002, pp. 245-259
Hard variants of stable marriage
David F. Manlove
,
Robert W. Irving
,
Kazuo Iwama
Theoretical Computer Science
276
(1-2), 2002, pp. 261-279
Episturmian words and Episturmian morphisms
Jacques Justin
,
Giuseppe Pirillo
Theoretical Computer Science
276
(1-2), 2002, pp. 281-313
Static and dynamic low-congested interval routing schemes
Serafino Cicerone
,
Gabriele Di Stefano
,
Michele Flammini
Theoretical Computer Science
276
(1-2), 2002, pp. 315-354
Error-detecting properties of languages
Stavros Konstantinidis
,
Amber O'Hearn
Theoretical Computer Science
276
(1-2), 2002, pp. 355-375
Sequential grammars and automata with valences
Henning Fernau
,
Ralf Stiebe
Theoretical Computer Science
276
(1-2), 2002, pp. 377-405
Does snooping help?
V.V. V'yugin
Theoretical Computer Science
276
(1-2), 2002, pp. 407-415
A necessary condition for a graph to be the visibility graph of a simple polygon
Chiuyuan Chen
Theoretical Computer Science
276
(1-2), 2002, pp. 417-424
Lower bounds for some decision problems over
C
Gregorio Malajovich
Theoretical Computer Science
276
(1-2), 2002, pp. 425-434
Constant bounds on the moments of the height of binary search trees
J.M. Robson
Theoretical Computer Science
276
(1-2), 2002, pp. 435-444
How to decide continuity of rational functions on infinite words
Christophe Prieur
Theoretical Computer Science
276
(1-2), 2002, pp. 445-447
A comparison of two approaches to pseudorandomness
Yongge Wang
Theoretical Computer Science
276
(1-2), 2002, pp. 449-459