Alex Ozdemir

Orcid: 0000-0002-0181-6752

According to our database1, Alex Ozdemir authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Split Gröbner Bases for Satisfiability Modulo Finite Fields.
IACR Cryptol. ePrint Arch., 2024

zkPi: Proving Lean Theorems in Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2024

2023
Generating and Exploiting Automated Reasoning Proof Certificates.
Commun. ACM, October, 2023

Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs).
IACR Cryptol. ePrint Arch., 2023

Satisfiability Modulo Finite Fields.
IACR Cryptol. ePrint Arch., 2023

Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols.
IACR Cryptol. ePrint Arch., 2023

2022
R2E2: low-latency path tracing of terabyte-scale scenes using thousands of cloud CPUs.
ACM Trans. Graph., 2022

Proof-Stitch: Proof Combination for Divide and Conquer SAT Solvers.
CoRR, 2022

cvc5: A Versatile and Industrial-Strength SMT Solver.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

CirC: Compiler infrastructure for proof systems, software verification, and more.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Flexible Proof Production in an Industrial-Strength SMT Solver.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets.
IACR Cryptol. ePrint Arch., 2021

Efficient Functional Commitments: How to Commit to Private Functions.
IACR Cryptol. ePrint Arch., 2021

SAT Solving in the Serverless Cloud.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
Unifying Compilers for SNARKs, SMT, and More.
IACR Cryptol. ePrint Arch., 2020

Scaling Verifiable Computation Using Efficient Set Accumulators.
Proceedings of the 29th USENIX Security Symposium, 2020

Parallelization Techniques for Verifying Neural Networks.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
Outsourcing Everyday Jobs to Thousands of Cloud Functions with gg.
login Usenix Mag., 2019

Scaling Verifiable Computation Using Efficient Set Accumulators.
IACR Cryptol. ePrint Arch., 2019

DRAT-based Bit-Vector Proofs in CVC4.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2017
Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model.
Proceedings of the Algorithms for Computational Biology, 2017


  Loading...