The following pages link to Charalampos Papamanthou (Q262255):
Displayed 29 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Distortion lower bounds for line embeddings (Q975439) (← links)
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency (Q1673402) (← links)
- Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Generalized cuckoo hashing with a stash, revisited (Q2681400) (← links)
- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (Q2811137) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Optimal Authenticated Data Structures with Multilinear Forms (Q3059655) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q3066976) (← links)
- Applications of Parameterized st-Orientations (Q3075612) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)
- Parameterized st-Orientations of Graphs: Algorithms and Experiments (Q3595466) (← links)
- Signatures of Correct Computation (Q4910280) (← links)
- Streaming Authenticated Data Structures (Q4924421) (← links)
- A parametric visualization software for the assignment problem (Q4928249) (← links)
- Practical Private Range Search in Depth (Q5012586) (← links)
- Optimal Verification of Operations on Dynamic Sets (Q5199186) (← links)
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures (Q5452276) (← links)
- Graph Drawing (Q5711626) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)
- Graph Drawing (Q5897644) (← links)
- Transparent batchable time-lock puzzles and applications to Byzantine consensus (Q6070776) (← links)
- Gossiping for communication-efficient broadcast (Q6108990) (← links)
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH (Q6186714) (← links)
- Accountable Storage (Q6484716) (← links)