Tsai, Shi-Chun - Department of Computer Science and Information Engineering, National Chiao Tung University

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Tsai, Shi-Chun - Department of Computer Science and Information Engineering, National Chiao Tung University

On the Bottleneck Counting Argument \Lambda Janos Simon
On the Fairness and Complexity of Generalized kinarow Games
Copyright (c) 2010 IEEE. Personal use is permitted. For any other purposes, Permission must be obtained from the IEEE by emailing pubs-permissions@ieee.org. This article has been accepted for publication in a future issue of this journal, but has not been
More on the Magnus-Derek Game Li-Jui Chen Jinn-Jy Lin Min-Zheng Shieh Shi-Chun Tsai
On the Complexity of Hardness Amplification Shi-Chun Tsai
The Periodic Property of Binomial Coefficients Modulo m and Its Applications
LOWER BOUNDS ON REPRESENTING BOOLEAN FUNCTIONS AS POLYNOMIALS IN Zm
Two Results on the Bit Extraction Problem Katalin Friedl \Lambda ShiChun Tsai y
Decoding Permutation Arrays with Ternary Vectors Chia-Jung Lee
JGAP: A Javabased Graph Algorithms Platform z
Compiler Optimization on Instruction Scheduling for Low Power \Lambda Chingren Lee Jenq Kuen Lee TingTing Hwang
Exact Solution of a Minimal Recurrence KehNing Chang \Lambda ShiChun Tsai y
Optimal Boolean Circuits with Unreliable Gates (Extended abstract)
Simple DistancePreserving Mappings from Ternary Vectors to Permutations
Recycling Random Bits in Parallel Katalin Friedl \Lambda ShiChun Tsai y