default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Hua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. AAMAS 2024: 1585-1592- [c5]Richard Hua, Daniele Di Lorenzo, Francisco Chinesta, Philippe Codognet:
Quantum Annealing Solutions for Drone Route Planning Problems. QCE 2024: 600-610 - [i5]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. CoRR abs/2404.06686 (2024) - [i4]Antigoni Polychroniadou, Gabriele Cipriani, Richard Hua, Tucker Balch:
Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data Based on Differential Privacy. IACR Cryptol. ePrint Arch. 2024: 461 (2024) - 2023
- [c4]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. USENIX Security Symposium 2023: 6417-6434 - [i3]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. CoRR abs/2310.09621 (2023) - [i2]Antigoni Polychroniadou, Gilad Asharov, Benjamin E. Diamond, Tucker Balch, Hans Buehler, Richard Hua, Suwen Gu, Greg Gimler, Manuela Veloso:
Prime Match: A Privacy-Preserving Inventory Matching System. IACR Cryptol. ePrint Arch. 2023: 400 (2023) - 2020
- [j3]Cristian S. Calude
, Michael J. Dinneen, Richard Hua:
Quantum solutions for densest k-subgraph problems. J. Membr. Comput. 2(1): 26-41 (2020) - [j2]Richard Hua, Michael J. Dinneen:
Improved QUBO Formulation of the Graph Isomorphism Problem. SN Comput. Sci. 1(1): 19:1-19:18 (2020)
2010 – 2019
- 2019
- [c3]Anuradha Mahasinghe, Richard Hua, Michael J. Dinneen, Rajni Goyal:
Solving the Hamiltonian Cycle Problem using a Quantum Computer. ACSW 2019: 8:1-8:9 - 2018
- [c2]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. PC@UCNC 2018: 1-13 - [i1]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. CoRR abs/1803.04340 (2018) - 2017
- [j1]Cristian S. Calude, Michael J. Dinneen, Richard Hua:
QUBO formulations for the graph isomorphism problem and related problems. Theor. Comput. Sci. 701: 54-69 (2017) - [c1]Michael J. Dinneen, Richard Hua:
Formulating graph covering problems for adiabatic quantum computers. ACSW 2017: 18:1-18:10
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 2025-01-27 00:45 CET 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:
