Sciweavers

18 search results - page 4 / 4
» Initial Segment Complexities of Randomness Notions
Sort
View
JUCS
2006
107views more  JUCS 2006»
13 years 5 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
ICRA
2007
IEEE
136views Robotics» more  ICRA 2007»
13 years 11 months ago
Automated Nanomanipulation with Atomic Force Microscopes
Abstract—Automation has long been recognized as an important goal in AFM (Atomic Force Microscope) nanomanipulation research. For the precise manipulation of small particles with...
Babak Mokaberi, Jaehong Yun, Michael Wang, Aristid...
ASIACRYPT
2009
Springer
13 years 11 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...