PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Gascón, Adria"

Author of the publication

copydeleteadd this publication to your clipboard
Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions.

, , , and . CSEDU (2), page 93-98. SciTePress, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Gascón, Adria
add a person with the name Gascón, Adria
 

Other publications of authors with the same name

Unification and matching on compressed terms., , and . ACM Trans. Comput. Log., 12 (4): 26:1-26:37 (2011)Private Nearest Neighbors Classification in Federated Databases., , and . IACR Cryptology ePrint Archive, (2018)Look for the Proof to Find the Program: Decorated-Component-Based Program Synthesis., , , and . CAV (2), volume 10427 of Lecture Notes in Computer Science, page 86-103. Springer, (2017)QUOTIENT: Two-Party Secure Neural Network Training and Prediction., , , and . CCS, page 1231-1247. ACM, (2019)MPC-Friendly Commitments for Publicly Verifiable Covert Security., , , and . IACR Cryptol. ePrint Arch., (2022)Learning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions., , , and . CSEDU (2), page 93-98. SciTePress, (2011)Context Matching for Compressed Terms., , and . LICS, page 93-102. IEEE Computer Society, (2008)Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation., , , , , , and . IEEE Symposium on Security and Privacy, page 218-234. IEEE Computer Society, (2016)How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation., , and . ITP, volume 10499 of Lecture Notes in Computer Science, page 114-130. Springer, (2017)The HOM Problem is EXPTIME-Complete., , , and . LICS, page 255-264. IEEE Computer Society, (2012)