Sciweavers

516 search results - page 39 / 104
» Sets of k-Independent Strings
Sort
View
IJFCS
2007
111views more  IJFCS 2007»
13 years 8 months ago
Involutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over th...
Lila Kari, Kalpana Mahalingam
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 9 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 9 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
BTW
2009
Springer
145views Database» more  BTW 2009»
14 years 3 months ago
Towards web Supported Identification of Top Affiliations from Scholarly Papers
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
David Aumüller
SCAM
2008
IEEE
14 years 3 months ago
Fast and Precise Points-to Analysis
—Many software engineering applications require points-to analysis. Client applications range from optimizing compilers to program development and testing environments to reverse...
Jonas Lundberg, Tobias Gutzmann, Welf Löwe