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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimization complexity of linear logic proof games
Patrick D. Lincoln
,
John C. Mitchell
,
Andre Scedrov
Theoretical Computer Science
227
(1-2), 1999, pp. 299-331
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Mitsuhiro Okada
Theoretical Computer Science
227
(1-2), 1999, pp. 333-396
A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over
GF(q)
Leonard M. Adleman
,
Jonathan DeMarrais
,
Ming-Deh Huang
Theoretical Computer Science
226
(1-2), 1999, pp. 7-18
Attack on RSA-type cryptosystems based on singular cubic curves over
Z/nZ
Seng Kiat Chua
,
Ka Hin Leung
,
San Ling
Theoretical Computer Science
226
(1-2), 1999, pp. 19-27
The Ajtai random class of lattices
Thomas W. Cusick
Theoretical Computer Science
226
(1-2), 1999, pp. 29-36
Three characterizations of correlation-immune functions over rings
Z_N
Dengguo Feng
Theoretical Computer Science
226
(1-2), 1999, pp. 37-43
Dual bases and bit-serial multiplication in
F_{q^{n}}
Dieter Gollmann
Theoretical Computer Science
226
(1-2), 1999, pp. 45-59
Algebraic feedback shift registers
Andrew Klapper
,
Jinzhong Xu
Theoretical Computer Science
226
(1-2), 1999, pp. 61-92
An algorithm for shifted continued fraction expansions in parallel linear time
Harald Niederreiter
,
Michael Vielhaber
Theoretical Computer Science
226
(1-2), 1999, pp. 93-104
Efficient voting with no selling of votes
Valtteri Niemi
,
Ari Renvall
Theoretical Computer Science
226
(1-2), 1999, pp. 105-116
Cryptographic copyright protection for digital images based on watermarking techniques
Joseph O ́ Ruanaidh
,
Holger Petersen
,
Alexander Herrigel
,
Shelby Pereira
,
Thierry Pun
Theoretical Computer Science
226
(1-2), 1999, pp. 117-142
On finite automaton public-key cryptosystem
Renji Tao
,
Shihua Chen
Theoretical Computer Science
226
(1-2), 1999, pp. 143-172
On the design of efficient RSA-based off-line electronic cash schemes
Vijay Varadharajan
,
Khanh Quoc Nguyen
,
Yi Mu
Theoretical Computer Science
226
(1-2), 1999, pp. 173-184
Scalable threshold closure
Chunru Zhang
,
Kwok-Yan Lam
,
Sushil Jajodia
Theoretical Computer Science
226
(1-2), 1999, pp. 185-206
Restriction, terms and nonlinearity of Boolean functions
Yuliang Zheng
,
Xian-Mo Zhang
,
Hideki Imai
Theoretical Computer Science
226
(1-2), 1999, pp. 207-223
On the representation of finite deterministic 2-tape automata
Maryse Pelletier
,
Jacques Sakarovitch
Theoretical Computer Science
225
(1-2), 1999, pp. 1-63
Max
NP
-completeness made easy
Pierluigi Crescenzi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 65-79
Simulations between cellular automata on Cayley graphs
Zsuzsanna Róka
Theoretical Computer Science
225
(1-2), 1999, pp. 81-111
Improved non-approximability results for minimum vertex cover with density constraints
Andrea E.F. Clementi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 113-128
Sturmian morphisms and
\alpha
-words
Wai-Fong Chuan
Theoretical Computer Science
225
(1-2), 1999, pp. 129-148
On the system of word equations
x_0u^i_1x_1u^i_2x_2u^i_3x_3 = y_0v^i_1y_1v^i_2y_2v^i_3y_3 (i = 0,1,2,\ldots)
in a free monoid
Ismo Hakala
,
Juha Kortelainen
Theoretical Computer Science
225
(1-2), 1999, pp. 149-161
Optimal path cover problem on block graphs
Pak-Ken Wong
Theoretical Computer Science
225
(1-2), 1999, pp. 163-169
A solution for the coloured cubes problem
J.M. Basart
,
P. Guitart
Theoretical Computer Science
225
(1-2), 1999, pp. 171-176
The ``smallest'' ring of polynomial invariants of a permutation group which has no finite SAGBI bases w.r.t. any admissible order
Manfred Göbel
Theoretical Computer Science
225
(1-2), 1999, pp. 177-184
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Jack H. Lutz
,
David L. Schweizer
Theoretical Computer Science
225
(1-2), 1999, pp. 185-194
Seiten
<
1
2
3
4
5
6
7
8
9
10
>