Cited By
View all- Bei XChen NZhang SBoneh DRoughgarden TFeigenbaum J(2013)On the complexity of trial and errorProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488613(31-40)Online publication date: 1-Jun-2013
- Grzonkowski SZaremba WZaremba MMcDaniel BZadeh LBadr YAbraham AOhsawa YChbeir RFerri FKoeppen MLaurent D(2008)Extending web applications with a lightweight zero knowledge proof authenticationProceedings of the 5th international conference on Soft computing as transdisciplinary science and technology10.1145/1456223.1456241(65-70)Online publication date: 28-Oct-2008
- Luks EMiyazaki TGiusti M(2002)Polynomial-time normalizers for permutation groups with restricted composition factorsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780529(176-183)Online publication date: 10-Jul-2002