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=235
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Threshold data structures and coding theory
Eric Bach
,
Marcos Kiwi
Theoretical Computer Science
235
(1), 2000, pp. 3-23
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
Avrim Blum
,
Goran Konjevod
,
R. Ravi
,
Santosh Vempala
Theoretical Computer Science
235
(1), 2000, pp. 25-42
On the multiplicative complexity of Boolean functions over the basis
(\wedge,\oplus,1)
Joan Boyar
,
René Peralta
,
Denis Pochuez
Theoretical Computer Science
235
(1), 2000, pp. 43-57
New applications of the incompressibility method: Part II
Harry Buhrman
,
Tao Jiang
,
Ming Li
,
Paul Vitányi
Theoretical Computer Science
235
(1), 2000, pp. 59-70
Cook's versus Valiant's hypothesis
Peter Bürgisser
Theoretical Computer Science
235
(1), 2000, pp. 71-88
Some structural prosperties of low-rank matrices related to computational complexity
Bruno Codenotti
,
Pavel Pudlák
,
Giovanni Resta
Theoretical Computer Science
235
(1), 2000, pp. 89-107
Scheduling in the dark
Jeff Edmonds
Theoretical Computer Science
235
(1), 2000, pp. 109-141
Self-stabilization of circular arrays of automata
Leonid A. Levin
Theoretical Computer Science
235
(1), 2000, pp. 143-144
Uncomputably large integral points on algebraic plane curves?
J. Maurice Rojas
Theoretical Computer Science
235
(1), 2000, pp. 145-162
On the distribution of integer points on curves of genus zero
Joseph H. Silverman
Theoretical Computer Science
235
(1), 2000, pp. 163-170
The self-reduction in lambda calculus
Fangmin Song
,
Yongsen Xu
,
Yuechen Qian
Theoretical Computer Science
235
(1), 2000, pp. 171-181
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
A.N. Trahtman
Theoretical Computer Science
235
(1), 2000, pp. 183-204
Recent results on approximating the Steiner tree problem and its generalizations
Vijay V. Vazirani
Theoretical Computer Science
235
(1), 2000, pp. 205-216
On upper bound graphs with respect to operations on graphs
Hiroshi Era
,
Kenjiro Ogawa
,
Morimasa Tsuchiya
Theoretical Computer Science
235
(2), 2000, pp. 219-223
Constructible complexes and recursive division of posets
Masahiro Hachimori
Theoretical Computer Science
235
(2), 2000, pp. 225-237
Extremality of submodular functions
Kenji Kashiwabara
Theoretical Computer Science
235
(2), 2000, pp. 239-256
Wide-diameter and minimum length of fan
Toru Kojima
,
Kiyoshi Ando
Theoretical Computer Science
235
(2), 2000, pp. 257-266
Can a convex polyhedron have a developable face-cycle?
Hiroshi Maehara
Theoretical Computer Science
235
(2), 2000, pp. 267-270
A generalization of diagonal flips in a convex polygon
Tomoki Nakamigawa
Theoretical Computer Science
235
(2), 2000, pp. 271-282
On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
Michio Ozeki
Theoretical Computer Science
235
(2), 2000, pp. 283-308
Forced color classes, intersection graphs and the strong perfect graph conjecture
Tadashi Sakuma
Theoretical Computer Science
235
(2), 2000, pp. 309-324
Three-dimensional convex hull as a fruitful source of diagrams
Kokichi Sugihara
Theoretical Computer Science
235
(2), 2000, pp. 325-337
Perfect
(0,\pm1)
-matrices and perfect bidirected graphs
Akihisa Tamura
Theoretical Computer Science
235
(2), 2000, pp. 339-356