ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: High Parallel Complexity Graphs and Memory-Hard Functions
Article URLs:
Alternative Article URLs:
Authors: Joël Alwen
  • IST Austria Am Campus 1 A - 3400 Klosterneuburg, Austria
Vladimir Serbinenko
  • ETH Zürich, Department of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/AlwenS15
Author Comments:

Discuss this paper and its artifacts below