Yael Gertner

Orcid: 0000-0001-8818-8172

According to our database1, Yael Gertner authored at least 17 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Disentangling the Learning Gains from Reading a Book Chapter and Completing Proof Blocks Problems.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Teaching Algorithm Design: A Literature Review.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Designing and Piloting a High School CS+X Topics Course.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

Leveraging Kotter's 8 Stage Model of Organizational Change to Understand Broadening Participation in Computing.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2023
Measuring the Impact of Distractors on Student Learning Gains while Using Proof Blocks.
CoRR, 2023

Efficiency of Learning from Proof Blocks Versus Writing Proofs.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

2010
Starting from Scratch in Semantic Role Labeling.
Proceedings of the ACL 2010, 2010

2009
Minimally Supervised Model of Early Language Acquisition.
Proceedings of the Thirteenth Conference on Computational Natural Language Learning, 2009

2008
Baby SRL: Modeling Early Language Acquisition.
Proceedings of the Twelfth Conference on Computational Natural Language Learning, 2008

2006
Towards a Separation of Semantic and CCA Security for Public Key Encryption.
IACR Cryptol. ePrint Arch., 2006

2005
Bounds on the Efficiency of Generic Cryptographic Constructions.
SIAM J. Comput., 2005

2003
Lower bounds on the efficiency of encryption and digital signature schemes.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2001
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Protecting Data Privacy in Private Information Retrieval Schemes.
J. Comput. Syst. Sci., 2000

The Relationship between Public Key Encryption and Oblivious Transfer.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1998
A Random Server Model for Private Information Retrieval (or How to Achieve Information Theoretic PIR Avoiding Data Replication).
IACR Cryptol. ePrint Arch., 1998

A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998


  Loading...