default search action
Alex Ozdemir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Alex Ozdemir, Shankara Pailoor, Alp Bassa, Kostas Ferles, Clark W. Barrett, Isil Dillig:
Split Gröbner Bases for Satisfiability Modulo Finite Fields. CAV (1) 2024: 3-25 - [c14]Thomas Hader, Alex Ozdemir:
An SMT-LIB Theory of Finite Fields. SMT@CAV 2024: 3-12 - [i14]Thomas Hader, Alex Ozdemir:
An SMT-LIB Theory of Finite Fields. CoRR abs/2407.21169 (2024) - [i13]Evan Laufer, Alex Ozdemir, Dan Boneh:
zkPi: Proving Lean Theorems in Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 267 (2024) - [i12]Alex Ozdemir, Shankara Pailoor, Alp Bassa, Kostas Ferles, Clark W. Barrett, Isil Dillig:
Split Gröbner Bases for Satisfiability Modulo Finite Fields. IACR Cryptol. ePrint Arch. 2024: 572 (2024) - [i11]Alex Ozdemir, Evan Laufer, Dan Boneh:
Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs. IACR Cryptol. ePrint Arch. 2024: 979 (2024) - 2023
- [j3]Haniel Barbosa, Clark W. Barrett
, Byron Cook, Bruno Dutertre, Gereon Kremer, Hanna Lachnitt, Aina Niemetz
Generating and Exploiting Automated Reasoning Proof Certificates. Commun. ACM 66(10): 86-95 (2023) - [c13]Alex Ozdemir, Riad S. Wahby, Fraser Brown, Clark W. Barrett:
Bounded Verification for Finite-Field-Blasting - In a Compiler for Zero Knowledge Proofs. CAV (3) 2023: 154-175 - [c12]Alex Ozdemir, Gereon Kremer, Cesare Tinelli, Clark W. Barrett:
Satisfiability Modulo Finite Fields. CAV (2) 2023: 163-186 - [c11]Edward Chen, Jinhao Zhu, Alex Ozdemir, Riad S. Wahby, Fraser Brown, Wenting Zheng:
Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols. SP 2023: 848-863 - [i10]Edward Chen, Jinhao Zhu, Alex Ozdemir, Riad S. Wahby, Fraser Brown, Wenting Zheng:
Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols. IACR Cryptol. ePrint Arch. 2023: 60 (2023) - [i9]Alex Ozdemir, Gereon Kremer, Cesare Tinelli, Clark W. Barrett:
Satisfiability Modulo Finite Fields. IACR Cryptol. ePrint Arch. 2023: 91 (2023) - [i8]Alex Ozdemir, Riad S. Wahby, Fraser Brown, Clark W. Barrett:
Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs). IACR Cryptol. ePrint Arch. 2023: 778 (2023) - 2022
- [j2]Sadjad Fouladi, Brennan Shacklett, Fait Poms, Arjun Arora, Alex Ozdemir, Deepti Raghavan, Pat Hanrahan, Kayvon Fatahalian, Keith Winstein
R2E2: low-latency path tracing of terabyte-scale scenes using thousands of cloud CPUs. ACM Trans. Graph. 41(4): 76:1-76:12 (2022) - [c10]Haniel Barbosa, Andrew Reynolds, Gereon Kremer, Hanna Lachnitt, Aina Niemetz
Flexible Proof Production in an Industrial-Strength SMT Solver. IJCAR 2022: 15-35 - [c9]Abhishek Anil Nair, Saranyu Chattopadhyay
Proof-Stitch: Proof Combination for Divide-and-Conquer SAT Solvers. FMCAD 2022: 84-88 - [c8]Alex Ozdemir, Fraser Brown, Riad S. Wahby:
CirC: Compiler infrastructure for proof systems, software verification, and more. SP 2022: 2248-2266 - [c7]Haniel Barbosa
cvc5: A Versatile and Industrial-Strength SMT Solver. TACAS (1) 2022: 415-442 - [c6]Alex Ozdemir, Dan Boneh:
Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. USENIX Security Symposium 2022: 4291-4308 - [i7]Abhishek Nair, Saranyu Chattopadhyay, Haoze Wu, Alex Ozdemir, Clark W. Barrett:
Proof-Stitch: Proof Combination for Divide and Conquer SAT Solvers. CoRR abs/2209.05201 (2022) - 2021
- [c5]Alex Ozdemir, Haoze Wu, Clark W. Barrett:
SAT Solving in the Serverless Cloud. FMCAD 2021: 241-245 - [i6]Dan Boneh, Wilson D. Nguyen, Alex Ozdemir:
Efficient Functional Commitments: How to Commit to Private Functions. IACR Cryptol. ePrint Arch. 2021: 1342 (2021) - [i5]Alex Ozdemir, Dan Boneh:
Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets. IACR Cryptol. ePrint Arch. 2021: 1530 (2021) - 2020
- [c4]Haoze Wu
Parallelization Techniques for Verifying Neural Networks. FMCAD 2020: 128-137 - [c3]Alex Ozdemir, Riad S. Wahby, Barry Whitehat, Dan Boneh:
Scaling Verifiable Computation Using Efficient Set Accumulators. USENIX Security Symposium 2020: 2075-2092 - [i4]Haoze Wu, Alex Ozdemir, Aleksandar Zeljic, Ahmed Irfan, Kyle Julian, Divya Gopinath, Sadjad Fouladi, Guy Katz, Corina S. Pasareanu, Clark W. Barrett:
Parallelization Techniques for Verifying Neural Networks. CoRR abs/2004.08440 (2020) - [i3]Alex Ozdemir, Fraser Brown, Riad S. Wahby:
Unifying Compilers for SNARKs, SMT, and More. IACR Cryptol. ePrint Arch. 2020: 1586 (2020)
2010 – 2019
- 2019
- [j1]Sadjad Fouladi, Francisco Romero, Dan Iter, Qian Li, Alex Ozdemir, Shuvo Chatterjee, Matei Zaharia, Christos Kozyrakis, Keith Winstein:
Outsourcing Everyday Jobs to Thousands of Cloud Functions with gg. login Usenix Mag. 44(3) (2019) - [c2]Alex Ozdemir
DRAT-based Bit-Vector Proofs in CVC4. SAT 2019: 298-305 - [i2]Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett:
DRAT-based Bit-Vector Proofs in CVC4. CoRR abs/1907.00087 (2019) - [i1]Alex Ozdemir, Riad S. Wahby, Dan Boneh:
Scaling Verifiable Computation Using Efficient Set Accumulators. IACR Cryptol. ePrint Arch. 2019: 1494 (2019) - 2017
- [c1]Alex Ozdemir, Michael Sheely, Daniel Bork, Ricson Cheng, Reyna Hulett, Jean Sung, Jincheng Wang, Ran Libeskind-Hadas:
Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. AlCoB 2017: 127-139
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: