Sciweavers

10271 search results - page 560 / 2055
» Computer Science
Sort
View
MFCS
1990
Springer
15 years 11 months ago
One-Way Functions in Complexity Theory
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
Alan L. Selman
FOCS
2000
IEEE
15 years 10 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 7 months ago
Implications of integrating test-driven development into CS1/CS2 curricula
Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testi...
Chetan Desai, David S. Janzen, John Clements
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
16 years 6 days ago
Computational Collapse of Quantum State with Application to Oblivious Transfer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
Claude Crépeau, Paul Dumais, Dominic Mayers...
FGCS
2010
126views more  FGCS 2010»
15 years 5 months ago
Perspectives on grid computing
Grid computing has been the subject of many large national and international IT projects in the past. However, it seems that the general expectations in Grids have not come true. ...
Uwe Schwiegelshohn, Rosa M. Badia, Marian Bubak, M...