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: Author="Tsai, Shi-Chun"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online prediction problems with variation
Chia-Jung Lee
,
Shi-Chun Tsai
,
Ming-Chuan Yang
Lecture Notes in Computer Science
8591
, 2014, pp. 49-60
On the inapproximability of maximum intersection problems
Min-Zheng Shieh
,
Shi-Chun Tsai
,
Ming-Chuan Yang
Information Processing Letters
112
(19), 2012, pp. 723-727
More on the Magnus-Derek game
Li-Jui Chen
,
Jinn-Jy Lin
,
Min-Zheng Shieh
,
Shi-Chun Tsai
Theoretical Computer Science
412
(4-5), 2011, pp. 339-344
Extracting computational entropy and learning noisy linear functions
Chia-Jung Lee
,
Chi-Jen Lu
,
Shi-Chun Tsai
Lecture Notes in Computer Science
5609
, 2009, pp. 338-347
Jug measuring: Algorithms and complexity
Min-Zheng Shieh
,
Shi-Chun Tsai
Theoretical Computer Science
396
(1-3), 2008, pp. 50-62
On the fairness and complexity of generalized
k
-in-a-row games
Ming Yu Hsieh
,
Shi-Chun Tsai
Theoretical Computer Science
385
(1-3), 2007, pp. 88-100
On the complexity of hard-core set constructions
Chi-Jen Lu
,
Shi-Chun Tsai
,
Hsin-Lung Wu
Lecture Notes in Computer Science
4596
, 2007, pp. 183-194
Improved hardness amplification in
NP
Chi-Jen Lu
,
Shi-Chun Tsai
,
Hsin-Lung Wu
Theoretical Computer Science
370
(1-3), 2007, pp. 293-298
Deterministic extractors for independent-symbol sources
Chia-Jung Lee
,
Chi-Jen Lu
,
Shi-Chun Tsai
Lecture Notes in Computer Science
4051
, 2006, pp. 84-95
A note on unscrambling address lines
Chang-Chun Lu
,
Shi-Chun Tsai
Information Processing Letters
85
(4), 2003, pp. 185-189
A note on iterating an
\alpha
-ary Gray code
Chi-Jen Lu
,
Shi-Chun Tsai
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 237-239
Exact solution of a minimal recurrence
Keh-Ning Chang
,
Shi-Chun Tsai
Information Processing Letters
75
(1-2), 2000, pp. 61-64
Two results on the bit extraction problem
Katalin Friedl
,
Shi-Chun Tsai
Discrete Applied Mathematics
99
(1-3), 2000, pp. 443-454
On the bottleneck counting argument
Janos Simon
,
Shi-Chun Tsai
Theoretical Computer Science
237
(1-2), 2000, pp. 429-437
A note on the bottleneck counting argument
Janos Simon
,
Shi-Chun Tsai
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 297-301
Lower bounds on representing Boolean functions as polynomials in
Z_m
Shi-Chun Tsai
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 55-62
Recycling random bits in parallel
Katalin Friedl
,
Shi-Chun Tsai
Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, HICSS-28. Vol.~II: Software Technology (Kihei, Hawaii, January 3-6, 1995)
, 1995, pp. 14-19
Lower bounds on representing boolean functions as polynomials in
Z_m
Shi-Chun Tsai
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 96-101