1. Online algorithms: a survey
2. Secure minimum weighted bipartite matching
3. Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems For Non-Cryptographic Fault-Tolerant Distributed Computation. In Symposium on Theory of Computing. ACM, 1--10 . Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems For Non-Cryptographic Fault-Tolerant Distributed Computation. In Symposium on Theory of Computing. ACM, 1--10.
4. Marina Blanton and Siddharth Saraph . 2015. Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification . In Computer Security -- ESORICS 2015 (Lecture Notes in Computer Science ) . Springer International Publishing , 384--406. Marina Blanton and Siddharth Saraph. 2015. Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification. In Computer Security -- ESORICS 2015 (Lecture Notes in Computer Science ). Springer International Publishing, 384--406.
5. Privacy-Preserving Maximum Matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange