Sciweavers

1120 search results - page 70 / 224
» Making computer science minority-friendly
Sort
View
119
Voted
FOCS
2007
IEEE
15 years 10 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary
STACS
2007
Springer
15 years 9 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
ACSC
2006
IEEE
15 years 9 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
ACSC
2006
IEEE
15 years 9 months ago
CASO: a framework for dealing with objectives in a constraint-based extension to AgentSpeak(L)
Incorporating constraints into a reactive BDI agent programming language can lead to better expressive capabilities as well as more efficient computation (in some instances). More...
Aniruddha Dasgupta, Aditya K. Ghose
150
Voted
ITICSE
2005
ACM
15 years 9 months ago
Testing first: emphasizing testing in early programming courses
The complexity of languages like Java and C++ can make introductory programming classes in these languages extremely challenging for many students. Part of the complexity comes fr...
Will Marrero, Amber Settle