Sciweavers

TAMC
2007
Springer
14 years 27 days ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
TAMC
2007
Springer
14 years 27 days ago
A Note on the Feasibility of Generalized Universal Composability
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
TAMC
2007
Springer
14 years 27 days ago
The Strongest Nonsplitting Theorem
Mariya Ivanova Soskova, S. Barry Cooper
TAMC
2007
Springer
14 years 27 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
TAMC
2007
Springer
14 years 27 days ago
Finding a Duplicate and a Missing Item in a Stream
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
Jun Tarui
TAMC
2007
Springer
14 years 27 days ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
TAMC
2007
Springer
14 years 27 days ago
Synchronization of Some DFA
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
A. N. Trahtman