7986 search results - page 164 / 1598 » Computational Science and its Applications |
130
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
161
click to vote
TCS
2010
15 years 6 days ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
133
click to vote
JPDC
2011
14 years 8 months ago
2011
ed abstract data types: Building blocks for collaborative applications Hyun-Gul Roha,∗ , Myeongjae Jeonb , Jin-Soo Kimc , Joonwon Leec a Department of Computer Science, KAIST, Da...
121
click to vote
SIGCSE
2008
ACM
15 years 5 months ago
2008
ACM
This paper presents a thorough evaluation of CS for Scientists, a CS 1 course designed to provide future scientists with an overview of the discipline. The course takes a breadth-...
114
click to vote
STACS
2010
Springer
16 years 14 days ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...